Advertisement

A Matheuristic Approach for the p-Cable Trench Problem

  • Eduardo Lalla-RuizEmail author
  • Silvia Schwarze
  • Stefan Voß
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 10079)

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.

Keywords

Lagrangean Relaxation Network Design Problem Short Path Tree Matheuristic Approach Mathematical Programming Formulation 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

References

  1. 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)MathSciNetCrossRefzbMATHGoogle Scholar
  2. 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. 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)CrossRefGoogle Scholar
  4. 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)MathSciNetCrossRefzbMATHGoogle Scholar
  5. 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)CrossRefGoogle Scholar
  6. 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

Copyright information

© Springer International Publishing AG 2016

Authors and Affiliations

  • Eduardo Lalla-Ruiz
    • 1
    Email author
  • Silvia Schwarze
    • 1
  • Stefan Voß
    • 1
  1. 1.Institute of Information SystemsUniversity of HamburgHamburgGermany

Personalised recommendations