DocumentCode
523892
Title
A New Hybrid Path Relinking Algorithm for the Vehicle Routing Problem
Author
Zhang, Xiaoxia ; Bai, Qiuying ; Dong, Liwen
Author_Institution
Coll. of Software Eng., Univ. of Sci. & Technol. Liaoning, Anshan, China
Volume
1
fYear
2010
fDate
11-12 May 2010
Firstpage
234
Lastpage
237
Abstract
This paper presents a new hybrid path relinking algorithm called ACO&PR algorithm to solve the vehicle routing problem. Ant colony optimization (ACO) is a meta-heuristic approach, which simulates the decision-making processes of ant colonies as they forage for food and find the most efficient routes from their nests to food sources. Due to its constructive nature, we hybridize the solution construction mechanism of ACO with path relinking (PR), an evolutionary method, which introduces progressively attributes of the guiding solution into the initial solution to obtain the high quality solution as quickly as possible. The experimental results for benchmark VRP instances have shown that our proposed method is competitive to solve the vehicle routing problem compared with the best existing methods in terms of solution quality.
Keywords
Algorithm design and analysis; Ant colony optimization; Automation; Computational modeling; Educational institutions; Intelligent vehicles; Paper technology; Routing; Simulated annealing; Software algorithms; Ant colony optimization; path relinking; vehicle routing problem;
fLanguage
English
Publisher
ieee
Conference_Titel
Intelligent Computation Technology and Automation (ICICTA), 2010 International Conference on
Conference_Location
Changsha, China
Print_ISBN
978-1-4244-7279-6
Electronic_ISBN
978-1-4244-7280-2
Type
conf
DOI
10.1109/ICICTA.2010.700
Filename
5523338
Link To Document