arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~
arXiv 1608.05485cs.AImath.OC
收藏

带时间窗的合作团队定向运动问题的一种启发式算法

A heuristic scheme for the Cooperative Team Orienteering Problem with Time Windows

RMIT University(皇家墨尔本理工大学)

Iman Roozbeh, Melih Ozlen, John W. Hearne

摘要:

带时间窗的合作定向问题(COPTW)是一类有重要应用但研究较少的问题。在COPTW中,需要一定数量的团队成员同时合作地从每个客户那里收集相关的奖励。这种要求有一个或多个团队成员同时在一个顶点收集奖励,提出了一个具有挑战性的或任务。精确的方法是不能够处理大规模的COPTW的情况下,没有启发式计划已经开发了这个问题到目前为止。在本文中,一个新的修改经典的克拉克和赖特节省启发式提出了处理这个问题。通过将资源需求属性添加到现有基准而生成的新基准集。启发式算法,其次是提升运营商实现最佳解决方案的64.5%的情况下,最佳结果是已知的。所提出的解决方案的方法达到了2.61%的最优差距相同的情况下,并解决了在短的计算时间内与现实的大小的基准。

英文摘要:

The Cooperative Orienteering Problem with Time Windows (COPTW)is a class of problems with some important applications and yet has received relatively little attention. In the COPTW a certain number of team members are required to collect the associated reward from each customer simultaneously and cooperatively. This requirement to have one or more team members simultaneously available at a vertex to collect the reward, poses a challenging OR task. Exact methods are not able to handle large scale instances of the COPTW and no heuristic schemes have been developed for this problem so far. In this paper, a new modification to the classical Clarke and Wright saving heuristic is proposed to handle this problem. A new benchmark set generated by adding the resource requirement attribute to the existing benchmarks. The heuristic algorithm followed by boosting operators achieves optimal solutions for 64.5% of instances for which the optimal results are known. The proposed solution approach attains an optimality gap of 2.61% for the same instances and solves benchmarks with realistic size within short computational times.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑