Skip to main content

Modeling of capacitated transportation systems for integral scheduling

  • Chapter
Container Terminals and Automated Transport Systems
  • 2416 Accesses

Abstract

Motivated by a planned automated cargo transportation network, we consider transportation problems in which the finite capacity of resources (such as vehicles, docks, parking places) has to be taken into account. For such problems, it is often even difficult to construct a good feasible solution. We present a flexible modeling methodology which allows to construct, evaluate, and improve feasible solutions. This new modeling approach is evaluated on instances stemming from a simulation model of the planned cargo transportation system.

The authors gratefully acknowledge the constructive comments of the anonymous referees, which helped to improve the presentation of the paper a lot.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 129.00
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 169.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info
Hardcover Book
USD 169.99
Price excludes VAT (USA)
  • Durable hardcover edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Ahuja RK, Magnanti TL, Orlin JB (1993) Network flows: theory, algorithms and applications. Prentice-Hall, New Jersey

    Google Scholar 

  2. Alicke K (2002) Modeling and optimization of the intermodal terminal Mega Hub. OR Spectrum 24: 1–18

    Article  MATH  MathSciNet  Google Scholar 

  3. Bilge Ü, Ulusoy G (1995) A time window approach to simultaneous scheduling of machines and material handling system in an FMS. Operations Research 43: 1058–1070

    Google Scholar 

  4. Bostel N, Dejax P (1998) Models and algorithms for container allocation problems on trains in a rapid transshipment shunting yard. Transportation Science 32(4): 370–379

    Google Scholar 

  5. Brucker P, Heitmann S, Hurink JL (2003) Flow-shop problems with intermediate buffers. OR Spectrum 25: 549–574

    Article  MathSciNet  Google Scholar 

  6. Chao X, Pinedo M (1998) Operations scheduling with applications in manufacturing and services. McGraw Hill, New York

    Google Scholar 

  7. Cordeau J, Desaulniers G, Desrosiers J, Solomon M, Soumis F (2002) The vehicle routing problem with time windows. In: Toth P, Vigo D (eds) The vehicle routing problem. SIAM monographs on discrete mathematics and applications, vol. 9, pp 157–193. Philadelphia, PA

    Google Scholar 

  8. Crama Y, Kats V, Van de Klundert J, Levner E (2000) Cyclic scheduling in robotic flowshops. Annals of Operations Research 96: 97–124

    Article  MathSciNet  Google Scholar 

  9. Ebben MJR (2001) Logistics control of automated transportation networks. PhD thesis, University of Twente, Twente University Press, Enschede, The Netherlands

    Google Scholar 

  10. Ebben MJR, van der Heijden MC, van Harten A (2002) Dynamic resource-constrained vehicle scheduling. Working paper, University of Twente, Faculty of Technology and Management, The Netherlands

    Google Scholar 

  11. Van der Heijden MC, Ebben MJR, Gademann N, van Harten A (2002) Scheduling vehicles in transportation networks. OR Spectrum 24(1): 31–58

    Google Scholar 

  12. Van der Heijden MC, van Harten A, Ebben MJR, Saanen YS, Valentin E, Verbraeck A (2002) Using simulation to design an automated underground system for transporting freight around Schiphol Airport. Interfaces 32(4): 1–19

    Google Scholar 

  13. Hurink J, Knust S (2001) Tabu search algorithms for job-shop problems with a single transport robot. Memorandum No. 1579, University of Twente, Faculty of Mathematical Sciences, The Netherlands. EJOR (to appear)

    Google Scholar 

  14. Kozan E (2000) Optimising container transfers at multimodal terminals. Mathematical and Computer Modelling 21: 235–243

    Google Scholar 

  15. Kozan E, Preston P (1999) Genetic algorithms to schedule container transfers at multimodal terminals. International Transactions in Operational Research 6, 311–329

    Article  Google Scholar 

  16. Meersmans P (2002) Optimization of container handling systems. PhD thesis, Erasmus University Rotterdam, The Netherlands

    Google Scholar 

  17. Nowicki E (1999) The permutation flow shop with buffers: a tabu search approach. European Journal of Operational Research 116: 205–219

    Article  MATH  Google Scholar 

  18. Ralphs TK, Kopman L, Pulleyblank WR, Trotter Jr LE (2003) On the capacitated vehicle routing problem. Mathematical Programming 94: 343–359

    Article  MathSciNet  Google Scholar 

  19. Vaessens RJM, Aarts EHL, Lenstra JK (1996) Job shop scheduling by local search. INFORMS Journal on Computing 8: 302–317

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2005 Springer-Verlag Berlin Heidelberg

About this chapter

Cite this chapter

Ebben, M., van der Heijden, M., Hurink, J., Schutten, M. (2005). Modeling of capacitated transportation systems for integral scheduling. In: Günther, HO., Kim, K.H. (eds) Container Terminals and Automated Transport Systems. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-26686-0_12

Download citation

Publish with us

Policies and ethics