.png){kind=icon}
返回
An adaptive VNS algorithm for vehicle routing problems with intermediate stops
.png){kind=icon}
PRE
AI
DOI：10.1007/s00291-014-0376-5.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
There are numerous practical vehicle routing applications in which vehicles have to stop at certain facilities along their routes to be able to continue their service. At these stops, the vehicles replenish or unload their cargo or they stop to refuel. In this paper, we study the vehicle routing problem with intermediate stops (VRPIS), which considers stopping requirements at intermediate facilities. Service times occur at these stops and may depend on the load level or fuel level on arrival. This is incorporated into the routing model to respect route duration constraints. We develop an adaptive variable neighborhood search (AVNS) to solve the VRPIS. The adaptive mechanism guides the shaking step of the AVNS by favoring the route and vertex selection methods according to their success within the search. The performance of the AVNS is demonstrated on test instances for VRPIS variants available in the literature. Furthermore, we conduct tests on newly generated instances of the electric vehicle routing problem with recharging facilities, which can also be modeled as VRPIS variant. In this problem, battery electric vehicles need to recharge their battery en route at respective recharging facilities.
Keyword:
Vehicle routing
Intermediate stops
Refueling
Recharging
Electric vehicles
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
O
IF:
1.9
论文数:
30
被引数:
1.9K
机构
引用论文
.png){kind=icon}
分享收藏分享收藏
Algorithms for the Vehicle Routing and Scheduling Problems with Time Window Constraints具有时间窗约束的车辆路径和调度问题的算法
PREAI
分享收藏
查看更多内容