A matheuristic approach for the p-Cable trench problem

Eduardo Lalla-Ruiz; Silvia Schwarze; Stefan Voß

doi:10.1007/978-3-319-50349-3_19

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 proceeding › Conference contribution › Academic › peer-review

4 Citations (Scopus)

5 Downloads (Pure)

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.

Original language	English
Title of host publication	Learning and Intelligent Optimization
Subtitle of host publication	10th International Conference, LION 10, Ischia, Italy, May 29 - June 1, 2016, Revised Selected Papers
Editors	Paola Festa, Meinolf Sellmann, Joaquin Vanschoren
Publisher	Springer
Pages	247-252
Number of pages	6
ISBN (Electronic)	978-3-319-50349-3
ISBN (Print)	978-3-319-50348-6
DOIs	https://doi.org/10.1007/978-3-319-50349-3_19
Publication status	Published - 1 Jan 2016
Externally published	Yes
Event	10th International Conference on Learning and Intelligent Optimization, LION 2016 - Ischia, Italy Duration: 29 May 2016 → 1 Jun 2016 Conference number: 10

Publication series

Name	Lecture Notes in Computer Science
Publisher	Springer
Volume	10079
ISSN (Print)	0302-9743
ISSN (Electronic)	1611-3349

Name	Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics
Publisher	Springer

Conference

Conference	10th International Conference on Learning and Intelligent Optimization, LION 2016
Abbreviated title	LION
Country/Territory	Italy
City	Ischia
Period	29/05/16 → 1/06/16

Keywords

n/a OA procedure

Access to Document

10.1007/978-3-319-50349-3_19

Cite this

Lalla-Ruiz, E., Schwarze, S., & Voß, S. (2016). A matheuristic approach for the p-Cable trench problem. In P. Festa, M. Sellmann, & J. Vanschoren (Eds.), Learning and Intelligent Optimization: 10th International Conference, LION 10, Ischia, Italy, May 29 - June 1, 2016, Revised Selected Papers (pp. 247-252). (Lecture Notes in Computer Science; Vol. 10079), (Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). Springer. https://doi.org/10.1007/978-3-319-50349-3_19

Lalla-Ruiz, Eduardo ; Schwarze, Silvia ; Voß, Stefan. / A matheuristic approach for the p-Cable trench problem. Learning and Intelligent Optimization: 10th International Conference, LION 10, Ischia, Italy, May 29 - June 1, 2016, Revised Selected Papers. editor / Paola Festa ; Meinolf Sellmann ; Joaquin Vanschoren. Springer, 2016. pp. 247-252 (Lecture Notes in Computer Science). (Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics).

@inproceedings{fca71d7981fd41f58dd8e7a5d69b1677,

title = "A matheuristic approach for the p-Cable trench problem",

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 = "n/a OA procedure",

author = "Eduardo Lalla-Ruiz and Silvia Schwarze and Stefan Vo{\ss}",

year = "2016",

month = jan,

day = "1",

doi = "10.1007/978-3-319-50349-3_19",

language = "English",

isbn = "978-3-319-50348-6",

series = "Lecture Notes in Computer Science",

publisher = "Springer",

pages = "247--252",

editor = "Paola Festa and Meinolf Sellmann and Joaquin Vanschoren",

booktitle = "Learning and Intelligent Optimization",

address = "Germany",

note = "10th International Conference on Learning and Intelligent Optimization, LION 2016, LION ; Conference date: 29-05-2016 Through 01-06-2016",

}

Lalla-Ruiz, E, Schwarze, S & Voß, S 2016, A matheuristic approach for the p-Cable trench problem. in P Festa, M Sellmann & J Vanschoren (eds), Learning and Intelligent Optimization: 10th International Conference, LION 10, Ischia, Italy, May 29 - June 1, 2016, Revised Selected Papers. Lecture Notes in Computer Science, vol. 10079, Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics, Springer, pp. 247-252, 10th International Conference on Learning and Intelligent Optimization, LION 2016, Ischia, Italy, 29/05/16. https://doi.org/10.1007/978-3-319-50349-3_19

A matheuristic approach for the p-Cable trench problem. / Lalla-Ruiz, Eduardo; Schwarze, Silvia; Voß, Stefan.
Learning and Intelligent Optimization: 10th International Conference, LION 10, Ischia, Italy, May 29 - June 1, 2016, Revised Selected Papers. ed. / Paola Festa; Meinolf Sellmann; Joaquin Vanschoren. Springer, 2016. p. 247-252 (Lecture Notes in Computer Science; Vol. 10079), (Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics).

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › Academic › peer-review

TY - GEN

T1 - A matheuristic approach for the p-Cable trench problem

AU - Lalla-Ruiz, Eduardo

AU - Schwarze, Silvia

AU - Voß, Stefan

N1 - Conference code: 10

PY - 2016/1/1

Y1 - 2016/1/1

N2 - 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.

AB - 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.

KW - n/a OA procedure

UR - http://www.scopus.com/inward/record.url?scp=85006892936&partnerID=8YFLogxK

U2 - 10.1007/978-3-319-50349-3_19

DO - 10.1007/978-3-319-50349-3_19

M3 - Conference contribution

AN - SCOPUS:85006892936

SN - 978-3-319-50348-6

T3 - Lecture Notes in Computer Science

SP - 247

EP - 252

BT - Learning and Intelligent Optimization

A2 - Festa, Paola

A2 - Sellmann, Meinolf

A2 - Vanschoren, Joaquin

PB - Springer

T2 - 10th International Conference on Learning and Intelligent Optimization, LION 2016

Y2 - 29 May 2016 through 1 June 2016

ER -

Lalla-Ruiz E, Schwarze S, Voß S. A matheuristic approach for the p-Cable trench problem. In Festa P, Sellmann M, Vanschoren J, editors, Learning and Intelligent Optimization: 10th International Conference, LION 10, Ischia, Italy, May 29 - June 1, 2016, Revised Selected Papers. Springer. 2016. p. 247-252. (Lecture Notes in Computer Science). (Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). doi: 10.1007/978-3-319-50349-3_19

A matheuristic approach for the p-Cable trench problem

Abstract

Publication series

Conference

Keywords

Access to Document

Other files and links

Fingerprint

Cite this