{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,16]],"date-time":"2026-04-16T10:41:22Z","timestamp":1776336082358,"version":"3.51.2"},"publisher-location":"Cham","reference-count":39,"publisher":"Springer Nature Switzerland","isbn-type":[{"value":"9783031436116","type":"print"},{"value":"9783031436123","type":"electronic"}],"license":[{"start":{"date-parts":[[2023,1,1]],"date-time":"2023-01-01T00:00:00Z","timestamp":1672531200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2023,1,1]],"date-time":"2023-01-01T00:00:00Z","timestamp":1672531200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2023]]},"DOI":"10.1007\/978-3-031-43612-3_6","type":"book-chapter","created":{"date-parts":[[2023,9,6]],"date-time":"2023-09-06T03:30:04Z","timestamp":1693971004000},"page":"105-121","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":5,"title":["Towards a\u00a0Deep Reinforcement Learning Model of\u00a0Master Bay Stowage Planning"],"prefix":"10.1007","author":[{"given":"Jaike","family":"van Twiller","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Djordje","family":"Grbic","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Rune M\u00f8ller","family":"Jensen","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2023,9,7]]},"reference":[{"key":"6_CR1","doi-asserted-by":"crossref","unstructured":"Akiba, T., Sano, S., Yanase, T., Ohta, T., Koyama, M.: Optuna: a next-generation hyperparameter optimization framework (2019). http:\/\/arxiv.org\/abs\/1907.10902","DOI":"10.1145\/3292500.3330701"},{"key":"6_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"314","DOI":"10.1007\/978-3-642-13193-6_27","volume-title":"Experimental Algorithms","author":"D Ambrosino","year":"2010","unstructured":"Ambrosino, D., Anghinolfi, D., Paolucci, M., Sciomachen, A.: An experimental comparison of different heuristics for the master bay plan problem. In: Festa, P. (ed.) SEA 2010. LNCS, vol. 6049, pp. 314\u2013325. Springer, Heidelberg (2010). https:\/\/doi.org\/10.1007\/978-3-642-13193-6_27"},{"key":"6_CR3","doi-asserted-by":"publisher","unstructured":"Ambrosino, D., Sciomachen, A., Tanfani, E.: Stowing a containership: the master bay plan problem. Transp. Res. Part A 38(2), 81\u201399 (2004). https:\/\/doi.org\/10.1016\/j.tra.2003.09.002, http:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0965856403000892, http:\/\/www.sciencedirect.com\/science\/article\/pii\/S0965856403000892","DOI":"10.1016\/j.tra.2003.09.002"},{"key":"6_CR4","doi-asserted-by":"crossref","unstructured":"Avriel, M., Penn, M., Shpirer, N., Witteboon, S.: Stowage planning for container ships to reduce the number of shifts. Ann. Oper. Res. 76(1-4), 55\u201371 (1998). http:\/\/search.ebscohost.com\/login.aspx?direct=true &db=bth &AN=18925445 &site=ehost-live, http:\/\/link.springer.com\/article\/10.1023\/A:1018956823693","DOI":"10.1023\/A:1018956823693"},{"key":"6_CR5","doi-asserted-by":"publisher","unstructured":"Azevedo, A., Cassilda Maria, R., de Sena, G.J., Chaves, A.A., Neto, L.L.S., Moretti, A.C.: Solving the 3D container ship loading planning problem by representation by rules and meta-heuristics. Int. J. Data Anal. Tech. Strategies 6(3), 228\u2013260 (2014). https:\/\/doi.org\/10.1504\/IJDATS.2014.063060","DOI":"10.1504\/IJDATS.2014.063060"},{"key":"6_CR6","unstructured":"Bergstra, J., Bardenet, R., Bengio, Y., K\u00e9gl, B.: Algorithms for hyper-parameter optimization. In: NIPS 2011: Proceedings of the 24th International Conference on Neural Information Processing Systems, pp. 2546\u20132554 (2011). https:\/\/proceedings.neurips.cc\/paper_files\/paper\/2011\/file\/86e8f7ab32cfd12577bc2619bc635690-Paper.pdf"},{"key":"6_CR7","doi-asserted-by":"publisher","first-page":"113392","DOI":"10.1109\/ACCESS.2020.3003557","volume":"8","author":"MS Bilican","year":"2020","unstructured":"Bilican, M.S., Evren, R., Karatas, M.: A mathematical model and two-stage heuristic for the container stowage planning problem with stability parameters. IEEE Access 8, 113392\u2013113413 (2020). https:\/\/doi.org\/10.1109\/ACCESS.2020.3003557","journal-title":"IEEE Access"},{"key":"6_CR8","unstructured":"Botter, R., Brinati, M.: Stowage container planning: a model for getting an optimal solution. Comput. Appl. Autom. Shipyard Oper. Ship Design VII(C), 217\u2013228 (1992)"},{"key":"6_CR9","doi-asserted-by":"publisher","unstructured":"Chao, S.L., Lin, P.H.: Minimizing overstowage in master bay plans of large container ships. Maritime Econ. Logist. 23(1), 71\u201393 (2021). https:\/\/doi.org\/10.1057\/s41278-019-00126-6","DOI":"10.1057\/s41278-019-00126-6"},{"key":"6_CR10","doi-asserted-by":"publisher","unstructured":"Delgado, A., Jensen, R.M., Guilbert, N.: A placement heuristic for a commercial decision support system for container vessel stowage. In: 38th Latin America Conference on Informatics, CLEI 2012 - Conference Proceedings (2012). https:\/\/doi.org\/10.1109\/CLEI.2012.6427181","DOI":"10.1109\/CLEI.2012.6427181"},{"key":"6_CR11","doi-asserted-by":"publisher","unstructured":"Ding, D., Chou, M.C.: Stowage planning for container ships: a heuristic algorithm to reduce the number of shifts. Eur. J. Oper. Res. (2015). https:\/\/doi.org\/10.1016\/j.ejor.2015.03.044, http:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0377221715002660","DOI":"10.1016\/j.ejor.2015.03.044"},{"key":"6_CR12","doi-asserted-by":"publisher","unstructured":"Dubrovsky, O., Levitin, G., Penn, M.: A genetic algorithm with a compact solution encoding for the container ship stowage problem. J. Heuristics 8(6), 585\u2013599 (2002). https:\/\/doi.org\/10.1023\/A:1020373709350, http:\/\/link.springer.com\/article\/10.1023\/A:1020373709350","DOI":"10.1023\/A:1020373709350"},{"key":"6_CR13","unstructured":"Engstrom, L., et al.: Implementation matters in deep policy gradients: a case study on PPO and TRPO (2020). http:\/\/arxiv.org\/abs\/2005.12729"},{"key":"6_CR14","unstructured":"Foa, S., Coppola, C., Grani, G., Palagi, L.: Solving the vehicle routing problem with deep reinforcement learning (2022). http:\/\/arxiv.org\/abs\/2208.00202"},{"key":"6_CR15","unstructured":"Goodfellow, I., Bengio, Y., Courville, A.: Deep Learning. MIT Press (2016). http:\/\/www.deeplearningbook.org"},{"key":"6_CR16","unstructured":"Hamedi, M.: Containership load planning with crane operations. Ph.D. thesis, University of Maryland (2011)"},{"key":"6_CR17","unstructured":"Hottung, A., Kwon, Y.D., Tierney, K.: Efficient active search for combinatorial optimization problems. In: International Conference on Learning Representations 2022 (2021). http:\/\/arxiv.org\/abs\/2106.05126"},{"key":"6_CR18","unstructured":"Jensen, R.M., Pacino, D., Ajspur, M.L., Vesterdal, C.: Container vessel stowage planning. Weilbach (2018)"},{"key":"6_CR19","unstructured":"Kebedow, K.G., Oppen, J.: Including containers with dangerous goods in the slot planning problem. In: 2019 Proceedings of the International Conference on Industrial Engineering and Operations Management, pp. 225\u2013232 (2019)"},{"key":"6_CR20","unstructured":"Kingma, D.P., Ba, J.: Adam: a method for stochastic optimization. In: 2015 International Conference on Learning Representations (2014). http:\/\/arxiv.org\/abs\/1412.6980"},{"issue":"3","key":"6_CR21","doi-asserted-by":"publisher","first-page":"873","DOI":"10.1016\/j.ejor.2019.09.042","volume":"282","author":"A Korach","year":"2020","unstructured":"Korach, A., Brouer, B.D., Jensen, R.M.: Matheuristics for slot planning of container vessel bays. Eur. J. Oper. Res. 282(3), 873\u2013885 (2020). https:\/\/doi.org\/10.1016\/j.ejor.2019.09.042","journal-title":"Eur. J. Oper. Res."},{"key":"6_CR22","doi-asserted-by":"publisher","unstructured":"Kwon, Y.D., Choo, J., Kim, B., Yoon, I., Gwon, Y., Min, S.: POMO: policy optimization with multiple optima for reinforcement learning (2020). https:\/\/doi.org\/10.48550\/ARXIV.2010.16011, https:\/\/arxiv.org\/abs\/2010.16011","DOI":"10.48550\/ARXIV.2010.16011"},{"issue":"1","key":"6_CR23","doi-asserted-by":"publisher","first-page":"94","DOI":"10.1057\/s41278-020-00172-5","volume":"23","author":"R Larsen","year":"2021","unstructured":"Larsen, R., Pacino, D.: A heuristic and a benchmark for the stowage planning problem. Maritime Econ. Logist. 23(1), 94\u2013122 (2021). https:\/\/doi.org\/10.1057\/s41278-020-00172-5","journal-title":"Maritime Econ. Logist."},{"issue":"7862","key":"6_CR24","doi-asserted-by":"publisher","first-page":"207","DOI":"10.1038\/s41586-021-03544-w","volume":"594","author":"A Mirhoseini","year":"2021","unstructured":"Mirhoseini, A., et al.: A graph placement methodology for fast chip design. Nature 594(7862), 207\u2013212 (2021). https:\/\/doi.org\/10.1038\/s41586-021-03544-w","journal-title":"Nature"},{"key":"6_CR25","unstructured":"Mnih, V., et al.: Playing Atari with Deep Reinforcement Learning (2013)"},{"key":"6_CR26","doi-asserted-by":"publisher","unstructured":"Pacino, D.: An LNS approach for container stowage multi-port master planning. In: Computational Logistics, pp. 35\u201344 (2013). https:\/\/doi.org\/10.1007\/978-3-642-41019-2_3, http:\/\/link.springer.com\/10.1007\/978-3-642-41019-2_3","DOI":"10.1007\/978-3-642-41019-2_3"},{"key":"6_CR27","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"191","DOI":"10.1007\/978-3-030-00898-7_12","volume-title":"Computational Logistics","author":"D Pacino","year":"2018","unstructured":"Pacino, D.: Crane intensity and block stowage strategies in stowage planning. In: Cerulli, R., Raiconi, A., Vo\u00df, S. (eds.) ICCL 2018. LNCS, vol. 11184, pp. 191\u2013206. Springer, Cham (2018). https:\/\/doi.org\/10.1007\/978-3-030-00898-7_12"},{"key":"6_CR28","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"286","DOI":"10.1007\/978-3-642-24264-9_22","volume-title":"Computational Logistics","author":"D Pacino","year":"2011","unstructured":"Pacino, D., Delgado, A., Jensen, R.M., Bebbington, T.: Fast generation of near-optimal plans for eco-efficient stowage of large container vessels. In: B\u00f6se, J.W., Hu, H., Jahn, C., Shi, X., Stahlbock, R., Vo\u00df, S. (eds.) ICCL 2011. LNCS, vol. 6971, pp. 286\u2013301. Springer, Heidelberg (2011). https:\/\/doi.org\/10.1007\/978-3-642-24264-9_22"},{"key":"6_CR29","unstructured":"Pacino, D., Jensen, R.M.: A 3-phase randomized constraint based local search algorithm for stowing under deck locations of container vessel bays (2010). https:\/\/en.itu.dk\/-\/media\/EN\/Research\/About-ITU-Research\/Technical-Reports\/2010\/ITU-TR-2010-123-pdf"},{"key":"6_CR30","doi-asserted-by":"publisher","unstructured":"Parre\u00f1o-Torres, C., \u00c7al\u0131k, H., Alvarez-Valdes, R., Ruiz, R.: Solving the generalized multi-port container stowage planning problem by a matheuristic algorithm. Comput. Oper. Res. 133, 105383 (2021). https:\/\/doi.org\/10.1016\/j.cor.2021.105383","DOI":"10.1016\/j.cor.2021.105383"},{"issue":"6","key":"6_CR31","doi-asserted-by":"publisher","first-page":"1444","DOI":"10.1287\/trsc.2017.0795","volume":"52","author":"R Roberti","year":"2018","unstructured":"Roberti, R., Pacino, D.: A decomposition method for finding optimal container stowage plans. Transp. Sci. 52(6), 1444\u20131462 (2018). https:\/\/doi.org\/10.1287\/trsc.2017.0795","journal-title":"Transp. Sci."},{"key":"6_CR32","unstructured":"Schulman, J., Wolski, F., Dhariwal, P., Radford, A., Klimov, O.: Proximal policy optimization algorithms (2017). http:\/\/arxiv.org\/abs\/1707.06347"},{"issue":"S3","key":"6_CR33","doi-asserted-by":"publisher","first-page":"102","DOI":"10.1515\/pomr-2017-0111","volume":"24","author":"Y Shen","year":"2017","unstructured":"Shen, Y., Zhao, N., Xia, M., Du, X.: A deep Q-learning network for ship stowage planning problem. Pol. Maritime Res. 24(S3), 102\u2013109 (2017). https:\/\/doi.org\/10.1515\/pomr-2017-0111","journal-title":"Pol. Maritime Res."},{"key":"6_CR34","volume-title":"Reinforcement Learning: An Introduction","author":"RS Sutton","year":"2018","unstructured":"Sutton, R.S., Barto, A.G.: Reinforcement Learning: An Introduction. MIT Press, Cambridge (2018)"},{"key":"6_CR35","doi-asserted-by":"publisher","unstructured":"Tierney, K., Pacino, D., Jensen, R.M.: On the complexity of container stowage planning problems. Discrete Appl. Math. 169, 225\u2013230 (2014). https:\/\/doi.org\/10.1016\/j.dam.2014.01.005, http:\/\/dx.doi.org\/10.1016\/j.dam.2014.01.005","DOI":"10.1016\/j.dam.2014.01.005"},{"key":"6_CR36","doi-asserted-by":"crossref","unstructured":"van Twiller, J., Sivertsen, A., Pacino, D., Jensen, R.M.: Literature survey on the container stowage planning problem. Under review (2023)","DOI":"10.1016\/j.ejor.2023.12.018"},{"key":"6_CR37","doi-asserted-by":"publisher","unstructured":"Wilson, I.D., Roach, P.A.: Container stowage planning: a methodology for generating computerised solutions. J. Oper. Res. Soc. 51(11), 1248\u20131255 (2000). https:\/\/doi.org\/10.1057\/palgrave.jors.2601022, https:\/\/www.tandfonline.com\/doi\/full\/10.1057\/palgrave.jors.2601022","DOI":"10.1057\/palgrave.jors.2601022"},{"key":"6_CR38","doi-asserted-by":"publisher","first-page":"540","DOI":"10.2112\/SI83-090.1","volume":"83","author":"N Zhao","year":"2018","unstructured":"Zhao, N., Guo, Y., Xiang, T., Xia, M., Shen, Y., Mi, C.: Container ship stowage based on Monte Carlo tree search. J. Coastal Res. 83, 540\u2013547 (2018). https:\/\/doi.org\/10.2112\/SI83-090.1","journal-title":"J. Coastal Res."},{"key":"6_CR39","doi-asserted-by":"publisher","unstructured":"Zhu, H., Ji, M., Guo, W.: Integer linear programming models for the containership stowage problem. Math. Probl. Eng. 2020 (2020). https:\/\/doi.org\/10.1155\/2020\/4382745","DOI":"10.1155\/2020\/4382745"}],"container-title":["Lecture Notes in Computer Science","Computational Logistics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-43612-3_6","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,12,21]],"date-time":"2023-12-21T03:07:08Z","timestamp":1703128028000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-43612-3_6"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023]]},"ISBN":["9783031436116","9783031436123"],"references-count":39,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-43612-3_6","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2023]]},"assertion":[{"value":"7 September 2023","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"ICCL","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Computational Logistics","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Berlin","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Germany","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2023","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"6 September 2023","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"8 September 2023","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"14","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"iccl22023","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/www.iccl2023.uni-hamburg.de\/en.html","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Single-blind","order":1,"name":"type","label":"Type","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"EquinOCS","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"71","order":3,"name":"number_of_submissions_sent_for_review","label":"Number of Submissions Sent for Review","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"32","order":4,"name":"number_of_full_papers_accepted","label":"Number of Full Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"0","order":5,"name":"number_of_short_papers_accepted","label":"Number of Short Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"45% - The value is computed by the equation \"Number of Full Papers Accepted \/ Number of Submissions Sent for Review * 100\" and then rounded to a whole number.","order":6,"name":"acceptance_rate_of_full_papers","label":"Acceptance Rate of Full Papers","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"2,42","order":7,"name":"average_number_of_reviews_per_paper","label":"Average Number of Reviews per Paper","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"2","order":8,"name":"average_number_of_papers_per_reviewer","label":"Average Number of Papers per Reviewer","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"Yes","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}