Soft Computing

, Volume 23, Issue 9, pp 2947–2957 | Cite as

The Minimum Routing Cost Tree Problem

State of the art and a core-node based heuristic algorithm
  • Adriano MasoneEmail author
  • Maria Elena Nenni
  • Antonio Sforza
  • Claudio Sterle


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.


Network 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).

Ethical approval

This article does not contain any studies with human or animals performed by any of the authors.


  1. Beasley JE (1990) OR-library: distributing test problems by electronic mail. J Oper Res Soc 41:1069–1072CrossRefGoogle Scholar
  2. Campos R, Ricardo M (2008) A fast algorithm for computing minimum routing cost spanning trees. Comput Netw 52:3229–3247CrossRefzbMATHGoogle Scholar
  3. 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
  4. Dijkstra EW (1959) A note on two problems in connexion with graphs. Numer Math 1:269–271MathSciNetCrossRefzbMATHGoogle Scholar
  5. Fernndez E, Luna-Mota C, Hildenbrandt A, Reinelt G, Wiesberg S (2013) A flow formulation for the optimum communication spanning tree. Electron Notes Discrete Math 41:85–92CrossRefGoogle Scholar
  6. Fischetti M, Lancia G, Serafini P (2002) Exact algorithms for minimum routing cost trees, networks. Wiley, London, pp 161–173zbMATHGoogle Scholar
  7. 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
  8. Hu TC (1974) Optimum communication spanning trees. J Comput SIAM 3:188–195MathSciNetCrossRefzbMATHGoogle Scholar
  9. Johnson DS, Lenstra JK, Rinnooy Kan AHG (1978) The complexity of the network design problem. Networks 8:279–285MathSciNetCrossRefzbMATHGoogle Scholar
  10. 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
  11. 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
  12. Kim T, Seob SC, Kim D (2015) Distributed formation of degree constrained minimum routing cost tree in wireless ad-hoc networks. J Parallel Distrib Comput 83:143–158CrossRefGoogle Scholar
  13. Lin CW, Wu BY (2017) On the minimum routing cost clustered tree problem. J Comb Optim 33(6):1106–1121MathSciNetCrossRefzbMATHGoogle Scholar
  14. 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
  15. Prim RC (1957) Shortest connection networks and some generalizations. Bell Syst Tech J 36:1389–1401CrossRefGoogle Scholar
  16. Raidl GR, Julstrom BA (2003) Edge sets: an effective evolutionary coding of spanning trees. IEEE Trans Evol Comput 7:225–239CrossRefGoogle Scholar
  17. 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
  18. Sattari S, Didehvar F (2013) Variable neighborhood search approach for the minimum routing cost spanning tree problem. Int J Oper Res 10(4):153–160MathSciNetGoogle Scholar
  19. 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
  20. 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
  21. Tan QP (2012a) A Heuristic approach for solving the minimum routing cost spanning tree problem. Int J Mach Learn Comput, IACSIT 2:406–409CrossRefGoogle Scholar
  22. Tan QP (2012b) A genetic approach for solving minimum routing cost spanning tree problem. Int J Mach Learn Comput 2(4):410–414CrossRefGoogle Scholar
  23. 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
  24. Wolf S, Merz P (2010) Efficient cycle search for the minimum routing cost spanning tree problem. Lect Notes Comput Sci 6022:276–287MathSciNetCrossRefGoogle Scholar
  25. Wong R (1980) Worst-case analysis of network design problem heuristics, SIAM. J Algebr Discr Methods 1:51–63CrossRefzbMATHGoogle Scholar
  26. Wu BY, Lancia G, Bafna V, Chao KM, Ravi R, Tang CY (1999) A polynomial-time approximation scheme for minimum routing cost spanning trees. SIAM J Comp 29:761–778MathSciNetCrossRefzbMATHGoogle Scholar
  27. Wu BY, Chao KM, Tang CY (2000) Approximation algorithms for some optimum communication spanning tree problems. Discrete Appl Math 102(3):245–266MathSciNetCrossRefzbMATHGoogle Scholar
  28. Wu BY (2002) A polynomial time approximation scheme for the two-source minimum routing cost spanning trees. J Algorithms 44(2):359–378MathSciNetCrossRefzbMATHGoogle Scholar

Copyright information

© Springer-Verlag GmbH Germany, part of Springer Nature 2018

Authors and Affiliations

  1. 1.Department of Electrical Engineering and Information TechnologyUniversity “Federico II” of NaplesNaplesItaly
  2. 2.Department of Industrial EngineeringUniversity “Federico II” of NaplesNaplesItaly
  3. 3.Istituto di Analisi dei Sistemi ed Informatica “A. Ruberti”CNRRomeItaly

Personalised recommendations