CFP last date
20 May 2024
Call for Paper
June Edition
IJCA solicits high quality original research papers for the upcoming June edition of the journal. The last date of research paper submission is 20 May 2024

Submit your paper
Know more
The week's pick
Responsive image
Enhancing Privacy Preservation: Multi-Attribute Protection with P-Sensitive K-Anonymity

Twinkle Patel Kiran Amin
Random Articles
Reseach Article

Optimization of Container Storage under Reshuffling Constraints in a Seaport

by Sara Souaini, Jamal Benhra
journal cover thumbnail

International Journal of Computer Applications
Foundation of Computer Science (FCS), NY, USA
Volume 183 - Number 21
Year of Publication: 2021
Authors: Sara Souaini, Jamal Benhra
10.5120/ijca2021921579

Sara Souaini, Jamal Benhra . Optimization of Container Storage under Reshuffling Constraints in a Seaport. International Journal of Computer Applications. 183, 21 ( Aug 2021), 29-34. DOI=10.5120/ijca2021921579

@article{ 10.5120/ijca2021921579,
author = { Sara Souaini, Jamal Benhra },
title = { Optimization of Container Storage under Reshuffling Constraints in a Seaport },
journal = { International Journal of Computer Applications },
issue_date = { Aug 2021 },
volume = { 183 },
number = { 21 },
month = { Aug },
year = { 2021 },
issn = { 0975-8887 },
pages = { 29-34 },
numpages = {9},
url = { https://ijcaonline.org/archives/volume183/number21/32050-2021921579/ },
doi = { 10.5120/ijca2021921579 },
publisher = {Foundation of Computer Science (FCS), NY, USA},
address = {New York, USA}
}
%0 Journal Article
%1 2024-02-07T01:17:26.837467+05:30
%A Sara Souaini
%A Jamal Benhra
%T Optimization of Container Storage under Reshuffling Constraints in a Seaport
%J International Journal of Computer Applications
%@ 0975-8887
%V 183
%N 21
%P 29-34
%D 2021
%I Foundation of Computer Science (FCS), NY, USA
Abstract

This contribution presents a mathematical model that manages container storage at the beginning of a time horizon, in a container terminal, ignoring incoming containers. For the solution of this static case of the container storage problem, a mathematical representation of the problem as an integer linear program will be studied. The objective is to minimize the expected total distance between storage locations and their exits, considering the shuffling constraints. A complexity analysis of the problem has been performed, and then graph theory notions has been employed by reducing the problem to incompatibility graphs that make the storage constraints more clearly visible. An application on a computer solver will then be performed on small instances.

References
  1. M. Wang, The rise of container transport in Asia, In : T. W. Lee, Culliane K (eds) World shipping and port development. Palgrave, Basingstoke, pp. 10-35, 2005.
  2. D. Steeken, S. Vob, et R. Stahlbock, Container terminal operation and operations research_a classification and literature review, OR Spectrum, vol. 26, pp. 309-332, 2005.
  3. Hans-Otto Günther et Kap-Haw Kim, Container terminals and terminal operations, OR Spectrum, vol. 28, pp. 437-445, 2006.
  4. M. Levinson, The box : How the shipping container made the world smaller and the world economy bigger, Princeton : Princeton UP, 2006.
  5. F. Broeze, The globalisation of the oceans : Containerisation from the 1950s to the present, St. Johns, NF, Canada : International Maritime Economic History Association, 2002.
  6. H. C. Brookfield, Boxes, ports, and places without ports, In Doyle, B.S. & Hilling, D. (Eds.), Seaport systems and spatial change, pp. 61-79, Chichester, UK: Wiley, 1984.
  7. B. J. Cudahy, The container revolution : Malcolm McLean's 1956 innovation goes global, TR News 246, pp. 5-9, 2006.
  8. U.S. Army Transportation Museum (n.d.). History & development of the container. (publication date unknown). Consulté le 29 June 2014 sur http://www.transchool.eustis.army.mil/museum/CONEX.htm
  9. Lloyd's, Containerisation International Yearbook 2012, incl. CD-ROM.
  10. UNCTAD, Review of maritime transport, 2005 : United Nations, 2006.
  11. M. Stopford, Maritime Economics, New York : Routledge, 2009.
  12. P. Hall, R. J. McCalla, C. Comtois, et B. Slack, Integrating seaports and corridors, Farnham, Surrey : Ashgate, 2011.
  13. T. E. Notteboom, Concentration and the formation of multi-port gateway regions in the European container port system: an update, Journal of Transport Geography, vol. 18, pp. 567-583, 2010.
  14. B. Slack, Corporate realignment and the global imperatives of container shipping ,In Pinder, D. & Slack, B. (Eds.) Shipping and ports in the twenty-_rst century : Globalization, technical change and the environment, London : Routledge, pp. 25-39, 2004.
  15. Y. A. Saanen et R. Dekker, Intelligent stacking as way out of congested yards part 1, Port Technol Int, vol. 31, pp. 87-92, 2007.
  16. Y. Ma et K. H. Kim, A comparative Analysis : Various storage rules in container yards and their perfermances, Industrial engineering & Management systems, vol. 11,pp. 276-287, 2012.
  17. Y. A. Saanen et R. Dekker, Intelligent stacking as way out of congested yards ? part 1, Port Technol Int, vol. 31, pp. 87-92, 2007.
  18. T. Chen, Yard operations in the container terminal-a study in the "unproductive" moves, Marit Policy Manage, vol. 26, pp. 27-38, 1999.
  19. M. B. Duinkerken, J. J. M. Evers, et J. A. Ottjes, A Simulation Model For Integrating Quay Transport And Stacking Policies On Automated Container Terminals , Proceedings of the 15 th European Simulation Multiconference, Prague, 2001.
Index Terms

Computer Science
Information Sciences

Keywords

Ports Optimization Mathematical Modeling Container Storage Storage Strategies solver reshuffling.

Powered by PhDFocusTM