{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,11]],"date-time":"2025-10-11T02:08:34Z","timestamp":1760148514480,"version":"build-2065373602"},"reference-count":73,"publisher":"MDPI AG","issue":"5","license":[{"start":{"date-parts":[[2023,5,12]],"date-time":"2023-05-12T00:00:00Z","timestamp":1683849600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Algorithms"],"abstract":"<jats:p>Focusing on the dynamic improvement of the underlying service network configuration, this paper aims to address a specific challenge of redesigning a multi-echelon city logistics distribution network. By considering the intra-echelon connection of facilities within the same layer of echelon, we propose a new distribution network design model by reformulating the classical quadratic assignment problem (QAP). To minimize the overall transportation costs, the proposed model jointly optimizes two types of decisions to enable agile distribution with dynamic \u201cshortcuts\u201d: (i) the allocation of warehouses to supply the corresponding distribution centers (DCs), and (ii) the demand coverage decision from distribution centers to delivery stations. Furthermore, a customized branch-and-bound algorithm is developed, where the lower bound is obtained by adopting Gilmore and Lawler lower Bound (GLB) for QAP. We conduct extensive computational experiments, highlighting the significant contribution of GLB-oriented lower bound, to obtain practical solutions; this type of efficient mathematical lower bounds offers a powerful tool for balancing theoretical research ideas with practical and industrial applicability.<\/jats:p>","DOI":"10.3390\/a16050252","type":"journal-article","created":{"date-parts":[[2023,5,12]],"date-time":"2023-05-12T10:49:51Z","timestamp":1683888591000},"page":"252","update-policy":"https:\/\/doi.org\/10.3390\/mdpi_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Efficient Mathematical Lower Bounds for City Logistics Distribution Network with Intra-Echelon Connection of Facilities: Bridging the Gap from Theoretical Model Formulations to Practical Solutions"],"prefix":"10.3390","volume":"16","author":[{"given":"Zhiqiang","family":"Niu","sequence":"first","affiliation":[{"name":"Research Center of Logistics, Ministry of Transport Research Institute of Highways, Beijing 100088, China"}]},{"given":"Shengnan","family":"Wu","sequence":"additional","affiliation":[{"name":"Technology and Data Science Department, JD Logistics, Beijing 100176, China"}]},{"given":"Xuesong (Simon)","family":"Zhou","sequence":"additional","affiliation":[{"name":"School of Sustainable Engineering and the Built Environment, Arizona State University, Tempe, AZ 85281, USA"}]}],"member":"1968","published-online":{"date-parts":[[2023,5,12]]},"reference":[{"key":"ref_1","doi-asserted-by":"crossref","first-page":"610","DOI":"10.1016\/j.ejor.2003.04.009","article-title":"Distribution network design: New problems and related models","volume":"165","author":"Ambrosino","year":"2005","journal-title":"Eur. J. Oper. Res."},{"key":"ref_2","doi-asserted-by":"crossref","first-page":"183","DOI":"10.1016\/j.ijpe.2018.05.018","article-title":"Two-stage supply chain design with safety stock placement decisions","volume":"209","author":"Puga","year":"2019","journal-title":"Int. J. Prod. Econ."},{"key":"ref_3","doi-asserted-by":"crossref","first-page":"93","DOI":"10.1016\/j.ijpe.2018.01.028","article-title":"An age-based lateral-transshipment policy for perishable items","volume":"198","author":"Dehghani","year":"2018","journal-title":"Int. J. Prod. Econ."},{"key":"ref_4","doi-asserted-by":"crossref","first-page":"125","DOI":"10.1016\/j.ejor.2010.05.048","article-title":"Inventory models with lateral transshipments: A review","volume":"210","author":"Paterson","year":"2011","journal-title":"Eur. J. Oper. Res."},{"key":"ref_5","first-page":"579","article-title":"Amiya Chakravarty. Sharing and Lateral Transshipment of Inventory in a Supply Chain with Expensive Low-Demand Items","volume":"47","author":"Jovan","year":"2001","journal-title":"Manag. Sci."},{"key":"ref_6","first-page":"2497","article-title":"A graph theory-based algorithm for a multi-echelon multi-period responsive supply chain network design with lateral-transshipments","volume":"20","author":"Rabbani","year":"2020","journal-title":"Oper. Res."},{"key":"ref_7","doi-asserted-by":"crossref","first-page":"17","DOI":"10.1007\/BF01721163","article-title":"Schedule synchronization for public transit networks","volume":"11","author":"Domschke","year":"1989","journal-title":"Oper.-Res.-Spektrum"},{"key":"ref_8","doi-asserted-by":"crossref","first-page":"351","DOI":"10.1007\/s10589-007-9093-1","article-title":"An algorithm for the generalized quadratic assignment problem","volume":"40","author":"Hahn","year":"2008","journal-title":"Comput. Optim. Appl."},{"key":"ref_9","doi-asserted-by":"crossref","first-page":"5943","DOI":"10.1073\/pnas.1811462116","article-title":"Optimizing schools\u2019 start time and bus routes","volume":"116","author":"Bertsimas","year":"2019","journal-title":"Proc. Natl. Acad. Sci. USA"},{"key":"ref_10","doi-asserted-by":"crossref","first-page":"829","DOI":"10.1016\/j.ejor.2017.08.025","article-title":"Logical and inequality implications for reducing the size and difficulty of quadratic unconstrained binary optimization problems","volume":"265","author":"Glover","year":"2018","journal-title":"Eur. J. Oper. Res."},{"key":"ref_11","doi-asserted-by":"crossref","first-page":"141","DOI":"10.1007\/s10479-022-04634-2","article-title":"Quantum Bridge Analytics I: A tutorial on formulating and using QUBO models","volume":"314","author":"Glover","year":"2022","journal-title":"Ann. Oper. Res."},{"key":"ref_12","unstructured":"Kochenberger, G.A., and Glover, F. (2006). Multiscale Optimization Methods and Applications, Springer."},{"key":"ref_13","doi-asserted-by":"crossref","first-page":"347","DOI":"10.1016\/j.ins.2020.06.036","article-title":"A hybrid method integrating an elite genetic algorithm with tabu search for the quadratic assignment problem","volume":"539","author":"Zhang","year":"2020","journal-title":"Inf. Sci."},{"key":"ref_14","doi-asserted-by":"crossref","first-page":"595","DOI":"10.1016\/j.asoc.2019.01.001","article-title":"Artificial bee colony optimization for the quadratic assignment problem","volume":"76","author":"Dokeroglu","year":"2019","journal-title":"Appl. Soft Comput."},{"key":"ref_15","doi-asserted-by":"crossref","first-page":"131","DOI":"10.3233\/JHS-220684","article-title":"A discrete artificial bee colony algorithm for quadratic assignment problem","volume":"28","author":"Peng","year":"2022","journal-title":"J. High Speed Netw."},{"key":"ref_16","doi-asserted-by":"crossref","first-page":"109220","DOI":"10.1016\/j.cie.2023.109220","article-title":"A New Hybrid-heuristic for Large-scale Combinatorial Optimization: A Case of Quadratic Assignment Problem","volume":"179","author":"Wang","year":"2023","journal-title":"Comput. Ind. Eng."},{"key":"ref_17","doi-asserted-by":"crossref","first-page":"497","DOI":"10.1007\/s11067-013-9196-4","article-title":"Integrated inventory control and facility location decisions in a multi-echelon supply chain network with hubs","volume":"13","author":"Shahabi","year":"2013","journal-title":"Netw. Spat. Econ."},{"key":"ref_18","doi-asserted-by":"crossref","first-page":"21","DOI":"10.1016\/j.advengsoft.2012.03.003","article-title":"A Lagrangian based solution algorithm for a build-to-order supply chain network design problem","volume":"49","author":"Shi","year":"2012","journal-title":"Adv. Eng. Softw."},{"key":"ref_19","doi-asserted-by":"crossref","first-page":"263","DOI":"10.1016\/S0360-8352(02)00074-8","article-title":"A combined model of network design and production\/distribution planning for a supply network","volume":"43","author":"Jang","year":"2002","journal-title":"Comput. Ind. Eng."},{"key":"ref_20","doi-asserted-by":"crossref","first-page":"1312","DOI":"10.1016\/j.cie.2018.10.010","article-title":"Optimization of a multi-echelon sustainable production-distribution supply chain system with lead time consideration under carbon emission policies","volume":"135","author":"Manupati","year":"2019","journal-title":"Comput. Ind. Eng."},{"key":"ref_21","doi-asserted-by":"crossref","first-page":"401","DOI":"10.1016\/j.ejor.2008.05.007","article-title":"Facility location and supply chain management\u2013A review","volume":"196","author":"Melo","year":"2009","journal-title":"Eur. J. Oper. Res."},{"key":"ref_22","doi-asserted-by":"crossref","first-page":"594","DOI":"10.1016\/j.ejor.2013.12.032","article-title":"Designing a sustainable closed-loop supply chain network based on triple bottom line approach: A comparison of metaheuristics hybridization techniques","volume":"235","author":"Devika","year":"2014","journal-title":"Eur. J. Oper. Res."},{"key":"ref_23","doi-asserted-by":"crossref","first-page":"11","DOI":"10.1016\/j.omega.2015.01.006","article-title":"Sustainable supply chain network design: An optimization-oriented review","volume":"54","author":"Eskandarpour","year":"2015","journal-title":"Omega"},{"key":"ref_24","doi-asserted-by":"crossref","first-page":"243","DOI":"10.1016\/j.ejor.2007.08.037","article-title":"A two-phase ant colony algorithm for multi-echelon defective supply chain network design","volume":"192","author":"Wang","year":"2009","journal-title":"Eur. J. Oper. Res."},{"key":"ref_25","doi-asserted-by":"crossref","first-page":"6125","DOI":"10.1016\/j.eswa.2010.11.008","article-title":"Location and allocation decisions in a two-echelon supply chain with stochastic demand\u2013A genetic-algorithm based solution","volume":"38","author":"Wang","year":"2011","journal-title":"Expert Syst. Appl."},{"key":"ref_26","doi-asserted-by":"crossref","first-page":"563","DOI":"10.1016\/j.tre.2009.12.004","article-title":"A three-level supply chain network design model with risk-pooling and lead times","volume":"46","author":"Park","year":"2010","journal-title":"Transp. Res. Part E Logist. Transp. Rev."},{"key":"ref_27","doi-asserted-by":"crossref","first-page":"40","DOI":"10.1016\/j.tre.2018.01.004","article-title":"Grain silo location-allocation problem with dwell time for optimization of food grain supply chain network","volume":"111","author":"Mogale","year":"2018","journal-title":"Transp. Res. Part E Logist. Transp. Rev."},{"key":"ref_28","doi-asserted-by":"crossref","first-page":"464","DOI":"10.1016\/S0377-2217(98)00317-8","article-title":"Hierarchical design of an integrated production and 2-echelon distribution system","volume":"118","year":"1999","journal-title":"Eur. J. Oper. Res."},{"key":"ref_29","doi-asserted-by":"crossref","first-page":"2505","DOI":"10.1016\/j.compchemeng.2007.12.006","article-title":"Lagrangean-based techniques for the supply chain management of flexible process networks","volume":"32","author":"Chen","year":"2008","journal-title":"Comput. Chem. Eng."},{"key":"ref_30","doi-asserted-by":"crossref","first-page":"229","DOI":"10.1016\/j.ijpe.2006.11.028","article-title":"A genetic algorithm to optimize the total cost and service level for just-in-time distribution in a supply chain","volume":"111","author":"Farahani","year":"2008","journal-title":"Int. J. Prod. Econ."},{"key":"ref_31","doi-asserted-by":"crossref","first-page":"1205","DOI":"10.1080\/00207540412331327718","article-title":"An integrated approach for production and distribution planning in supply chain management","volume":"43","author":"Park","year":"2005","journal-title":"Int. J. Prod. Res."},{"key":"ref_32","doi-asserted-by":"crossref","first-page":"468","DOI":"10.1016\/j.ijpe.2007.02.035","article-title":"Optimal production allocation and distribution supply chain networks","volume":"111","author":"Tsiakis","year":"2008","journal-title":"Int. J. Prod. Econ."},{"key":"ref_33","doi-asserted-by":"crossref","first-page":"229","DOI":"10.1007\/s00170-015-6796-9","article-title":"A new robust optimization approach for integrated multi-echelon, multi-product, multi-period supply chain network design under process uncertainty","volume":"79","author":"Akbari","year":"2015","journal-title":"Int. J. Adv. Manuf. Technol."},{"key":"ref_34","doi-asserted-by":"crossref","first-page":"343","DOI":"10.1016\/j.asoc.2018.04.011","article-title":"A bi-objective partial interdiction problem considering different defensive systems with capacity expansion of facilities under imminent attacks","volume":"68","year":"2018","journal-title":"Appl. Soft Comput."},{"key":"ref_35","doi-asserted-by":"crossref","first-page":"328","DOI":"10.1016\/j.asoc.2017.11.004","article-title":"A tri-level location-allocation model for forward\/reverse supply chain","volume":"62","year":"2018","journal-title":"Appl. Soft Comput."},{"key":"ref_36","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/j.tre.2017.06.012","article-title":"A two-stage stochastic programming approach for value-based closed-loop supply chain network design","volume":"105","author":"Badri","year":"2017","journal-title":"Transp. Res. Part E Logist. Transp. Rev."},{"key":"ref_37","doi-asserted-by":"crossref","first-page":"176","DOI":"10.1016\/j.tre.2017.02.004","article-title":"Responsive and resilient supply chain network design under operational and disruption risks with delivery lead-time sensitive customers","volume":"101","author":"Fattahi","year":"2017","journal-title":"Transp. Res. Part E Logist. Transp. Rev."},{"key":"ref_38","doi-asserted-by":"crossref","first-page":"263","DOI":"10.1016\/0377-2217(85)90246-2","article-title":"Facility location models for distribution planning","volume":"22","author":"Aikens","year":"1985","journal-title":"Eur. J. Oper. Res."},{"key":"ref_39","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/S0377-2217(97)80080-X","article-title":"Strategic production-distribution models: A critical review with emphasis on global supply chain models","volume":"98","author":"Vidal","year":"1997","journal-title":"Eur. J. Oper. Res."},{"key":"ref_40","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/j.jmsy.2012.07.005","article-title":"A review and critique on integrated production\u2013distribution planning models and techniques","volume":"32","author":"Fahimnia","year":"2013","journal-title":"J. Manuf. Syst."},{"key":"ref_41","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/S0377-2217(02)00142-X","article-title":"Modeling and design of global logistics systems: A review of integrated strategic and tactical models and design algorithms","volume":"143","author":"Goetschalckx","year":"2002","journal-title":"Eur. J. Oper. Res."},{"key":"ref_42","doi-asserted-by":"crossref","first-page":"130","DOI":"10.1287\/opre.1080.0688","article-title":"Integrated production and outbound distribution scheduling: Review and extensions","volume":"58","author":"Chen","year":"2010","journal-title":"Oper. Res."},{"key":"ref_43","doi-asserted-by":"crossref","first-page":"488","DOI":"10.1287\/opre.45.3.488","article-title":"Vehicle routing with time windows: Two optimization algorithms","volume":"45","author":"Fisher","year":"1997","journal-title":"Oper. Res."},{"key":"ref_44","doi-asserted-by":"crossref","first-page":"40","DOI":"10.1287\/trsc.37.1.40.12823","article-title":"A joint location-inventory model","volume":"37","author":"Coullard","year":"2003","journal-title":"Transp. Sci."},{"key":"ref_45","doi-asserted-by":"crossref","first-page":"969","DOI":"10.1016\/j.omega.2012.12.004","article-title":"Multi-echelon supply chain network design in agile manufacturing","volume":"41","author":"Pan","year":"2013","journal-title":"Omega"},{"key":"ref_46","first-page":"1520764","article-title":"An integrated production-distribution planning problem under demand and production capacity uncertainties: New formulation and case study","volume":"2020","author":"Ayadi","year":"2020","journal-title":"Math. Probl. Eng."},{"key":"ref_47","doi-asserted-by":"crossref","first-page":"100697","DOI":"10.1016\/j.seps.2019.03.003","article-title":"Itemized platelet supply chain with lateral transshipment under uncertainty evaluating inappropriate output in laboratories","volume":"68","author":"Larimi","year":"2019","journal-title":"Socio-Econ. Plan. Sci."},{"key":"ref_48","doi-asserted-by":"crossref","first-page":"3585","DOI":"10.1021\/ie0100030","article-title":"Design of multi-echelon supply chain networks under demand uncertainty","volume":"40","author":"Tsiakis","year":"2001","journal-title":"Ind. Eng. Chem. Res."},{"key":"ref_49","doi-asserted-by":"crossref","first-page":"61","DOI":"10.1016\/S0304-0208(08)73232-8","article-title":"Quadratic assignment problems","volume":"132","author":"Finke","year":"1987","journal-title":"North-Holl. Math. Stud."},{"key":"ref_50","doi-asserted-by":"crossref","unstructured":"Abdel-Basset, M., Manogaran, G., Rashad, H., and Zaied, A.N.H. (2018). A comprehensive review of quadratic assignment problem: Variants, hybrids and applications. J. Ambient. Intell. Humaniz. Comput., 1\u201324.","DOI":"10.1007\/s12652-018-0917-x"},{"key":"ref_51","unstructured":"Burkard, R.E., Cela, E., Pardalos, P.M., and Pitsoulis, L.S. (1998). Handbook of Combinatorial Optimization, Springer."},{"key":"ref_52","doi-asserted-by":"crossref","unstructured":"Burkard, R., Dell\u2019Amico, M., and Martello, S. (2012). Assignment Problems: Revised Reprint, Society for Industrial and Applied Mathematics.","DOI":"10.1137\/1.9781611972238"},{"key":"ref_53","doi-asserted-by":"crossref","first-page":"387","DOI":"10.1007\/BF02085649","article-title":"Lower bounds for the quadratic assignment problem","volume":"50","author":"Li","year":"1994","journal-title":"Ann. Oper. Res."},{"key":"ref_54","doi-asserted-by":"crossref","first-page":"2403","DOI":"10.1016\/j.cor.2005.09.012","article-title":"A general heuristic for vehicle routing problems","volume":"34","author":"Pisinger","year":"2007","journal-title":"Comput. Oper. Res."},{"key":"ref_55","unstructured":"Lutz, R. (2015). Adaptive Large Neighborhood Search. [Bachelor\u2019s Thesis, Ulm University]."},{"key":"ref_56","doi-asserted-by":"crossref","first-page":"143","DOI":"10.1016\/j.eswa.2017.04.050","article-title":"An adaptive large neighborhood search heuristic for solving a robust gate assignment problem","volume":"84","author":"Yu","year":"2017","journal-title":"Expert Syst. Appl."},{"key":"ref_57","doi-asserted-by":"crossref","first-page":"364","DOI":"10.1287\/trsc.1110.0368","article-title":"The two-echelon capacitated vehicle routing problem: Models and math-based heuristics","volume":"45","author":"Perboli","year":"2011","journal-title":"Transp. Sci."},{"key":"ref_58","doi-asserted-by":"crossref","first-page":"5944","DOI":"10.1016\/j.sbspro.2010.04.009","article-title":"Two-echelon vehicle routing problem: A satellite location analysis","volume":"2","author":"Crainic","year":"2010","journal-title":"Procedia-Soc. Behav. Sci."},{"key":"ref_59","doi-asserted-by":"crossref","first-page":"140","DOI":"10.1016\/j.trb.2021.08.008","article-title":"Synchronizing time-dependent transportation services: Reformulation and solution algorithm using quadratic assignment problem","volume":"152","author":"Wu","year":"2021","journal-title":"Transp. Res. Part B Methodol."},{"key":"ref_60","doi-asserted-by":"crossref","unstructured":"Ayodele, M., Allmendinger, R., L\u00f3pez-Ib\u00e1\u00f1ez, M., and Parizy, M. (2022, January 9\u201313). Multi-objective QUBO solver: Bi-objective quadratic assignment problem. Proceedings of the Genetic and Evolutionary Computation Conference, Boston, MA, USA.","DOI":"10.1145\/3512290.3528698"},{"key":"ref_61","doi-asserted-by":"crossref","first-page":"100594","DOI":"10.1016\/j.disopt.2020.100594","article-title":"Penalty and partitioning techniques to improve performance of QUBO solvers","volume":"44","author":"Verma","year":"2020","journal-title":"Discret. Optim."},{"key":"ref_62","unstructured":"Leslie, P.C., and S\u00e9bastien, V. (2022, January 20\u201322). Penalty Weights in QUBO Formulations: Permutation Problems. Proceedings of the EvoCOP 2022\u201322nd European Conference on Evolutionary Computation in Combinatorial Optimization, Madrid, Spain."},{"key":"ref_63","doi-asserted-by":"crossref","first-page":"143","DOI":"10.1016\/j.trb.2022.10.011","article-title":"Rich arc routing problem in city logistics: Models and solution algorithms using a fluid queue-based time-dependent travel time representation","volume":"166","author":"Lu","year":"2022","journal-title":"Transp. Res. Part B Methodol."},{"key":"ref_64","doi-asserted-by":"crossref","first-page":"305","DOI":"10.1137\/0110022","article-title":"Optimal and suboptimal algorithms for the quadratic assignment problem","volume":"10","author":"Gilmore","year":"1962","journal-title":"J. Soc. Ind. Appl. Math."},{"key":"ref_65","doi-asserted-by":"crossref","first-page":"781","DOI":"10.1287\/opre.43.5.781","article-title":"Computing lower bounds for the quadratic assignment problem with an interior point algorithm for linear programming","volume":"43","author":"Resende","year":"1995","journal-title":"Oper. Res."},{"key":"ref_66","doi-asserted-by":"crossref","first-page":"912","DOI":"10.1287\/opre.46.6.912","article-title":"Lower bounds for the quadratic assignment problem based upon a dual formulation","volume":"46","author":"Hahn","year":"1998","journal-title":"Oper. Res."},{"key":"ref_67","doi-asserted-by":"crossref","first-page":"351","DOI":"10.1007\/s006070050040","article-title":"A dual framework for lower bounds of the quadratic assignment problem based on linearization","volume":"63","author":"Karisch","year":"1999","journal-title":"Computing"},{"key":"ref_68","doi-asserted-by":"crossref","first-page":"341","DOI":"10.1007\/PL00011402","article-title":"A new bound for the quadratic assignment problem based on convex quadratic programming","volume":"89","author":"Anstreicher","year":"2001","journal-title":"Math. Program."},{"key":"ref_69","unstructured":"Ramakrishnan, K.G., Resende MG, C., Ramachandran, B., and Pekny, J.F. (2002). Combinatorial and Global Optimization, World Scientific."},{"key":"ref_70","unstructured":"Sotirov, R., and Rendl, F. (2003). Discrete Optimization: Methods and Applications, University of Klagenfurt."},{"key":"ref_71","doi-asserted-by":"crossref","first-page":"469","DOI":"10.1007\/s10878-004-4838-6","article-title":"From linear to semidefinite programming: An algorithm to obtain semidefinite relaxations for bivalent quadratic problems","volume":"8","author":"Roupin","year":"2004","journal-title":"J. Comb. Optim."},{"key":"ref_72","doi-asserted-by":"crossref","first-page":"726","DOI":"10.1137\/040609574","article-title":"Solving lift-and-project relaxations of binary integer programs","volume":"16","author":"Burer","year":"2006","journal-title":"SIAM J. Optim."},{"key":"ref_73","doi-asserted-by":"crossref","first-page":"983","DOI":"10.1016\/j.ejor.2006.03.051","article-title":"A level-2 reformulation\u2013linearization technique bound for the quadratic assignment problem","volume":"180","author":"Adams","year":"2007","journal-title":"Eur. J. Oper. Res."}],"container-title":["Algorithms"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.mdpi.com\/1999-4893\/16\/5\/252\/pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,10,10]],"date-time":"2025-10-10T19:34:03Z","timestamp":1760124843000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.mdpi.com\/1999-4893\/16\/5\/252"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023,5,12]]},"references-count":73,"journal-issue":{"issue":"5","published-online":{"date-parts":[[2023,5]]}},"alternative-id":["a16050252"],"URL":"https:\/\/doi.org\/10.3390\/a16050252","relation":{},"ISSN":["1999-4893"],"issn-type":[{"type":"electronic","value":"1999-4893"}],"subject":[],"published":{"date-parts":[[2023,5,12]]}}}