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

Authors:
A. Liefooghe;L. Jourdan;E. -G. Talbi
Affiliations:
Laboratoire d'Informatique Fondamentale de Lille, UMR CNRS 8022, INRIA Lille-Nord Europe, Université Lille 1, Parc Scientifique de la Haute Borne, 40 avenue Halley, 59650 Villeneuve d'Ascq, F ...;Laboratoire d'Informatique Fondamentale de Lille, UMR CNRS 8022, INRIA Lille-Nord Europe, Université Lille 1, Parc Scientifique de la Haute Borne, 40 avenue Halley, 59650 Villeneuve d'Ascq, F ...;Laboratoire d'Informatique Fondamentale de Lille, UMR CNRS 8022, INRIA Lille-Nord Europe, Université Lille 1, Parc Scientifique de la Haute Borne, 40 avenue Halley, 59650 Villeneuve d'Ascq, F ...
Venue:
Computers and Operations Research
Year:
2010

Citing 16
Cited 1

Multi-Objective Optimization Using Evolutionary Algorithms

Multi-Objective Optimization Using Evolutionary Algorithms
Evolutionary Algorithms for Solving Multi-Objective Problems

Evolutionary Algorithms for Solving Multi-Objective Problems
A Taxonomy of Hybrid Metaheuristics

Journal of Heuristics
Multiple Objective Optimization with Vector Evaluated Genetic Algorithms

Proceedings of the 1st International Conference on Genetic Algorithms
Genetic Algorithms for Multiobjective Optimization: FormulationDiscussion and Generalization

Proceedings of the 5th International Conference on Genetic Algorithms
Optimizing a Ring-Based Private Line Telecommunication Network Using Tabu Search

Management Science
The Ring Star Problem: Polyhedral analysis and exact algorithm

Networks
Design of multi-objective evolutionary algorithms: application to the flow-shop scheduling problem

CEC '02 Proceedings of the Evolutionary Computation on 2002. CEC '02. Proceedings of the 2002 Congress - Volume 02
The Capacitated m-Ring-Star Problem

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

EMO'03 Proceedings of the 2nd international conference on Evolutionary multi-criterion optimization
Metaheuristics for the bi-objective ring star problem

EvoCOP'08 Proceedings of the 8th European conference on Evolutionary computation in combinatorial optimization
An efficient heuristic for the ring star problem

WEA'06 Proceedings of the 5th international conference on Experimental Algorithms
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
Balance between genetic search and local search in memetic algorithms for multiobjective permutation flowshop scheduling

IEEE Transactions on Evolutionary Computation

A memetic algorithm for the capacitated m-ring-star problem

Applied Intelligence

Quantified Score

Hi-index	0.01

Visualization

Abstract

This paper presents and investigates different approaches to solve a new bi-objective routing problem called the ring star problem. It consists of locating a simple cycle through a subset of nodes of a graph while optimizing two kinds of cost. The first objective is the minimization of a ring cost that is related to the length of the cycle. The second one is the minimization of an assignment cost from non-visited nodes to visited ones. In spite of its obvious bi-objective formulation, this problem has always been investigated in a single-objective way. To tackle the bi-objective ring star problem, we first investigate different stand-alone search methods. Then, we propose two cooperative strategies that combine two multi-objective metaheuristics: an elitist evolutionary algorithm and a population-based local search. We apply these new hybrid approaches to well-known benchmark test instances and demonstrate their effectiveness in comparison to non-hybrid algorithms and to state-of-the-art methods.