A model-driven decision support system for the storage location assignment problem in bulk ports

dc.contributor.authorKrimi I.
dc.contributor.authorTodosijevic R.
dc.date.accessioned2024-08-07T08:04:45Z
dc.date.available2024-08-07T08:04:45Z
dc.date.issued2024
dc.description.abstractYard storage management involves tactical and operational decisions affecting bulk port productivity. The main challenge is to ensure that bulk materials are available and stored according to physical and managerial constraints while minimizing storage space utilization. This article studies a new variant of the storage location assignment problem by considering contamination constraints for bulk materials. The problem is inspired by a real case study of Africa's largest fertilizer hub port. To tackle the problem, a model-driven decision support system, optimizing the storage space while satisfying vessels' demands and avoiding contamination from overlapping bulk materials, is developed. A mixed-integer linear programming model is formulated, and an efficient rolling-horizon heuristic is investigated as a solution approach. Extensive numerical experiments are performed, and the results confirm the efficiency of this model-driven support system from both theoretical and practical points of view. Keywords: Model-driven decision support system, sport yard management, bulk port operations, rolling-horizon heuristics
dc.identifier.citationKrimi, I., & Todosijevic, R. (2024). A model-driven decision support system for the storage location assignment problem in bulk ports. Engineering Optimization, 1-22.
dc.identifier.doihttps://doi.org/10.1080/0305215X.2024.2333400
dc.identifier.urihttps://repository.adu.ac.ae/handle/1/6112
dc.language.isoen
dc.publisherTaylor and Francis Ltd
dc.titleA model-driven decision support system for the storage location assignment problem in bulk ports
dc.typeArticle

Files

License bundle

Now showing 1 - 1 of 1
Loading...
Thumbnail Image
Name:
license.txt
Size:
1.71 KB
Format:
Item-specific license agreed to upon submission
Description: