The Minimum Routing Cost Tree Problem
- 74 Downloads
The minimum routing cost tree problem arises when we need to find the tree minimizing the minimum travel/communication cost, i.e., the tree which presents the minimal difference with the same cost computed on the whole network. This paper provides the state of the art of the problem and proposes a new heuristic based on the identification of a core of the network around which the solution can be built. The algorithm has been tested on literature instances of up to one thousand nodes. The results, compared with those of other heuristic algorithms, prove the competitiveness of the proposed one both in terms of the quality of the solution and computation time.
KeywordsNetwork design Spanning tree Routing cost Shortest path
Compliance with ethical standards
Conflict of interest
Adriano Masone declares that he has no conflict of interest. Antonio Sforza declares that he has no conflict of interest. Maria Elena Nenni declares that she has no conflict of interest.
The research activity of the authors was partially funded by the Department of Electrical Engineering and Information Technology and by the University Federico II of Naples, within the OPT_APP for EPG project (Optimization Approaches for designing and protecting Electric Power Grid) and MOSTOLOG project (A multi-objective approach for Sustainable Logistic System, DIETI-ALTRI_DR408_2017_Ricerca di Ateneo).
This article does not contain any studies with human or animals performed by any of the authors.
- Chen Y H, Liao G L, Tang C Y (2007) Approximation algorithms for 2-source minimum routing cost k-tree problems. In: Computational science and its applications, ICCSA 2007. Springer, Berlin, pp 520–533Google Scholar
- Hieu NM, Quoc PT, Nghia ND (2011) An approach of ant algorithm for solving minimum routing cost spanning tree problem. In: Proceedings of the second symposium on information and communication technology, SoICT11. ACM, New York, pp 5–10Google Scholar
- Julstrom BA (2001) The blob code: a better string coding of spanning trees for evolutionary search. In: Wu AS (ed) 2001 Genetic and evolutionary computation conference workshop program, San Francisco, CA, pp 256–261Google Scholar
- Julstrom BA (2005) The Blob code is competitive with edgesets in genetic algorithms for the minimum routing cost spanning tree problem. In: Beyer H-G et al (eds) Proceedings of the genetic and evolutionary computation conference 2005, vol 1. ACM Press, New York, pp 585–590Google Scholar
- Merz P, Wolf S (2006) Evolutionary local search for designing peer-to-peer overlay topologies based on minimum routing cost spanning trees, parallel problem solving from nature-PPSN IX. Springer, Berlin, pp 272–281Google Scholar
- Sattari S, Didehvar F (2015) A metaheuristic algorithm for the minimum routing cost spanning tree problem. Iran J Oper Res 6(1):65–78Google Scholar
- Singh A (2008) A new heuristic for the minimum routing cost spanning tree problem. In: Proceedings of 11th international conference on information technology. IEEE Computer Society, pp. 9–13Google Scholar
- Singh A, Sundar S (2011) An artificial bee colony algorithm for the minimum routing cost spanning tree problem. Soft Comput Fus Found Methodol Appl 15(12):2489–2499Google Scholar
- Tan QP, Due NN (2013) An experimental study of minimum routing cost spanning tree algorithms. In: International conference of soft computing and pattern recognition (SoCPaR). IEEE Computer Society, pp 158–165Google Scholar