Inventory Routing Problem over the long term: a math-heuristic approach - Archive ouverte HAL Access content directly
Conference Papers Year :

Inventory Routing Problem over the long term: a math-heuristic approach

(1) , (2) , (1) , (2) , (2)
1
2

Abstract

The problem we present is the object of the ROADEF Challenge 2016. It consists in an Inventory Routing Problem over a long time horizon with additional features: the objective function to minimize is fractional (cost per unit delivered); there is no prior assignment of drivers to trailers; the time is accurately modelled: non-constant hourly consumption of each customer is provided while minute-precise delivery planning needs to be determined; vehicles can perform multiple trips during the working day. The problem calls for the determination of a delivery planning that respects operational constraints and avoids customer stockouts.
Not file

Dates and versions

hal-01335601 , version 1 (22-06-2016)

Identifiers

  • HAL Id : hal-01335601 , version 1

Cite

Nabil Absi, Diego Cattaruzza, Dominique Feillet, Maxime Ogier, Frédéric Semet. Inventory Routing Problem over the long term: a math-heuristic approach. Verolog 2016, Jun 2016, Nantes, France. ⟨hal-01335601⟩
221 View
1 Download

Share

Gmail Facebook Twitter LinkedIn More