Title :

A heuristic branch-cut-and-price algorithm for the ROADEF/EURO challenge on Inventory Routing

Author(s) :

Absi, Nabil [Auteur]
Département Sciences de la Fabrication et Logistique [SFL-ENSMSE]
Laboratoire d'Informatique, de Modélisation et d'Optimisation des Systèmes [LIMOS]
Cattaruzza, Diego [Auteur]
Integrated Optimization with Complex Structure [INOCS]
Feillet, Dominique [Auteur]
École des Mines de Saint-Étienne [Mines Saint-Étienne MSE]
Laboratoire d'Informatique, de Modélisation et d'Optimisation des Systèmes [LIMOS]
Ogier, Maxime [Auteur]
Integrated Optimization with Complex Structure [INOCS]
Semet, Frédéric [Auteur]
Integrated Optimization with Complex Structure [INOCS]

Journal title :

Transportation Science

Pages :

299-564

Publisher :

INFORMS

Publication date :

2020

ISSN :

0041-1655

HAL domain(s) :

Computer Science [cs]/Operations Research [math.OC]

English abstract : [en]

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, ...
Show more >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.Show less >

Language :

Anglais

Peer reviewed article :

Oui

Audience :

Internationale

Popular science :

Non

Collections :

• Centre de Recherche en Informatique, Signal et Automatique de Lille (CRIStAL) - UMR 9189

Source :

Harvested from HAL