期刊
COMPUTERS & INDUSTRIAL ENGINEERING
卷 83, 期 -, 页码 244-251出版社
PERGAMON-ELSEVIER SCIENCE LTD
DOI: 10.1016/j.cie.2015.02.019
关键词
Traveling salesman problem; Covering salesman problem; Ant colony optimization; Dynamic programming; Heuristics
资金
- Research Deputy of Ferdowsi University of Mashhad [28038]
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.
作者
我是这篇论文的作者
点击您的名字以认领此论文并将其添加到您的个人资料中。
推荐
暂无数据