{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,17]],"date-time":"2026-06-17T15:32:47Z","timestamp":1781710367456,"version":"3.54.5"},"reference-count":40,"publisher":"MDPI AG","issue":"1","license":[{"start":{"date-parts":[[2023,12,31]],"date-time":"2023-12-31T00:00:00Z","timestamp":1703980800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0\/"}],"funder":[{"name":"Agricultural Joint Fund of Yunnan Province","award":["202301BD070001-086"],"award-info":[{"award-number":["202301BD070001-086"]}]},{"name":"Agricultural Joint Fund of Yunnan Province","award":["31860332"],"award-info":[{"award-number":["31860332"]}]},{"name":"National Natural Science Foundation of China","award":["202301BD070001-086"],"award-info":[{"award-number":["202301BD070001-086"]}]},{"name":"National Natural Science Foundation of China","award":["31860332"],"award-info":[{"award-number":["31860332"]}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Axioms"],"abstract":"<jats:p>The Location-Routing Problem (LRP) becomes a more intricate subject when the limits of capacities of vehicles and warehouses are considered, which is an NP-hard problem. Moreover, as the number of vehicles increases, the solution to LRP is exacerbated because of the complexity of transportation and the combination of routes. To solve the problem, this paper proposed a Discrete Assembly Combination-Delivery (DACA) strategy based on, the Binary Equilibrium Optimizer (BiEO) algorithm, in addition, this paper also proposes a mixed-integer linear programming model for the problem of this paper. Our primary objective is to address both the route optimization problem and the assembly group sum problem concurrently. Our BiEO algorithm was designed as discrete in decision space to meet the requirements of the LRP represented by the DACA strategy catering to the multi-vehicle LRP scenario. The efficacy of the BiEO algorithm with the DACA strategy is demonstrated. through empirical analysis utilizing authentic data from Changchun City, China, Remarkably, the experiments reveal that the BiEO algorithm outperforms conventional methods, specifically GA, PSO, and DE algorithms, resulting in reduced costs. Notably, the results show the DACA strategy enables the simultaneous optimization of the LRP and the vehicle routing problem (VRP), ultimately leading to cost reduction. This innovative algorithm proficiently tackles both the assembly group sum and route optimization problems intrinsic to multi-level LRP instances.<\/jats:p>","DOI":"10.3390\/axioms13010031","type":"journal-article","created":{"date-parts":[[2023,12,31]],"date-time":"2023-12-31T06:00:21Z","timestamp":1704002421000},"page":"31","update-policy":"https:\/\/doi.org\/10.3390\/mdpi_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["Optimization of Location-Routing for Multi-Vehicle Combinations with Capacity Constraints Based on Binary Equilibrium Optimizers"],"prefix":"10.3390","volume":"13","author":[{"ORCID":"https:\/\/orcid.org\/0009-0008-1764-2006","authenticated-orcid":false,"given":"Rui","family":"Xi","sequence":"first","affiliation":[{"name":"College of Big Data and Intelligent Engineering, Southwest Forestry University, Kunming 650224, China"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Danju","family":"Lv","sequence":"additional","affiliation":[{"name":"College of Big Data and Intelligent Engineering, Southwest Forestry University, Kunming 650224, China"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Yueyun","family":"Yu","sequence":"additional","affiliation":[{"name":"College of Big Data and Intelligent Engineering, Southwest Forestry University, Kunming 650224, China"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-7535-8803","authenticated-orcid":false,"given":"Xin","family":"Huang","sequence":"additional","affiliation":[{"name":"College of Big Data and Intelligent Engineering, Southwest Forestry University, Kunming 650224, China"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Ziqian","family":"Wang","sequence":"additional","affiliation":[{"name":"College of Big Data and Intelligent Engineering, Southwest Forestry University, Kunming 650224, China"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Lianglian","family":"Gu","sequence":"additional","affiliation":[{"name":"College of Big Data and Intelligent Engineering, Southwest Forestry University, Kunming 650224, China"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Zhicheng","family":"Zhu","sequence":"additional","affiliation":[{"name":"College of Big Data and Intelligent Engineering, Southwest Forestry University, Kunming 650224, China"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Yan","family":"Zhang","sequence":"additional","affiliation":[{"name":"College of Mathematics and Physics, Southwest Forestry University, Kunming 650224, China"}],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"1968","published-online":{"date-parts":[[2023,12,31]]},"reference":[{"key":"ref_1","doi-asserted-by":"crossref","first-page":"150","DOI":"10.1016\/0377-2217(89)90188-4","article-title":"The effect of ignoring routes when locating depots","volume":"39","author":"Salhi","year":"1989","journal-title":"Eur. J. Oper. Res."},{"key":"ref_2","doi-asserted-by":"crossref","first-page":"861","DOI":"10.1016\/j.cie.2018.10.044","article-title":"Multi-objective location-routing model for hazardous material logistics with traffic restriction constraint in inter-city roads","volume":"128","author":"Hu","year":"2019","journal-title":"Comput. Ind. Eng."},{"key":"ref_3","doi-asserted-by":"crossref","first-page":"101426","DOI":"10.1016\/j.ijdrr.2019.101426","article-title":"A two-stage stochastic model for location planning of temporary medical centers for disaster response","volume":"44","author":"Oksuz","year":"2020","journal-title":"Int. J. Disaster Risk Reduct."},{"key":"ref_4","doi-asserted-by":"crossref","first-page":"107107","DOI":"10.1016\/j.asoc.2021.107107","article-title":"Interval type-2 Fuzzy ARAS method for recycling facility location problems","volume":"102","author":"Deveci","year":"2021","journal-title":"Appl. Soft Comput."},{"key":"ref_5","unstructured":"Kara, I., and Bektas, T. (2003, January 6\u201310). Integer linear programming formulation of the generalized vehicle routing problem. Proceedings of the 5-th EURO\/INFORMS Joint International Meeting, \u0130stanbul, Turkey."},{"key":"ref_6","doi-asserted-by":"crossref","unstructured":"Posada, A., Rivera, J.C., and Palacio, J.D. (2018, January 17\u201319). A mixed-integer linear programming model for a selective vehicle routing problem. Proceedings of the Applied Computer Sciences in Engineering: 5th Workshop on Engineering Applications, WEA 2018, Medell\u00edn, Colombia.","DOI":"10.1007\/978-3-030-00353-1_10"},{"key":"ref_7","doi-asserted-by":"crossref","first-page":"97","DOI":"10.1016\/j.apm.2011.05.037","article-title":"New mathematical models of the generalized vehicle routing problem and extensions","volume":"36","author":"Pop","year":"2012","journal-title":"Appl. Math. Model."},{"key":"ref_8","doi-asserted-by":"crossref","first-page":"107252","DOI":"10.1016\/j.cie.2021.107252","article-title":"A novel reinforcement learning-based hyper-heuristic for heterogeneous vehicle routing problem","volume":"156","author":"Qin","year":"2021","journal-title":"Comput. Ind. Eng."},{"key":"ref_9","doi-asserted-by":"crossref","first-page":"107403","DOI":"10.1016\/j.asoc.2021.107403","article-title":"Solving capacitated vehicle routing problem using cooperative firefly algorithm","volume":"108","author":"Altabeeb","year":"2021","journal-title":"Appl. Soft Comput."},{"key":"ref_10","first-page":"1763","article-title":"Efficient implementation of the genetic algorithm to solve rich vehicle routing problems","volume":"21","author":"Rabbouch","year":"2021","journal-title":"Oper. Res."},{"key":"ref_11","doi-asserted-by":"crossref","first-page":"261","DOI":"10.1057\/jors.1964.47","article-title":"On the location of supply points to minimize transport costs","volume":"15","author":"Maranzana","year":"1964","journal-title":"J. Oper. Res. Soc."},{"key":"ref_12","doi-asserted-by":"crossref","first-page":"311","DOI":"10.1057\/jors.1968.74","article-title":"Cost functions in the location of depots for multiple-delivery journeys","volume":"19","author":"Webb","year":"1968","journal-title":"J. Oper. Res. Soc."},{"key":"ref_13","doi-asserted-by":"crossref","first-page":"649","DOI":"10.1016\/j.ejor.2006.04.004","article-title":"Location-routing: Issues, models and methods","volume":"177","author":"Nagy","year":"2007","journal-title":"Eur. J. Oper. Res."},{"key":"ref_14","first-page":"271","article-title":"Mathematical Programming Modeling and Resolution of the Location-Routing Problem in Urban Logistics","volume":"18","year":"2014","journal-title":"Ing. Y Univ."},{"key":"ref_15","unstructured":"Heidari, M., Jafari, M.J., and Rahbari, M. (2018, January 7). Modeling a Multi-Objective Location-Routing Problem for Hazardous Materials with CO2 Emissions Consideration. Proceedings of the 14th International Industrial Engineering Conference (IIEC 2018), Tehran, Iran."},{"key":"ref_16","doi-asserted-by":"crossref","unstructured":"Shaerpour, M., Azani, M., Aghsami, A., and Rabbani, M. (2023). A new fuzzy bi-objective mixed-integer linear programming for designing a medical waste management network in the Coronavirus epidemic: A case study. Int. J. Manag. Sci. Eng. Manag., 1\u201316.","DOI":"10.1080\/17509653.2023.2253775"},{"key":"ref_17","doi-asserted-by":"crossref","first-page":"106","DOI":"10.1016\/j.biosystemseng.2020.12.007","article-title":"A two-echelon location-routing problem for biomass logistics systems","volume":"202","author":"Cao","year":"2021","journal-title":"Biosyst. Eng."},{"key":"ref_18","doi-asserted-by":"crossref","first-page":"120842","DOI":"10.1016\/j.jclepro.2020.120842","article-title":"An integrated location-routing-inventory model for sustainable design of a perishable products supply chain network","volume":"260","author":"Biuki","year":"2020","journal-title":"J. Clean. Prod."},{"key":"ref_19","doi-asserted-by":"crossref","first-page":"108443","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":"ref_20","doi-asserted-by":"crossref","first-page":"114304","DOI":"10.1016\/j.eswa.2020.114304","article-title":"A hybrid adaptive large neighbourhood search algorithm for the capacitated location routing problem","volume":"168","author":"Akpunar","year":"2021","journal-title":"Expert Syst. Appl."},{"key":"ref_21","doi-asserted-by":"crossref","first-page":"34","DOI":"10.1016\/j.ijpe.2012.06.011","article-title":"A multiple ant colony optimization algorithm for the capacitated location routing problem","volume":"141","author":"Ting","year":"2013","journal-title":"Int. J. Prod. Econ."},{"key":"ref_22","doi-asserted-by":"crossref","first-page":"288","DOI":"10.1016\/j.cie.2009.10.007","article-title":"A simulated annealing heuristic for the capacitated location routing problem","volume":"58","author":"Vincent","year":"2010","journal-title":"Comput. Ind. Eng."},{"key":"ref_23","doi-asserted-by":"crossref","first-page":"153671","DOI":"10.1109\/ACCESS.2020.3018490","article-title":"A hybrid heuristic based on a particle swarm algorithm to solve the capacitated location-routing problem with fuzzy demands","volume":"8","author":"Zhang","year":"2020","journal-title":"IEEE Access"},{"key":"ref_24","first-page":"14668","article-title":"Particle swarm optimization for capacitated location-routing problem","volume":"50","author":"Peng","year":"2017","journal-title":"IFAC-Pap."},{"key":"ref_25","doi-asserted-by":"crossref","first-page":"105760","DOI":"10.1016\/j.asoc.2019.105760","article-title":"A novel hybrid genetic algorithm for the location routing problem with tight capacity constraints","volume":"85","author":"Yu","year":"2019","journal-title":"Appl. Soft Comput."},{"key":"ref_26","doi-asserted-by":"crossref","first-page":"113","DOI":"10.1016\/j.ejor.2011.07.030","article-title":"Solving the two-echelon location routing problem by a GRASP reinforced by a learning process and path relinking","volume":"216","author":"Nguyen","year":"2012","journal-title":"Eur. J. Oper. Res."},{"key":"ref_27","doi-asserted-by":"crossref","first-page":"56","DOI":"10.1016\/j.engappai.2011.09.012","article-title":"A multi-start iterated local search with tabu list and path relinking for the two-echelon location-routing problem","volume":"25","author":"Nguyen","year":"2012","journal-title":"Eng. Appl. Artif. Intell."},{"key":"ref_28","doi-asserted-by":"crossref","first-page":"2007","DOI":"10.1007\/s00170-012-4627-9","article-title":"Modeling and solving the bi-objective capacitated location-routing problem with probabilistic travel times","volume":"67","author":"Jabalameli","year":"2013","journal-title":"Int. J. Adv. Manuf. Technol."},{"key":"ref_29","doi-asserted-by":"crossref","first-page":"10075","DOI":"10.1016\/j.eswa.2011.02.006","article-title":"The multi-depot capacitated location-routing problem with fuzzy travel times","volume":"38","author":"Zarandi","year":"2011","journal-title":"Expert Syst. Appl."},{"key":"ref_30","doi-asserted-by":"crossref","first-page":"931","DOI":"10.1016\/j.cor.2010.09.019","article-title":"A branch-and-cut method for the capacitated location-routing problem","volume":"38","author":"Belenguer","year":"2011","journal-title":"Comput. Oper. Res."},{"key":"ref_31","doi-asserted-by":"crossref","first-page":"1284","DOI":"10.1287\/opre.1110.0989","article-title":"An exact method for the capacitated location-routing problem","volume":"59","author":"Baldacci","year":"2011","journal-title":"Oper. Res."},{"key":"ref_32","doi-asserted-by":"crossref","first-page":"88","DOI":"10.1287\/ijoc.2013.0549","article-title":"An exact algorithm based on cut-and-column generation for the capacitated location-routing problem","volume":"26","author":"Contardo","year":"2014","journal-title":"INFORMS J. Comput."},{"key":"ref_33","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/j.tre.2015.12.003","article-title":"Branch-and-price algorithm for the location-routing problem with time windows","volume":"86","author":"Ponboon","year":"2016","journal-title":"Transp. Res. Part E Logist. Transp. Rev."},{"key":"ref_34","doi-asserted-by":"crossref","first-page":"221","DOI":"10.1007\/s10288-006-0001-9","article-title":"Solving the capacitated location-routing problem by a GRASP complemented by a learning process and a path relinking","volume":"4","author":"Prins","year":"2006","journal-title":"4OR"},{"key":"ref_35","doi-asserted-by":"crossref","first-page":"1912","DOI":"10.1016\/j.cor.2009.07.004","article-title":"A GRASP\u00d7 ELS approach for the capacitated location-routing problem","volume":"37","author":"Duhamel","year":"2010","journal-title":"Comput. Oper. Res."},{"key":"ref_36","doi-asserted-by":"crossref","first-page":"219","DOI":"10.5539\/jms.v2n2p219","article-title":"A heuristic based approach to solve a capacitated location-routing problem","volume":"2","author":"Jokar","year":"2012","journal-title":"J. Mgmt. Sustain."},{"key":"ref_37","doi-asserted-by":"crossref","first-page":"155","DOI":"10.1016\/j.cor.2016.01.006","article-title":"A simple and effective evolutionary algorithm for the capacitated location\u2013routing problem","volume":"70","author":"Lopes","year":"2016","journal-title":"Comput. Oper. Res."},{"key":"ref_38","doi-asserted-by":"crossref","first-page":"1079","DOI":"10.1111\/itor.12322","article-title":"A biased-randomized metaheuristic for the capacitated location routing problem","volume":"24","author":"Juan","year":"2017","journal-title":"Int. Trans. Oper. Res."},{"key":"ref_39","doi-asserted-by":"crossref","first-page":"105190","DOI":"10.1016\/j.knosys.2019.105190","article-title":"Equilibrium optimizer: A novel optimization algorithm","volume":"191","author":"Faramarzi","year":"2019","journal-title":"Knowl.-Based Syst."},{"key":"ref_40","doi-asserted-by":"crossref","first-page":"4081","DOI":"10.1016\/j.aej.2021.09.063","article-title":"Enhancement of Voltage Profile in the Distribution system by Reconfiguring with DG placement using Equilibrium Optimizer","volume":"61","author":"Mareddy","year":"2022","journal-title":"Alex. Eng. J."}],"container-title":["Axioms"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.mdpi.com\/2075-1680\/13\/1\/31\/pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,10,10]],"date-time":"2025-10-10T21:45:13Z","timestamp":1760132713000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.mdpi.com\/2075-1680\/13\/1\/31"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023,12,31]]},"references-count":40,"journal-issue":{"issue":"1","published-online":{"date-parts":[[2024,1]]}},"alternative-id":["axioms13010031"],"URL":"https:\/\/doi.org\/10.3390\/axioms13010031","relation":{},"ISSN":["2075-1680"],"issn-type":[{"value":"2075-1680","type":"electronic"}],"subject":[],"published":{"date-parts":[[2023,12,31]]}}}