Volume 49, Number 1, January-March 2015
Special ROADEF 2013. Guest editors: Andréa Cynthia Santos, Christian Prins, Alice Yalaoui
|Page(s)||143 - 160|
|Published online||17 December 2014|
An exact method for solving the bi-objective Minimum Diameter-Cost Spanning Tree Problem
1 Universidade do Estado do Rio Grande
do Norte, UERN Rua Almino Afonso,
59.610-210, Mossoró, RN,
2 ICD-LOSI, Université de Technologie de Troyes 12, rue Marie Curie, CS 42060, 10004 Troyes Cedex, France.
Accepted: 5 May 2014
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.
Mathematics Subject Classification: 90-08 / 90C27 / 90C29 / 68W99
Key words: Spanning trees / multi-objective optimization / Parallel Partitioning Method
© EDP Sciences, ROADEF, SMAI 2014
Current usage metrics show cumulative count of Article Views (full-text article views including HTML views, PDF and ePub downloads, according to the available data) and Abstracts Views on Vision4Press platform.
Data correspond to usage on the plateform after 2015. The current usage metrics is available 48-96 hours after online publication and is updated daily on week days.
Initial download of the metrics may take a while.