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 - Methods, Algorithms for Operations REsearch
2 LIA - Laboratoire Informatique d'Avignon

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.

Mots clés: Network design; Bi-level programming; Cutting plane; Branch-and-Cut

Domaines: Optimisation et contrôle [math.OC]; Mathématique discrète [cs.DM]; Réseaux et télécommunications [cs.NI]; Recherche opérationnelle [math.OC]; Combinatoire [math.CO]

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