• 文献检索
  • 文档翻译
  • 深度研究
  • 学术资讯
  • Suppr Zotero 插件Zotero 插件
  • 邀请有礼
  • 套餐&价格
  • 历史记录
应用&插件
Suppr Zotero 插件Zotero 插件浏览器插件Mac 客户端Windows 客户端微信小程序
定价
高级版会员购买积分包购买API积分包
服务
文献检索文档翻译深度研究API 文档MCP 服务
关于我们
关于 Suppr公司介绍联系我们用户协议隐私条款
关注我们

Suppr 超能文献

核心技术专利:CN118964589B侵权必究
粤ICP备2023148730 号-1Suppr @ 2026

文献检索

告别复杂PubMed语法,用中文像聊天一样搜索,搜遍4000万医学文献。AI智能推荐,让科研检索更轻松。

立即免费搜索

文件翻译

保留排版,准确专业,支持PDF/Word/PPT等文件格式,支持 12+语言互译。

免费翻译文档

深度研究

AI帮你快速写综述,25分钟生成高质量综述,智能提取关键信息,辅助科研写作。

立即免费体验

一种针对带时间窗和同步约束的定向越野问题的求解方法。

A solution approach to the orienteering problem with time windows and synchronisation constraints.

作者信息

Roozbeh Iman, Hearne John W, Pahlevani Delaram

机构信息

School of Science, RMIT University, Melbourne, Australia.

出版信息

Heliyon. 2020 Jun 20;6(6):e04202. doi: 10.1016/j.heliyon.2020.e04202. eCollection 2020 Jun.

DOI:10.1016/j.heliyon.2020.e04202
PMID:32596522
原文链接:https://pmc.ncbi.nlm.nih.gov/articles/PMC7306599/
Abstract

The orienteering problem with time windows and synchronisation constraints, known as the Cooperative Orienteering Problem with Time Windows (COPTW), is a class of problems with some important applications such as in home health care and emergency logistics management, 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 node simultaneously and cooperatively. This requirement to have one or more team members simultaneously available at a vertex to collect the reward poses a challenging task. It means that while multiple paths need to be determined as in the team orienteering problem with time-windows (TOPTW), there is the additional requirement that certain paths must meet at some of the vertices. Exact methods are too slow for operational purposes and they are not able to handle large scale instances of the COPTW. In this paper, we address the problem of finding solutions to the COPTW in times that make the approach suitable for use in certain emergency response situations. This is achieved by developing new merit-based heuristics as elements of an Adaptive Large Neighbourhood Search (ALNS) algorithm. We validate the performance of this new approach through an extensive computational study. The computational results show that the proposed method is effective in obtaining high quality solutions in times that are suitable for operational purposes.

摘要

带时间窗和同步约束的定向越野问题,即带时间窗的协同定向越野问题(COPTW),是一类具有重要应用的问题,如家庭医疗保健和应急物流管理等领域,但受到的关注相对较少。在COPTW中,需要一定数量的团队成员同时协作从每个节点获取相关奖励。要求有一个或多个团队成员同时在一个顶点获取奖励是一项具有挑战性的任务。这意味着虽然如同带时间窗的团队定向越野问题(TOPTW)一样需要确定多条路径,但还有额外要求,即某些路径必须在一些顶点处会合。精确方法对于实际操作来说太慢,并且无法处理大规模的COPTW实例。在本文中,我们解决了在适合某些应急响应情况的时间内找到COPTW解决方案的问题。这是通过开发新的基于价值的启发式算法作为自适应大邻域搜索(ALNS)算法的元素来实现的。我们通过广泛的计算研究验证了这种新方法的性能。计算结果表明,所提出的方法能够在适合实际操作的时间内有效地获得高质量的解决方案。

相似文献

1
A solution approach to the orienteering problem with time windows and synchronisation constraints.一种针对带时间窗和同步约束的定向越野问题的求解方法。
Heliyon. 2020 Jun 20;6(6):e04202. doi: 10.1016/j.heliyon.2020.e04202. eCollection 2020 Jun.
2
A clustering metaheuristic for large orienteering problems.一种用于大规模定向问题的聚类启发式算法。
PLoS One. 2022 Jul 22;17(7):e0271751. doi: 10.1371/journal.pone.0271751. eCollection 2022.
3
Iterated local search algorithm for solving the orienteering problem with soft time windows.用于求解带软时间窗定向越野问题的迭代局部搜索算法。
Springerplus. 2016 Oct 12;5(1):1781. doi: 10.1186/s40064-016-3440-6. eCollection 2016.
4
Orienteering Problem with Functional Profits for multi-source dynamic path construction.多源动态路径构建的功能收益定向越野问题。
PLoS One. 2019 Apr 2;14(4):e0213777. doi: 10.1371/journal.pone.0213777. eCollection 2019.
5
Lower and upper bounds for the two-echelon capacitated location-routing problem.两阶段容量受限选址-路径问题的上下界
Comput Oper Res. 2012 Dec;39(12):3185-3199. doi: 10.1016/j.cor.2012.04.003.
6
Dynamic vehicle routing with time windows in theory and practice.带时间窗的动态车辆路径规划:理论与实践
Nat Comput. 2017;16(1):119-134. doi: 10.1007/s11047-016-9550-9. Epub 2016 Apr 9.
7
Towards an efficient collection and transport of COVID-19 diagnostic specimens using genetic-based algorithms.利用基于遗传的算法实现新冠病毒诊断样本的高效采集与运输。
Appl Soft Comput. 2022 Feb;116:108264. doi: 10.1016/j.asoc.2021.108264. Epub 2021 Dec 9.
8
Fairness in ambulance routing for post disaster management.灾后管理中救护车调度的公平性
Cent Eur J Oper Res. 2022;30(1):189-211. doi: 10.1007/s10100-021-00785-y. Epub 2021 Oct 26.
9
Multiobjective Vehicle Routing Problems With Simultaneous Delivery and Pickup and Time Windows: Formulation, Instances, and Algorithms.具有同时交付和取货以及时间窗的多目标车辆路径问题:公式、实例和算法。
IEEE Trans Cybern. 2016 Mar;46(3):582-94. doi: 10.1109/TCYB.2015.2409837. Epub 2015 Mar 18.
10
An efficient and global interactive optimization methodology for path planning with multiple routing constraints.一种用于具有多个路由约束的路径规划的高效全局交互式优化方法。
ISA Trans. 2022 Feb;121:206-216. doi: 10.1016/j.isatra.2021.03.041. Epub 2021 Mar 29.

本文引用的文献

1
The home health care routing and scheduling problem with interdependent services.带相依服务的家庭医疗保健路径规划和调度问题。
Health Care Manag Sci. 2014 Mar;17(1):15-30. doi: 10.1007/s10729-013-9243-1. Epub 2013 Jun 19.