.png){kind=icon}
返回
A multi-start algorithm for a balanced real-world Open Vehicle Routing Problem
.png){kind=icon}
PRE
AI
DOI：10.1016/j.ejor.2014.04.008.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
The aim of this paper is to solve a real-world problem proposed by an international company operating in Spain and modeled as a variant of the Open Vehicle Routing Problem in which the makespan, i.e., the maximum time spent on the vehicle by one person, must be minimized. A competitive multi-start algorithm, able to obtain high quality solutions within reasonable computing time is proposed. The effectiveness of the algorithm is analyzed through computational testing on a set of 19 school-bus routing benchmark problems from the literature, and on 9 hard real-world problem instances. (C) 2014 Elsevier B.V. All rights reserved.
Keyword:
Open Vehicle Routing Problem
Multi-start algorithm
Local search algorithm
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
6
论文数:
2.2W
被引数:
6.4W
机构
引用论文
.png){kind=icon}
A comprehensive study of thermoelectric and transport properties of β-silicon carbide nanowires
PREAI
分享收藏分享收藏
查看更多内容