iBet uBet web content aggregator. Adding the entire web to your favor.
iBet uBet web content aggregator. Adding the entire web to your favor.



Link to original content: https://doi.org/10.1007/978-3-319-07644-7_5
A Partition-Based Heuristic for the Steiner Tree Problem in Large Graphs | SpringerLink
Skip to main content

A Partition-Based Heuristic for the Steiner Tree Problem in Large Graphs

  • Conference paper
Hybrid Metaheuristics (HM 2014)

Part of the book series: Lecture Notes in Computer Science ((LNTCS,volume 8457))

Included in the following conference series:

Abstract

This paper deals with a new heuristic for the Steiner tree problem (STP) in graphs which aims for the efficient construction of approximate solutions in very large graphs. The algorithm is based on a partitioning approach in which instances are divided into several subinstances that are small enough to be solved to optimality. A heuristic solution of the complete instance can then be constructed through the combination of the subinstances’ solutions. To this end, a new STP-specific partitioning scheme based on the concept of Voronoi diagrams is introduced. This partitioning scheme is then combined with state-of-the-art exact and heuristic methods for the STP. The implemented algorithms are also embedded into a memetic algorithm, which incorporates reduction tests, an algorithm for solution recombination and a variable neighborhood descent that uses best-performing neighborhood structures from the literature. All implemented algorithms are evaluated using previously existing benchmark instances and by using a set of new very large-scale real-world instances. The results show that our approach yields good quality solutions within relatively short time.

This work is supported by the Austrian Science Fund (FWF) under grants I892-N23 and P26755-N26.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Subscribe and save

Springer+ Basic
$34.99 /Month
  • Get 10 units per month
  • Download Article/Chapter or eBook
  • 1 Unit = 1 Article or 1 Chapter
  • Cancel anytime
Subscribe now

Buy Now

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Similar content being viewed by others

References

  1. Koch, T., Martin, A.: Solving Steiner tree problems in graphs to optimality. Networks 32(3), 207–232 (1998)

    Article  MATH  MathSciNet  Google Scholar 

  2. de Aragão, M.P., Uchoa, E., Werneck, R.F.F.: Dual heuristics on the exact solution of large Steiner problems. Electronic Notes in Discrete Mathematics 7, 150–153 (2001)

    Article  Google Scholar 

  3. Goemans, M.X., Myung, Y.S.: A catalog of Steiner tree formulations. Networks 23(1), 19–28 (1993)

    Article  MATH  MathSciNet  Google Scholar 

  4. Polzin, T.: Algorithms for the Steiner Problem in Networks. PhD thesis, Saarland University, Saarbrcken (2003)

    Google Scholar 

  5. Wong, R.T.: A dual ascent approach for Steiner tree problems on a directed graph. Mathematical Programming 28(3), 271–287 (1984)

    Article  MATH  MathSciNet  Google Scholar 

  6. Daneshmand, S.V.: Algorithmic Approaches to the Steiner Problem in Networks. PhD thesis, University of Mannheim, Mannheim (2003)

    Google Scholar 

  7. Duin, C.W., Volgenant, A.: Reduction tests for the Steiner problem in graphs. Networks 19(5), 549–567 (1989)

    Article  MATH  MathSciNet  Google Scholar 

  8. Ribeiro, C.C., De Souza, M.C.: Tabu search for the Steiner problem in graphs. Networks 36(2), 138–146 (2000)

    Article  MATH  MathSciNet  Google Scholar 

  9. Ribeiro, C.C., Uchoa, E., Werneck, R.F.F.: A hybrid GRASP with perturbations for the Steiner problem in graphs. INFORMS Journal on Computing 14(3), 228–246 (2002)

    Article  MATH  MathSciNet  Google Scholar 

  10. Uchoa, E., Werneck, R.F.F.: Fast local search for Steiner trees in graphs. In: Blelloch, G.E., Halperin, D. (eds.) ALENEX, pp. 1–10. SIAM (2010)

    Google Scholar 

  11. Luipersbeck, M.: A new partition-based heuristic for the Steiner tree problem in large graphs. Master’s thesis, Faculty of Informatics, Vienna University of Technology (December 2013)

    Google Scholar 

  12. Guschinskaya, O., Dolgui, A., Guschinsky, N., Levin, G.: A heuristic multi-start decomposition approach for optimal design of serial machining lines. European Journal of Operational Research 189(3), 902–913 (2008)

    Article  MATH  Google Scholar 

  13. Taillard, É.D., Voß, S.: POPMUSIC–Partial optimization metaheuristic under special intensification conditions. In: Essays and Surveys in Metaheuristics, pp. 613–629. Springer (2002)

    Google Scholar 

  14. Karypis, G., Kumar, V.: A fast and high quality multilevel scheme for partitioning irregular graphs. SIAM Journal on Scientific Computing 20(1), 359–392 (1998)

    Article  MathSciNet  Google Scholar 

  15. Cherkassky, B.V., Goldberg, A.V.: On implementing the push-relabel method for the maximum flow problem. Algorithmica 19(4), 390–410 (1997)

    Article  MATH  MathSciNet  Google Scholar 

  16. Takahashi, H., Matsuyama, A.: An approximate solution for the Steiner problem in graphs. Math. Japonica 24(6), 573–577 (1980)

    MATH  MathSciNet  Google Scholar 

  17. Poggi de Aragão, M., Werneck, R.F.F.: On the implementation of MST-based heuristics for the Steiner problem in graphs. In: Mount, D.M., Stein, C. (eds.) ALENEX 2002. LNCS, vol. 2409, pp. 1–15. Springer, Heidelberg (2002)

    Chapter  Google Scholar 

  18. Werneck, R.F.F.: Bossa (2003), http://www.cs.princeton.edu/~rwerneck/bossa/ (visited on January 20, 2014)

  19. Koch, T., Martin, A., Voß, S.: SteinLib: An updated library on Steiner tree problems in graphs. Technical Report 00-37, ZIB, Takustr.7, 14195, Berlin (2000)

    Google Scholar 

  20. Leitner, M., Ljubić, I., Luipersbeck, M., Prossegger, M., Resch, M.: New real-world instances for the Steiner tree problem in graphs. Technical report, ISOR, University of Vienna (2014)

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2014 Springer International Publishing Switzerland

About this paper

Cite this paper

Leitner, M., Ljubić, I., Luipersbeck, M., Resch, M. (2014). A Partition-Based Heuristic for the Steiner Tree Problem in Large Graphs. In: Blesa, M.J., Blum, C., Voß, S. (eds) Hybrid Metaheuristics. HM 2014. Lecture Notes in Computer Science, vol 8457. Springer, Cham. https://doi.org/10.1007/978-3-319-07644-7_5

Download citation

  • DOI: https://doi.org/10.1007/978-3-319-07644-7_5

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-319-07643-0

  • Online ISBN: 978-3-319-07644-7

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics