{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,2]],"date-time":"2026-03-02T23:09:32Z","timestamp":1772492972273,"version":"3.50.1"},"reference-count":30,"publisher":"MDPI AG","issue":"3","license":[{"start":{"date-parts":[[2023,1,31]],"date-time":"2023-01-31T00:00:00Z","timestamp":1675123200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0\/"}],"funder":[{"DOI":"10.13039\/501100001871","name":"FCT\u2014Funda\u00e7\u00e3o para a Ci\u00eancia e a Tecnologia","doi-asserted-by":"publisher","award":["UIDB\/00285\/2020"],"award-info":[{"award-number":["UIDB\/00285\/2020"]}],"id":[{"id":"10.13039\/501100001871","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100001871","name":"FCT\u2014Funda\u00e7\u00e3o para a Ci\u00eancia e a Tecnologia","doi-asserted-by":"publisher","award":["UIDB\/00319\/2020"],"award-info":[{"award-number":["UIDB\/00319\/2020"]}],"id":[{"id":"10.13039\/501100001871","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100001871","name":"FCT\u2014Funda\u00e7\u00e3o para a Ci\u00eancia e a Tecnologia","doi-asserted-by":"publisher","award":["UIDB\/04058\/2020"],"award-info":[{"award-number":["UIDB\/04058\/2020"]}],"id":[{"id":"10.13039\/501100001871","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100001871","name":"FCT\u2014Funda\u00e7\u00e3o para a Ci\u00eancia e a Tecnologia","doi-asserted-by":"publisher","award":["UIDP\/04058\/2020"],"award-info":[{"award-number":["UIDP\/04058\/2020"]}],"id":[{"id":"10.13039\/501100001871","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100001871","name":"FCT\u2014Funda\u00e7\u00e3o para a Ci\u00eancia e a Tecnologia","doi-asserted-by":"publisher","award":["POCI-01-0247-FEDER-072638"],"award-info":[{"award-number":["POCI-01-0247-FEDER-072638"]}],"id":[{"id":"10.13039\/501100001871","id-type":"DOI","asserted-by":"publisher"}]},{"name":"Foundation for Science and Technology, IP","award":["UIDB\/00285\/2020"],"award-info":[{"award-number":["UIDB\/00285\/2020"]}]},{"name":"Foundation for Science and Technology, IP","award":["UIDB\/00319\/2020"],"award-info":[{"award-number":["UIDB\/00319\/2020"]}]},{"name":"Foundation for Science and Technology, IP","award":["UIDB\/04058\/2020"],"award-info":[{"award-number":["UIDB\/04058\/2020"]}]},{"name":"Foundation for Science and Technology, IP","award":["UIDP\/04058\/2020"],"award-info":[{"award-number":["UIDP\/04058\/2020"]}]},{"name":"Foundation for Science and Technology, IP","award":["POCI-01-0247-FEDER-072638"],"award-info":[{"award-number":["POCI-01-0247-FEDER-072638"]}]},{"DOI":"10.13039\/501100002924","name":"FEDER","doi-asserted-by":"publisher","award":["UIDB\/00285\/2020"],"award-info":[{"award-number":["UIDB\/00285\/2020"]}],"id":[{"id":"10.13039\/501100002924","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100002924","name":"FEDER","doi-asserted-by":"publisher","award":["UIDB\/00319\/2020"],"award-info":[{"award-number":["UIDB\/00319\/2020"]}],"id":[{"id":"10.13039\/501100002924","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100002924","name":"FEDER","doi-asserted-by":"publisher","award":["UIDB\/04058\/2020"],"award-info":[{"award-number":["UIDB\/04058\/2020"]}],"id":[{"id":"10.13039\/501100002924","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100002924","name":"FEDER","doi-asserted-by":"publisher","award":["UIDP\/04058\/2020"],"award-info":[{"award-number":["UIDP\/04058\/2020"]}],"id":[{"id":"10.13039\/501100002924","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100002924","name":"FEDER","doi-asserted-by":"publisher","award":["POCI-01-0247-FEDER-072638"],"award-info":[{"award-number":["POCI-01-0247-FEDER-072638"]}],"id":[{"id":"10.13039\/501100002924","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Mathematics"],"abstract":"<jats:p>This work presents a hybrid approach to solve a distribution problem of a Portuguese company in the automotive industry. The objective is to determine the minimum cost for daily distribution operations, such as collecting and delivering goods to multiple suppliers. Additional constraints are explicitly considered, such as time windows and loading constraints due to the limited capacity of the fleet in terms of weight and volume. An exhaustive review of the state of the art was conducted, presenting different typology schemes from the literature for the pickup and delivery problems in the distribution field. Two mathematical models were integrated within a matheuristic approach. One model reflects the combination of the Vehicle Routing Problem with Simultaneous Delivery and Pickup with the Capacitated Vehicle Routing Problem with Time Windows. The second one aims to pack all the items to be delivered onto the pallets, reflecting a three-dimensional single bin size Bin Packing Problem. Both formulations proposed\u2014a commodity-flow model and a formulation of the Three-Dimensional Packing Problem must be solved within the matheuristic. All the approaches were tested using real instances from data provided by the company. Additional computational experiments using benchmark instances were also performed.<\/jats:p>","DOI":"10.3390\/math11030713","type":"journal-article","created":{"date-parts":[[2023,2,1]],"date-time":"2023-02-01T05:04:48Z","timestamp":1675227888000},"page":"713","update-policy":"https:\/\/doi.org\/10.3390\/mdpi_crossmark_policy","source":"Crossref","is-referenced-by-count":25,"title":["A Matheuristic Approach to the Integration of Three-Dimensional Bin Packing Problem and Vehicle Routing Problem with Simultaneous Delivery and Pickup"],"prefix":"10.3390","volume":"11","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-4687-2747","authenticated-orcid":false,"given":"Ana","family":"Moura","sequence":"first","affiliation":[{"name":"University of Aveiro, GOVCOPP, Systems for Decision Support Research Group, Campus Universit\u00e1rio de Santiago, 3810-193 Aveiro, Portugal"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-1087-7941","authenticated-orcid":false,"given":"Telmo","family":"Pinto","sequence":"additional","affiliation":[{"name":"University of Coimbra, CEMMPRE, Department of Mechanical Engineering, 3000-370 Coimbra, Portugal"},{"name":"University of Minho, Centro ALGORITMI, Campus de Gualtar, 4710-057 Braga, Portugal"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-4017-1184","authenticated-orcid":false,"given":"Cl\u00e1udio","family":"Alves","sequence":"additional","affiliation":[{"name":"University of Minho, Centro ALGORITMI, Campus de Gualtar, 4710-057 Braga, Portugal"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-5566-845X","authenticated-orcid":false,"given":"Jos\u00e9","family":"Val\u00e9rio de Carvalho","sequence":"additional","affiliation":[{"name":"University of Minho, Centro ALGORITMI, Campus de Gualtar, 4710-057 Braga, Portugal"}]}],"member":"1968","published-online":{"date-parts":[[2023,1,31]]},"reference":[{"key":"ref_1","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"},{"key":"ref_2","doi-asserted-by":"crossref","first-page":"8","DOI":"10.1016\/j.ejor.2009.04.024","article-title":"Dynamic pickup and delivery problems","volume":"202","author":"Berbeglia","year":"2010","journal-title":"Eur. J. Oper. Res."},{"key":"ref_3","doi-asserted-by":"crossref","first-page":"21","DOI":"10.1007\/s11301-008-0033-7","article-title":"A survey on pickup and delivery problems. Part I: Transportation between customers and depot","volume":"58","author":"Parragh","year":"2008","journal-title":"J. Betriebswirtschaft"},{"key":"ref_4","doi-asserted-by":"crossref","first-page":"81","DOI":"10.1007\/s11301-008-0036-4","article-title":"A survey on pickup and delivery problems. Part II: Transportation between pickup and delivery locations","volume":"58","author":"Parragh","year":"2008","journal-title":"J. Betriebswirtschaft"},{"key":"ref_5","doi-asserted-by":"crossref","first-page":"4","DOI":"10.1007\/s11750-010-0144-x","article-title":"Routing problems with loading constraints","volume":"18","author":"Iori","year":"2010","journal-title":"TOP"},{"key":"ref_6","doi-asserted-by":"crossref","unstructured":"Pinto, T., Alves, C., and Carvalho, J.V.d. (2016, January 7\u20139). A branch-and-price algorithm for the vehicle routing problem with 2-dimensional loading constraints. Proceedings of the International Conference on Computational Logistics, Lisbon, Portugal.","DOI":"10.1007\/978-3-319-44896-1_21"},{"key":"ref_7","doi-asserted-by":"crossref","first-page":"342","DOI":"10.1287\/trsc.1050.0145","article-title":"A Tabu Search Algorithm for a Routing and Container Loading Problem","volume":"40","author":"Gendreau","year":"2006","journal-title":"Transp. Sci."},{"key":"ref_8","doi-asserted-by":"crossref","first-page":"294","DOI":"10.1002\/net.20179","article-title":"Metaheuristics for the vehicle routing problem with loading constraints","volume":"49","author":"Doerner","year":"2007","journal-title":"Networks"},{"key":"ref_9","doi-asserted-by":"crossref","first-page":"931","DOI":"10.1007\/s00291-009-0179-2","article-title":"Heuristic and exact algorithms for the multi-pile vehicle routing problem","volume":"33","author":"Tricoire","year":"2011","journal-title":"OR Spectr."},{"key":"ref_10","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":"2011","journal-title":"Transp. Sci."},{"key":"ref_11","doi-asserted-by":"crossref","first-page":"361","DOI":"10.1016\/j.ejor.2012.02.007","article-title":"Heuristics for the multi-depot petrol station replenishment problem with time windows","volume":"220","author":"Cornillier","year":"2012","journal-title":"Eur. J. Oper. Res."},{"key":"ref_12","doi-asserted-by":"crossref","first-page":"295","DOI":"10.1016\/j.ejor.2007.08.016","article-title":"A heuristic for the multi-period petrol station replenishment problem","volume":"191","author":"Cornillier","year":"2008","journal-title":"Eur. J. Oper. Res."},{"key":"ref_13","doi-asserted-by":"crossref","first-page":"19","DOI":"10.1287\/mnsc.27.1.19","article-title":"Real-Time Dispatch of Petroleum Tank Trucks","volume":"27","author":"Brown","year":"1981","journal-title":"Manag. Sci."},{"key":"ref_14","doi-asserted-by":"crossref","unstructured":"Pena, C., Pinto, T., and Carvalho, M.S. (2021, January 13\u201316). A Two-Stage Heuristic for a Real Multi-compartment and Multi-trip Vehicle Routing Problem with Time Windows. Proceedings of the Computational Science and Its Applications\u2014ICCSA 2021, Cagliari, Italy.","DOI":"10.1007\/978-3-030-86976-2_19"},{"key":"ref_15","doi-asserted-by":"crossref","first-page":"1725","DOI":"10.1016\/j.cor.2006.10.006","article-title":"A memetic algorithm and a tabu search for the multi-compartment vehicle routing problem","volume":"35","author":"Fallahi","year":"2008","journal-title":"Comput. Oper. Res."},{"key":"ref_16","doi-asserted-by":"crossref","first-page":"43","DOI":"10.1023\/A:1023067016014","article-title":"Scheduling Deliveries in Vehicles with Multiple Compartments","volume":"26","author":"Chajakis","year":"2003","journal-title":"J. Glob. Optim."},{"key":"ref_17","doi-asserted-by":"crossref","first-page":"3041","DOI":"10.1016\/j.cor.2009.02.008","article-title":"An adaptive guidance approach for the heuristic solution of a minimum multiple trip vehicle routing problem","volume":"36","author":"Battarra","year":"2009","journal-title":"Comput. Oper. Res."},{"key":"ref_18","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":"2014","journal-title":"OR Spectr."},{"key":"ref_19","unstructured":"Malapert, A., Gu\u00e9ret, C., Jussien, N., Langevin, A., and Rousseau, L.M. (2008, January 22). Two-dimensional pickup and delivery routing problem with loading constraints. Proceedings of the First CPAIOR Workshop on Bin Packing and Placement Constraints (BPPC\u201908), Paris, France."},{"key":"ref_20","doi-asserted-by":"crossref","first-page":"311","DOI":"10.5937\/fmet1504311P","article-title":"An insertion heuristic for the capacitated vehicle routing problem with loading constraints and mixed linehauls and backhauls","volume":"43","author":"Pinto","year":"2015","journal-title":"FME Trans."},{"key":"ref_21","doi-asserted-by":"crossref","first-page":"549","DOI":"10.1111\/itor.12509","article-title":"Variable neighborhood search algorithms for the vehicle routing problem with two-dimensional loading constraints and mixed linehauls and backhauls","volume":"27","author":"Pinto","year":"2020","journal-title":"Int. Trans. Oper. Res."},{"key":"ref_22","doi-asserted-by":"crossref","first-page":"17","DOI":"10.14232\/actacyb.20.1.2011.3","article-title":"Pickup and Delivery Vehicle Routing with Multidimensional Loading Constraints","volume":"20","author":"Imreh","year":"2011","journal-title":"Acta Cybern."},{"key":"ref_23","doi-asserted-by":"crossref","first-page":"82","DOI":"10.1016\/j.ejor.2014.12.001","article-title":"Hybrid algorithms for the vehicle routing problem with clustered backhauls and 3D loading constraints","volume":"243","author":"Bortfeldt","year":"2015","journal-title":"Eur. J. Oper. Res."},{"key":"ref_24","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":"Schumann","year":"2007","journal-title":"Eur. J. Oper. Res."},{"key":"ref_25","unstructured":"Moura, A. (2018, January 14\u201318). Linear Programming applied to the Capacitated Simultaneous Delivery and Pick-up Problem. Proceedings of the International Conference on Computational and Mathematical Methods in Science and Engineering, ICCMSE2018, Thessaloniki, Greece."},{"key":"ref_26","doi-asserted-by":"crossref","first-page":"888","DOI":"10.1111\/itor.12586","article-title":"A model-based heuristic to the vehicle routing and loading problem","volume":"26","author":"Moura","year":"2019","journal-title":"Int. Trans. Oper. Res."},{"key":"ref_27","doi-asserted-by":"crossref","first-page":"2307","DOI":"10.1016\/j.cor.2006.11.006","article-title":"Formulations and exact algorithms for the vehicle routing problem with time windows","volume":"35","author":"Kallehauge","year":"2008","journal-title":"Comput. Oper. Res."},{"key":"ref_28","unstructured":"Ivancic, N.J. (1988). An Integer Programming Based Heuristic Approach to the Three Dimensional Packing Problem. [Ph.D. Thesis, Case Western Reserve University]."},{"key":"ref_29","doi-asserted-by":"crossref","first-page":"173","DOI":"10.1142\/S0218213003001186","article-title":"A metaheuristic for the pickup and delivery problem with time windows","volume":"12","author":"Li","year":"2003","journal-title":"Int. J. Artif. Intell. Tools"},{"key":"ref_30","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"}],"container-title":["Mathematics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.mdpi.com\/2227-7390\/11\/3\/713\/pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,10,10]],"date-time":"2025-10-10T18:19:17Z","timestamp":1760120357000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.mdpi.com\/2227-7390\/11\/3\/713"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023,1,31]]},"references-count":30,"journal-issue":{"issue":"3","published-online":{"date-parts":[[2023,2]]}},"alternative-id":["math11030713"],"URL":"https:\/\/doi.org\/10.3390\/math11030713","relation":{},"ISSN":["2227-7390"],"issn-type":[{"value":"2227-7390","type":"electronic"}],"subject":[],"published":{"date-parts":[[2023,1,31]]}}}