By Topic

Search Algorithm for the Constraint Satisfaction Problem of VRPTW

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

5 Author(s)

This paper presents an algorithm called CSP-IRPTW for the vehicles routing problem with time windows (VRPTW), which applies the PCP method (precedence constraint posting) used for models of scheduling as a CSP (constraint satisfaction problem). PCP involves the calculation of the shortest path in partial and global form, between pairs of nodes and among all the nodes respectively, in the graph that represents the VRPTW model. In order to apply PCP to VRPTW, the problem is treated as a CSP. The results show that the proposed search algorithm is efficient in the search for the global optimum for some problems.

Published in:

Electronics, Robotics and Automotive Mechanics Conference, 2007. CERMA 2007

Date of Conference:

25-28 Sept. 2007