Skip to main content

Hybrid Genetic Simulated Annealing Algorithm (HGSAA) to Solve Storage Container Problem in Port

  • Conference paper
Intelligent Information and Database Systems (ACIIDS 2012)

Part of the book series: Lecture Notes in Computer Science ((LNAI,volume 7197))

Included in the following conference series:

Abstract

Container terminals play an important role in marine transportation; they constitute transfer stations to multimodal transport. In this paper, we study the storage of containers. We model the seaport system as a container location model, with an objective function designed to minimize the distance between the vessel berthing locations and the storage zone. Due to the inherent complexity of the problem, we propose a hybrid algorithm based on genetic (GA) and simulated annealing (SA) algorithm. In this paper, three different forms of integration between GA and SA are developed. In order to prove the efficiency of the HGSAAs proposed are compared to the optimal solutions for small-scale problems of an exact method which is Branch and Bound using the commercial software ILOG CPLEX. Computational results on real dimensions taken from the terminal of Normandy, Le Havre port, France, show the good quality of the solutions obtained by the HGSAAs.

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. Bourazza, S.: Variants of genetic algorithms applied to scheduling problems. PhD Thesis, University of Le Havre, France (2006)

    Google Scholar 

  2. Changkyu, P., Junyong, S.: Mathematical modeling and solving procedure of the planar storage location assignment problem. Computers and Industrial Engineering 57, 1062–1071 (2009)

    Article  Google Scholar 

  3. Chuqian, Z., Jiyin, L., Yat-Wah, W., Katta, M.: Storage space allocation in container terminals. Transportation Research 37, 883–903 (2003)

    Article  Google Scholar 

  4. El-Mihoub, T.A., Hopgood, A.A., Nolle, L., Battersby, A.: Hybrid Genetic Algorithms: A Review. Engineering Letters 13, 2–16 (2006)

    Google Scholar 

  5. El-Mihoub, T.A., Hopgood, A.A., Nolle, L., Battersby, A.: Performance of Hybrid Genetic Algorithms Incorporating Local Search. In: Horton, G. (ed.) 18th European Simulation Multiconference (ESM 2004), Magdeburg, Germany, pp. 154–160 (2004)

    Google Scholar 

  6. El-Ghazali, T.: Metaheuristics from design to implementation. John Wiley and Sons (2009)

    Google Scholar 

  7. Erhan, K., Peter, P.: Mathematical modeling of container transfers and storage locations at seaport terminals. OR Spectrum 28, 519–537 (2006)

    Article  MATH  Google Scholar 

  8. Kap, H.K., Hong, B.K.: Segregating space allocation models for container inventories inport container terminals. Int. J. Production Economics 59, 415–423 (1999)

    Article  Google Scholar 

  9. Kap, H.K., Kang, T.P.: A note on a dynamic space-allocation method for outbound containers. European Journal of Operational Research 148, 92–101 (2003)

    Article  MATH  Google Scholar 

  10. Kap, H.K., Ki, Y.K.: Optimal price schedules for storage of inbound containers. Transportation Research 41, 892–905 (2007)

    Article  Google Scholar 

  11. Lu, C., Zhiqiang, L.: The storage location assignment problem for outbound containers in a maritime terminal. Int. J. Production Economics 48, 991–1011 (2010)

    Article  Google Scholar 

  12. Mohammad, B., Nima, S., Nikbakhsh, J.: A genetic algorithm to solve the storage space allocation problem in a container terminal. Computers and Industrial Engineering 56, 44–52 (2009)

    Article  Google Scholar 

  13. Moussi, R., Ndiaye, F., Yassine, A.: A genetic algorithm and new modeling to solve container location problem in port. In: The International Maritime Transport and Logistics Conference, A Vision For Future Integration, Alexandria, Egypt (December 2011)

    Google Scholar 

  14. Peter, P., Erhan, K.: An approach to determine storage locations of containers at seaport terminals. Computers and Operations Research 28, 983–995 (2001)

    Article  MATH  Google Scholar 

  15. Patel, R., Raghuwanshi, M.M., Shrawankar, U.N.: Genetic Algorithm with Histogram Construction Technique. Journal of Information Hiding and Multimedia Signal Processing 2(4), 342–351 (2011)

    Google Scholar 

  16. Stahlbock, R., Vob, S.: Operations research at container terminals: a literature update. OR Spectrum 30, 1–52 (2008)

    Article  MathSciNet  MATH  Google Scholar 

  17. Steenken, D., Vob, S., Stahlbock, R.: Container terminal operation and operations research-a classification and literature review. OR Spectrum 26, 3–49 (2004)

    Article  MATH  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

Moussi, R., Ndiaye, N.F., Yassine, A. (2012). Hybrid Genetic Simulated Annealing Algorithm (HGSAA) to Solve Storage Container Problem in Port. In: Pan, JS., Chen, SM., Nguyen, N.T. (eds) Intelligent Information and Database Systems. ACIIDS 2012. Lecture Notes in Computer Science(), vol 7197. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-28490-8_32

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-28490-8_32

  • Publisher Name: Springer, Berlin, Heidelberg

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

  • Online ISBN: 978-3-642-28490-8

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics