Skip to main content

A Matheuristic Approach for the p-Cable Trench Problem

  • Conference paper
  • First Online:
Learning and Intelligent Optimization (LION 2016)

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

Included in the following conference series:

Abstract

The p-Cable Trench Problem is a telecommunications network design problem, which jointly considers cable and trench installation costs and addresses the optimal location of p facilities. In this work, a matheuristic approach based on the POPMUSIC (Partial Optimization Metaheuristic under Special Intensification Conditions) framework is developed. The inspected neighborhoods for building sub-problems include lexicographic as well as nearest neighbor measures. Using benchmark data available from literature it is shown that existing results can be outperformed.

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

Access this chapter

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 EPUB and 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

References

  1. Marianov, V., Gutiérrez-Jarpa, G., Obreque, C., Cornejo, O.: Lagrangean relaxation heuristics for the \(p\)-cable-trench problem. Comput. Oper. Res. 39, 620–628 (2012)

    Article  MathSciNet  MATH  Google Scholar 

  2. Nielsen, R.H., Riaz, M.T., Pedersen, J.M., Madsen, O.B.: On the potential of using the cable trench problem in planning of ICT access networks. In: 50th International Symposium ELMAR, pp. 585–588 (2008)

    Google Scholar 

  3. Taillard, É.D., Voß, S.: Popmusic - partial optimization metaheuristic under special intensification conditions. In: Ribeiro, C.C., Hansen, P. (eds.) Essays and Surveys in Metaheuristics. Operations Research/Computer Science Interfaces Series, vol. 15, pp. 613–629. Springer, New York (2002)

    Chapter  Google Scholar 

  4. Vasko, F.J., Barbieri, R.S., Rieksts, B.Q., Reitmeyer, K.L., Stott Jr., K.L.: The cable trench problem: combining the shortest path and minimum spanning tree problems. Comput. Oper. Res. 29, 441–458 (2002)

    Article  MathSciNet  MATH  Google Scholar 

  5. Vasko, F.J., Landquist, E., Kresge, G., Tal, A., Jiang, Y., Papademetris, X.: A simple and efficient strategy for solving very large-scale generalized cable-trench problems. Networks 67(3), 199–208 (2015)

    Article  Google Scholar 

  6. Zyma, K., Girard, J.N., Landquist, E., Schaper, G., Vasko, F.J.: Formulating and solving a radio astronomy antenna connection problem as a generalized cable-trench problem: an empirical study. Int. Trans. Oper. Res. (2016). doi:10.1111/itor.12312

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Eduardo Lalla-Ruiz .

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2016 Springer International Publishing AG

About this paper

Cite this paper

Lalla-Ruiz, E., Schwarze, S., Voß, S. (2016). A Matheuristic Approach for the p-Cable Trench Problem. In: Festa, P., Sellmann, M., Vanschoren, J. (eds) Learning and Intelligent Optimization. LION 2016. Lecture Notes in Computer Science(), vol 10079. Springer, Cham. https://doi.org/10.1007/978-3-319-50349-3_19

Download citation

  • DOI: https://doi.org/10.1007/978-3-319-50349-3_19

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-319-50348-6

  • Online ISBN: 978-3-319-50349-3

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics