Search Algorithm for the Constraint Satisfaction Problem of VRPTW

Authors:
Marco Antonio Cruz-Chavez;Ocotlan Diaz-Parral;J. A. Hernandez;Jose Crispin Zavala-Diaz;Martin G. Martinez-Rangel
Affiliations:
Autonomous University of Morelos State, Mexico;Autonomous University of Morelos State, Mexico;Autonomous University of Morelos State, Mexico;Autonomous University of Morelos State, Mexico;Autonomous University of Morelos State, Mexico
Venue:
CERMA '07 Proceedings of the Electronics, Robotics and Automotive Mechanics Conference
Year:
2007

Citing 0
Cited 1

Memetic Algorithm Based on a Constraint Satisfaction Technique for VRPTW

ICAISC '08 Proceedings of the 9th international conference on Artificial Intelligence and Soft Computing

Quantified Score

Hi-index	0.00

Visualization

Abstract

This paper presents an algorithm called CSPVRPTW 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.