.png){kind=icon}
返回
A model-based algorithm for the Probabilistic Orienteering Problem
.png){kind=icon}
PRE
AI
DOI：10.1016/j.cor.2024.106947.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
The Orienteering Problem is a routing problem aiming at selecting a subset of a given set of customers to visited within a given time budget, so that a total revenue is maximized. Multiple variants of the problem have been studied. The Probabilistic Orienteering Problem is one of these variants, where customers will require visit according to a certain given probability. Stochasticity makes the model more practical, but concurrently more difficult to solve. Effective approaches to solve the problem potentially lead to higher quality planning in real-life logistics, thanks to the exploitation of the probabilistic informations that can normally be derived from historical data. In this paper we present an iterative model-based algorithm that solves a sequence of deterministic problems and is able to retrieve and certify optimal solutions if run for sufficient time. Experimental results show that the new approach is performing well when compared against both the exact (proven optimality) and heuristic (high quality solutions) algorithms available in the literature.
Keyword:
Probabilistic Orienteering Problem
Heuristic algorithms
Exact algorithms
期刊
C
IF:
4.3
论文数:
6.5K
被引数:
1.8W
机构
引用论文
Quantitative assay of six main phenylethanoid glycosides in Cistanche Herba by high performance liquid chromatography高效液相色谱法测定肉苁蓉中六种主要苯乙醇苷类化合物的定量分析.png)
IF0
PREAI
分享收藏分享收藏Orienteering Problem: A survey of recent variants, solution approaches and applications定向越野问题: 对最新变体，解决方法和应用的调查
OAAI
OAAI分享收藏Injury-Dependent and Disability-Specific Lumbar Spinal Gene Regulation following Sciatic Nerve Injury in the Rat大鼠坐骨神经损伤后损伤依赖性和残疾特异性腰椎基因调控PLOS ONEOAAI
PLOS ONEIF0
OAAI分享收藏
查看更多内容