{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,4]],"date-time":"2026-05-04T04:33:21Z","timestamp":1777869201618,"version":"3.51.4"},"reference-count":52,"publisher":"Elsevier BV","license":[{"start":{"date-parts":[[2025,10,1]],"date-time":"2025-10-01T00:00:00Z","timestamp":1759276800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2025,10,1]],"date-time":"2025-10-01T00:00:00Z","timestamp":1759276800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/legal\/tdmrep-license"},{"start":{"date-parts":[[2025,10,1]],"date-time":"2025-10-01T00:00:00Z","timestamp":1759276800000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-017"},{"start":{"date-parts":[[2025,10,1]],"date-time":"2025-10-01T00:00:00Z","timestamp":1759276800000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"},{"start":{"date-parts":[[2025,10,1]],"date-time":"2025-10-01T00:00:00Z","timestamp":1759276800000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-012"},{"start":{"date-parts":[[2025,10,1]],"date-time":"2025-10-01T00:00:00Z","timestamp":1759276800000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2025,10,1]],"date-time":"2025-10-01T00:00:00Z","timestamp":1759276800000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-004"}],"funder":[{"DOI":"10.13039\/501100004410","name":"T\u00fcrkiye Bilimsel ve Teknolojik Ara\u015ft\u0131rma Kurumu","doi-asserted-by":"publisher","award":["TEYDEB-1505"],"award-info":[{"award-number":["TEYDEB-1505"]}],"id":[{"id":"10.13039\/501100004410","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100004410","name":"T\u00fcrkiye Bilimsel ve Teknolojik Ara\u015ft\u0131rma Kurumu","doi-asserted-by":"publisher","award":["5200028"],"award-info":[{"award-number":["5200028"]}],"id":[{"id":"10.13039\/501100004410","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["elsevier.com","sciencedirect.com"],"crossmark-restriction":true},"short-container-title":["Computers &amp; Operations Research"],"published-print":{"date-parts":[[2025,10]]},"DOI":"10.1016\/j.cor.2025.107115","type":"journal-article","created":{"date-parts":[[2025,5,2]],"date-time":"2025-05-02T19:18:07Z","timestamp":1746213487000},"page":"107115","update-policy":"https:\/\/doi.org\/10.1016\/elsevier_cm_policy","source":"Crossref","is-referenced-by-count":2,"special_numbering":"C","title":["Mathematical modeling and heuristic solutions for container loading and routing problem: A case study in a cable manufacturing company"],"prefix":"10.1016","volume":"182","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-2057-803X","authenticated-orcid":false,"given":"Gazi Bilal","family":"Y\u0131ld\u0131z","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0009-0003-4044-5098","authenticated-orcid":false,"given":"K\u00fcbra","family":"Yal\u00e7\u0131n","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-8936-0576","authenticated-orcid":false,"given":"Halim Burak","family":"Ta\u015fk\u0131n","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Murat","family":"G\u00fcrek","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/j.cor.2025.107115_b0005","doi-asserted-by":"crossref","first-page":"722","DOI":"10.1016\/j.cie.2018.11.012","article-title":"Mathematical models for multi container loading problems with practical constraints","volume":"127","author":"Alonso","year":"2019","journal-title":"Computers & Industrial Engineering"},{"issue":"3","key":"10.1016\/j.cor.2025.107115_b0010","doi-asserted-by":"crossref","first-page":"860","DOI":"10.1016\/j.ejor.2022.01.035","article-title":"The pallet-loading vehicle routing problem with stability constraints","volume":"302","author":"Alonso","year":"2022","journal-title":"European Journal of Operational Research"},{"key":"10.1016\/j.cor.2025.107115_b0015","doi-asserted-by":"crossref","first-page":"42105","DOI":"10.1109\/ACCESS.2024.3378063","article-title":"A multi-heuristic algorithm for multi-container 3-d bin packing problem optimization using real world constraints","volume":"12","author":"Ananno","year":"2024","journal-title":"IEEE Access"},{"key":"10.1016\/j.cor.2025.107115_b0020","doi-asserted-by":"crossref","DOI":"10.1016\/j.asoc.2021.107462","article-title":"Effects of memory and genetic operators on Artificial Bee Colony algorithm for Single Container Loading problem","volume":"108","author":"Bayraktar","year":"2021","journal-title":"Applied Soft Computing"},{"issue":"2","key":"10.1016\/j.cor.2025.107115_b0025","doi-asserted-by":"crossref","first-page":"267","DOI":"10.1016\/0377-2217(90)90362-F","article-title":"A comparative evaluation of heuristics for container loading","volume":"44","author":"Bischoff","year":"1990","journal-title":"European Journal of Operational Research"},{"issue":"4","key":"10.1016\/j.cor.2025.107115_b0030","doi-asserted-by":"crossref","first-page":"377","DOI":"10.1016\/0305-0483(95)00015-G","article-title":"Issues in the development of approaches to container loading","volume":"23","author":"Bischoff","year":"1995","journal-title":"Omega"},{"issue":"9","key":"10.1016\/j.cor.2025.107115_b0035","doi-asserted-by":"crossref","first-page":"2248","DOI":"10.1016\/j.cor.2011.11.008","article-title":"A hybrid algorithm for the capacitated vehicle routing problem with three-dimensional loading constraints","volume":"39","author":"Bortfeldt","year":"2012","journal-title":"Computers & Operations Research"},{"issue":"3","key":"10.1016\/j.cor.2025.107115_b0040","doi-asserted-by":"crossref","first-page":"873","DOI":"10.1016\/j.cor.2012.09.005","article-title":"Packing first, routing second\u2014a heuristic for the vehicle routing and loading problem","volume":"40","author":"Bortfeldt","year":"2013","journal-title":"Computers & Operations Research"},{"issue":"1","key":"10.1016\/j.cor.2025.107115_b0045","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/j.ejor.2012.12.006","article-title":"Constraints in container loading\u2013A state-of-the-art review","volume":"229","author":"Bortfeldt","year":"2013","journal-title":"European Journal of Operational Research"},{"key":"10.1016\/j.cor.2025.107115_b0050","unstructured":"Bowes, P. (2024). Shipping index. Pitney Bowes. https:\/\/www.pitneybowes.com\/us\/shipping-index.html\/ (accessed 25 March 2025)."},{"key":"10.1016\/j.cor.2025.107115_b0055","doi-asserted-by":"crossref","DOI":"10.1016\/j.orp.2019.100126","article-title":"Output maximization container loading problem with time availability constraints","volume":"6","author":"Castellucci","year":"2019","journal-title":"Operations Research Perspectives"},{"key":"10.1016\/j.cor.2025.107115_b0060","doi-asserted-by":"crossref","first-page":"275","DOI":"10.1007\/s10732-011-9162-6","article-title":"Local search for a multi-drop multi-container loading problem","volume":"19","author":"Ceschia","year":"2013","journal-title":"Journal of Heuristics"},{"issue":"4","key":"10.1016\/j.cor.2025.107115_b0065","doi-asserted-by":"crossref","first-page":"1138","DOI":"10.1016\/j.cie.2013.07.025","article-title":"Local search techniques for a routing-packing problem","volume":"66","author":"Ceschia","year":"2013","journal-title":"Computers & Industrial Engineering"},{"issue":"1","key":"10.1016\/j.cor.2025.107115_b0070","doi-asserted-by":"crossref","first-page":"68","DOI":"10.1016\/0377-2217(94)00002-T","article-title":"An analytical model for the container loading problem","volume":"80","author":"Chen","year":"1995","journal-title":"European Journal of Operational Research"},{"issue":"1\u20132","key":"10.1016\/j.cor.2025.107115_b0075","doi-asserted-by":"crossref","first-page":"319","DOI":"10.1016\/S0360-8352(98)00084-9","article-title":"A recursive computational procedure for container loading","volume":"35","author":"Chien","year":"1998","journal-title":"Computers & Industrial Engineering"},{"key":"10.1016\/j.cor.2025.107115_b0080","series-title":"Three dimensional container packing of drums and pallets","author":"Dean","year":"1999"},{"issue":"6","key":"10.1016\/j.cor.2025.107115_b0085","doi-asserted-by":"crossref","first-page":"3244","DOI":"10.1111\/itor.12740","article-title":"A mixed\u2010integer linear model for the multiple heterogeneous knapsack problem with realistic container loading constraints and bins' priority","volume":"28","author":"Deplano","year":"2021","journal-title":"International Transactions in Operational Research"},{"issue":"2","key":"10.1016\/j.cor.2025.107115_b0090","doi-asserted-by":"crossref","first-page":"2854","DOI":"10.1016\/j.asoc.2010.11.017","article-title":"A hybrid \u2018bee (s) algorithm\u2019for solving container loading problems","volume":"11","author":"Dereli","year":"2011","journal-title":"Applied Soft Computing"},{"issue":"2","key":"10.1016\/j.cor.2025.107115_b0095","doi-asserted-by":"crossref","first-page":"145","DOI":"10.1016\/0377-2217(90)90350-K","article-title":"A typology of cutting and packing problems","volume":"44","author":"Dyckhoff","year":"1990","journal-title":"European Journal of Operational Research"},{"issue":"3","key":"10.1016\/j.cor.2025.107115_b0100","doi-asserted-by":"crossref","first-page":"881","DOI":"10.1016\/j.ejor.2009.01.048","article-title":"Heuristics for container loading of furniture","volume":"200","author":"Egeblad","year":"2010","journal-title":"European Journal of Operational Research"},{"key":"10.1016\/j.cor.2025.107115_b0105","doi-asserted-by":"crossref","first-page":"1547","DOI":"10.1007\/s11590-017-1154-5","article-title":"A MIP-based slicing heuristic for three-dimensional bin packing","volume":"11","author":"Elhedhli","year":"2017","journal-title":"Optimization Letters"},{"issue":"4","key":"10.1016\/j.cor.2025.107115_b0110","doi-asserted-by":"crossref","first-page":"323","DOI":"10.1287\/ijoo.2019.0013","article-title":"Three-dimensional bin packing and mixed-case palletization","volume":"1","author":"Elhedhli","year":"2019","journal-title":"INFORMS Journal on Optimization"},{"issue":"3","key":"10.1016\/j.cor.2025.107115_b0115","doi-asserted-by":"crossref","first-page":"751","DOI":"10.1016\/j.ejor.2009.03.046","article-title":"Metaheuristics for vehicle routing problems with three-dimensional loading constraints","volume":"201","author":"Fuellerer","year":"2010","journal-title":"European Journal of Operational Research"},{"key":"10.1016\/j.cor.2025.107115_b0120","doi-asserted-by":"crossref","DOI":"10.1016\/j.omega.2021.102559","article-title":"An optimization approach for a complex real-life container loading problem","volume":"107","author":"Gajda","year":"2022","journal-title":"Omega"},{"issue":"3","key":"10.1016\/j.cor.2025.107115_b0125","doi-asserted-by":"crossref","first-page":"147","DOI":"10.1016\/0305-0548(80)90001-5","article-title":"A heuristic for packing boxes into a container","volume":"7","author":"George","year":"1980","journal-title":"Computers & Operations Research"},{"key":"10.1016\/j.cor.2025.107115_b0130","doi-asserted-by":"crossref","first-page":"374","DOI":"10.1016\/j.eswa.2019.06.023","article-title":"Transportation problems for intermodal networks: Mathematical models, exact and heuristic algorithms, and machine learning","volume":"135","author":"G\u00f6\u00e7men","year":"2019","journal-title":"Expert Systems with Applications"},{"key":"10.1016\/j.cor.2025.107115_b0135","first-page":"65","article-title":"A simple sequentially rejective multiple test procedure","author":"Holm","year":"1979","journal-title":"Scandinavian Journal of Statistics"},{"key":"10.1016\/j.cor.2025.107115_b0140","doi-asserted-by":"crossref","first-page":"471","DOI":"10.1016\/j.eswa.2019.07.020","article-title":"A hybrid approach for a multi-compartment container loading problem","volume":"137","author":"J\u00fanior","year":"2019","journal-title":"Expert Systems with Applications"},{"issue":"5","key":"10.1016\/j.cor.2025.107115_b0145","doi-asserted-by":"crossref","first-page":"645","DOI":"10.1111\/j.1475-3995.2012.00872.x","article-title":"An optimization model for the vehicle routing problem with practical three\u2010dimensional loading constraints","volume":"20","author":"Junqueira","year":"2013","journal-title":"International Transactions in Operational Research"},{"key":"10.1016\/j.cor.2025.107115_b0150","doi-asserted-by":"crossref","first-page":"110","DOI":"10.1016\/j.cie.2015.06.005","article-title":"Heuristic algorithms for a three-dimensional loading capacitated vehicle routing problem in a carrier","volume":"88","author":"Junqueira","year":"2015","journal-title":"Computers & Industrial Engineering"},{"issue":"1","key":"10.1016\/j.cor.2025.107115_b0155","doi-asserted-by":"crossref","first-page":"87","DOI":"10.1016\/j.ejor.2019.12.012","article-title":"The exact solutions of several types of container loading problems","volume":"284","author":"Kurpel","year":"2020","journal-title":"European Journal of Operational Research"},{"key":"10.1016\/j.cor.2025.107115_b0160","author":"Mozilla Developer Network"},{"issue":"3","key":"10.1016\/j.cor.2025.107115_b0165","doi-asserted-by":"crossref","first-page":"1018","DOI":"10.1016\/j.ejor.2019.07.057","article-title":"Automating the planning of container loading for Atlas Copco: Coping with real-life stacking and stability constraints","volume":"280","author":"Olsson","year":"2020","journal-title":"European Journal of Operational Research"},{"key":"10.1016\/j.cor.2025.107115_b0170","doi-asserted-by":"crossref","first-page":"2257","DOI":"10.1016\/j.procs.2015.05.382","article-title":"Distributing fibre boards: a practical application of the heterogeneous fleet vehicle routing problem with time windows and three-dimensional loading constraints","volume":"51","author":"Pace","year":"2015","journal-title":"Procedia Computer Science"},{"key":"10.1016\/j.cor.2025.107115_b0175","doi-asserted-by":"crossref","first-page":"297","DOI":"10.1007\/s00291-014-0386-3","article-title":"Vehicle routing problems with loading constraints: state-of-the-art and future directions","volume":"37","author":"Pollaris","year":"2015","journal-title":"Or Spectrum"},{"issue":"2","key":"10.1016\/j.cor.2025.107115_b0180","doi-asserted-by":"crossref","first-page":"382","DOI":"10.1016\/S0377-2217(02)00132-7","article-title":"Heuristics for the container loading problem","volume":"141","author":"Pisinger","year":"2002","journal-title":"European Journal of Operational Research"},{"issue":"3","key":"10.1016\/j.cor.2025.107115_b0185","doi-asserted-by":"crossref","first-page":"526","DOI":"10.1016\/j.ejor.2011.04.025","article-title":"A tree search method for the container loading problem with shipment priority","volume":"214","author":"Ren","year":"2011","journal-title":"European Journal of Operational Research"},{"key":"10.1016\/j.cor.2025.107115_b0190","doi-asserted-by":"crossref","first-page":"149","DOI":"10.1016\/j.cie.2017.04.021","article-title":"Heuristic algorithm for the container loading problem with multiple constraints","volume":"108","author":"Sheng","year":"2017","journal-title":"Computers & Industrial Engineering"},{"key":"10.1016\/j.cor.2025.107115_b0195","doi-asserted-by":"crossref","first-page":"12","DOI":"10.1016\/j.cor.2019.04.020","article-title":"Exact methods for three-dimensional cutting and packing: A comparative study concerning single container problems","volume":"109","author":"Silva","year":"2019","journal-title":"Computers & Operations Research"},{"issue":"1","key":"10.1016\/j.cor.2025.107115_b0200","doi-asserted-by":"crossref","first-page":"799","DOI":"10.1007\/s10479-019-03205-2","article-title":"Multi-objective vehicle routing and loading with time window constraints: a real-life application","volume":"291","author":"Song","year":"2020","journal-title":"Annals of Operations Research"},{"issue":"37","key":"10.1016\/j.cor.2025.107115_b0205","doi-asserted-by":"crossref","first-page":"1450","DOI":"10.21105\/joss.01450","article-title":"PyVista: 3D plotting and mesh analysis through a streamlined interface for the Visualization Toolkit (VTK)","volume":"4","author":"Sullivan","year":"2019","journal-title":"Journal of Open Source Software"},{"key":"10.1016\/j.cor.2025.107115_b0210","doi-asserted-by":"crossref","DOI":"10.1016\/j.cor.2023.106199","article-title":"A large neighbourhood search algorithm for solving container loading problems","volume":"154","author":"\u015eafak","year":"2023","journal-title":"Computers & Operations Research"},{"issue":"2","key":"10.1016\/j.cor.2025.107115_b0215","doi-asserted-by":"crossref","first-page":"255","DOI":"10.1109\/TITS.2009.2020187","article-title":"A hybrid metaheuristic algorithm for the integrated vehicle routing and three-dimensional container-loading problem","volume":"10","author":"Tarantilis","year":"2009","journal-title":"IEEE Transactions on Intelligent Transportation Systems"},{"issue":"3","key":"10.1016\/j.cor.2025.107115_b0220","doi-asserted-by":"crossref","first-page":"1109","DOI":"10.1016\/j.ejor.2005.12.047","article-title":"An improved typology of cutting and packing problems","volume":"183","author":"W\u00e4scher","year":"2007","journal-title":"European Journal of Operational Research"},{"issue":"1","key":"10.1016\/j.cor.2025.107115_b0225","doi-asserted-by":"crossref","DOI":"10.1155\/2018\/2024184","article-title":"Optimization of heterogeneous container loading problem with adaptive genetic algorithm","volume":"2018","author":"Xiang","year":"2018","journal-title":"Complexity"},{"issue":"3","key":"10.1016\/j.cor.2025.107115_b0230","doi-asserted-by":"crossref","first-page":"555","DOI":"10.1016\/j.tre.2007.01.006","article-title":"Optimal cargo container loading plans under stochastic demands for air express carriers","volume":"44","author":"Yan","year":"2008","journal-title":"Transportation Research Part e: Logistics and Transportation Review"},{"key":"10.1016\/j.cor.2025.107115_b0235","doi-asserted-by":"crossref","DOI":"10.1016\/j.cie.2022.108302","article-title":"Multi-strategy hybrid heuristic algorithm for single container weakly heterogeneous loading problem","volume":"170","author":"Zhang","year":"2022","journal-title":"Computers & Industrial Engineering"},{"issue":"1\u20132","key":"10.1016\/j.cor.2025.107115_b0240","doi-asserted-by":"crossref","first-page":"287","DOI":"10.1111\/itor.12094","article-title":"A comparative review of 3D container loading algorithms","volume":"23","author":"Zhao","year":"2016","journal-title":"International Transactions in Operational Research"},{"key":"10.1016\/j.cor.2025.107115_b0245","doi-asserted-by":"crossref","first-page":"80","DOI":"10.1016\/j.cie.2014.07.012","article-title":"Multi-objective multi-population biased random-key genetic algorithm for the 3-D container loading problem","volume":"89","author":"Zheng","year":"2015","journal-title":"Computers & Industrial Engineering"},{"issue":"3","key":"10.1016\/j.cor.2025.107115_b0250","doi-asserted-by":"crossref","first-page":"408","DOI":"10.1016\/j.ejor.2012.04.036","article-title":"A new iterative-doubling Greedy\u2013Lookahead algorithm for the single container loading problem","volume":"222","author":"Zhu","year":"2012","journal-title":"European Journal of Operational Research"},{"issue":"3","key":"10.1016\/j.cor.2025.107115_b0255","doi-asserted-by":"crossref","first-page":"253","DOI":"10.1002\/nav.21837","article-title":"Optimizing barge utilization in hinterland container transportation","volume":"66","author":"Zweers","year":"2019","journal-title":"Naval Research Logistics (NRL)"},{"issue":"9","key":"10.1016\/j.cor.2025.107115_b0260","doi-asserted-by":"crossref","first-page":"2178","DOI":"10.1016\/j.cor.2011.11.001","article-title":"A two-stage tabu search algorithm with enhanced packing heuristics for the 3L-CVRP and M3L-CVRP","volume":"39","author":"Zhu","year":"2012","journal-title":"Computers & Operations Research"}],"container-title":["Computers &amp; Operations Research"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0305054825001431?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0305054825001431?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2026,4,30]],"date-time":"2026-04-30T13:17:38Z","timestamp":1777555058000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0305054825001431"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,10]]},"references-count":52,"alternative-id":["S0305054825001431"],"URL":"https:\/\/doi.org\/10.1016\/j.cor.2025.107115","relation":{},"ISSN":["0305-0548"],"issn-type":[{"value":"0305-0548","type":"print"}],"subject":[],"published":{"date-parts":[[2025,10]]},"assertion":[{"value":"Elsevier","name":"publisher","label":"This article is maintained by"},{"value":"Mathematical modeling and heuristic solutions for container loading and routing problem: A case study in a cable manufacturing company","name":"articletitle","label":"Article Title"},{"value":"Computers & Operations Research","name":"journaltitle","label":"Journal Title"},{"value":"https:\/\/doi.org\/10.1016\/j.cor.2025.107115","name":"articlelink","label":"CrossRef DOI link to publisher maintained version"},{"value":"article","name":"content_type","label":"Content Type"},{"value":"\u00a9 2025 Elsevier Ltd. All rights are reserved, including those for text and data mining, AI training, and similar technologies.","name":"copyright","label":"Copyright"}],"article-number":"107115"}}