Skip to main content

An Ant Colony Algorithm to Solve the Container Storage Problem

  • Conference paper
  • 814 Accesses

Part of the book series: Springer Proceedings in Mathematics & Statistics ((PROMS,volume 124))

Abstract

In this chapter we treat the container storage problem in port terminal. We study the storage of inbound containers in a port wherein straddle carriers are used as means of transport instead of internal trucks. In this work, unlike to the one that we did in Moussi et al. (LNCS 7197:301–310, 2012), reshuffles are not completely prohibited but are minimized. We consider additional constraints operational and propose a linear mathematical model. For numerical resolution we design an ant colony-based algorithm, named CSP-ANT. Several performed simulations prove the effectiveness of our algorithm.

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

Buying options

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 EPUB and 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
Hardcover Book
USD   54.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

Learn about institutional subscriptions

References

  1. Sauri, S., Martin, E.: Space allocating strategies for improving import yard performance at marine terminals. Transport Res. Part E 47(6), 1038–1057 (2011)

    Article  Google Scholar 

  2. Kim, K.H., Kim, H.B.: Segregating space allocation models for container inventories in port container terminals. Int. J. Prod. Econ. 59(1–3), 415–423 (1999)

    Google Scholar 

  3. Cao, J., Shi, Q., Der-Horng, L.: A decision support method for truck scheduling and storage allocation problem at container. Tsinghua Sci. Technol. 13(Suppl 1), 211–216 (2008)

    Article  Google Scholar 

  4. Mingzhu, Y., Xiangtong, Q.: Storage space allocation models for inbound containers in an automatic container terminal. Eur. J. Oper. Res. 226(1), 32–45 (2013)

    Article  MathSciNet  MATH  Google Scholar 

  5. Moussi, R., Ndiaye, N.F., Yassine, A.: Hybrid genetic simulated annealing algorithm (HGSAA) to solve storage container problem in port. Intelligent Information and Database Systems (ACIIDS), Lecture Notes in Computer Science, vol. 7197, pp. 301–310. (2012)

    Google Scholar 

  6. Dorigo, M., Maniezzo, V., Colorni, A.: The ant system: optimization by a colony of cooperating agents. IEEE Trans. Syst. Man Cybernet. Part B 26(1), 1–13 (1996)

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Ndèye Fatma Ndiaye .

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2016 Springer International Publishing Switzerland

About this paper

Cite this paper

Ndiaye, N.F., Yassine, A., Diarrassouba, I. (2016). An Ant Colony Algorithm to Solve the Container Storage Problem. In: Chen, K., Ravindran, A. (eds) Forging Connections between Computational Mathematics and Computational Geometry. Springer Proceedings in Mathematics & Statistics, vol 124. Springer, Cham. https://doi.org/10.5176/2251-1911_CMCGS14.37_7

Download citation

Publish with us

Policies and ethics