HAL will be down for maintenance from Friday, June 10 at 4pm through Monday, June 13 at 9am. More information
Skip to Main content Skip to Navigation
Conference papers

Metaheuristics for the Bi-objective Ring Star Problem

Abstract : The bi-objective ring star problem aims to locate a cycle through a subset of nodes of a graph while optimizing two types of cost. The first criterion is to minimize a ring cost, related to the length of the cycle, whereas the second one is to minimize an assignment cost, from non-visited nodes to visited ones. In spite of its natural multi-objective formulation, this problem has never been investigated in such a way. In this paper, three metaheuristics are designed to approximate the whole set of efficient solutions for the problem under consideration. Computational experiments are performed on well-known benchmark test instances, and the proposed methods are rigorously compared to each other using different performance metrics.
Document type :
Conference papers
Complete list of metadata

Cited literature [17 references]  Display  Hide  Download

Contributor : Arnaud Liefooghe Connect in order to contact the contributor
Submitted on : Thursday, April 3, 2008 - 2:07:50 PM
Last modification on : Thursday, January 20, 2022 - 5:27:52 PM
Long-term archiving on: : Friday, May 21, 2010 - 1:17:35 AM


Files produced by the author(s)



Arnaud Liefooghe, Laetitia Jourdan, Matthieu Basseur, El-Ghazali Talbi, Edmund Burke. Metaheuristics for the Bi-objective Ring Star Problem. Eighth European Conference on Evolutionary Computation in Combinatorial Optimisation (EvoCOP 2008), Mar 2008, Napoli, Italy. pp.206--217, ⟨10.1007/978-3-540-78604-7_18⟩. ⟨inria-00269978⟩



Record views


Files downloads