{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,23]],"date-time":"2026-04-23T08:03:52Z","timestamp":1776931432958,"version":"3.51.2"},"reference-count":31,"publisher":"MDPI AG","issue":"3","license":[{"start":{"date-parts":[[2025,3,13]],"date-time":"2025-03-13T00:00:00Z","timestamp":1741824000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Computation"],"abstract":"<jats:p>Competitive dynamics in dry bulk terminals necessitate efficient planning and scheduling to optimize operations. This study focuses on the productivity of stackers and reclaimers by developing a mathematical optimization model to enhance scheduling efficiency. A mixed-integer linear programming (MILP) model was formulated to minimize the maximum completion time (makespan) of operations while ensuring smooth material flow and resource utilization. Given the computational complexity of real-world scenarios, a novel hybrid genetic algorithm (GA) was proposed. This algorithm integrates tabu search to generate a high-quality initial population size and employs innovative chromosome designs that respect operational constraints, such as equipment availability, material flow continuity, and sequencing restrictions. This hybrid approach balances exploration and exploitation, improving solution convergence and robustness. Computational experiments using real data from a Moroccan dry bulk terminal validated the algorithm\u2019s efficiency and effectiveness. Performance indicators such as makespan reduction, equipment utilization, and computational efficiency were analyzed. The results demonstrate that the hybrid GA significantly reduced processing times and improved resource efficiency compared to conventional methods. Additionally, the algorithm showed scalability across different operational scenarios, confirming its adaptability to dynamic terminal conditions. These findings highlight the potential of advanced optimization techniques to enhance decision making and improve operational productivity in dry bulk terminals.<\/jats:p>","DOI":"10.3390\/computation13030074","type":"journal-article","created":{"date-parts":[[2025,3,13]],"date-time":"2025-03-13T10:16:45Z","timestamp":1741861005000},"page":"74","update-policy":"https:\/\/doi.org\/10.3390\/mdpi_crossmark_policy","source":"Crossref","is-referenced-by-count":3,"title":["Integrated Scheduling of Stacker and Reclaimer in Dry Bulk Terminals: A Hybrid Genetic Algorithm"],"prefix":"10.3390","volume":"13","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-0220-0631","authenticated-orcid":false,"given":"Imane","family":"Torbi","sequence":"first","affiliation":[{"name":"Mechanical Department, ENSEM, Hassan II University, Route d\u2019El Jadida, Km 7, Oasis, Casablanca P.O. Box 8118, Morocco"}]},{"given":"Imad","family":"Belassiria","sequence":"additional","affiliation":[{"name":"Mechanical Department, ENSEM, Hassan II University, Route d\u2019El Jadida, Km 7, Oasis, Casablanca P.O. Box 8118, Morocco"}]},{"given":"Mohamed","family":"Mazouzi","sequence":"additional","affiliation":[{"name":"Mechanical Department, ENSEM, Hassan II University, Route d\u2019El Jadida, Km 7, Oasis, Casablanca P.O. Box 8118, Morocco"}]},{"given":"Sanaa","family":"Aidi","sequence":"additional","affiliation":[{"name":"Mechanical Department, ENSEM, Hassan II University, Route d\u2019El Jadida, Km 7, Oasis, Casablanca P.O. Box 8118, Morocco"}]}],"member":"1968","published-online":{"date-parts":[[2025,3,13]]},"reference":[{"key":"ref_1","doi-asserted-by":"crossref","first-page":"5324","DOI":"10.1080\/00207543.2018.1467061","article-title":"An integrated model for assembly line re-balancing problem","volume":"56","author":"Belassiria","year":"2018","journal-title":"Int. J. Prod. Res."},{"key":"ref_2","doi-asserted-by":"crossref","first-page":"615","DOI":"10.1016\/j.ejor.2009.05.031","article-title":"A survey of berth allocation and quay crane scheduling problems in container terminals","volume":"202","author":"Bierwirth","year":"2010","journal-title":"Eur. J. Oper. Res."},{"key":"ref_3","doi-asserted-by":"crossref","first-page":"159","DOI":"10.1016\/0191-2615(89)90001-5","article-title":"The crane scheduling problem","volume":"23","author":"Daganzo","year":"1989","journal-title":"Transp. Res. Part B Methodol."},{"key":"ref_4","doi-asserted-by":"crossref","unstructured":"Bartz-Beielstein, T. (2010). SPOT: An R Package for Automatic and Interactive Tuning of Optimization Algorithms by Sequential Parameter Optimization. arXiv.","DOI":"10.1007\/978-3-642-02538-9_14"},{"key":"ref_5","doi-asserted-by":"crossref","first-page":"752","DOI":"10.1016\/S0377-2217(03)00133-4","article-title":"A crane scheduling method for port container terminals","volume":"156","author":"Kim","year":"2004","journal-title":"Eur. J. Oper. Res."},{"key":"ref_6","doi-asserted-by":"crossref","first-page":"45","DOI":"10.1002\/nav.20121","article-title":"A branch-and-cut algorithm for the quay crane scheduling problem in a container terminal","volume":"53","author":"Moccia","year":"2006","journal-title":"Nav. Res. Logist."},{"key":"ref_7","doi-asserted-by":"crossref","first-page":"327","DOI":"10.1007\/s10951-007-0029-5","article-title":"A tabu search heuristic for the quay crane scheduling problem","volume":"10","author":"Sammarra","year":"2007","journal-title":"J. Sched."},{"key":"ref_8","doi-asserted-by":"crossref","first-page":"103","DOI":"10.1057\/mel.2015.3","article-title":"Sea container terminals: New technologies and OR models","volume":"18","author":"Gharehgozli","year":"2016","journal-title":"Marit. Econ. Logist."},{"key":"ref_9","doi-asserted-by":"crossref","first-page":"4820","DOI":"10.1080\/00207543.2013.774489","article-title":"A workload balancing genetic algorithm for the quay crane scheduling problem","volume":"51","author":"Chung","year":"2013","journal-title":"Int. J. Prod. Res."},{"key":"ref_10","doi-asserted-by":"crossref","first-page":"115","DOI":"10.1016\/j.cie.2013.12.012","article-title":"An integrated quay crane assignment and scheduling problem","volume":"73","author":"Diabat","year":"2014","journal-title":"Comput. Ind. Eng."},{"key":"ref_11","doi-asserted-by":"crossref","first-page":"3478","DOI":"10.1080\/00207543.2018.1539265","article-title":"Integrated berth allocation and quay crane assignment with maintenance activities","volume":"57","author":"Zheng","year":"2018","journal-title":"Int. J. Prod. Res."},{"key":"ref_12","doi-asserted-by":"crossref","first-page":"412","DOI":"10.1016\/j.ejor.2013.10.054","article-title":"Storage yard operations in container terminals: Literature overview, trends, and research directions","volume":"235","author":"Carlo","year":"2014","journal-title":"Eur. J. Oper. Res."},{"key":"ref_13","doi-asserted-by":"crossref","first-page":"64","DOI":"10.1016\/j.ejor.2003.11.025","article-title":"Crane scheduling in container yards with inter-crane interference","volume":"164","author":"Ng","year":"2005","journal-title":"Eur. J. Oper. Res."},{"key":"ref_14","doi-asserted-by":"crossref","first-page":"468","DOI":"10.1016\/j.ejor.2008.03.011","article-title":"A neighborhood search heuristic for pre-marshalling export containers","volume":"196","author":"Lee","year":"2009","journal-title":"Eur. J. Oper. Res."},{"key":"ref_15","doi-asserted-by":"crossref","first-page":"305","DOI":"10.1287\/trsc.2016.0687","article-title":"Scheduling of different automated yard crane systems at container terminals","volume":"51","author":"Speer","year":"2017","journal-title":"Transp. Sci."},{"key":"ref_16","doi-asserted-by":"crossref","first-page":"288","DOI":"10.1016\/j.ejor.2018.05.007","article-title":"Yard Crane Scheduling for container storage, retrieval, and relocation","volume":"271","author":"Galle","year":"2018","journal-title":"Eur. J. Oper. Res."},{"key":"ref_17","doi-asserted-by":"crossref","first-page":"424","DOI":"10.1016\/j.ejor.2017.03.007","article-title":"Novel time-space network flow formulation and approximate dynamic programming approach for the crane scheduling in a coil warehouse","volume":"262","author":"Yuan","year":"2017","journal-title":"Eur. J. Oper. Res."},{"key":"ref_18","doi-asserted-by":"crossref","first-page":"267","DOI":"10.1080\/0740817X.2013.802841","article-title":"Crane scheduling in a warehouse storing steel coils","volume":"46","author":"Tang","year":"2014","journal-title":"IIE Trans."},{"key":"ref_19","doi-asserted-by":"crossref","first-page":"1607","DOI":"10.1080\/00207543.2016.1193249","article-title":"Crane scheduling problem with non-interference constraints in a steel coil distribution centre","volume":"55","author":"Maschietto","year":"2017","journal-title":"Int. J. Prod. Res."},{"key":"ref_20","doi-asserted-by":"crossref","first-page":"926","DOI":"10.1016\/j.ejor.2016.08.073","article-title":"A branch and price algorithm to solve the integrated production planning and scheduling in bulk ports","volume":"258","author":"Menezes","year":"2017","journal-title":"Eur. J. Oper. Res."},{"key":"ref_21","doi-asserted-by":"crossref","first-page":"277","DOI":"10.1007\/s00186-008-0221-1","article-title":"Scheduling at coal handling facilities using simulated annealing","volume":"68","author":"Conradie","year":"2008","journal-title":"Math. Methods Oper. Res."},{"key":"ref_22","doi-asserted-by":"crossref","first-page":"197","DOI":"10.1007\/s13676-012-0011-z","article-title":"A stockyard planning problem","volume":"1","author":"Boland","year":"2012","journal-title":"EURO J. Transp. Logist."},{"key":"ref_23","doi-asserted-by":"crossref","first-page":"2740","DOI":"10.1080\/00207543.2012.737955","article-title":"Distributed optimisation method for multi-resource constrained scheduling in coal supply chains","volume":"51","author":"Thomas","year":"2013","journal-title":"Int. J. Prod. Res."},{"key":"ref_24","doi-asserted-by":"crossref","first-page":"399","DOI":"10.1016\/j.ejor.2013.08.015","article-title":"A branch-and-price algorithm to solve the integrated berth allocation and yard assignment problem in bulk ports","volume":"235","author":"Robenek","year":"2014","journal-title":"Eur. J. Oper. Res."},{"key":"ref_25","doi-asserted-by":"crossref","first-page":"4182","DOI":"10.1080\/00207543.2015.1111535","article-title":"Integrated scheduling of rake and stockyard management with ship berthing: A block based evolutionary algorithm","volume":"54","author":"Pratap","year":"2016","journal-title":"Int. J. Prod. Res."},{"key":"ref_26","doi-asserted-by":"crossref","first-page":"1047","DOI":"10.1080\/0951192X.2012.684707","article-title":"Stacker-reclaimer scheduling in a dry bulk terminal","volume":"25","author":"Hu","year":"2012","journal-title":"Int. J. Comput. Integr. Manuf."},{"key":"ref_27","doi-asserted-by":"crossref","first-page":"533","DOI":"10.1016\/0305-0548(86)90048-1","article-title":"Future Paths for Integer Programming and Links to Artificial Intelligence","volume":"13","author":"Glover","year":"1986","journal-title":"Comp. Oper. Res."},{"key":"ref_28","doi-asserted-by":"crossref","first-page":"190","DOI":"10.1287\/ijoc.1.3.190","article-title":"TABU-SEARCH, Version 11.0, Annotated Experimental Computer Code for Traveling Salesman Problems","volume":"1","author":"Glover","year":"1997","journal-title":"ORSA J. Comput."},{"key":"ref_29","unstructured":"Pardalos, P.M., and Resende, M.G.C. (2002). Handbook of Applied Optimization, Oxford University Press."},{"key":"ref_30","doi-asserted-by":"crossref","first-page":"464","DOI":"10.1080\/10705510701301834","article-title":"Sensitivity of goodness of fit indexes to lack of measurement invariance","volume":"14","author":"Chen","year":"2007","journal-title":"Struct. Equ. Model. Multidiscip. J."},{"key":"ref_31","doi-asserted-by":"crossref","unstructured":"Toth, P., and Vigo, D. (2002). Metaheuristics for the Capacitated VRP. The Vehicle Routing Problem, SIAM.","DOI":"10.1137\/1.9780898718515"}],"container-title":["Computation"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.mdpi.com\/2079-3197\/13\/3\/74\/pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,10,9]],"date-time":"2025-10-09T16:53:15Z","timestamp":1760028795000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.mdpi.com\/2079-3197\/13\/3\/74"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,3,13]]},"references-count":31,"journal-issue":{"issue":"3","published-online":{"date-parts":[[2025,3]]}},"alternative-id":["computation13030074"],"URL":"https:\/\/doi.org\/10.3390\/computation13030074","relation":{},"ISSN":["2079-3197"],"issn-type":[{"value":"2079-3197","type":"electronic"}],"subject":[],"published":{"date-parts":[[2025,3,13]]}}}