DocumentCode
527743
Title
Hybrid genetic algorithm for searching efficient paths in traffic assignment
Author
Yang, Xinfeng ; Li, Yinzhen
Author_Institution
Sch. of Traffic & Transp. Eng., Lanzhou Jiaotong Univ., Lanzhou, China
Volume
5
fYear
2010
fDate
10-12 Aug. 2010
Firstpage
2374
Lastpage
2377
Abstract
The selection of path set has a great influence on stochastic traffic assignment. By considering path selection character of road users and traffic restriction in real road network, the concept of efficient paths is redefined. Moreover, a vertices-outdegree-based genetic algorithm (GA) is designed which adopts positive integer coding method. Furthermore, the probabilities of crossover and mutation are adjusted by adaptive algorithm and the process of selection is adopted simulated annealing algorithm to maintain the diversity and convergence of population. Thereby, this algorithm does not need to repair chromosome and can cover the shortages of priority - based GA. While finding efficient path sets of multi-OD (Origination-Destination) at the same time, this method can improve the computation efficiency by decoding simultaneously. At last, a case study is given for verifying the efficiency.
Keywords
genetic algorithms; road traffic; simulated annealing; adaptive algorithm; hybrid genetic algorithm; multiorigination-destination; path selection character; positive integer coding method; road network; simulated annealing algorithm; stochastic traffic assignment; traffic restriction; vertices-outdegree-based genetic algorithm; Algorithm design and analysis; Biological cells; Computational modeling; Decoding; Delay; Encoding; Roads; GA; delay in the intersection; efficient paths; road network; simulated annealing algorithm; traffic assignment;
fLanguage
English
Publisher
ieee
Conference_Titel
Natural Computation (ICNC), 2010 Sixth International Conference on
Conference_Location
Yantai, Shandong
Print_ISBN
978-1-4244-5958-2
Type
conf
DOI
10.1109/ICNC.2010.5584023
Filename
5584023
Link To Document