Close category search window
 

Combining Constraint Programming and Tabu Search to Solve 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

2 Author(s)
Nguyen Huu Bao Quoc ; Fac. of Comput. Sci. & Eng., Ho Chi Minh City Univ. of Technol., Ho Chi Minh City, Vietnam ; Duong Tuan Anh

This paper presents a new two-stage approach to solve Vehicle Routing Problem with Time Windows. The first stage aims to minimize the number of routes and the second stage is to minimize the travel distance. The approach is also based on a combination of Tabu search method and constraint programming technology. The main idea is to apply the power of constraint propagation in constraint programming to reduce the computational cost when Tabu search needs to scan the whole neighborhood to find the best non-tabu moves at each iteration.

Published in:
Computing and Communication Technologies, Research, Innovation, and Vision for the Future (RIVF), 2010 IEEE RIVF International Conference on

Date of Conference: 1-4 Nov. 2010

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.