Geodesic
An exact method for solving the bi-objective Minimum Diameter-Cost Spanning Tree Problem
de Sousa, Ernando Gomes1 ; Santos, Andréa Cynthia2  ; Aloise, Dario José1
1 Universidade do Estado do Rio Grande do Norte, UERN Rua Almino Afonso, 478, CEP 59.610-210, Mossoró, RN, Brasil.
2 ICD-LOSI, Université de Technologie de Troyes 12, rue Marie Curie, CS 42060, 10004 Troyes Cedex, France.
RAIRO - Operations Research - Recherche Opérationnelle, Special ROADEF 2013, Tome 49 (2015) no. 1, pp. 143-160 Cet article a éte moissonné depuis la source Numdam

Voir la notice de l'article

In this work, we propose a procedure to compute Pareto-optimal fronts for the bi-objective Minimum Diameter-Cost Spanning Tree problem (bi-MDCST). The bi-MDCST aims at finding spanning trees with minimum total cost and minimum diameter. Strategic decision problems for high-speed trains infrastructure, as well as tactical and operational optimization problems for network design and transportation can be modeled as bi-MDCST. The proposed exact procedure makes use of components from the multi-objective exact method Parallel Partitioning Method, and Pareto-optimal fronts have been computed for two benchmark instances from the literature. To the best of our knowledge, there are no works dedicated to providing Pareto-optimal fronts for the bi-MDCST.

Reçu le :
Accepté le :
DOI : 10.1051/ro/2014029
Classification : 90-08, 90C27, 90C29, 68W99
Keywords: Spanning trees, multi-objective optimization, Parallel Partitioning Method

de Sousa, Ernando Gomes 1 ; Santos, Andréa Cynthia 2 ; Aloise, Dario José 1

1 Universidade do Estado do Rio Grande do Norte, UERN Rua Almino Afonso, 478, CEP 59.610-210, Mossoró, RN, Brasil.
2 ICD-LOSI, Université de Technologie de Troyes 12, rue Marie Curie, CS 42060, 10004 Troyes Cedex, France. 
@article{RO_2015__49_1_143_0,
     author = {de Sousa, Ernando Gomes and Santos, Andr\'ea Cynthia and Aloise, Dario Jos\'e},
     title = {An exact method for solving the bi-objective {Minimum} {Diameter-Cost} {Spanning} {Tree} {Problem}},
     journal = {RAIRO - Operations Research - Recherche Op\'erationnelle},
     pages = {143--160},
     year = {2015},
     publisher = {EDP-Sciences},
     volume = {49},
     number = {1},
     doi = {10.1051/ro/2014029},
     mrnumber = {3349121},
     zbl = {1310.90098},
     language = {en},
     url = {http://geodesic.mathdoc.fr/articles/10.1051/ro/2014029/}
}
TY  - JOUR
AU  - de Sousa, Ernando Gomes
AU  - Santos, Andréa Cynthia
AU  - Aloise, Dario José
TI  - An exact method for solving the bi-objective Minimum Diameter-Cost Spanning Tree Problem
JO  - RAIRO - Operations Research - Recherche Opérationnelle
PY  - 2015
SP  - 143
EP  - 160
VL  - 49
IS  - 1
PB  - EDP-Sciences
UR  - http://geodesic.mathdoc.fr/articles/10.1051/ro/2014029/
DO  - 10.1051/ro/2014029
LA  - en
ID  - RO_2015__49_1_143_0
ER  - 
%0 Journal Article
%A de Sousa, Ernando Gomes
%A Santos, Andréa Cynthia
%A Aloise, Dario José
%T An exact method for solving the bi-objective Minimum Diameter-Cost Spanning Tree Problem
%J RAIRO - Operations Research - Recherche Opérationnelle
%D 2015
%P 143-160
%V 49
%N 1
%I EDP-Sciences
%U http://geodesic.mathdoc.fr/articles/10.1051/ro/2014029/
%R 10.1051/ro/2014029
%G en
%F RO_2015__49_1_143_0
de Sousa, Ernando Gomes; Santos, Andréa Cynthia; Aloise, Dario José. An exact method for solving the bi-objective Minimum Diameter-Cost Spanning Tree Problem. RAIRO - Operations Research - Recherche Opérationnelle, Special ROADEF 2013, Tome 49 (2015) no. 1, pp. 143-160. doi: 10.1051/ro/2014029

Cité par Sources :