{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,10]],"date-time":"2026-02-10T16:03:46Z","timestamp":1770739426981,"version":"3.49.0"},"reference-count":54,"publisher":"Springer Science and Business Media LLC","issue":"4","license":[{"start":{"date-parts":[[2021,8,30]],"date-time":"2021-08-30T00:00:00Z","timestamp":1630281600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2021,8,30]],"date-time":"2021-08-30T00:00:00Z","timestamp":1630281600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"funder":[{"DOI":"10.13039\/501100003399","name":"Science and Technology Commission of Shanghai Municipality","doi-asserted-by":"crossref","award":["9JC1420101"],"award-info":[{"award-number":["9JC1420101"]}],"id":[{"id":"10.13039\/501100003399","id-type":"DOI","asserted-by":"crossref"}]},{"name":"Shanghai Municipal Science and Technology Major Project","award":["2018SHZDZX01"],"award-info":[{"award-number":["2018SHZDZX01"]}]},{"name":"Shanghai Committee of Science and Technology","award":["14DZ1118700"],"award-info":[{"award-number":["14DZ1118700"]}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["J Glob Optim"],"published-print":{"date-parts":[[2022,4]]},"DOI":"10.1007\/s10898-021-01078-z","type":"journal-article","created":{"date-parts":[[2021,8,30]],"date-time":"2021-08-30T02:03:26Z","timestamp":1630289006000},"page":"803-834","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":4,"title":["Asynchronous optimization of part logistics routing problem"],"prefix":"10.1007","volume":"82","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-0676-4840","authenticated-orcid":false,"given":"Yaoting","family":"Huang","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Boyu","family":"Chen","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Wenlian","family":"Lu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Zhong-Xiao","family":"Jin","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ren","family":"Zheng","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2021,8,30]]},"reference":[{"issue":"3","key":"1078_CR1","doi-asserted-by":"publisher","first-page":"209","DOI":"10.1016\/0167-9260(86)90002-7","volume":"4","author":"EH Aarts","year":"1986","unstructured":"Aarts, E.H., de Bont, F.M., Habers, E.H., van Laarhoven, P.J.: Parallel implementations of the statistical cooling algorithm. Integration 4(3), 209\u2013238 (1986). https:\/\/doi.org\/10.1016\/0167-9260(86)90002-7","journal-title":"Integration"},{"issue":"11","key":"1078_CR2","doi-asserted-by":"publisher","first-page":"1422","DOI":"10.1057\/s41274-016-0151-x","volume":"68","author":"M Alinaghian","year":"2017","unstructured":"Alinaghian, M., Zamanlou, K., Sabbagh, M.S.: A bi-objective mathematical model for two-dimensional loading time-dependent vehicle routing problem. J. Oper. Res. Soc. 68(11), 1422\u20131441 (2017). https:\/\/doi.org\/10.1057\/s41274-016-0151-x","journal-title":"J. Oper. Res. Soc."},{"key":"1078_CR3","doi-asserted-by":"publisher","unstructured":"Anbuudayasankar, S.P., Ganesh, K., Mohapatra, S.: Survey of methodologies for TSP and VRP. In: Models for Practical Routing Problems in Logistics, pp. 11\u201342. Springer, Cham (2014). https:\/\/doi.org\/10.1007\/978-3-319-05035-5_2","DOI":"10.1007\/978-3-319-05035-5_2"},{"issue":"2","key":"1078_CR4","doi-asserted-by":"publisher","first-page":"233","DOI":"10.1016\/S0377-2217(01)00206-5","volume":"137","author":"E Angelelli","year":"2002","unstructured":"Angelelli, E., Grazia Speranza, M.: The periodic vehicle routing problem with intermediate facilities. Eur. J. Oper. Res. 137(2), 233\u2013247 (2002). https:\/\/doi.org\/10.1016\/S0377-2217(01)00206-5","journal-title":"Eur. J. Oper. Res."},{"issue":"1","key":"1078_CR5","doi-asserted-by":"publisher","first-page":"26","DOI":"10.1111\/itor.12480","volume":"27","author":"A Anoki\u0107","year":"2020","unstructured":"Anoki\u0107, A., Stanimirovi\u0107, Z., Davidovi\u0107, T., Staki\u0107, D.: Variable neighborhood search based approaches to a vehicle scheduling problem in agriculture. Int. Trans. Oper. Res. 27(1), 26\u201356 (2020). https:\/\/doi.org\/10.1111\/itor.12480","journal-title":"Int. Trans. Oper. Res."},{"issue":"1","key":"1078_CR6","doi-asserted-by":"publisher","first-page":"33","DOI":"10.1080\/21681015.2020.1727970","volume":"37","author":"E Araee","year":"2020","unstructured":"Araee, E., Manavizadeh, N., Bosjin, S.A.: Designing a multi-objective model for a hazardous waste routing problem considering flexibility of routes and social effects. J. Ind. Prod. Eng. 37(1), 33\u201345 (2020). https:\/\/doi.org\/10.1080\/21681015.2020.1727970","journal-title":"J. Ind. Prod. Eng."},{"issue":"4","key":"1078_CR7","doi-asserted-by":"publisher","first-page":"359","DOI":"10.1016\/0305-0548(94)90024-8","volume":"21","author":"B Borchers","year":"1994","unstructured":"Borchers, B., Mitchell, J.E.: An improved branch and bound algorithm for mixed integer nonlinear programs. Comput. Oper. Res. 21(4), 359\u2013367 (1994). https:\/\/doi.org\/10.1016\/0305-0548(94)90024-8","journal-title":"Comput. Oper. Res."},{"key":"1078_CR8","doi-asserted-by":"publisher","first-page":"300","DOI":"10.1016\/j.cie.2015.12.007","volume":"99","author":"K Braekers","year":"2016","unstructured":"Braekers, K., Ramaekers, K., Van Nieuwenhuyse, I.: The vehicle routing problem: state of the art classification and review. Comput. Ind. Eng. 99, 300\u2013313 (2016). https:\/\/doi.org\/10.1016\/j.cie.2015.12.007","journal-title":"Comput. Ind. Eng."},{"issue":"6","key":"1078_CR9","doi-asserted-by":"publisher","first-page":"942","DOI":"10.1109\/TEVC.2010.2041061","volume":"14","author":"EK Burke","year":"2010","unstructured":"Burke, E.K., Hyde, M., Kendall, G., Woodward, J.: A genetic programming hyper-heuristic approach for evolving 2-D strip packing heuristics. IEEE Trans. Evol. Comput. 14(6), 942\u2013958 (2010). https:\/\/doi.org\/10.1109\/TEVC.2010.2041061","journal-title":"IEEE Trans. Evol. Comput."},{"key":"1078_CR10","doi-asserted-by":"publisher","first-page":"860","DOI":"10.1007\/11844297_87","volume-title":"Parallel Problem Solving from Nature - PPSN IX","author":"EK Burke","year":"2006","unstructured":"Burke, E.K., Hyde, M.R., Kendall, G.: Evolving bin packing heuristics with genetic programming. In: Hutchison, D., Kanade, T., Kittler, J., Kleinberg, J.M., Mattern, F., Mitchell, J.C., Naor, M., Nierstrasz, O., PanduRangan, C., Steffen, B., Sudan, M., Terzopoulos, D., Tygar, D., Vardi, M.Y., Weikum, G., Runarsson, T.P., Beyer, H.G., Burke, E., Merelo-Guerv\u00f3s, J.J., Whitley, L.D., Yao, X. (eds.) Parallel Problem Solving from Nature - PPSN IX, vol. 4193, pp. 860\u2013869. Springer, Berlin, Heidelberg (2006). https:\/\/doi.org\/10.1007\/11844297_87"},{"key":"1078_CR11","unstructured":"Christensen, H.I., Khan, A., Pokutta, S., Tetali, P.: Multidimensional bin packing and other related problems: a survey (2016). https:\/\/www.semanticscholar.org\/paper\/Multidimensional-Bin-Packing-and-Other-Related-A-Christensen-Khan\/bbcf4ca2524cd50fdb03b180aa5f98d2daa759ce"},{"issue":"4","key":"1078_CR12","doi-asserted-by":"publisher","first-page":"808","DOI":"10.1137\/0209062","volume":"9","author":"EG Coffman Jr","year":"1980","unstructured":"Coffman, E.G., Jr., Garey, M.R., Johnson, D.S., Tarjan, R.E.: Performance bounds for level-oriented two-dimensional packing algorithms. SIAM J. Comput. 9(4), 808\u2013826 (1980). https:\/\/doi.org\/10.1137\/0209062","journal-title":"SIAM J. Comput."},{"key":"1078_CR13","volume-title":"Introduction to Algorithms","year":"2009","unstructured":"Cormen, T.H. (ed.): Introduction to Algorithms, 3rd edn. MIT Press, Cambridge (2009)","edition":"3"},{"issue":"4","key":"1078_CR14","doi-asserted-by":"publisher","first-page":"767","DOI":"10.2307\/1911818","volume":"29","author":"GB Dantzig","year":"1961","unstructured":"Dantzig, G.B., Wolfe, P.: The decomposition algorithm for linear programs. Econometrica 29(4), 767 (1961). https:\/\/doi.org\/10.2307\/1911818","journal-title":"Econometrica"},{"issue":"2","key":"1078_CR15","doi-asserted-by":"publisher","first-page":"342","DOI":"10.1287\/opre.40.2.342","volume":"40","author":"M Desrochers","year":"1992","unstructured":"Desrochers, M., Desrosiers, J., Solomon, M.: A new optimization algorithm for the vehicle routing problem with time windows. Oper. Res. 40(2), 342\u2013354 (1992). https:\/\/doi.org\/10.1287\/opre.40.2.342","journal-title":"Oper. Res."},{"issue":"3\u20134","key":"1078_CR16","doi-asserted-by":"publisher","first-page":"301","DOI":"10.1080\/01966324.1986.10737198","volume":"6","author":"J Desrosiers","year":"1986","unstructured":"Desrosiers, J., Dumas, Y., Soumis, F.: A dynamic programming solution of the large-scale single-vehicle dial-a-ride problem with time windows. Am. J. Math. Manag. Sci. 6(3\u20134), 301\u2013325 (1986). https:\/\/doi.org\/10.1080\/01966324.1986.10737198","journal-title":"Am. J. Math. Manag. Sci."},{"key":"1078_CR17","series-title":"Advances in Intelligent Systems and Computing","doi-asserted-by":"publisher","first-page":"539","DOI":"10.1007\/978-981-13-0761-4_52","volume-title":"Harmony Search and Nature Inspired Optimization Algorithms","author":"A Dixit","year":"2019","unstructured":"Dixit, A., Mishra, A., Shukla, A.: Vehicle routing problem with time windows using meta-heuristic algorithms: a survey. In: Yadav, N., Yadav, A., Bansal, J.C., Deep, K., Kim, J.H. (eds.) Harmony Search and Nature Inspired Optimization Algorithms. Advances in Intelligent Systems and Computing, pp. 539\u2013546. Springer, Berlin (2019). https:\/\/doi.org\/10.1007\/978-981-13-0761-4_52"},{"key":"1078_CR18","doi-asserted-by":"publisher","first-page":"106242","DOI":"10.1016\/j.cie.2019.106242","volume":"140","author":"R Elshaer","year":"2020","unstructured":"Elshaer, R., Awad, H.: A taxonomic review of metaheuristic algorithms for solving the vehicle routing problem and its variants. Comput. Ind. Eng. 140, 106242 (2020). https:\/\/doi.org\/10.1016\/j.cie.2019.106242","journal-title":"Comput. Ind. Eng."},{"key":"1078_CR19","unstructured":"Fleischmann, B.: The vehicle routing problem with multiple use of vehicles, p.\u00a020 (1990). https:\/\/www.researchgate.net\/publication\/221704650_The_vehicle_routing_problem_with_multiple_use_of_vehicles"},{"issue":"1","key":"1078_CR20","doi-asserted-by":"publisher","first-page":"4","DOI":"10.1002\/net.20192","volume":"51","author":"M Gendreau","year":"2008","unstructured":"Gendreau, M., Iori, M., Laporte, G., Martello, S.: A Tabu search heuristic for the vehicle routing problem with two-dimensional loading constraints. Networks 51(1), 4\u201318 (2008). https:\/\/doi.org\/10.1002\/net.20192","journal-title":"Networks"},{"issue":"14","key":"1078_CR21","doi-asserted-by":"publisher","first-page":"4201","DOI":"10.1080\/00207543.2019.1650975","volume":"58","author":"I Harbaoui Dridi","year":"2020","unstructured":"Harbaoui Dridi, I., Ben Ala\u00efa, E., Borne, P., Bouchriha, H.: Optimisation of the multi-depots pick-up and delivery problems with time windows and multi-vehicles using PSO algorithm. Int. J. Prod. Res. 58(14), 4201\u20134214 (2020). https:\/\/doi.org\/10.1080\/00207543.2019.1650975","journal-title":"Int. J. Prod. Res."},{"key":"1078_CR22","first-page":"14","volume":"39","author":"VC Hemmelmayr","year":"2012","unstructured":"Hemmelmayr, V.C.: An adaptive large neighborhood search heuristic for two-echelon vehicle routing problems arising in city logistics. Oper. Res. 39, 14 (2012)","journal-title":"Oper. Res."},{"issue":"4","key":"1078_CR23","doi-asserted-by":"publisher","first-page":"257","DOI":"10.1023\/A:1012590107280","volume":"16","author":"E Hopper","year":"2001","unstructured":"Hopper, E., Turton, B.C.H.: A review of the application of meta-heuristic algorithms to 2D strip packing problems. Artif. Intell. Rev. 16(4), 257\u2013300 (2001). https:\/\/doi.org\/10.1023\/A:1012590107280","journal-title":"Artif. Intell. Rev."},{"key":"1078_CR24","unstructured":"Hu, H., Zhang, X., Yan, X., Wang, L., Xu, Y.: Solving a new 3D bin packing problem with deep reinforcement learning method (2017). arXiv:1708.05930 [cs]"},{"issue":"2","key":"1078_CR25","doi-asserted-by":"publisher","first-page":"253","DOI":"10.1287\/trsc.1060.0165","volume":"41","author":"M Iori","year":"2007","unstructured":"Iori, M., Salazar-Gonz\u00e1lez, J.J., Vigo, D.: An exact approach for the vehicle routing problem with two-dimensional loading constraints. Transp. Sci. 41(2), 253\u2013264 (2007). https:\/\/doi.org\/10.1287\/trsc.1060.0165","journal-title":"Transp. Sci."},{"key":"1078_CR26","doi-asserted-by":"publisher","DOI":"10.1145\/1460833.1460872","volume-title":"A Programming Language","author":"KE Iverson","year":"1962","unstructured":"Iverson, K.E.: A Programming Language. Wiley, New York (1962)"},{"issue":"1","key":"1078_CR27","doi-asserted-by":"publisher","first-page":"36","DOI":"10.30560\/sdr.v3n1p36","volume":"3","author":"DGND Jayarathna","year":"2021","unstructured":"Jayarathna, D.G.N.D., Lanel, G.H.J., Juman, Z.A.M.S.: Survey on ten years of multi-depot vehicle routing problems: mathematical models, solution methods and real-life applications. Sustain. Dev. Res. 3(1), 36 (2021). https:\/\/doi.org\/10.30560\/sdr.v3n1p36","journal-title":"Sustain. Dev. Res."},{"issue":"4598","key":"1078_CR28","doi-asserted-by":"publisher","first-page":"671","DOI":"10.1126\/science.220.4598.671","volume":"220","author":"S Kirkpatrick","year":"1983","unstructured":"Kirkpatrick, S., Gelatt, C.D., Vecchi, M.P.: Optimization by simulated annealing. Science 220(4598), 671\u2013680 (1983). https:\/\/doi.org\/10.1126\/science.220.4598.671","journal-title":"Science"},{"key":"1078_CR29","doi-asserted-by":"publisher","first-page":"79","DOI":"10.1016\/j.cor.2017.11.003","volume":"91","author":"C Ko\u00e7","year":"2019","unstructured":"Ko\u00e7, C., Laporte, G.: Vehicle routing with backhauls. Rev. Res. Perspect. 91, 79\u201391 (2019). https:\/\/doi.org\/10.1016\/j.cor.2017.11.003","journal-title":"Rev. Res. Perspect."},{"key":"1078_CR30","doi-asserted-by":"publisher","first-page":"104987","DOI":"10.1016\/j.cor.2020.104987","volume":"122","author":"C Ko\u00e7","year":"2020","unstructured":"Ko\u00e7, C., Laporte, G., T\u00fckenmez, I.: A review of vehicle routing with simultaneous pickup and delivery. Comput. Oper. Res. 122, 104987 (2020). https:\/\/doi.org\/10.1016\/j.cor.2020.104987","journal-title":"Comput. Oper. Res."},{"issue":"1","key":"1078_CR31","doi-asserted-by":"publisher","first-page":"71","DOI":"10.1007\/s10951-019-00625-7","volume":"23","author":"H Koch","year":"2020","unstructured":"Koch, H., Schl\u00f6gell, M., Bortfeldt, A.: A hybrid algorithm for the vehicle routing problem with three-dimensional loading constraints and mixed backhauls. J. Sched. 23(1), 71\u201393 (2020). https:\/\/doi.org\/10.1007\/s10951-019-00625-7","journal-title":"J. Sched."},{"key":"1078_CR32","doi-asserted-by":"publisher","first-page":"285","DOI":"10.1016\/S0969-6016(00)00003-4","volume":"7","author":"G Laporte","year":"2000","unstructured":"Laporte, G.: Classical and modern heuristics for the vehicle routing problem. Int. Trans. Oper. Res. 7, 285\u2013300 (2000). https:\/\/doi.org\/10.1016\/S0969-6016(00)00003-4","journal-title":"Int. Trans. Oper. Res."},{"issue":"6","key":"1078_CR33","doi-asserted-by":"publisher","first-page":"655","DOI":"10.1134\/S1064226918060177","volume":"63","author":"MS Levin","year":"2018","unstructured":"Levin, M.S.: Bin packing problems (promising models and examples). J. Commun. Technol. Electron. 63(6), 655\u2013666 (2018). https:\/\/doi.org\/10.1134\/S1064226918060177","journal-title":"J. Commun. Technol. Electron."},{"issue":"3","key":"1078_CR34","doi-asserted-by":"publisher","first-page":"473","DOI":"10.1108\/IMDS-07-2018-0314","volume":"119","author":"Y Li","year":"2018","unstructured":"Li, Y., Lim, M.K., Tseng, M.L.: A green vehicle routing model based on modified particle swarm optimization for cold chain logistics. Ind. Manag. Data Syst. 119(3), 473\u2013494 (2018). https:\/\/doi.org\/10.1108\/IMDS-07-2018-0314","journal-title":"Ind. Manag. Data Syst."},{"issue":"2","key":"1078_CR35","doi-asserted-by":"publisher","first-page":"241","DOI":"10.1016\/S0377-2217(02)00123-6","volume":"141","author":"A Lodi","year":"2002","unstructured":"Lodi, A., Martello, S., Monaci, M.: Two-dimensional packing problems: a survey. Eur. J. Oper. Res. 141(2), 241\u2013252 (2002). https:\/\/doi.org\/10.1016\/S0377-2217(02)00123-6","journal-title":"Eur. J. Oper. Res."},{"issue":"2","key":"1078_CR36","doi-asserted-by":"publisher","first-page":"169","DOI":"10.1109\/TSMCA.2002.806498","volume":"33","author":"LH Lee","year":"2003","unstructured":"Lee, L.H., Tan, K.C., Ou, K., Chew, Y.H.: Vehicle capacity planning system: a case study on vehicle routing problem with time windows. IEEE Trans. Syst. Man Cybern. Part A Syst. Hum. 33(2), 169\u2013178 (2003). https:\/\/doi.org\/10.1109\/TSMCA.2002.806498","journal-title":"IEEE Trans. Syst. Man Cybern. Part A Syst. Hum."},{"issue":"4","key":"1078_CR37","doi-asserted-by":"publisher","first-page":"989","DOI":"10.1007\/s10898-020-00965-1","volume":"79","author":"F Majzoubi","year":"2021","unstructured":"Majzoubi, F., Bai, L., Heragu, S.S.: The ems vehicle patient transportation problem during a demand surge. J. Glob. Optim. 79(4), 989\u20131006 (2021). https:\/\/doi.org\/10.1007\/s10898-020-00965-1","journal-title":"J. Glob. Optim."},{"key":"1078_CR38","unstructured":"Malapert, A., Gu\u00e9ret, C., Jussien, N., Langevin, A., Rousseau, L.M.: Two-dimensional pickup and delivery routing problem with loading constraints. First CPAIOR Workshop on Bin Packing and Placement Constraints (BPPC\u201908), May 2008, Paris, France. $$<$$hal-00363126$$>$$ (2008)"},{"key":"1078_CR39","unstructured":"Martelot, E.L., Hankin, C.: Fast multi-scale community detection based on local criteria within a multi-threaded algorithm (2013). arXiv:1301.0955 [physics]"},{"key":"1078_CR40","doi-asserted-by":"publisher","first-page":"137","DOI":"10.1016\/j.trd.2018.04.025","volume":"63","author":"MA Masmoudi","year":"2018","unstructured":"Masmoudi, M.A., Hosny, M., Demir, E., Cheikhrouhou, N.: A study on the heterogeneous fleet of alternative fuel vehicles: reducing CO2 emissions by means of biodiesel fuel. Transp. Res. Part D Transp. Environ. 63, 137\u2013155 (2018). https:\/\/doi.org\/10.1016\/j.trd.2018.04.025","journal-title":"Transp. Res. Part D Transp. Environ."},{"key":"1078_CR41","doi-asserted-by":"publisher","first-page":"197","DOI":"10.1590\/0101-7438.2016.036.02.0197","volume":"36","author":"JF Oliveira","year":"2016","unstructured":"Oliveira, J.F., Neuenfeldt, A., Silva, E., Carravilla, M.A.: A survey on heuristics for the two-dimensional rectangular strip packing problem. Pesquisa Oper. 36, 197\u2013226 (2016)","journal-title":"Pesquisa Oper."},{"issue":"2","key":"1078_CR42","doi-asserted-by":"publisher","first-page":"197","DOI":"10.1590\/0101-7438.2016.036.02.0197","volume":"36","author":"JF Oliveira","year":"2016","unstructured":"Oliveira, J.F., Neuenfeldt J\u00fanior, A., Silva, E., Carravilla, M.A.: A survey on heuristics for the two-dimensional rectangular strip packing problem. Pesquisa Oper. 36(2), 197\u2013226 (2016). https:\/\/doi.org\/10.1590\/0101-7438.2016.036.02.0197","journal-title":"Pesquisa Oper."},{"issue":"1","key":"1078_CR43","doi-asserted-by":"publisher","first-page":"21","DOI":"10.1007\/s11301-008-0033-7","volume":"58","author":"SN Parragh","year":"2008","unstructured":"Parragh, S.N., Doerner, K.F., Hartl, R.F.: A survey on pickup and delivery problems. J. Betriebswirtschaft 58(1), 21\u201351 (2008). https:\/\/doi.org\/10.1007\/s11301-008-0033-7","journal-title":"J. Betriebswirtschaft"},{"issue":"1","key":"1078_CR44","doi-asserted-by":"publisher","first-page":"5","DOI":"10.1007\/s10479-017-2642-9","volume":"273","author":"PHV Penna","year":"2019","unstructured":"Penna, P.H.V., Subramanian, A., Ochi, L.S., Vidal, T., Prins, C.: A hybrid heuristic for a broad class of vehicle routing problems with heterogeneous fleet. Ann. Oper. Res. 273(1), 5\u201374 (2019). https:\/\/doi.org\/10.1007\/s10479-017-2642-9","journal-title":"Ann. Oper. Res."},{"issue":"1","key":"1078_CR45","doi-asserted-by":"publisher","first-page":"549","DOI":"10.1111\/itor.12509","volume":"27","author":"T Pinto","year":"2020","unstructured":"Pinto, T., Alves, C., Val\u00e9rio de Carvalho, J.: Variable neighborhood search algorithms for the vehicle routing problem with two-dimensional loading constraints and mixed linehauls and backhauls. Int. Trans. Oper. Res. 27(1), 549\u2013572 (2020). https:\/\/doi.org\/10.1111\/itor.12509","journal-title":"Int. Trans. Oper. Res."},{"key":"1078_CR46","doi-asserted-by":"publisher","first-page":"012014","DOI":"10.1088\/1757-899X\/352\/1\/012014","volume":"352","author":"H Prasetyo","year":"2018","unstructured":"Prasetyo, H., Alfatsani, M.A., Fauza, G.: Solving capacitated closed vehicle routing problem with time windows (CCVRPTW) using BRKGA with local search. IOP Conf. Ser. Mater. Sci. Eng. 352, 012014 (2018). https:\/\/doi.org\/10.1088\/1757-899X\/352\/1\/012014","journal-title":"IOP Conf. Ser. Mater. Sci. Eng."},{"key":"1078_CR47","doi-asserted-by":"publisher","first-page":"100730","DOI":"10.1016\/j.swevo.2020.100730","volume":"58","author":"NR Sabar","year":"2020","unstructured":"Sabar, N.R., Bhaskar, A., Chung, E., Turky, A., Song, A.: An adaptive memetic approach for heterogeneous vehicle routing problems with two-dimensional loading constraints. Swarm Evol. Comput. 58, 100730 (2020). https:\/\/doi.org\/10.1016\/j.swevo.2020.100730","journal-title":"Swarm Evol. Comput."},{"key":"1078_CR48","doi-asserted-by":"publisher","unstructured":"Sbai, I., Krichen, S.: An adaptive genetic algorithm for dynamic vehicle routing problem with backhaul and two-dimensional loading constraints. In: 2020 International Multi-Conference on: \u201cOrganization of Knowledge and Advanced Technologies\u201d (OCTA), pp. 1\u20137. IEEE, Tunis, Tunisia (2020). https:\/\/doi.org\/10.1109\/OCTA49274.2020.9151691","DOI":"10.1109\/OCTA49274.2020.9151691"},{"key":"1078_CR49","doi-asserted-by":"publisher","first-page":"170","DOI":"10.1287\/trsc.31.2.170","volume":"31","author":"\u00c9 Taillard","year":"1997","unstructured":"Taillard, \u00c9., Badeau, P., Gendreau, M., Guertin, F., Potvin, J.Y.: A Tabu search heuristic for the vehicle routing problem with soft time windows. Transp. Sci. 31, 170\u2013186 (1997). https:\/\/doi.org\/10.1287\/trsc.31.2.170","journal-title":"Transp. Sci."},{"key":"1078_CR50","doi-asserted-by":"crossref","unstructured":"Toth, P., Vigo, D.: Vehicle Routing: Problems, Methods, and Applications. SIAM, Philadelphia (2014). https:\/\/doi.org\/10.4028\/www.scientific.net\/MSF.594.119","DOI":"10.1137\/1.9781611973594"},{"key":"1078_CR51","doi-asserted-by":"publisher","first-page":"119","DOI":"10.4028\/www.scientific.net\/MSF.594.119","volume":"594","author":"C Trappey","year":"2008","unstructured":"Trappey, C., Trappey, A., Liu, C.S., Lee, W., Hung, Y.: The design and evaluation of a supply chain logistic hub for automobile and parts distribution. Mater. Sci. Forum 594, 119\u2013131 (2008)","journal-title":"Mater. Sci. Forum"},{"issue":"3","key":"1078_CR52","doi-asserted-by":"publisher","first-page":"843","DOI":"10.1016\/j.ejor.2017.08.035","volume":"265","author":"L Wei","year":"2018","unstructured":"Wei, L., Zhang, Z., Zhang, D., Leung, S.C.: A simulated annealing algorithm for the capacitated vehicle routing problem with two-dimensional loading constraints. Eur. J. Oper. Res. 265(3), 843\u2013859 (2018). https:\/\/doi.org\/10.1016\/j.ejor.2017.08.035","journal-title":"Eur. J. Oper. Res."},{"issue":"1","key":"1078_CR53","doi-asserted-by":"publisher","first-page":"115","DOI":"10.1007\/s12351-015-0218-5","volume":"17","author":"EE Zachariadis","year":"2017","unstructured":"Zachariadis, E.E., Tarantilis, C.D., Kiranoudis, C.T.: Vehicle routing strategies for pick-up and delivery service under two dimensional loading constraints. Oper. Res. 17(1), 115\u2013143 (2017). https:\/\/doi.org\/10.1007\/s12351-015-0218-5","journal-title":"Oper. Res."},{"key":"1078_CR54","doi-asserted-by":"publisher","first-page":"31934","DOI":"10.1109\/ACCESS.2020.2971220","volume":"8","author":"X Zhu","year":"2020","unstructured":"Zhu, X., Yan, R., Huang, Z., Wei, W., Yang, J., Kudratova, S.: Logistic optimization for multi depots loading capacitated electric vehicle routing problem from low carbon perspective. IEEE Access 8, 31934\u201331947 (2020). https:\/\/doi.org\/10.1109\/ACCESS.2020.2971220","journal-title":"IEEE Access"}],"container-title":["Journal of Global Optimization"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10898-021-01078-z.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s10898-021-01078-z\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10898-021-01078-z.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,4,6]],"date-time":"2022-04-06T05:12:23Z","timestamp":1649221943000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s10898-021-01078-z"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021,8,30]]},"references-count":54,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2022,4]]}},"alternative-id":["1078"],"URL":"https:\/\/doi.org\/10.1007\/s10898-021-01078-z","relation":{},"ISSN":["0925-5001","1573-2916"],"issn-type":[{"value":"0925-5001","type":"print"},{"value":"1573-2916","type":"electronic"}],"subject":[],"published":{"date-parts":[[2021,8,30]]},"assertion":[{"value":"13 January 2020","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"18 August 2021","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"30 August 2021","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Declarations"}},{"value":"The authors declare that they have no conflict of interest.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of interest"}}]}}