Close category search window
 

Hybrid Genetic Tabu Search Simulated Annealing Algorithm and its application in vehicle routing problem with time windows

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

4 Author(s)
Mengzhu Shi ; Sch. of Mech. Eng., Shandong Univ., Jinan, China ; Qingguo Lin ; Qiang Zhang ; Huanhong Zhao

A detail analysis of VRPTW and the condition for the investigation of VRPTW is proposed following with some related mathematics models. For the characteristics of the VRPTW, GTSA algorithm is designed combined with the Tabu Search algorithm and Simulated Annealing algorithm. Finally, an instance is presented to validate the three algorithms GA, GSA and GTSA by MATLAB and some comparisons between them are made. It is concluded that the GSA and GTSA have very good searching capability and computing efficiency, with stable and reliable computing ability.

Published in:
Artificial Intelligence, Management Science and Electronic Commerce (AIMSEC), 2011 2nd International Conference on

Date of Conference: 8-10 Aug. 2011

Need Help?


IEEE Advancing Technology for Humanity About IEEE Xplore | Contact | Help | Terms of Use | Nondiscrimination Policy | Site Map | Privacy & Opting Out of Cookies

A not-for-profit organization, IEEE is the world's largest professional association for the advancement of technology.
© Copyright 2013 IEEE - All rights reserved. Use of this web site signifies your agreement to the terms and conditions.