A Benders decomposition based framework for solving cable trench problems - Archive ouverte HAL Access content directly
Journal Articles Computers and Operations Research Year : 2017

A Benders decomposition based framework for solving cable trench problems

(1) , (2) , (2)
1
2

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.
Fichier principal
Vignette du fichier
paper.pdf (420.15 Ko) Télécharger le fichier
Origin : Files produced by the author(s)
Loading...

Dates and versions

hal-01669247 , version 1 (21-12-2017)

Identifiers

Cite

Hatice Calik, Markus Leitner, Martin Luipersbeck. A Benders decomposition based framework for solving cable trench problems. Computers and Operations Research, 2017, 81, pp.128 - 140. ⟨10.1016/j.cor.2016.12.015⟩. ⟨hal-01669247⟩
155 View
179 Download

Altmetric

Share

Gmail Facebook Twitter LinkedIn More