.png){kind=icon}
返回
The Set Orienteering Problem
.png){kind=icon}
PRE
AI
DOI：10.1016/j.ejor.2017.11.009.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
In this paper, we study the Set Orienteering Problem which is a generalization of the Orienteering Problem where customers are grouped in clusters and a profit is associated with each cluster. The profit of a cluster is collected only if at least one customer from the cluster is visited. A single vehicle is available to collect the profit and the objective is to find the vehicle route that maximizes the profit collected and such that the route duration does not exceed a given threshold. We propose a mathematical formulation of the problem and a matheuristic algorithm. Computational tests are made on instances derived from benchmark instances for the Generalized Traveling Salesman Problem with up 1084 vertices. Results show that the matheuristic produces robust and high-quality solutions in a short computing time. (C) 2017 Elsevier B.V. All rights reserved.
Keyword:
Routing
Orienteering problem
Matheuristic
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
6
论文数:
2.2W
被引数:
6.4W
机构
引用论文
Investigation of morphologies and characterization of rare earth metal samarium hexacyanoferrate and its composite with surfactant intercalated graphene oxide for sensor applications.png)
RSC Adv.
RSC Adv.IF0
PREAI
分享收藏Orienteering Problem: A survey of recent variants, solution approaches and applications定向越野问题: 对最新变体，解决方法和应用的调查
OAAI
OAAI分享收藏Accurate analysis of the size distribution and crystallinity of boron doped Si nanocrystals via Raman and PL spectraRSC AdvancesOAAI
RSC AdvancesIF0
OAAI分享收藏 没有更多内容
没有更多内容