A matheuristic algorithm for the inventory routing problem
Year of publication: |
2020
|
---|---|
Authors: | Su, Zhouxing ; Lü, Zhipeng ; Wang, Zhuo ; Qi, Yanmin ; Benlic, Una |
Published in: |
Transportation science : a journal of the Institute for Operations Research and the Management Sciences. - Catonsville, MD : Transportation Science & Logistics Society of the Institute for Operations Research and the Management Sciences, ISSN 0041-1655, ZDB-ID 160958-0. - Vol. 54.2020, 2, p. 330-354
|
Subject: | ROADEF/EURO Challenge 2016 | inventory routing problem | matheuristic | local search | mixed integer programming | linear programming | Tourenplanung | Vehicle routing problem | Lagermanagement | Warehouse management | Ganzzahlige Optimierung | Integer programming | Bestandsmanagement | Inventory management | Mathematische Optimierung | Mathematical programming | Algorithmus | Algorithm |
-
A variable MIP neighborhood descent for the multi-attribute inventory routing problem
Coelho, Leandro C., (2020)
-
A shortest path-based algorithm for the inventory routing problem of waste vegetable oil collection
Montagné, Romain, (2019)
-
A branch-and-cut algorithm for the inventory routing problem with pickups and deliveries
Archetti, Claudia, (2020)
- More ...
-
A vertex weighting-based double-tabu search algorithm for the classical p-center problem
Zhang, Qingyun, (2023)
-
A two-phase intensification tabu search algorithm for the maximum min-sum dispersion problem
Wang, Yang, (2021)
-
Multi-neighborhood local search optimization for machine reassignment problem
Wang, Zhuo, (2016)
- More ...