Title : ( Combining ant colony optimization algorithm and dynamic programming technique for solving the covering salesman problem )
Authors: Majid Salari , Mohammad Reihaneh , Mohammad S. Sabbagh ,
دانلود فایل برای اعضای دانشگاهAccess to full-text not allowed by authors
Abstract
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 the our proposed heuristic algorithm.
Keywords
, Traveling salesman proble; Covering salesman problem, Ant colony optimization, Dynamic programming, Heuristics.
@article{paperid:1046727,
author = {Salari, Majid and Mohammad Reihaneh and Mohammad S. Sabbagh},
title = {Combining ant colony optimization algorithm and dynamic programming technique for solving the covering salesman problem},
journal = {Computers and Industrial Engineering},
year = {2015},
volume = {83},
number = {5},
month = {July},
issn = {0360-8352},
pages = {244--251},
numpages = {7},
keywords = {Traveling salesman proble; Covering salesman problem; Ant colony optimization; Dynamic
programming; Heuristics.},
}
%0 Journal Article
%T Combining ant colony optimization algorithm and dynamic programming technique for solving the covering salesman problem
%A Salari, Majid
%A Mohammad Reihaneh
%A Mohammad S. Sabbagh
%J Computers and Industrial Engineering
%@ 0360-8352
%D 2015
