|
|
International Journal of Automotive Technology 2008;9(3): 353-364. |
| LANE ASSIGNMENT PROBLEM USING A GENETIC ALGORITHM IN THE AUTOMATED HIGHWAY SYSTEMS |
| K. KIM1, J. V. MEDANIC2, D.-I. CHO3 |
1Hanbat National University
2University of Illinois at Urbana-Champaign
3Seoul National University |
|
|
|
|
|
| ABSTRACT |
|
This paper deals with the lane assignment problem in the Automated Highway Systems (AHS). The purpose of lane assignment strategies is to increase throughput on multi-lane highways with many entry and exit points, based on the itineraries of vehicles using the highway (point of entry, time of entry and exit point) and the effects of maneuvers. Using partitioned lane assignment strategies, the lane assignment problem is formulated as an optimization problem to find the proper positions of partitions. Then the optimal problem is solved using a Genetic Algorithm (GA). The proposed algorithm has been validated by comparing its solution with that of an all-cases algorithm for a simple case. Moreover, a traffic simulator with a realistic car-following model as well as lane change logic has been developed. The simulation results show the efficiency of the proposed genetic algorithm, compared with random assignment algorithms. |
| Key Words:
Optimization, Automated highway systems, Genetic algorithm |
|
|
|
Preview
Full text via DOI 
Download Citation 
Print 
