A matheuristic approach for the p-Cable trench problem

Eduardo Lalla-Ruiz*, Silvia Schwarze, Stefan Voß

*Corresponding author for this work

    Research output: Chapter in Book/Report/Conference proceedingConference contributionAcademicpeer-review

    3 Citations (Scopus)


    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.

    Original languageEnglish
    Title of host publicationLearning and Intelligent Optimization
    Subtitle of host publication10th International Conference, LION 10, Ischia, Italy, May 29 - June 1, 2016, Revised Selected Papers
    EditorsPaola Festa, Meinolf Sellmann, Joaquin Vanschoren
    Number of pages6
    ISBN (Electronic)978-3-319-50349-3
    ISBN (Print)978-3-319-50348-6
    Publication statusPublished - 1 Jan 2016
    Event10th International Conference on Learning and Intelligent Optimization, LION 2016 - Ischia, Italy
    Duration: 29 May 20161 Jun 2016
    Conference number: 10

    Publication series

    NameLecture Notes in Computer Science
    ISSN (Print)0302-9743
    ISSN (Electronic)1611-3349
    NameLecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics


    Conference10th International Conference on Learning and Intelligent Optimization, LION 2016
    Abbreviated titleLION

    Fingerprint Dive into the research topics of 'A matheuristic approach for the p-Cable trench problem'. Together they form a unique fingerprint.

    Cite this