Lane assignment using a genetic algorithm in the automated highway systems

This paper deals with lane assignment problem in the automated highway systems (AHS). The purpose of lane assignment strategies is to increase the 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 effects of maneuvers. Using the partitioned lane assignment strategies, the lane assignment problem is formulated as an optimal problem to find proper positions of partitions on an itinerary matrix. Then the optimal problem is solved with genetic algorithm (GA). The validation of the proposed algorithm is conducted by comparing it with a random strategy in a realistic situation.