By Topic

A new hybrid method of Genetic Algorithm,Tabu and Chaotic search for CVRPTW

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

3 Author(s)
Lin Lin ; Dept. of Autom., Tsinghua Univ., Beijing, China ; Jianming Hu ; Boan Shen

This paper proposes a method for solving Capacitated Vehicle Routing Problem with Hard Time Window (CVRPTW). This method combines the traditional Genetic Algorithm which is frequently used in solving NP-hard problems and the idea of Chaotic Search together to work for a better result. The Logistic Mapping mechanism is adopted to create more new genes and contribute to diversity. In addition, Tabu search is used for accelerating the whole method and jumping out of local optimal. We confirmed that the proposed method shows good performance for CVRPTW. Furthermore, by comparing with the results calculated without chaotic search and some up-to-date best results in Solomon Benchmark, the proposed method is testified to be feasible and applicable.

Published in:

Intelligent Computing and Intelligent Systems (ICIS), 2010 IEEE International Conference on  (Volume:2 )

Date of Conference:

29-31 Oct. 2010