Combinatorial heuristics for inventory routing problems
Year of publication: |
2022
|
---|---|
Authors: | Tang, Ziye ; Jiao, Yang ; Ravi, Ramamoorthi |
Published in: |
INFORMS journal on computing : JOC ; charting new directions in operations research and computer science ; a journal of the Institute for Operations Research and the Management Sciences. - Linthicum, Md. : INFORMS, ISSN 1526-5528, ZDB-ID 2004082-9. - Vol. 34.2022, 1, p. 370-384
|
Subject: | heuristics | inventory routing problem | large neighborhood search | prize-collecting Steiner tree | Heuristik | Heuristics | Tourenplanung | Vehicle routing problem | Lagermanagement | Warehouse management | Bestandsmanagement | Inventory management | Lieferkette | Supply chain |
-
Cyclic delivery schedules for an inventory routing problem
Ekici, Ali, (2015)
-
A heuristic branch-cut-and-price algorithm for the ROADEF/EURO challenge on inventory routing
Absi, Nabil, (2020)
-
Rabbani, Masoud, (2013)
- More ...
-
Approximation algorithm for the 2-stage stochastic matroid base problem
Fukunaga, Takuro, (2022)
-
Dual bounds from decision diagram-based route relaxations : an application to truck-drone routing
Tang, Ziye, (2024)
-
Approximating max-min weighted T-joins
Iwata, Satoru, (2013)
- More ...