Metaheuristics for the Bi-objective Ring ...
Type de document :
Communication dans un congrès avec actes
Titre :
Metaheuristics for the Bi-objective Ring Star Problem
Auteur(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]
Éditeur(s) ou directeur(s) scientifique(s) :
J. Van Hemert and C. Cotta
Titre de la manifestation scientifique :
Eighth European Conference on Evolutionary Computation in Combinatorial Optimisation (EvoCOP 2008)
Ville :
Napoli
Pays :
Italie
Date de début de la manifestation scientifique :
2008-03
Titre de la revue :
Lecture Notes in Computer Science (LNCS)
Éditeur :
Springer-Verlag
Date de publication :
2008
Discipline(s) HAL :
Mathématiques [math]/Combinatoire [math.CO]
Résumé en anglais : [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 ...
Lire la suite >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.Lire moins >
Lire la suite >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.Lire moins >
Langue :
Anglais
Comité de lecture :
Oui
Audience :
Internationale
Vulgarisation :
Non
Collections :
Source :
Fichiers
- https://hal.inria.fr/inria-00269978/document
- Accès libre
- Accéder au document
- http://www.lifl.fr/~jourdan/publi/evocop08.pdf
- Accès libre
- Accéder au document
- https://hal.inria.fr/inria-00269978/document
- Accès libre
- Accéder au document
- http://www.lifl.fr/~jourdan/publi/evocop08.pdf
- Accès libre
- Accéder au document
- document
- Accès libre
- Accéder au document
- liefooghe.evocop08.pdf
- Accès libre
- Accéder au document
- document
- Accès libre
- Accéder au document
- liefooghe.evocop08.pdf
- Accès libre
- Accéder au document
- evocop08.pdf
- Accès libre
- Accéder au document