Metaheuristics for the bi-objective ring star problem

Authors:
Arnaud Liefooghe;Laetitia Jourdan;Matthieu Basseur;El-Ghazali Talbi;Edmund K. Burke
Affiliations:
Laboratoire d'Informatique Fondamentale de Lille, INRIA, CNRS, Université des Sciences et Technologies de Lille, Villeneuve d'Ascq, France;Laboratoire d'Informatique Fondamentale de Lille, INRIA, CNRS, Université des Sciences et Technologies de Lille, Villeneuve d'Ascq, France;School of Computer Science, University of Nottingham, Nottingham, United Kingdom;Laboratoire d'Informatique Fondamentale de Lille, INRIA, CNRS, Université des Sciences et Technologies de Lille, Villeneuve d'Ascq, France;School of Computer Science, University of Nottingham, Nottingham, United Kingdom
Venue:
EvoCOP'08 Proceedings of the 8th European conference on Evolutionary computation in combinatorial optimization
Year:
2008

Citing 6
Cited 2

The Ring Star Problem: Polyhedral analysis and exact algorithm

Networks
PISA: a platform and programming language independent interface for search algorithms

EMO'03 Proceedings of the 2nd international conference on Evolutionary multi-criterion optimization
ParadisEO-MOEO: a framework for evolutionary multi-objective optimization

EMO'07 Proceedings of the 4th international conference on Evolutionary multi-criterion optimization
Multiobjective evolutionary algorithms: a comparative case studyand the strength Pareto approach

IEEE Transactions on Evolutionary Computation
A fast and elitist multiobjective genetic algorithm: NSGA-II

IEEE Transactions on Evolutionary Computation
Performance assessment of multiobjective optimizers: an analysis and review

IEEE Transactions on Evolutionary Computation

Metaheuristics and cooperative approaches for the Bi-objective Ring Star Problem

Computers and Operations Research
A Generic Branch-and-Cut Algorithm for Multiobjective Optimization Problems: Application to the Multilabel Traveling Salesman Problem

INFORMS Journal on Computing

Quantified Score

Hi-index	0.00

Visualization

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.