A variable MIP neighborhood descent for the multi-attribute inventory routing problem
Year of publication: |
2020
|
---|---|
Authors: | Coelho, Leandro C. ; De Maio, Annarita ; Laganà, Demetrio |
Published in: |
Transportation research / E : an international journal. - Amsterdam : Elsevier, ISSN 1366-5545, ZDB-ID 1380969-6. - Vol. 144.2020, p. 1-23
|
Subject: | Exact algorithm | Inventory routing problem | Mixed-integer programming | Variable neighborhood search | Tourenplanung | Vehicle routing problem | Algorithmus | Algorithm | Lagermanagement | Warehouse management | Ganzzahlige Optimierung | Integer programming | Bestandsmanagement | Inventory management | Nachbarschaft | Neighbourhood | Lieferkette | Supply chain |
-
A shortest path-based algorithm for the inventory routing problem of waste vegetable oil collection
Montagné, Romain, (2019)
-
A matheuristic algorithm for the inventory routing problem
Su, Zhouxing, (2020)
-
Cyclic delivery schedules for an inventory routing problem
Ekici, Ali, (2015)
- More ...
-
A matheuristic algorithm for the multi-depot inventory routing problem
Bertazzi, Luca, (2019)
-
Arc routing under uncertainty : introduction and literature review
De Maio, Annarita, (2021)
-
Online algorithms for the multi-vehicle inventory-routing problem with real-time demands
Bertazzi, Luca, (2023)
- More ...