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.
Search Algorithm for the Constraint Satisfaction Problem of VRPTW
2007-09-01
393886 byte
Conference paper
Electronic Resource
English
Flower Pollination Algorithm for Vehicle Routing Problem with Time Windows (VRPTW)
BASE | 2021
|Low cost parallel solutions for the VRPTW optimization problem
Tema Archive | 2001
|