Volume 52, Number 2, April–June 2018
|Page(s)||577 - 594|
|Published online||20 July 2018|
A generalized model and a heuristic algorithm for the large-scale covering tour problem
Faculty of Business and Commerce, Kansai University,
* Corresponding author: email@example.com
Accepted: 17 December 2017
The covering tour problem (CTP) is defined on a graph, where there exist two types of vertices. One is called visited vertex, which can be visited. The other is called covered vertex, which must be covered but cannot be visited. Each visited vertex covers a subset of covered vertices, and the costs of edges between visited vertices are given. The objective of the CTP is to obtain a minimum cost tour on a subset of visited vertices while covering all covered vertices. In this paper, we deal with the large-scale CTPs, which are composed of tens of thousands of vertices; in the previous studies, the scales of the instances in the experiments are at most a few hundred vertices. We propose a heuristic algorithm using local search techniques for the large-scale CTP. With computational experiments, we show that our algorithm outperforms the existing methods.
Mathematics Subject Classification: 90C06 / 90C27 / 90C59
Key words: Covering tour problem / traveling salesman problem / set-covering problem / local search techniques / large-scale problem
© EDP Sciences, ROADEF, SMAI 2018
Current usage metrics show cumulative count of Article Views (full-text article views including HTML views, PDF and ePub downloads, according to the available data) and Abstracts Views on Vision4Press platform.
Data correspond to usage on the plateform after 2015. The current usage metrics is available 48-96 hours after online publication and is updated daily on week days.
Initial download of the metrics may take a while.