On Two New Formulations for the Fixed Charge Network Design Problem with Shortest Path Constraints

Abstract : We study the fixed charge network design problem with shortest path constraints which is modeled as a bi-level program. We first review three one-level formulations obtained by applying the complementarity slackness theorem, Bellman's optimality conditions and cycle elimination constraints. We propose two new binary integer programming (BILP) formulations inspired by path and cycle inequalities. The two formulations have exponential numbers of constraints. We incorporate the path and the cycle based formulations in a branch-and-cut algorithm and in another cutting-plane based method. Numerical experiments are performed on real instances, and random data sets generated with different criteria to examine the difficulty of the instances. The results show that the proposed cutting plane algorithms can solve up to 19% more instances than the classic branch-and-bound algorithms.
Complete list of metadatas

Cited literature [20 references]  Display  Hide  Download

https://hal.archives-ouvertes.fr/hal-02013557
Contributor : Ikram Bouras <>
Submitted on : Tuesday, June 18, 2019 - 3:20:38 PM
Last modification on : Monday, July 1, 2019 - 11:38:10 AM

File

second_revision__Copy_.pdf
Files produced by the author(s)

Identifiers

Citation

Ikram Bouras, Rosa Figueiredo, Michael Poss, Fen Zhou. On Two New Formulations for the Fixed Charge Network Design Problem with Shortest Path Constraints. Computers and Operations Research, Elsevier, 2019, 108, pp.226-237. ⟨10.1016/j.cor.2019.04.007⟩. ⟨hal-02013557v2⟩

Share

Metrics

Record views

33

Files downloads

31