Dispatching of multiple Autonomous Intelligent Vehicles considering stochastic travel times by Genetic Algorithm

Author(s):  
Minh Sang Nguyen ◽  
Kee Jin Lee ◽  
Jihoon Hong
2014 ◽  
Vol 587-589 ◽  
pp. 1854-1857
Author(s):  
Yi Yong Pan

This paper addresses adaptive reliable shortest path problem which aims to find adaptive en-route guidance to maximize the reliability of arriving on time in stochastic networks. Such routing policy helps travelers better plan their trips to prepare for the risk of running late in the face of stochastic travel times. In order to reflect the stochastic characteristic of travel times, a traffic network is modeled as a discrete stochastic network. Adaptive reliable shortest path problem is uniformly defined in a stochastic network. Bellman’s Principle that is the core of dynamic programming is showed to be valid if the adaptive reliable shortest path is defined by optimal-reliable routing policy. A successive approximations algorithm is developed to solve adaptive reliable shortest path problem. Numerical results show that the proposed algorithm is valid using typical transportation networks.


Author(s):  
Rahul Patel ◽  
Prashanth Venkatraman ◽  
Stephen D. Boyles

Reservation-based traffic control is a revolutionary intersection management system which involves the communication of autonomous vehicles and an intersection to request space-time trajectories through the intersection. Although previous studies have found congestion and throughput benefits of reservation-based control that surpass signalized control, other studies have found negative impacts at peak travel times. The main purpose of this paper is to find and characterize favorable mixed configurations of reservation-based controls and signalized controls in a large city network which minimize total system travel times. As this optimization problem is bi-level and challenging, three different methods are proposed to heuristically find effective mixed configurations. The first method is an intersection ranking method that uses simulation to assign a score to each intersection in a network based on localized potential benefit to system travel time under reservation control and then ranks all intersections accordingly. The second is another ranking method; however, it uses linear regression to predict an intersection’s localized score. Finally, a genetic algorithm is presented that iteratively approaches high-performing network configurations yielding minimal system travel times. The methods were tested on the downtown Austin network and configurations found that are less than half controlled by reservation intersections that improve travel times beyond an all-reservation controlled network. Overall, the results show that the genetic algorithm finds the best performing configurations, with the initial score-assigning ranking method performing similarly but much more efficiently. It was finally find that favorable reservation placement is in consecutive chains along highly trafficked corridors.


Sign in / Sign up

Export Citation Format

Share Document