.png){kind=icon}
返回
The orienteering problem: A survey
.png){kind=icon}
OA
AI
DOI：10.1016/j.ejor.2010.03.045.png)
.png){kind=icon}
.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
During the last decade, a number of challenging applications in logistics, tourism and other fields were modelled as orienteering problems (OP). In the orienteering problem, a set of vertices is given, each with a score. The goal is to determine a path, limited in length, that visits some vertices and maximises the sum of the collected scores. In this paper, the literature about the orienteering problem and its applications is reviewed. The OP is formally described and many relevant variants are presented. All published exact solution approaches and (meta) heuristics are discussed and compared. Interesting open research questions concerning the OP conclude this paper. (C) 2010 Elsevier B.V. All rights reserved.
Keyword:
Combinatorial optimisation
Orienteering problem
Survey
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
6
论文数:
2.2W
被引数:
6.4W
机构
引用论文
.png){kind=icon}
分享收藏The profitable arc tour problem: Solution with a branch-and-price algorithm有利可图的arc游览问题: 使用分支和价格算法的解决方案
PREAI
分享收藏
查看更多内容