arrow
返回

Efficiently solving very large-scale routing problems

delete2019-07-01
delete67
delete
OA
AI
F
Florian Arnold *
M
Michel Gendreau
K
Kenneth Sörensen
DOI:10.1016/j.cor.2019.03.006delete
delete原文链接
delete分享
delete收藏
查看原文
摘要

摘要

En 中文
The vehicle routing problem is among the most-studied and practically relevant problems in combinatorial optimization. Yet, almost all research thus far has been targeted at solving problems with not more than a few hundred customers. In this paper, we explore how to design a local search heuristic that computes good solutions for very large-scale instances of the capacitated vehicle routing problem in a reasonable computational time. We investigate different ways to reduce the time complexity with pruning and sequential search, as well as the space complexity by restricting the amount of stored information. The resulting algorithm outperforms a previously introduced heuristic for instances of 10,000 and more customers in relatively short computational time. In order to stimulate more research in this domain, we introduce a new set of benchmark instances that are based on a real-world problem and contain up to 30,000 customers and use our heuristic to solve them. (C) 2019 Elsevier Ltd. All rights reserved.
Keyword:
Vehicle routing problems
Heuristics
Local search
Large-scale problems
AI总结

AI总结

对已上传原文的论文进行重点信息的提取,主要内容包括:简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。

期刊

C
Computers and Operations Research
IF:
4.3
论文数:
6.5K
被引数:
1.8W

机构

U
University of Antwerp
学者数:
2.1W
论文数: 1.9W
被引数: 2.6W
U
universite de montreal
学者数:
4.6W
论文数: 3.8W
被引数: 46
引用论文

引用论文

New benchmark instances for the Capacitated Vehicle Routing Problem
err2017-03-01
err281
PREAI
errUchoa, Eduardo; Pecin, Diego; Pessoa, Artur; Poggi, Marcus; Vidal, Thibaut; Subramanian, Anand
err分享
err收藏
err分享
err收藏
A Novel Protection Method for Single Line-to-Ground Faults in Ungrounded Low-Inertia Microgrids
err2016-06-16
err0
errOAAI
errLiuming Jing; Dae-Hee Son; Sang-Hee Kang; Soon-Ryul Nam
err分享
err收藏
学者 查看更多内容