Using Constraint Programming and Local Search Methods to Solve Vehicle Routing Problems

DMCA

Using Constraint Programming and Local Search Methods to Solve Vehicle Routing Problems (1998)

Cached

Download Links

Other Repositories/Bibliography

DBLP

by Paul Shaw

Citations:

212 - 2 self

BibTeX

@INPROCEEDINGS{Shaw98usingconstraint,
    author = {Paul Shaw},
    title = {Using Constraint Programming and Local Search Methods to Solve Vehicle Routing Problems},
    booktitle = {},
    year = {1998},
    pages = {417--431},
    publisher = {Springer-Verlag}
}

OpenURL

Abstract

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 to the shuffling technique of job-shop scheduling. The technique explores a large neighbourhood of the current solution by selecting a number of customer visits to remove from the routing plan, and re-inserting these visits using a constraint-based tree search. We analyse the performance of LNS on a number of vehicle routing benchmark problems. Unlike related methods, we use Limited Discrepancy Search during the tree search to re-insert visits. We also maintain diversity during search by dynamically altering the number of visits to be removed, and by using a randomised choice method for selecting visits to remove. We analyse the performance of our method for various parameter settings controlling the discrepancy limit, the dynamicity of the size of the removal set, and the randomness of the choice. We demonst...

Keyphrases

local search method vehicle routing problem constraint programming routing plan related method removal set term large neighbourhood search tree search current solution limited discrepancy search randomised choice method benchmark problem job-shop scheduling discrepancy limit large neighbourhood various parameter setting constraint-based tree search lns mesh re-insert visit customer visit

DMCA