A Matheuristic with Fixed-Sequence Reoptimization for a Real-Life Inventory Routing Problem | Zendy

Yun He | Zendy; Christian Artigues | Zendy; Cyril Briand | Zendy; Nicolas Jozefowiez | Zendy; Sandra Ulrich Ngueveu | Zendy

AI Assistant Blog Pricing

Home ZAIA Blog

Open Access

A Matheuristic with Fixed-Sequence Reoptimization for a Real-Life Inventory Routing Problem

Author(s) -

Yun He,

Christian Artigues,

Cyril Briand,

Nicolas Jozefowiez,

Sandra Ulrich Ngueveu

Publication year - 2020

Publication title -

transportation science

Language(s) - English

Resource type - Journals

SCImago Journal Rank - 1.965

H-Index - 115

eISSN - 1526-5447

pISSN - 0041-1655

DOI - 10.1287/trsc.2019.0954

Subject(s) - sequence (biology) , column generation , mathematical optimization , heuristic , routing (electronic design automation) , computer science , process (computing) , vehicle routing problem , fixed cost , operations research , mathematics , computer network , economics , genetics , accounting , biology , operating system

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 r...

The content you want is available to Zendy users.

Already have an account? Click here to sign in.

Having issues? You can contact us here

Accelerating Research