Optimizing Complex Logistics Systems with Approximative Consideration of Short-Term Costs
This paper provides an approach which optimizes complex logistics networks strategically, considering the total operational and tactical costs. Real-world-sized instances of models which consider the costs of all time-horizons exactly are very complex and very difficult to solve. Beside this it does not make much sense to completely plan operational details (that will never be executed later on). So, we formulate a model which uses an appropriate approximation of short-term costs. This makes the model and the solution process much easier. But the model turns out to be very complex, nevertheless. So we introduce a heuristic to solve it and to gain a satisfactory solution.
KeywordsLocal Search Tabu Search Facility Location Knapsack Problem Facility Location Problem
Unable to display preview. Download preview PDF.
- Campbell, J.F.: Designing logistics systems by analyzing transportation, inventory and terminal cost trade-offs. Journal of Business Logistics 11, 159–179 (1990)Google Scholar
- Voß, S.: Observing logical interdependencies in tabu search: Methods and results. In: Rayward-Smith, V., Osman, I., Reeves, C., Smith, G. (eds.) Modern Heuristic Search Methods, pp. 41–59. Wiley, Chichester (1996)Google Scholar
- Winkelkotte, T.: Strategische Optimierung von Distributionsnetzwerken – Ein Optimierungsmodell und heuristische Lösungsverfahren zur Planung von Standorten und Absatzgebieten mit approximativer Berücksichtigung der taktischen un operativen Logistikprozesse. Shaker (2011)Google Scholar