{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,7,24]],"date-time":"2026-07-24T12:04:21Z","timestamp":1784894661014,"version":"3.55.0"},"reference-count":32,"publisher":"Elsevier BV","license":[{"start":{"date-parts":[[2026,10,1]],"date-time":"2026-10-01T00:00:00Z","timestamp":1790812800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2026,10,1]],"date-time":"2026-10-01T00:00:00Z","timestamp":1790812800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/legal\/tdmrep-license"},{"start":{"date-parts":[[2026,10,1]],"date-time":"2026-10-01T00:00:00Z","timestamp":1790812800000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-017"},{"start":{"date-parts":[[2026,10,1]],"date-time":"2026-10-01T00:00:00Z","timestamp":1790812800000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"},{"start":{"date-parts":[[2026,10,1]],"date-time":"2026-10-01T00:00:00Z","timestamp":1790812800000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-012"},{"start":{"date-parts":[[2026,10,1]],"date-time":"2026-10-01T00:00:00Z","timestamp":1790812800000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2026,10,1]],"date-time":"2026-10-01T00:00:00Z","timestamp":1790812800000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-004"}],"funder":[{"DOI":"10.13039\/501100003725","name":"National Research Foundation of Korea","doi-asserted-by":"publisher","id":[{"id":"10.13039\/501100003725","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100014188","name":"Ministry of Science and ICT, South Korea","doi-asserted-by":"publisher","award":["2022R1A2C2006665"],"award-info":[{"award-number":["2022R1A2C2006665"]}],"id":[{"id":"10.13039\/501100014188","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["elsevier.com","sciencedirect.com"],"crossmark-restriction":true},"short-container-title":["Computers & Operations Research"],"published-print":{"date-parts":[[2026,10]]},"DOI":"10.1016\/j.cor.2026.107573","type":"journal-article","created":{"date-parts":[[2026,6,1]],"date-time":"2026-06-01T15:58:15Z","timestamp":1780329495000},"page":"107573","update-policy":"https:\/\/doi.org\/10.1016\/elsevier_cm_policy","source":"Crossref","is-referenced-by-count":0,"special_numbering":"C","title":["Pickup and delivery with time windows and two-dimensional loading for shipbuilding block transportation"],"prefix":"10.1016","volume":"194","author":[{"ORCID":"https:\/\/orcid.org\/0009-0009-3326-0814","authenticated-orcid":false,"given":"Ohhyun","family":"Kweon","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0009-0008-2958-152X","authenticated-orcid":false,"given":"Jun","family":"Kim","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-4526-2509","authenticated-orcid":false,"given":"Byung-In","family":"Kim","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Sang Hun","family":"Kim","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"78","reference":[{"issue":"3","key":"10.1016\/j.cor.2026.107573_b0005","doi-asserted-by":"crossref","first-page":"90","DOI":"10.1016\/j.ejor.2020.01.040","article-title":"Exact algorithms for the multi-pickup and delivery problem with time windows","volume":"284","author":"Aziez","year":"2020","journal-title":"Eur. J. Oper. Res."},{"issue":"12","key":"10.1016\/j.cor.2026.107573_b0010","doi-asserted-by":"crossref","first-page":"857","DOI":"10.1016\/j.ifacol.2016.07.882","article-title":"Time-dependent formulations for minimizing total completion time in a parallel machine scheduling problem with dependent setup times","volume":"49","author":"Baez","year":"2016","journal-title":"IFAC-PapersOnLine"},{"key":"10.1016\/j.cor.2026.107573_b0015","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1007\/s11750-007-0009-0","article-title":"Static pickup and delivery problems: a classification scheme and survey","volume":"15","author":"Berbeglia","year":"2007","journal-title":"TOP"},{"issue":"4","key":"10.1016\/j.cor.2026.107573_b0020","doi-asserted-by":"crossref","first-page":"685","DOI":"10.1016\/j.disopt.2008.04.001","article-title":"The time-dependent traveling salesman problem and single machine scheduling problems with sequence dependent setup times","volume":"5","author":"Bigras","year":"2008","journal-title":"Discret. Optim."},{"issue":"1","key":"10.1016\/j.cor.2026.107573_b0025","article-title":"Mathematical model and simulated annealing algorithm for the two\u2010dimensional loading heterogeneous fixed fleet vehicle routing problem","volume":"2022","author":"Candido","year":"2022","journal-title":"Math. Probl. Eng."},{"key":"10.1016\/j.cor.2026.107573_b0030","doi-asserted-by":"crossref","unstructured":"da Silveira, J. L., Xavier, E. C. (2014). Pickup and delivery problem with two dimensional loading\/unloading constraints. In Computational Logistics: 5th International Conference, ICCL 2014, Valparaiso, Chile, September 24-26, 2014. Proceedings 5: 31\u201346. Springer International Publishing. https:\/\/doi.org\/10.1007\/978-3-319-11421-7_3.","DOI":"10.1007\/978-3-319-11421-7_3"},{"issue":"1","key":"10.1016\/j.cor.2026.107573_b0035","doi-asserted-by":"crossref","first-page":"37","DOI":"10.1057\/jors.2015.48","article-title":"An ILS-biased randomization algorithm for the two-dimensional loading HFVRP with sequential loading and items rotation","volume":"67","author":"Dominguez Rivero","year":"2016","journal-title":"J. Oper. Res. Soc."},{"issue":"1","key":"10.1016\/j.cor.2026.107573_b0040","doi-asserted-by":"crossref","first-page":"7","DOI":"10.1016\/0377-2217(91)90319-Q","article-title":"The pickup and delivery problem with time windows","volume":"54","author":"Dumas","year":"1991","journal-title":"Eur. J. Oper. Res."},{"issue":"1","key":"10.1016\/j.cor.2026.107573_b0045","doi-asserted-by":"crossref","first-page":"10796","DOI":"10.1038\/s41598-024-61578-2","article-title":"Multi-objective green vehicle scheduling problem considering time window and emission factors in ship block transportation","volume":"14","author":"Guo","year":"2024","journal-title":"Sci. Rep."},{"issue":"1","key":"10.1016\/j.cor.2026.107573_b0050","doi-asserted-by":"crossref","first-page":"33","DOI":"10.1007\/s10107-003-0375-9","article-title":"Logic-based benders decomposition","volume":"96","author":"Hooker","year":"2003","journal-title":"Math. Program."},{"issue":"1","key":"10.1016\/j.cor.2026.107573_b0055","doi-asserted-by":"crossref","first-page":"385","DOI":"10.1016\/j.ejor.2022.11.006","article-title":"A metaheuristic algorithm for a locomotive routing problem arising in the steel industry","volume":"308","author":"Huang","year":"2023","journal-title":"Eur. J. Oper. Res."},{"issue":"2","key":"10.1016\/j.cor.2026.107573_b0060","doi-asserted-by":"crossref","first-page":"253","DOI":"10.1287\/trsc.1060.0165","article-title":"An exact approach for the vehicle routing problem with two-dimensional loading constraints","volume":"41","author":"Iori","year":"2007","journal-title":"Transp. Sci."},{"key":"10.1016\/j.cor.2026.107573_b0065","doi-asserted-by":"crossref","DOI":"10.1016\/j.aei.2021.101306","article-title":"A heuristic optimization approach for multi-vehicle and one-cargo green transportation scheduling in shipbuilding","volume":"49","author":"Jiang","year":"2021","journal-title":"Adv. Eng. Inf."},{"issue":"6","key":"10.1016\/j.cor.2026.107573_b0070","doi-asserted-by":"crossref","first-page":"2851","DOI":"10.1016\/j.eswa.2013.10.020","article-title":"Block transportation scheduling under delivery restriction in shipyard using meta-heuristic algorithms","volume":"41","author":"Joo","year":"2014","journal-title":"Expert Syst. Appl."},{"issue":"24","key":"10.1016\/j.cor.2026.107573_b0075","doi-asserted-by":"crossref","first-page":"7229","DOI":"10.1080\/00207543.2011.645078","article-title":"Ant colony optimisation with random selection for block transportation scheduling with heterogeneous transporters in a shipyard","volume":"50","author":"Kim","year":"2012","journal-title":"Int. J. Prod. Res."},{"issue":"23","key":"10.1016\/j.cor.2026.107573_b0080","doi-asserted-by":"crossref","first-page":"8373","DOI":"10.1080\/00207543.2024.2342017","article-title":"Many-to-many locomotive routing problem for the steel industry","volume":"62","author":"Kweon","year":"2024","journal-title":"Int. J. Prod. Res."},{"key":"10.1016\/j.cor.2026.107573_b0085","doi-asserted-by":"crossref","DOI":"10.1016\/j.cor.2025.107300","article-title":"Column generation-based matheuristic for pickup and delivery problem with two-dimensional loading","author":"Kweon","year":"2026","journal-title":"Comput. Oper. Res."},{"issue":"2","key":"10.1016\/j.cor.2026.107573_b0090","doi-asserted-by":"crossref","first-page":"199","DOI":"10.1016\/j.ejor.2012.09.023","article-title":"A meta-heuristic algorithm for heterogeneous fleet vehicle routing problems with two-dimensional loading constraints","volume":"225","author":"Leung","year":"2013","journal-title":"Eur. J. Oper. Res."},{"key":"10.1016\/j.cor.2026.107573_b0095","unstructured":"Malapert, A., Gu\u00e9ret, C., Jussien, N., Langevin, A., Rousseau, L. M. (2008). Two-dimensional pickup and delivery routing problem with loading constraints. In First CPAIOR Workshop on Bin Packing and Placement Constraints (BPPC\u201908): 184."},{"key":"10.1016\/j.cor.2026.107573_b0100","series-title":"Working Paper Series","article-title":"Hybrid algorithms for the vehicle routing problem with pickup and delivery and two-dimensional loading constraints","author":"M\u00e4nnel","year":"2017"},{"key":"10.1016\/j.cor.2026.107573_b0105","article-title":"A survey of adaptive large neighborhood search algorithms and applications","volume":"146","author":"Mara","year":"2022","journal-title":"Comput. Oper. Res."},{"issue":"1","key":"10.1016\/j.cor.2026.107573_b0110","doi-asserted-by":"crossref","first-page":"353","DOI":"10.1016\/j.ejor.2018.01.035","article-title":"The multi-pickup and delivery problem with time windows","volume":"269","author":"Naccache","year":"2018","journal-title":"Eur. J. Oper. Res."},{"issue":"1","key":"10.1016\/j.cor.2026.107573_b0115","doi-asserted-by":"crossref","first-page":"86","DOI":"10.1287\/opre.26.1.86","article-title":"The time-dependent traveling salesman problem and its application to the tardiness problem in one-machine scheduling","volume":"26","author":"Picard","year":"1978","journal-title":"Oper. Res."},{"issue":"11","key":"10.1016\/j.cor.2026.107573_b0120","doi-asserted-by":"crossref","first-page":"3231","DOI":"10.1080\/00207543.2010.484427","article-title":"A block transportation scheduling system considering a minimisation of travel distance without loading of and interference between multiple transporters","volume":"49","author":"Roh","year":"2011","journal-title":"Int. J. Prod. Res."},{"key":"10.1016\/j.cor.2026.107573_b0125","article-title":"Constraint programming-based optimization algorithm for international voyage planning considering barge loading space allocation","volume":"308\u2013322","author":"Song","year":"2025","journal-title":"In IFIP International Conference on Advances in Production Management Systems"},{"key":"10.1016\/j.cor.2026.107573_b0130","doi-asserted-by":"crossref","DOI":"10.1016\/j.tre.2020.101942","article-title":"Adaptive large neighborhood search for the time-dependent profitable pickup and delivery problem with time windows","volume":"138","author":"Sun","year":"2020","journal-title":"Transportation Research Part e: Logistics and Transportation Review"},{"issue":"1","key":"10.1016\/j.cor.2026.107573_b0135","article-title":"A metaheuristic algorithm to transporter scheduling for assembly blocks in a shipyard considering precedence and cooperating constraints","volume":"2019","author":"Tao","year":"2019","journal-title":"Discret. Dyn. Nat. Soc."},{"issue":"2","key":"10.1016\/j.cor.2026.107573_b0140","doi-asserted-by":"crossref","first-page":"93","DOI":"10.25103\/jestr.092.15","article-title":"Ship block transportation scheduling problem based on greedy algorithm","volume":"9","author":"Wang","year":"2016","journal-title":"Journal of Engineering Science & Technology Review"},{"issue":"12","key":"10.1016\/j.cor.2026.107573_b0145","doi-asserted-by":"crossref","first-page":"991","DOI":"10.3390\/jmse8120991","article-title":"Research on real-time optimal path planning model and algorithm for ship block transportation in Shipyard","volume":"8","author":"Wang","year":"2020","journal-title":"Journal of Marine Science and Engineering"},{"issue":"2","key":"10.1016\/j.cor.2026.107573_b0150","doi-asserted-by":"crossref","first-page":"369","DOI":"10.1016\/j.ejor.2015.11.018","article-title":"The vehicle routing problem with simultaneous pick-ups and deliveries and two-dimensional loading constraints","volume":"251","author":"Zachariadis","year":"2016","journal-title":"Eur. J. Oper. Res."},{"key":"10.1016\/j.cor.2026.107573_b0155","first-page":"115","article-title":"Vehicle routing strategies for pick-up and delivery service under two dimensional loading constraints","volume":"17","author":"Zachariadis","year":"2017","journal-title":"Oper. Res."},{"issue":"1","key":"10.1016\/j.cor.2026.107573_b0160","doi-asserted-by":"crossref","first-page":"259","DOI":"10.1016\/j.ejor.2021.12.050","article-title":"A branch-and-cut algorithm for the vehicle routing problem with two-dimensional loading constraints","volume":"302","author":"Zhang","year":"2022","journal-title":"Eur. J. Oper. Res."}],"container-title":["Computers & Operations Research"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0305054826001917?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0305054826001917?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2026,7,24]],"date-time":"2026-07-24T11:39:20Z","timestamp":1784893160000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0305054826001917"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026,10]]},"references-count":32,"alternative-id":["S0305054826001917"],"URL":"https:\/\/doi.org\/10.1016\/j.cor.2026.107573","relation":{},"ISSN":["0305-0548"],"issn-type":[{"value":"0305-0548","type":"print"}],"subject":[],"published":{"date-parts":[[2026,10]]},"assertion":[{"value":"Elsevier","name":"publisher","label":"This article is maintained by"},{"value":"Pickup and delivery with time windows and two-dimensional loading for shipbuilding block transportation","name":"articletitle","label":"Article Title"},{"value":"Computers & Operations Research","name":"journaltitle","label":"Journal Title"},{"value":"https:\/\/doi.org\/10.1016\/j.cor.2026.107573","name":"articlelink","label":"CrossRef DOI link to publisher maintained version"},{"value":"article","name":"content_type","label":"Content Type"},{"value":"\u00a9 2026 Elsevier Ltd. All rights are reserved, including those for text and data mining, AI training, and similar technologies.","name":"copyright","label":"Copyright"}],"article-number":"107573"}}