A heuristic branch-cut-and-price algorithm for the ROADEF/EURO challenge on Inventory Routing
Résumé
This paper is part of the special section devoted to the ROADEF/EURO challenge on Inventory Routing. We propose an extended formulation that we address with a heuristic branch-price-and-cut method. Among the difficulties, that we had to face, are: a fractional objective function, the simultaneous generation of constraints and columns, and a complex pricing problem. We evaluate our approach on the benchmark instances proposed for the challenge.
Domaines
Recherche opérationnelle [math.OC]| Origine | Fichiers produits par l'(les) auteur(s) |
|---|
Loading...