.png){kind=icon}
返回
Hybrid dynamic programming with bounding algorithm for the multi-profit orienteering problem
.png){kind=icon}
PRE
AI
DOI：10.1016/j.ejor.2022.02.045.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
The multi-profit orienteering problem (MPOP), a variant of the orienteering problem, was introduced in 2020. In MPOP, each vertex has multiple profits, and a profit is determined by the time of visit. Therefore, the vertices to visit as well as the visit sequence and visit times must be optimally selected. The purpose of MPOP is to maximize the total profits collected from the vertices while satisfying the travel time limit constraint. To date, no exact algorithm has been developed for MPOP. This paper proposes a dynamic programming (DP)-based exact algorithm for MPOP for the first time. The proposed algorithm combines DP, ng-route relaxed DP, incumbent solution generation algorithms, and bounding rules. The proposed algorithm can obtain the optimal solutions for 33 previously unsolved benchmark instances and update the best solutions in 23 benchmark instances for MPOP.(c) 2022 Elsevier B.V. All rights reserved.
Keyword:
Dynamic programming
Bounding
Multi-profit orienteering problem
Exact approach
期刊
IF:
6
论文数:
2.2W
被引数:
6.4W
机构
暂无机构信息
引用论文
An NMR crystallography DFT-D approach to analyse the role of intermolecular hydrogen bonding and π–π interactions in driving cocrystallisation of indomethacin and nicotinamide.png)
CrystEngComm
CrystEngCommIF0
PREAI
分享收藏
查看更多内容