返回
Combining ant colony optimization algorithm and dynamic programming technique for solving the covering salesman problem
DOI:10.1016/j.cie.2015.02.019.png)
摘要
En 中文
The covering salesman problem (CSP) is an extension of the well-known traveling salesman problem in which we are allowed to leave some vertices unvisited. The goal of the CSP is to construct a minimum length Hamiltonian cycle over a subset of vertices where those vertices not visited by the tour need to be within a pre-determined distance from at least one visited vertex. In this paper, we propose a mathematical formulation and a hybrid heuristic algorithm by combining ant colony optimization algorithm and dynamic programming technique to obtain high quality solutions. Comparing the results of the proposed algorithm with available methods in the literature clearly indicates the effectiveness of our proposed heuristic algorithm. (c) 2015 Elsevier Ltd. All rights reserved.
Keyword:
Traveling salesman problem
Covering salesman problem
Ant colony optimization
Dynamic programming
Heuristics
AI总结
对已上传原文的论文进行重点信息的提取,主要内容包括:简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
6.5
论文数:
1.0W
被引数:
3.8W
机构
引用论文
Investigation of morphologies and characterization of rare earth metal samarium hexacyanoferrate and its composite with surfactant intercalated graphene oxide for sensor applications
RSC Adv.
IF0
Development and validation of a TRNSYS type to simulate heat pipe heat exchangers in transient applications of waste heat recovery开发和验证TRNSYS类型,以模拟废热回收瞬态应用中的热管换热器
Injury-Dependent and Disability-Specific Lumbar Spinal Gene Regulation following Sciatic Nerve Injury in the Rat大鼠坐骨神经损伤后损伤依赖性和残疾特异性腰椎基因调控
PLOS ONE
IF0
Chronic lymphatic leukaemia presenting as severe obstructive sleep apnoea表现为严重阻塞性睡眠呼吸暂停的慢性淋巴白血病
Respirology
IF0

