.png){kind=icon}
返回
An integer programming-based local search for the covering salesman problem
.png){kind=icon}
PRE
AI
DOI：10.1016/j.cor.2012.01.004.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
We consider a generalized version of the well known Traveling Salesman Problem called Covering Salesman problem. In this problem, we are given a set of vertices while each vertex i can cover a subset of vertices within its predetermined covering distance r(i). The goal is to construct a minimum length Hamiltonian cycle over a subset of vertices in which those vertices not visited on the tour has to be within the covering distance of at least one vertex visited on the tour. The paper proposes an Integer Linear Programming based heuristic method which takes advantage of Integer Linear Programming techniques and heuristic search to improve the quality of the solutions. Extensive computational tests on the standard benchmark instances and on a new set of large sized datasets show the effectiveness of the proposed approach. (C) 2012 Elsevier Ltd. All rights reserved.
Keyword:
Covering salesman problem
Heuristics
Integer linear programming
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
C
IF:
4.3
论文数:
6.5K
被引数:
1.8W
机构
引用论文
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
分享收藏
Injury-Dependent and Disability-Specific Lumbar Spinal Gene Regulation following Sciatic Nerve Injury in the Rat大鼠坐骨神经损伤后损伤依赖性和残疾特异性腰椎基因调控PLOS ONE
OAAI
PLOS ONEIF0
OAAI分享收藏Bodily pleasure matters: velocity of touch modulates body ownership during the rubber hand illusionOAAI
OAAI分享收藏A comprehensive study on the heterogeneous electro-Fenton degradation of tartrazine in water using CoFe2O4/carbon felt cathodeChemosphere
ChemosphereIF0
PREAI
分享收藏
查看更多内容