DocumentCode
3374250
Title
A new GA approach for the vehicle routing problem
Author
Chin, Ang Juay ; Kit, Ho Wee ; Lim, Andrew
Author_Institution
Sch. of Comput., Nat. Univ. of Singapore, Singapore
fYear
1999
fDate
1999
Firstpage
307
Lastpage
310
Abstract
This paper focuses on the study of a hybrid of two search heuristics, tabu search (TS) and genetic algorithms (GA) in the vehicle routing problem with time-windows (VRPTW). TS is a local search technique that has been successfully applied to many NP-complete problems. On the other hand, a GA which is capable of searching multiple search areas in a search space is good for diversification. We investigate whether a hybrid of the two heuristics outperforms the individual heuristics
Keywords
genetic algorithms; heuristic programming; search problems; vehicles; NP-complete problems; genetic algorithms; local search technique; multiple search areas; search heuristics; search space; tabu search; time-windows; vehicle routing problem; Biological cells; Clustering algorithms; Clustering methods; Costs; Genetic algorithms; NP-complete problem; Routing; Shape; Time factors; Vehicles;
fLanguage
English
Publisher
ieee
Conference_Titel
Tools with Artificial Intelligence, 1999. Proceedings. 11th IEEE International Conference on
Conference_Location
Chicago, IL
ISSN
1082-3409
Print_ISBN
0-7695-0456-6
Type
conf
DOI
10.1109/TAI.1999.809805
Filename
809805
Link To Document