作者： P. Shaw
DOI:
关键词: Mathematical optimization 、 Local search (optimization) 、 Constraint satisfaction 、 Scheduling (computing) 、 Guided Local Search 、 Computer science 、 Vehicle routing problem 、 Polygon mesh 、 Constraint programming
摘要: We use a local search method we term Large Neighbourhood Search (LNS) to solve vehicle routing problems. LNS is analogous the shuffling technique of job-shop scheduling, and so meshes well with constraint programming technology. explores large neighbourhood current solution by selecting number related customer visits remove from set planned routes, re-inserting these using constraint-based tree search. Unlike similar methods, Limited Discrepancy during re-insert visits. analyse performance our on benchmark demonstrate that results produced are competitive Operations Research meta-heuristic indicating technology directly applicable