An efficient heuristic approach for a multi-period logistics network redesign problem
Year of publication: |
2014
|
---|---|
Authors: | Melo, M. T. ; Nickel, Stefan ; Saldanha-da-Gama, Francisco |
Published in: |
Top : transactions in operations research. - [Berlin] : Springer, ISSN 1134-5764, ZDB-ID 1205918-3. - Vol. 22.2014, 1, p. 80-108
|
Subject: | Logistics network redesign | Heuristic | Linear programming | Rounding | Local search | Mathematische Optimierung | Mathematical programming | Heuristik | Heuristics | Logistik | Logistics | Theorie | Theory | Unternehmensnetzwerk | Business network | Tourenplanung | Vehicle routing problem |
-
Bonassa, Antonio Carlos, (2023)
-
An integrated approach to tactical transportation planning in logistics networks
Harks, Tobias, (2016)
-
An effective iterated two-stage heuristic algorithm for the multiple Traveling Salesmen Problem
Zheng, Jiongzhi, (2022)
- More ...
-
Mathematical programming models for strategic supply chain planning and design
Kalcsics, J., (2003)
-
Melo, M. T., (2004)
-
A tabu search heuristic for redesigning a multi-echelon supply chain network over a planning horizon
Melo, M. T., (2012)
- More ...