Skip to Main content Skip to Navigation

Résolution exacte de problèmes de couverture par arborescences sous contraintes de capacité

Abstract : In this document, we study two districting problems and propose several exact methods, based on Dantzig-Wolfe decomposition and column generation, to solve them. For each model, we compare exact approaches based either on compact formulations or on extended formulations obtained using Dantzig-Wolfe decomposition. The first type of model that we propose defines the objective function in a p-median problem fashion. Regarding the methods used to solve that kind of model, we emphasize accelerating the convergence of the column generation algorithm by designing constraint aggregation techniques in order to reduce the degeneracy in the simplex algorithm. Numerical experiments show that this constraint aggregation method indeed reduces the proportion of degenerated iterations. However, it is not enough to speed up the branch-and-price algorithm. Choosing to tackle the problem through either a compact formulation or an extended formulation depends on the structure of the instances to solve. The second type of model formulates the objective function in a way quite similar to that of p-centre problems. Using such an objective function induces complex column generation subproblems. We focus on designing branch-and-bound and dynamic programming algorithms in order to solve them efficiently. Experiments show that the branch-and-price approach surpasses any proposed method based on compact formulations of the problem.
Complete list of metadatas

Cited literature [71 references]  Display  Hide  Download
Contributor : Abes Star :  Contact
Submitted on : Friday, February 15, 2019 - 2:15:07 PM
Last modification on : Saturday, February 16, 2019 - 1:27:06 AM
Long-term archiving on: : Friday, May 17, 2019 - 3:19:21 PM


Version validated by the jury (STAR)


  • HAL Id : tel-02020787, version 1



Jérémy Guillot. Résolution exacte de problèmes de couverture par arborescences sous contraintes de capacité. Optimisation et contrôle [math.OC]. Université de Bordeaux, 2018. Français. ⟨NNT : 2018BORD0395⟩. ⟨tel-02020787⟩



Record views


Files downloads