A Benders decomposition based framework for solving cable trench problems. (May 2017)

• Record Type: Journal Article
• Authors: Calik, Hatice; Leitner, Markus; Luipersbeck, Martin
• Is Part Of: Computers & operations research. Volume 81(2017)
• Page Start: 128
• Page End: 140
• Publication Date: 2017-05
• Subjects: Location -- Network design -- Benders decomposition -- Integer linear programming; Operations research -- Periodicals; Electronic digital computers -- Periodicals; 004.05
• DOI: 10.1016/j.cor.2016.12.015
• Languages: English
• ISSNs: 0305-0548

Abstract

Highlights: Algorithmic framework based on Benders decomposition applicable to different variants of the cable trench problem (CTP). Benders decomposition approach including stabilization and primal heuristics. Computational study addressing three variants of the CTP. Abstract: In this work, we present an algorithmic framework based on Benders decomposition for the Capacitated p -Cable Trench Problem with Covering. We show that our approach can be applied to most variants of the Cable Trench Problem (CTP) that have been considered in the literature. The proposed algorithm is augmented with a stabilization procedure to accelerate the convergence of the cut loop and with a primal heuristic to derive high-quality primal solutions. Three different variants of the CTP are considered in a computational study which compares the Benders approach with two compact integer linear programming formulations that are solved with CPLEX. The obtained results show that the proposed algorithm significantly outperforms the two compact models and that it can be used to tackle significantly larger instances than previously considered algorithms based on Lagrangean relaxation.