A Matheuristic Approach for the p-Cable Trench Problem
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.
KeywordsLagrangean Relaxation Network Design Problem Short Path Tree Matheuristic Approach Mathematical Programming Formulation
- 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)CrossRefGoogle Scholar