Exact Algorithms for Fixed Charge Network Design Problem with User-Optimal Flows

Ikram Bouras 1 Rosa Figueiredo 2 Michael Poss 1 Fen Zhoo 2
1 MAORE - Méthodes Algorithmes pour l'Ordonnancement et les Réseaux
LIRMM - Laboratoire d'Informatique de Robotique et de Microélectronique de Montpellier
Abstract : We study the fixed charge network design problem with user-optimal flows, which is modeled as a bi-level programming problem. We propose a new Binary Integer Programming (BIP) formulation. This formulation is used to solve the problem by cutting plane and branch-and-cut algorithms. Numerical experiments are performed on realistic instances as well as on random data sets generated with different criteria to examine the difficulty of the instances. The results also show the efficiency of our proposed approaches.
Complete list of metadatas

Cited literature [3 references]  Display  Hide  Download

https://hal.archives-ouvertes.fr/hal-02188525
Contributor : Ikram Bouras <>
Submitted on : Thursday, July 18, 2019 - 3:36:34 PM
Last modification on : Thursday, July 25, 2019 - 2:53:30 PM

File

FCNDP-UOF.pdf
Files produced by the author(s)

Identifiers

  • HAL Id : hal-02188525, version 1

Citation

Ikram Bouras, Rosa Figueiredo, Michael Poss, Fen Zhoo. Exact Algorithms for Fixed Charge Network Design Problem with User-Optimal Flows. IWOBIP: International Workshop on Bilevel Programming, Jun 2018, Lille, France. ⟨hal-02188525⟩

Share

Metrics

Record views

18

Files downloads

7