The Ships Containers to storage areas Assignment Problems: Complexity and a Case study
Storage Area Assignment, Containers Dispersion, Complexity
In order to reduce the time the ship stays in the port, we consider the Ships containers to Storage areas Assignment Problem (SSAP) which finds an allocation of ship containers to storage area that minimizes the travelling time of the Reach Stacker and containers dispersion. In a first step, a Mixed Integer Linear Program model is presented to address the SSAP with a view to reduce both travelling time and containers dispersion while satisfying storage capacities when the containers of the same ship can be affected into one or two different storage areas. In a second step, the complexity of the SSAP is established by reduction from the Numerical Matching with Target Sum Problems where the containers of one ship can be partitioned into one or two different storage areas. Our mathematical model is illustrated with a real case study in the Tunisian port of Rades.
"The Ships Containers to storage areas Assignment Problems: Complexity and a Case study", IJSDR - International Journal of Scientific Development and Research (www.IJSDR.org), ISSN:2455-2631, Vol.9, Issue 3, page no.347 - 358, March-2024, Available :https://ijsdr.org/papers/IJSDR2403052.pdf
Volume 9
Issue 3,
March-2024
Pages : 347 - 358
Paper Reg. ID: IJSDR_210217
Published Paper Id: IJSDR2403052
Downloads: 000347097
Research Area: Other
Country: tunis, Tunis, Tunisie
DOI: https://doi.org/10.5281/zenodo.10830254
ISSN: 2455-2631 | IMPACT FACTOR: 9.15 Calculated By Google Scholar | ESTD YEAR: 2016
An International Scholarly Open Access Journal, Peer-Reviewed, Refereed Journal Impact Factor 9.15 Calculate by Google Scholar and Semantic Scholar | AI-Powered Research Tool, Multidisciplinary, Monthly, Multilanguage Journal Indexing in All Major Database & Metadata, Citation Generator
Publisher: IJSDR(IJ Publication) Janvi Wave
