Metaheuristics for the Bi-objective Ring Star Problem - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Conference Papers Year : 2008

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.
Fichier principal
Vignette du fichier
liefooghe.evocop08.pdf (154.27 Ko) Télécharger le fichier
Origin : Files produced by the author(s)
Loading...

Dates and versions

inria-00269978 , version 1 (03-04-2008)

Identifiers

Cite

Arnaud Liefooghe, Laetitia Jourdan, Matthieu Basseur, El-Ghazali Talbi, Edmund K. 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⟩
130 View
199 Download

Altmetric

Share

Gmail Facebook X LinkedIn More