Optimization Online


A Benders decomposition based framework for solving cable trench problems

Hatice Calik(hatice.calik***at***ulb.ac.be)
Markus Leitner(markus.leitner***at***univie.ac.at)
Martin Luipersbeck(martin.luipersbeck***at***univie.ac.at)

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.

Keywords: Location, Network Design, Benders Decomposition, Integer Linear Programming

Category 1: Network Optimization

Category 2: Integer Programming


Download: [PDF]

Entry Submitted: 08/05/2016
Entry Accepted: 08/05/2016
Entry Last Modified: 08/05/2016

Modify/Update this entry

  Visitors Authors More about us Links
  Subscribe, Unsubscribe
Digest Archive
Search, Browse the Repository


Coordinator's Board
Classification Scheme
Give us feedback
Optimization Journals, Sites, Societies
Mathematical Optimization Society