[HTML][HTML] Local Dynamic Path Planning for an Ambulance Based on Driving Risk and Attraction Field

F Zong, M Zeng, Y Cao, Y Liu - Sustainability, 2021 - mdpi.com
Path planning is one of the most important aspects for ambulance driving. A local dynamic
path planning method based on the potential field theory is presented in this paper. The …

Exploiting counterfactuals for scalable stochastic optimization

S Kuhlemann, M Sellmann, K Tierney - … CT, USA, September 30–October 4 …, 2019 - Springer
We propose a new framework for decision making under uncertainty to overcome the main
drawbacks of current technology: modeling complexity, scenario generation, and scaling …

[HTML][HTML] Novel parameterized utility function on dual hesitant fuzzy rough sets and its application in pattern recognition

Z Wu, F Zhang, J Sun, W Wang, X Tang - Information, 2019 - mdpi.com
Based on comparative studies on correlation coefficient theory and utility theory, a series of
rules that utility functions on dual hesitant fuzzy rough sets (DHFRSs) should satisfy, and a …

Improving the performance of arrival on time in stochastic shortest path problem

Y Wu, W Chen, X Zhang, G Liao - 2016 IEEE 19th International …, 2016 - ieeexplore.ieee.org
Facing various uncertainties in real world traffic, navigation services are typically formulated
as a certain stochastic shortest path problem (SSPP). In the past several years, many …

[HTML][HTML] 考虑用户紧急程度的在途路径诱导策略研究

白静, 陈业华, 刘一健 - 公路交通科技, 2020 - html.rhhz.net
为了提高突发交通拥堵情境下在途路径诱导效率, 从用户体验层面出发, 对诱导方案设计进行
深入研究. 提高用户体验有利于提高用户对诱导系统的服从率, 从而提高诱导效率 …

Life Saving Express-Discovery The Shortest Distance In Vehicle Routing

M Hema, KS Raja, K Valarmathi… - … on Networking and …, 2023 - ieeexplore.ieee.org
One of the famous examples in the study of route optimization in the field of computers is
Travelling Saleman Problem (TSP). Researches throughout the years various algorithms …

Data-driven distributionally robust shortest path problem using the Wasserstein ambiguity set

Z Wang, K You, S Song, C Shang - 2019 IEEE 15th …, 2019 - ieeexplore.ieee.org
This paper proposes a data-driven distributionally robust shortest path (DRSP) model where
the distribution of the travel time is only observable through a finite training dataset. Our …

Vehicle dispatch in high-capacity shared autonomous mobility-on-demand systems

C Li - 2022 - etheses.bham.ac.uk
Ride-sharing is a promising solution for transportation issues such as traffic congestion and
parking land use, which are brought about by the extensive usage of private vehicles. In the …

An Integrated Approach for a Universal Routing Algorithm

M Hedderich, U Fastenrath, Z Cao… - 2019 IEEE Intelligent …, 2019 - ieeexplore.ieee.org
Stress and anxiety are well known feelings for a car driver when it comes to finding a free on-
street parking spot in an urban area or estimating the time for punctual arrival at a certain …

Maximizing the probability of arriving on time: a stochastic shortest path problem

Z Cao - 2017 - dr.ntu.edu.sg
Traffic and transportation are crucial to the sustainable development of most metropolitan
cities, where the stochastic shortest path (SSP) problem for vehicle routing is a challenging …