An autonomous vehicle sequencing problem at intersections: A genetic algorithm approach

43Citations
Citations of this article
31Readers
Mendeley users who have this article in their library.

Abstract

This paper addresses a vehicle sequencing problem for adjacent intersections under the framework of Autonomous Intersection Management (AIM). In the context of AIM, autonomous vehicles are considered to be independent individuals and the traffic control aims at deciding on an efficient vehicle passing sequence. Since there are considerable vehicle passing combinations, how to find an efficient vehicle passing sequence in a short time becomes a big challenge, especially for more than one intersection. In this paper, we present a technique for combining certain vehicles into some basic groups with reference to some properties discussed in our earlier works. A genetic algorithm based on these basic groups is designed to find an optimal or a near-optimal vehicle passing sequence for each intersection. Computational experiments verify that the proposed genetic algorithms can response quickly for several intersections. Simulations with continuous vehicles are carried out with application of the proposed algorithm or existing traffic control methods. The results show that the traffic condition can be significantly improved by our algorithm.

Cite

CITATION STYLE

APA

Yan, F., Dridi, M., & Moudni, A. E. (2013). An autonomous vehicle sequencing problem at intersections: A genetic algorithm approach. International Journal of Applied Mathematics and Computer Science, 23(1), 183–200. https://doi.org/10.2478/amcs-2013-0015

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free