 |
LAAS-ROC: Operations research, Combinatorial optimization and Constraints Researchteam |  |
Journal articles
A Matheuristic with Fixed-Sequence Reoptimization for a Real-Life Inventory Routing Problem
Abstract : This paper proposes a matheuristic for solving a real-life Inventory Routing Problem introduced in the ROADEF/EURO Challenge 2016. The method integrates a fixed-sequence mathematical program, two ran-domized greedy algorithms, and a column-generation based heuristic. In particular, the paper discusses the performance of the fixed-sequence mathematical program, which considers a fixed sequence of customer visits and aims at (re)optimizing partial solutions by modifying arrival times and delivered or loaded quantities. Experiments show that the proposed algorithm for the fixed-sequence sub-problem is efficient as a post-optimization process and is even able to improve the best solutions obtained during the Challenge.
Cited literature [26 references]
https://hal.archives-ouvertes.fr/hal-02944238
Contributor : Christian Artigues <>
Submitted on : Monday, September 21, 2020 - 12:30:28 PM
Last modification on : Wednesday, January 20, 2021 - 3:38:27 AM
Long-term archiving on: : Thursday, December 3, 2020 - 2:54:52 PM
Contributor : Christian Artigues <>
Submitted on : Monday, September 21, 2020 - 12:30:28 PM
Last modification on : Wednesday, January 20, 2021 - 3:38:27 AM
Long-term archiving on: : Thursday, December 3, 2020 - 2:54:52 PM
File
TS_challenge_revised_version_F...
Files produced by the author(s)