Paper Info
Title
Heuristics for vehicle routing problems: Sequence or set optimization?
Abstract
•We study decision-set decompositions in vehicle routing heuristics.•We use Balas & Simonetti’s dynamic programming to define different search spaces.•We propose and evaluate a variety of techniques to improve exploration speed.•We measure the performance of local searches and metaheuristics in these spaces.
Year
DOI
Venue
2019
10.1016/j.cor.2018.12.023
Computers & Operations Research
Keywords
DocType
Volume
Decision-set decompositions,Metaheuristics,Dynamic programming,Integer programming,Large neighborhood search,Vehicle routing problem
Journal
105
ISSN
Citations 
PageRank 
0305-0548
2
0.37
References 
Authors
23
3
Name
Order
Citations
PageRank
Túlio A. Toffolo1264.35
Thibaut Vidal271430.28
Tony Wauters35610.20