Dynamic routing under recurrent and non-recurrent congestion using real-time ITS information

Güner, Ali R.; Murat, Alper; Chinnam, Ratna Babu

doi:10.1016/j.cor.2011.04.012

Cited by 62 publications

(32 citation statements)

References 41 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…More specifically, requests can be a demand for goods [2,62,70,71,75,99,101,144] or services [7,11,17,52,89,141]. Travel time, a dynamic component of most real-world applications, has been recently taken into account [1,6,28,48,64,65,94,108,136,139,153]; while service time has not been explicitly studied (but can be added to travel time). Finally, some recent work considers dynamically revealed demands for a set of known customers [104,105,126,128] and vehicle availability [92,93,103], in which case the source of dynamism is the possible breakdown of vehicles.…”

Section: A General Definitionmentioning

confidence: 99%

A review of dynamic vehicle routing problems

Pillac

Gendreau

Guéret

et al. 2013

European Journal of Operational Research

965

496

View full text Add to dashboard Cite

A number of technological advances have led to a renewed interest on dynamic vehicle routing problems. This survey classifies routing problems from the perspective of information quality and evolution. After presenting a general description of dynamic routing, we introduce the notion of degree of dynamism, and present a comprehensive review of applications and solution methods for dynamic vehicle routing problems.

show abstract

Section: A General Definitionmentioning

confidence: 99%

A review of dynamic vehicle routing problems

Pillac

Gendreau

Guéret

et al. 2013

European Journal of Operational Research

965

496

View full text Add to dashboard Cite

show abstract

“…Figliozzi [12] assumed that the travel time of a commercial vehicle in urban area follows normal distribution. Guner et al [20] proposed a dynamic stochastic routing model under recurrent or non-recurrent congestions and assumed the link travel time follows normal distribution. Fu and Rilett [17] modeled the dynamic stochastic shortest path problem as a stochastic process and assumed the travel time is normally distributed.…”

Section: Literature Reviewmentioning

confidence: 99%

“…Accordingly, the cost of congestion has rapidly increased in metropolitan areas and its unpredictability has forced logistics providers to allow sufficient buffer times in order to satisfy on-time delivery performance targets [20]. Although many studies on the DVRP with either time-dependent or stochastic travel times have been conducted in the literature, to the best of our knowledge, there is a lack of studies on the DVRP considering both time-dependent and stochastic travel times simultaneously.…”

Section: Introductionmentioning

confidence: 99%

Solving the Dynamic Vehicle Routing Problem Under Traffic Congestion

Kim

Ong

Cheong

et al. 2016

IEEE Trans. Intell. Transport. Syst.

View full text Add to dashboard Cite

This paper proposes a dynamic vehicle routing problem (DVRP) model with nonstationary stochastic travel times under traffic congestion. Depending on the traffic conditions, the travel time between two nodes, particularly in a city, may not be proportional to distance and changes both dynamically and stochastically over time. Considering this environment, we propose a Markov decision process model to solve this problem and adopt a rollout-based approach to the solution, using approximate dynamic programming to avoid the curse of dimensionality. We also investigate how to estimate the probability distribution of travel times of arcs which, reflecting reality, are considered to consist of multiple road segments. Experiments are conducted using a real-world problem faced by Singapore logistics/delivery company and authentic road traffic information.Index Terms-Dynamic vehicle routing problem, approximate dynamic programming, uncertain travel times, rollout algorithm.

show abstract

“…Path planning is a hot topic in the field of mobile robot and aircraft research, traffic network, 3D route planning and dynamic shortest path problems [1][2]. Since there are known and unknown obstacles or dangers in real environment, the path planning is a complex problem.…”

Section: Introductionmentioning

confidence: 99%

Indoor path planning for hex-rotor aircraft with landmark-based visual navigation

Shi

Wang

Cui

et al. 2015

2015 12th International Conference on Fuzzy Systems and Knowledge Discovery (FSKD)

View full text Add to dashboard Cite

In this paper, a indoor path planning algorithm is presented to obtain the shortest trajectory for the hex-rotor aircraft in the complex terrains with no-fly zones. This algorithm finds all flyable and feasible trajectories from the start point to the landmarks and from the landmarks to the destination point firstly. Then, it constructs the path network between all landmarks and connects the start point, all landmarks and the destination point. Finally, it finds the final navigable trajectory. To overcome the drawbacks of Global Positioning System (GPS) and improve the positioning accuracy, the visual navigation based on landmarks is employed to assist the Inertial Navigation System (INS). It is accomplished by comparing the corresponding position of landmarks in the real-time image and onboard stored integral referenced image. The landmarks must be visible and distinguishable. The results of simulations and actual indoor flights show that the algorithm proposed in this paper was feasible for path planning and it can be used in indoor and outdoor environments.

show abstract

Dynamic routing under recurrent and non-recurrent congestion using real-time ITS information

Cited by 62 publications

References 41 publications

A review of dynamic vehicle routing problems

A review of dynamic vehicle routing problems

Solving the Dynamic Vehicle Routing Problem Under Traffic Congestion

Indoor path planning for hex-rotor aircraft with landmark-based visual navigation

Contact Info

Product

Resources

About