Skip to main content

Optimal Scheduling of Emergency Horizontal Transport in Container Port

  • Conference paper
Emerging Research in Artificial Intelligence and Computational Intelligence (AICI 2012)

Part of the book series: Communications in Computer and Information Science ((CCIS,volume 315))

  • 1872 Accesses

Abstract

This paper discusses the horizontal transport emergency scheduling problem during loading and unloading process in container port. This problem can be solved with the network optimization theory of CPM. A modified network model is provided formulate the problem.

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 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight 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. Chris, K.: Singlemachine schedulingwith timewindows and earliness/tardiness. European J. Oper. Res. 91, 190–202 (1996); Van der Geer, J., Hanraads, J.A.J., Lupton, R.A.: The art of writing a scientific article. J. Sci. Commun. 163, 51–59 (2000)

    Google Scholar 

  2. Cao, Z., Lee, D.-H., Meng, Q.: Deployment strategies of double-rail-mounted gantry crane systems for loading outbound containers in container ports. International Journal of Production Economics 115, 221–228 (2008)

    Article  Google Scholar 

  3. Codato, G., Fischetti, M.: Combinatorial Benders’ cuts for mixed-integer linear programming. Operations Research 54, 756–766 (2006)

    Article  MathSciNet  MATH  Google Scholar 

  4. Lee, D.-H., Cao, Z., Meng, Q.: Scheduling of two-transtainer systems for loading outbound containers in port container ports with simulated annealing algorithm. International Journal of Production Economics 107, 115–124 (2007)

    Article  Google Scholar 

  5. Ng, W.C.: Crane scheduling in container yards with inter-crane interference. European Journal of Operational Research 164, 64–78 (2005)

    Article  MathSciNet  MATH  Google Scholar 

  6. Narasimhan, A., Palekar, U.S.: Analysis and algorithm for the transtainer routing problem in container port operation. Transportation Science 36(1), 63–78 (2002)

    Article  MATH  Google Scholar 

  7. Fang, L.C.: A branch and bound algorithm for the singlemachine earliness and tardiness scheduling problem. Computers & Operations Research 26, 679–693 (1999); Strunk Jr., W., White, E.B.: The elements of style, 3rd edn. Macmillan, New York (1979)

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2012 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Huang, Y., Tian, L., Liu, S. (2012). Optimal Scheduling of Emergency Horizontal Transport in Container Port. In: Lei, J., Wang, F.L., Deng, H., Miao, D. (eds) Emerging Research in Artificial Intelligence and Computational Intelligence. AICI 2012. Communications in Computer and Information Science, vol 315. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-34240-0_14

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-34240-0_14

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-34239-4

  • Online ISBN: 978-3-642-34240-0

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics