Close category search window
 

Hybrid Tabu Search Algorithm for Vehicle Routing Problem with Time Window

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)
Jiu-Mei Chen ; Strategical Planning Dept., Chongqing Technol. & Bus. Univ., Chongqing ; Xu-mei Zhang ; Han-Guang Qiu

A hybrid tabu search algorithm, which generates initial solution by genetic algorithm, is proposed here to solve the vehicle routing problems with time windows (VRPTW). Experimental result shows that this algorithm is better than the other known algorithms.

Published in:
Wireless Communications, Networking and Mobile Computing, 2008. WiCOM '08. 4th International Conference on

Date of Conference: 12-14 Oct. 2008

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.