.png){kind=icon}
返回
The Multiconstraint Team Orienteering Problem with Multiple Time Windows
.png){kind=icon}
OA
AI
DOI：10.1287/trsc.1110.0377.png)
.png){kind=icon}
.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
This paper introduces the multiconstraint team orienteering problem with multiple time windows (MC-TOP-1 MTW). In the MC-TOP-MTW, a set of vertices is given, each with a service time, one or more time windows, and a score. The goal is to maximize the sum of the collected scores, by a fixed number of tours. The tours are limited in length and restricted by the time windows and additional constraints. Next to a mathematical formulation of the MC-TOP-MTW, the main contribution of this paper is a fast and effective algorithm for tackling this problem, by hybridizing iterated local search with a greedy randomized adaptive search procedure. On a large test set, an average run has a score gap of only 5.19% with known high quality solutions, using 1.5 seconds of computational time. For 32% of the test instances, the known high quality solution was found or improved. This solution method also performs well on test instances of the TOPTW, the selective vehicle routing problem with time windows, and the MC-TOP-TW. A sensitivity analysis shows that the performance of the algorithm is insensitive to small changes in the parameter settings.
Keyword:
orienteering problem
grasp
iterated local search
vehicle routing
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
4.8
论文数:
1.9K
被引数:
8.4K
机构
引用论文
.png){kind=icon}
Algorithms for the Vehicle Routing and Scheduling Problems with Time Window Constraints具有时间窗约束的车辆路径和调度问题的算法
PREAI
分享收藏
查看更多内容