Paper Info
Title
Designing granular solution methods for routing problems with time windows.
Abstract
•We consider the efficient design of local search methods for vehicle routing.•Different sparsification methods are compared.•Reduced-cost based methods computationally prove more effective.•Substantial time savings are achieved.
Year
DOI
Venue
2017
10.1016/j.ejor.2017.04.059
European Journal of Operational Research
Keywords
Field
DocType
Metaheuristics,Granular neighborhoods,Vehicle routing,Time windows,Local search
Mathematical optimization,Vehicle routing problem,Arc (geometry),Combinatorial optimization problem,Vertex (geometry),Algorithm,Local search (optimization),Tabu search,Mathematics,Metaheuristic
Journal
Volume
Issue
ISSN
263
2
0377-2217
Citations 
PageRank 
References 
4
0.38
35
Authors
3
Name
Order
Citations
PageRank
michael schneider155576.50
Fabian Schwahn240.38
Daniele Vigo32054149.20