{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,7]],"date-time":"2026-03-07T17:42:55Z","timestamp":1772905375500,"version":"3.50.1"},"reference-count":42,"publisher":"Elsevier BV","license":[{"start":{"date-parts":[[2026,1,1]],"date-time":"2026-01-01T00:00:00Z","timestamp":1767225600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2026,1,1]],"date-time":"2026-01-01T00:00:00Z","timestamp":1767225600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/legal\/tdmrep-license"},{"start":{"date-parts":[[2026,1,1]],"date-time":"2026-01-01T00:00:00Z","timestamp":1767225600000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-017"},{"start":{"date-parts":[[2026,1,1]],"date-time":"2026-01-01T00:00:00Z","timestamp":1767225600000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"},{"start":{"date-parts":[[2026,1,1]],"date-time":"2026-01-01T00:00:00Z","timestamp":1767225600000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-012"},{"start":{"date-parts":[[2026,1,1]],"date-time":"2026-01-01T00:00:00Z","timestamp":1767225600000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2026,1,1]],"date-time":"2026-01-01T00:00:00Z","timestamp":1767225600000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-004"}],"funder":[{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["72261011"],"award-info":[{"award-number":["72261011"]}],"id":[{"id":"10.13039\/501100001809","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,1]]},"DOI":"10.1016\/j.cor.2025.107258","type":"journal-article","created":{"date-parts":[[2025,8,29]],"date-time":"2025-08-29T06:58:59Z","timestamp":1756450739000},"page":"107258","update-policy":"https:\/\/doi.org\/10.1016\/elsevier_cm_policy","source":"Crossref","is-referenced-by-count":1,"special_numbering":"C","title":["A branch-and-cut algorithm for the pallet-loading vehicle routing problem considering load balance of semi-trailer trucks"],"prefix":"10.1016","volume":"185","author":[{"given":"Xiangbin","family":"Xu","sequence":"first","affiliation":[]},{"given":"Haoxing","family":"Ouyang","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"issue":"3","key":"10.1016\/j.cor.2025.107258_b0005","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":"Eur. J. Oper. Res."},{"key":"10.1016\/j.cor.2025.107258_b0010","doi-asserted-by":"crossref","unstructured":"Annouch, A., Bellabdaoui, A., Minkhar, J., 2016. Split delivery and pickup vehicle routing problem with two-dimensional loading constraints. In: 2016 11th International Conference on Intelligent Systems: Theories and Applications (SITA). IEEE, 1\u20136. https:\/\/doi.org\/10.1109\/SITA.2016.7772277.","DOI":"10.1109\/SITA.2016.7772277"},{"issue":"4","key":"10.1016\/j.cor.2025.107258_b0015","doi-asserted-by":"crossref","first-page":"241","DOI":"10.1002\/net.20467","article-title":"A column generation approach for the split delivery vehicle routing problem","volume":"58","author":"Archetti","year":"2011","journal-title":"Networks"},{"issue":"3","key":"10.1016\/j.cor.2025.107258_b0020","doi-asserted-by":"crossref","first-page":"685","DOI":"10.1016\/j.ejor.2014.04.026","article-title":"Branch-and-cut algorithms for the split delivery vehicle routing problem","volume":"238","author":"Archetti","year":"2014","journal-title":"Eur. J. Oper. Res."},{"issue":"3","key":"10.1016\/j.cor.2025.107258_b0025","doi-asserted-by":"crossref","first-page":"285","DOI":"10.1287\/trsc.1100.0363","article-title":"Enhanced branch and price and cut for vehicle routing with split deliveries and time windows","volume":"45","author":"Archetti","year":"2011","journal-title":"Transp. Sci."},{"key":"10.1016\/j.cor.2025.107258_b0030","doi-asserted-by":"crossref","first-page":"475","DOI":"10.1007\/PL00011432","article-title":"Solving the asymmetric travelling salesman problem with time windows by branch-and-cut","volume":"90","author":"Ascheuer","year":"2001","journal-title":"Math. Program."},{"issue":"8","key":"10.1016\/j.cor.2025.107258_b0035","doi-asserted-by":"crossref","first-page":"2004","DOI":"10.1016\/j.cor.2013.03.008","article-title":"Lifted and local reachability cuts for the vehicle routing problem with time windows","volume":"40","author":"Avella","year":"2013","journal-title":"Comput. Oper. Res."},{"issue":"2","key":"10.1016\/j.cor.2025.107258_b0040","doi-asserted-by":"crossref","first-page":"442","DOI":"10.1287\/trsc.2018.0825","article-title":"Branch-and-cut for the split delivery vehicle routing problem with time windows","volume":"53","author":"Bianchessi","year":"2019","journal-title":"Transp. Sci."},{"issue":"1","key":"10.1016\/j.cor.2025.107258_b0050","doi-asserted-by":"crossref","first-page":"179","DOI":"10.1287\/opre.1090.0713","article-title":"Branch-and-price-and-cut for the split-delivery vehicle routing problem with time windows","volume":"58","author":"Desaulniers","year":"2010","journal-title":"Oper. Res."},{"issue":"1","key":"10.1016\/j.cor.2025.107258_b0055","doi-asserted-by":"crossref","first-page":"27","DOI":"10.1016\/0167-6377(91)90083-2","article-title":"Improvements and extensions to the Miller-Tucker-Zemlin subtour elimination constraints","volume":"10","author":"Desrochers","year":"1991","journal-title":"Oper. Res. Lett."},{"issue":"2","key":"10.1016\/j.cor.2025.107258_b0060","doi-asserted-by":"crossref","first-page":"141","DOI":"10.1287\/trsc.23.2.141","article-title":"Savings by split delivery routing","volume":"23","author":"Dror","year":"1989","journal-title":"Transp. Sci."},{"key":"10.1016\/j.cor.2025.107258_b0065","doi-asserted-by":"crossref","first-page":"239","DOI":"10.1016\/0166-218X(92)00172-I","article-title":"Vehicle routing with split deliveries","volume":"50","author":"Dror","year":"1994","journal-title":"Discret. Appl. Math."},{"issue":"3","key":"10.1016\/j.cor.2025.107258_b0070","doi-asserted-by":"crossref","first-page":"617","DOI":"10.1016\/j.cor.2010.08.017","article-title":"A multi-start evolutionary local search for the two-dimensional loading capacitated vehicle routing problem","volume":"38","author":"Duhamel","year":"2011","journal-title":"Comput. Oper. Res."},{"key":"10.1016\/j.cor.2025.107258_b0075","doi-asserted-by":"crossref","DOI":"10.1016\/j.cie.2021.107518","article-title":"Multi-objective 3D bin packing problem with load balance and product family concerns","volume":"159","author":"Erbayrak","year":"2021","journal-title":"Comput. Ind. Eng."},{"key":"10.1016\/j.cor.2025.107258_b0080","doi-asserted-by":"crossref","DOI":"10.1016\/j.asoc.2022.108443","article-title":"A simulated annealing based heuristic for a location-routing problem with two-dimensional loading constraints","volume":"118","author":"Ferreira","year":"2022","journal-title":"Appl. Soft Comput."},{"key":"10.1016\/j.cor.2025.107258_b0085","doi-asserted-by":"crossref","DOI":"10.1016\/j.cor.2021.105452","article-title":"An exact approach for the green vehicle routing problem with two-dimensional loading constraints and split delivery","volume":"136","author":"Ferreira","year":"2021","journal-title":"Comput. Oper. Res."},{"issue":"2","key":"10.1016\/j.cor.2025.107258_b0090","doi-asserted-by":"crossref","first-page":"277","DOI":"10.1016\/0377-2217(90)90363-G","article-title":"A computer-based heuristic for packing pooled shipment containers","volume":"44","author":"Gehring","year":"1990","journal-title":"Eur. J. Oper. Res."},{"issue":"12","key":"10.1016\/j.cor.2025.107258_b0095","doi-asserted-by":"crossref","first-page":"1947","DOI":"10.1016\/S0305-0548(03)00155-2","article-title":"A tabu search heuristic for the vehicle routing problem with time windows and split deliveries","volume":"31","author":"Ho","year":"2004","journal-title":"Comput. Oper. Res."},{"key":"10.1016\/j.cor.2025.107258_b0100","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/j.eswa.2015.10.013","article-title":"A branch-and-cut approach for the vehicle routing problem with loading constraints","volume":"47","author":"Hokama","year":"2016","journal-title":"Expert Syst. Appl."},{"issue":"2","key":"10.1016\/j.cor.2025.107258_b0105","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."},{"issue":"2","key":"10.1016\/j.cor.2025.107258_b0110","doi-asserted-by":"crossref","first-page":"658","DOI":"10.1111\/itor.13382","article-title":"A branch-and-price-based heuristic for the vehicle routing problem with two\u2010dimensional loading constraints and time windows","volume":"31","author":"Ji","year":"2024","journal-title":"Int. Tran. Oper. Res."},{"issue":"2","key":"10.1016\/j.cor.2025.107258_b0115","doi-asserted-by":"crossref","first-page":"250","DOI":"10.1287\/trsc.36.2.250.565","article-title":"A branch-and-cut procedure for the vehicle routing problem with time windows","volume":"36","author":"Bard","year":"2002","journal-title":"Transp. Sci."},{"key":"10.1016\/j.cor.2025.107258_b0120","doi-asserted-by":"crossref","DOI":"10.1016\/j.ejtl.2021.100043","article-title":"Axle weights in combined vehicle routing and container loading problems","volume":"10","author":"Krebs","year":"2021","journal-title":"EURO J. Transp. Logist."},{"issue":"1","key":"10.1016\/j.cor.2025.107258_b0125","doi-asserted-by":"crossref","first-page":"358","DOI":"10.1016\/j.ijpe.2013.03.001","article-title":"The single container loading problem with axle weight constraints","volume":"144","author":"Lim","year":"2013","journal-title":"Int. J. Prod. Econ."},{"issue":"4","key":"10.1016\/j.cor.2025.107258_b0130","doi-asserted-by":"crossref","first-page":"797","DOI":"10.1016\/j.cor.2010.09.002","article-title":"A novel hybrid tabu search approach to container loading","volume":"38","author":"Liu","year":"2011","journal-title":"Comput. Oper. Res."},{"key":"10.1016\/j.cor.2025.107258_b0135","doi-asserted-by":"crossref","first-page":"93","DOI":"10.1016\/j.cor.2014.11.007","article-title":"Testing local search move operators on the vehicle routing problem with split deliveries and time windows","volume":"56","author":"McNabb","year":"2015","journal-title":"Comput. Oper. Res."},{"key":"10.1016\/j.cor.2025.107258_b0140","doi-asserted-by":"crossref","first-page":"140","DOI":"10.1016\/j.asoc.2013.12.012","article-title":"A bi-objective vehicle routing problem with time windows: a real case in Tenerife","volume":"17","author":"Meli\u00e1n-Batista","year":"2014","journal-title":"Appl. Soft Comput."},{"key":"10.1016\/j.cor.2025.107258_b0145","doi-asserted-by":"crossref","first-page":"172","DOI":"10.1016\/j.cor.2018.06.019","article-title":"A matheuristic method for the electric vehicle routing problem with time windows and fast chargers","volume":"100","author":"Merve Keskin","year":"2018","journal-title":"Comput. Oper. Res."},{"key":"10.1016\/j.cor.2025.107258_b0150","doi-asserted-by":"crossref","first-page":"107","DOI":"10.1057\/palgrave.jors.2600338","article-title":"Split-delivery routeing heuristics in livestock feed distribution","volume":"48","author":"Mullaseril","year":"1997","journal-title":"J. Oper. Res. Soc."},{"issue":"4","key":"10.1016\/j.cor.2025.107258_b0155","doi-asserted-by":"crossref","first-page":"1022","DOI":"10.1287\/trsc.2021.1106","article-title":"Compact formulations for split delivery routing problems","volume":"56","author":"Munari","year":"2022","journal-title":"Transp. Sci."},{"issue":"2","key":"10.1016\/j.cor.2025.107258_b0160","doi-asserted-by":"crossref","first-page":"231","DOI":"10.1007\/s13676-014-0064-2","article-title":"Capacitated vehicle routing problem with sequence-based pallet loading and axle weight constraints","volume":"5","author":"Pollaris","year":"2016","journal-title":"EURO J. Transp. Logist."},{"issue":"4","key":"10.1016\/j.cor.2025.107258_b0165","doi-asserted-by":"crossref","first-page":"455","DOI":"10.1287\/trsc.1050.0135","article-title":"An adaptive large neighborhood search heuristic for the pickup and delivery problem with time windows","volume":"40","author":"Ropke","year":"2006","journal-title":"Transp. Sci."},{"key":"10.1016\/j.cor.2025.107258_b0170","doi-asserted-by":"crossref","DOI":"10.1016\/j.eswa.2023.122893","article-title":"Pallets delivery: two matheuristics for combined loading and routing","volume":"243","author":"Silva","year":"2024","journal-title":"Expert Syst. Appl."},{"key":"10.1016\/j.cor.2025.107258_b0175","doi-asserted-by":"crossref","DOI":"10.1590\/0101-7438.2022.042.00248686","article-title":"Integer formulations for the integrated vehicle routing problem with two-dimensional packing constraints","volume":"42","author":"Silva","year":"2022","journal-title":"Pesquisa Operacional."},{"issue":"2","key":"10.1016\/j.cor.2025.107258_b0180","doi-asserted-by":"crossref","first-page":"254","DOI":"10.1287\/opre.35.2.254","article-title":"Algorithms for the vehicle routing and scheduling problems with time window constraints","volume":"35","author":"Solomon","year":"1987","journal-title":"Oper. Res."},{"issue":"1\u20132","key":"10.1016\/j.cor.2025.107258_b0185","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":"Ann. Oper. Res."},{"issue":"3","key":"10.1016\/j.cor.2025.107258_b0190","doi-asserted-by":"crossref","first-page":"798","DOI":"10.1016\/j.ejor.2014.12.048","article-title":"A variable neighborhood search for the capacitated vehicle routing problem with two-dimensional loading constraints","volume":"243","author":"Wei","year":"2015","journal-title":"Eur. J. Oper. Res."},{"key":"10.1016\/j.cor.2025.107258_b0195","doi-asserted-by":"crossref","first-page":"207962","DOI":"10.1109\/ACCESS.2020.3020728","article-title":"A hybrid discrete differential evolution algorithm to solve the split delivery vehicle routing problem","volume":"8","author":"Xing","year":"2020","journal-title":"IEEE Access"},{"issue":"3","key":"10.1016\/j.cor.2025.107258_b0200","doi-asserted-by":"crossref","first-page":"341","DOI":"10.1287\/trsc.1110.0373","article-title":"The pallet-packing vehicle routing problem","volume":"46","author":"Zachariadis","year":"2012","journal-title":"Transp. Sci."},{"issue":"6","key":"10.1016\/j.cor.2025.107258_b0205","doi-asserted-by":"crossref","first-page":"1618","DOI":"10.1287\/trsc.2022.1135","article-title":"A branch-and-price-and-cut algorithm for the vehicle routing problem with two-dimensional loading constraints","volume":"56","author":"Zhang","year":"2022","journal-title":"Transp. Sci."},{"issue":"3","key":"10.1016\/j.cor.2025.107258_b0210","doi-asserted-by":"crossref","first-page":"1419","DOI":"10.1287\/ijoc.2021.1110","article-title":"Learning-based branch-and-price algorithms for the vehicle routing problem with time windows and two-dimensional loading constraints","volume":"34","author":"Zhang","year":"2022","journal-title":"INFORMS J. Comput."},{"issue":"3","key":"10.1016\/j.cor.2025.107258_b0215","doi-asserted-by":"crossref","first-page":"483","DOI":"10.1007\/s42524-023-0259-z","article-title":"Enhanced solution representations for vehicle routing problems with split deliveries","volume":"10","author":"Zhu","year":"2023","journal-title":"Front. Eng. Manage."}],"container-title":["Computers & Operations Research"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0305054825002874?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0305054825002874?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2026,3,7]],"date-time":"2026-03-07T01:41:06Z","timestamp":1772847666000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0305054825002874"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026,1]]},"references-count":42,"alternative-id":["S0305054825002874"],"URL":"https:\/\/doi.org\/10.1016\/j.cor.2025.107258","relation":{},"ISSN":["0305-0548"],"issn-type":[{"value":"0305-0548","type":"print"}],"subject":[],"published":{"date-parts":[[2026,1]]},"assertion":[{"value":"Elsevier","name":"publisher","label":"This article is maintained by"},{"value":"A branch-and-cut algorithm for the pallet-loading vehicle routing problem considering load balance of semi-trailer trucks","name":"articletitle","label":"Article Title"},{"value":"Computers & Operations Research","name":"journaltitle","label":"Journal Title"},{"value":"https:\/\/doi.org\/10.1016\/j.cor.2025.107258","name":"articlelink","label":"CrossRef DOI link to publisher maintained version"},{"value":"article","name":"content_type","label":"Content Type"},{"value":"\u00a9 2025 Published by Elsevier Ltd.","name":"copyright","label":"Copyright"}],"article-number":"107258"}}