Metaheuristics for the Bi-objective Ring ...
Document type :
Communication dans un congrès avec actes
Title :
Metaheuristics for the Bi-objective Ring Star Problem
Author(s) :
Liefooghe, Arnaud [Auteur]
Parallel Cooperative Multi-criteria Optimization [DOLPHIN]
Laboratoire d'Informatique Fondamentale de Lille [LIFL]
Jourdan, Laetitia [Auteur]
Parallel Cooperative Multi-criteria Optimization [DOLPHIN]
Laboratoire d'Informatique Fondamentale de Lille [LIFL]
Basseur, Matthieu [Auteur]
Talbi, El-Ghazali [Auteur]
Parallel Cooperative Multi-criteria Optimization [DOLPHIN]
Laboratoire d'Informatique Fondamentale de Lille [LIFL]
Burke, Edmund [Auteur]

Parallel Cooperative Multi-criteria Optimization [DOLPHIN]
Laboratoire d'Informatique Fondamentale de Lille [LIFL]
Jourdan, Laetitia [Auteur]

Parallel Cooperative Multi-criteria Optimization [DOLPHIN]
Laboratoire d'Informatique Fondamentale de Lille [LIFL]
Basseur, Matthieu [Auteur]
Talbi, El-Ghazali [Auteur]

Parallel Cooperative Multi-criteria Optimization [DOLPHIN]
Laboratoire d'Informatique Fondamentale de Lille [LIFL]
Burke, Edmund [Auteur]
Scientific editor(s) :
J. Van Hemert and C. Cotta
Conference title :
Eighth European Conference on Evolutionary Computation in Combinatorial Optimisation (EvoCOP 2008)
City :
Napoli
Country :
Italie
Start date of the conference :
2008-03
Journal title :
Lecture Notes in Computer Science (LNCS)
Publisher :
Springer-Verlag
Publication date :
2008
HAL domain(s) :
Mathématiques [math]/Combinatoire [math.CO]
English abstract : [en]
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 ...
Show more >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.Show less >
Show more >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.Show less >
Language :
Anglais
Peer reviewed article :
Oui
Audience :
Internationale
Popular science :
Non
Collections :
Source :
Files
- https://hal.inria.fr/inria-00269978/document
- Open access
- Access the document
- http://www.lifl.fr/~jourdan/publi/evocop08.pdf
- Open access
- Access the document
- https://hal.inria.fr/inria-00269978/document
- Open access
- Access the document
- http://www.lifl.fr/~jourdan/publi/evocop08.pdf
- Open access
- Access the document
- document
- Open access
- Access the document
- liefooghe.evocop08.pdf
- Open access
- Access the document
- document
- Open access
- Access the document
- liefooghe.evocop08.pdf
- Open access
- Access the document
- evocop08.pdf
- Open access
- Access the document