161 search results - page 1 / 33 » Using Constraint Programming and Local Search Methods to Sol... |
CP
1998
Springer
13 years 8 months ago
1998
Springer
We use a local search method we term Large Neighbourhood Search (LNS) for solving vehicle routing problems. LNS meshes well with constraint programming technology and is analogous...
HEURISTICS
2002
13 years 4 months ago
2002
This paper presents operators searching large neighborhoods in order to solve the vehicle routing problem. They make use of the pruning and propagation techniques of constraint pr...
SAC
2002
ACM
13 years 4 months ago
2002
ACM
In this paper, we propose a metaheuristic based on snneedinglikerestarts to diversifyand intensifylocalsearches for solving the vehicle muting problem with time windows (VR_PTW). ...
CONSTRAINTS
2000
13 years 4 months ago
2000
The vehicle routing problem (VRP) is a variant of the familiar travelling salesperson problem (TSP). In the VRP we are to perform a number of visits, using a number of vehicles of ...
HEURISTICS
2000
13 years 4 months ago
2000