.png){kind=icon}
返回
Vehicle routing problems with multiple trips
.png){kind=icon}
PRE
AI
DOI：10.1007/s10479-018-2988-7.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
This paper presents a survey on the multi-trip vehicle routing problem (MTVRP) and on related routing problems where vehicles are allowed to perform multiple trips and corresponds to the article by Cattaruzza et al.(4OR 14(3):223-259, 2016). The first part of the paper focuses on the MTVRP. It gives an unified view on mathematical formulations and surveys exact and heuristic approaches. The paper continues with variants of the MTVRP and other families of routing problems where multiple trips are sometimes allowed. For the latter, it specially insists on the motivations for having multiple trips and the algorithmic consequences. The expected contribution of the survey is to give a comprehensive overview on a structural property of routing problems that has seen a strongly growing interest in the last few years and that has been investigated in very different areas of the routing literature.
Keyword:
STATION-REPLENISHMENT-PROBLEM
LARGE NEIGHBORHOOD SEARCH
TIME WINDOWS
EXACT ALGORITHM
TABU SEARCH
CITY LOGISTICS
INTEGRATED PRODUCTION
SCHEDULING PROBLEMS
WASTE COLLECTION
DELIVERY PROBLEM
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
4.5
论文数:
8.0K
被引数:
2.1W
机构
引用论文
.png){kind=icon}
A tabu search for Time-dependent Multi-zone Multi-trip Vehicle Routing Problem with Time Windows带时间窗的时间相关多区域多行程车辆路径问题的禁忌搜索
PREAI
分享收藏An iterated local search for the multi-commodity multi-trip vehicle routing problem with time windows带时间窗的多商品多行程车辆路径问题的迭代局部搜索
PREAI
分享收藏
查看更多内容