Skip to main content

Optimizing Complex Logistics Systems with Approximative Consideration of Short-Term Costs

  • Conference paper
  • 2720 Accesses

Part of the Lecture Notes in Computer Science book series (LNTCS,volume 6971)

Abstract

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.

Keywords

  • Local Search
  • Tabu Search
  • Facility Location
  • Knapsack Problem
  • Facility Location Problem

These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

This is a preview of subscription content, access via your institution.

Buying options

Chapter
USD   29.95
Price excludes VAT (USA)
  • DOI: 10.1007/978-3-642-24264-9_15
  • Chapter length: 15 pages
  • Instant PDF download
  • Readable on all devices
  • Own it forever
  • Exclusive offer for individuals only
  • Tax calculation will be finalised during checkout
eBook
USD   59.99
Price excludes VAT (USA)
  • ISBN: 978-3-642-24264-9
  • Instant PDF download
  • Readable on all devices
  • Own it forever
  • Exclusive offer for individuals only
  • Tax calculation will be finalised during checkout
Softcover Book
USD   74.99
Price excludes VAT (USA)

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 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 

  2. Crainic, T., Gendreau, M., Soriano, P., Toulouse, M.: A tabu search procedure for multicommodity location/allocation with balancing requirements. Annals of Operations Research 41(4), 359–383 (1993)

    CrossRef  MATH  Google Scholar 

  3. Daganzo, C.F.: The length of tours in zones of different shapes. Transportation Research B 18B, 135–145 (1984)

    MathSciNet  CrossRef  Google Scholar 

  4. Daganzo, C.F.: The distance traveled to visit N points with a maximum of C stops per vehicle: an analytic model and application. Transportation Science 18, 131–150 (1984)

    MathSciNet  CrossRef  Google Scholar 

  5. Daganzo, C.F.: Logistics Systems Analysis, 4th edn. Springer, Heidelberg (2005)

    MATH  Google Scholar 

  6. Glover, F., Laguna, M.: Tabu Search. Kluver, London (1997)

    CrossRef  MATH  Google Scholar 

  7. Klose, A.: Standortplanung in distributiven Systemen – Modelle, Methoden. Anwendungen, Physica Heidelberg (2001)

    CrossRef  Google Scholar 

  8. 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 

  9. 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 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and Permissions

Copyright information

© 2011 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Winkelkotte, T. (2011). Optimizing Complex Logistics Systems with Approximative Consideration of Short-Term Costs. In: Böse, J.W., Hu, H., Jahn, C., Shi, X., Stahlbock, R., Voß, S. (eds) Computational Logistics. ICCL 2011. Lecture Notes in Computer Science, vol 6971. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-24264-9_15

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-24264-9_15

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-24263-2

  • Online ISBN: 978-3-642-24264-9

  • eBook Packages: Computer ScienceComputer Science (R0)