Name
Abstract | ||
|---|---|---|
•A local search heuristic for very large-scale routing problems is developed.•Different strategies to minimize time and space complexity are explored.•The final heuristic outperforms a previously introduced heuristic.•New realistic VRP instances with up to 30,000 customers are introduced. |
Year | DOI | Venue |
|---|---|---|
2019 | 10.1016/j.cor.2019.03.006 | Computers & Operations Research |
Keywords | Field | DocType |
Vehicle routing problems,Heuristics,Local search,Large-scale problems | Mathematical optimization,Heuristic,Vehicle routing problem,Combinatorial optimization,Local search (optimization),Time complexity,Linear search,Mathematics | Journal |
Volume | ISSN | Citations |
107 | 0305-0548 | 3 |
PageRank | References | Authors |
0.37 | 7 | 3 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Florian Arnold | 1 | 53 | 5.42 |
| Michel Gendreau | 2 | 6609 | 393.98 |
| Kenneth Sörensen | 3 | 175 | 19.42 |