{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,24]],"date-time":"2026-06-24T05:32:20Z","timestamp":1782279140868,"version":"3.54.5"},"reference-count":28,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2023,6,10]],"date-time":"2023-06-10T00:00:00Z","timestamp":1686355200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2023,6,10]],"date-time":"2023-06-10T00:00:00Z","timestamp":1686355200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"funder":[{"name":"Ministry of Education of the P. R. China","award":["202108310209"],"award-info":[{"award-number":["202108310209"]}]},{"DOI":"10.13039\/501100010264","name":"Shanghai Maritime University","doi-asserted-by":"publisher","award":["2019YBR020"],"award-info":[{"award-number":["2019YBR020"]}],"id":[{"id":"10.13039\/501100010264","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Ann Oper Res"],"published-print":{"date-parts":[[2025,3]]},"DOI":"10.1007\/s10479-023-05417-z","type":"journal-article","created":{"date-parts":[[2023,6,10]],"date-time":"2023-06-10T06:01:38Z","timestamp":1686376898000},"page":"1345-1376","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Optimization of multistage timeliness transit consolidation problem using adaptive-weighted genetic algorithm"],"prefix":"10.1007","volume":"346","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-4109-1557","authenticated-orcid":false,"given":"Bowen","family":"Lv","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Bin","family":"Yang","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Ek Peng","family":"Chew","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2023,6,10]]},"reference":[{"key":"5417_CR1","first-page":"51","volume":"138","author":"K Aljohani","year":"2020","unstructured":"Aljohani, K., & Thompson, R. G. (2020). A multi-criteria spatial evaluation framework to optimise the siting of freight consolidation facilities in inner-city areas. Transportation Research Part A: Policy and Practice, 138, 51\u201369.","journal-title":"Transportation Research Part A: Policy and Practice"},{"issue":"3","key":"5417_CR2","doi-asserted-by":"crossref","first-page":"227","DOI":"10.1080\/19427867.2020.1852504","volume":"14","author":"KP Anoop","year":"2022","unstructured":"Anoop, K. P., & Panicker, V. V. (2022). Multimodal transportation planning with freight consolidation and volume discount on rail freight rate. Transportation Letters, 14(3), 227\u2013244.","journal-title":"Transportation Letters"},{"issue":"3","key":"5417_CR3","doi-asserted-by":"crossref","first-page":"906","DOI":"10.1016\/j.ejor.2020.01.040","volume":"284","author":"I Aziez","year":"2020","unstructured":"Aziez, I., C\u00f4t\u00e9, J. F., & Coelho, L. C. (2020). Exact algorithms for the multi-pickup and delivery problem with time windows. European Journal of Operational Research, 284(3), 906\u2013919.","journal-title":"European Journal of Operational Research"},{"key":"5417_CR4","doi-asserted-by":"crossref","first-page":"789","DOI":"10.1016\/j.trb.2015.09.007","volume":"93","author":"E Demir","year":"2016","unstructured":"Demir, E., Burgholzer, W., Hru\u0161ovsk\u00fd, M., Ar\u0131kan, E., Jammernegg, W., & Van Woensel, T. (2016). A green intermodal service network design problem with travel time uncertainty. Transportation Research Part B: Methodological, 93, 789\u2013807.","journal-title":"Transportation Research Part B: Methodological"},{"key":"5417_CR5","doi-asserted-by":"crossref","first-page":"108","DOI":"10.1016\/j.tre.2015.02.006","volume":"76","author":"RM Estrada","year":"2015","unstructured":"Estrada, R. M., & Robust\u00e9, F. (2015). Stopover and hub-and-spoke shipment strategies in less-than-truckload carriers. Transportation Research Part E-Logistics & Transportation Review, 76, 108\u2013121.","journal-title":"Transportation Research Part E-Logistics & Transportation Review"},{"key":"5417_CR6","doi-asserted-by":"crossref","first-page":"233","DOI":"10.1016\/j.cie.2018.03.041","volume":"119","author":"S Fazayeli","year":"2018","unstructured":"Fazayeli, S., Eydi, A., & Kamalabadi, I. N. (2018). Location-routing problem in multimodal transportation network with time windows and fuzzy demands: Presenting a two-part genetic algorithm. Computers & Industrial Engineering, 119, 233\u2013246.","journal-title":"Computers & Industrial Engineering"},{"issue":"14","key":"5417_CR7","doi-asserted-by":"crossref","first-page":"4267","DOI":"10.1080\/00207543.2019.1651457","volume":"58","author":"W Ferrell","year":"2019","unstructured":"Ferrell, W., Ellis, K., Kaminsky, P., & Rainwater, C. (2019). Horizontal collaboration: Opportunities for improved logistics planning. International Journal of Production Research, 58(14), 4267\u20134284.","journal-title":"International Journal of Production Research"},{"key":"5417_CR8","volume-title":"Network models and optimization: Multiobjective genetic algorithm approach","author":"M Gen","year":"2008","unstructured":"Gen, M., Cheng, R., & Lin, L. (2008). Network models and optimization: Multiobjective genetic algorithm approach. Springer-Verlag."},{"key":"5417_CR9","doi-asserted-by":"crossref","first-page":"394","DOI":"10.1016\/j.cie.2018.08.025","volume":"125","author":"M Gen","year":"2018","unstructured":"Gen, M., Lin, L., Yun, Y. S., & Inoue, H. (2018). Recent advances in hybrid priority-based genetic algorithms for logistics and SCM network design. Computers & Industrial Engineering., 125, 394\u2013412.","journal-title":"Computers & Industrial Engineering."},{"key":"5417_CR200","unstructured":"Goldberg, D. E., & Lingle, R. (1985). Alleles Loci and the Traveling Salesman Problem. In Proceedings of the 1st International Conference on Genetic Algorithms. L. Erlbaum Associates Inc., USA, 154\u2013159."},{"issue":"2","key":"5417_CR10","doi-asserted-by":"crossref","first-page":"84","DOI":"10.1080\/19427867.2020.1815143","volume":"14","author":"LR Guimar\u00e3es","year":"2022","unstructured":"Guimar\u00e3es, L. R., de Sousa, J. P., & Prata, B. D. A. (2022). Variable fixing heuristics for the capacitated multicommodity network flow problem with multiple transport lines, a heterogeneous fleet and time windows. Transportation Letters, 14(2), 84\u201393.","journal-title":"Transportation Letters"},{"issue":"3","key":"5417_CR11","doi-asserted-by":"crossref","first-page":"909","DOI":"10.1016\/j.ejor.2018.10.031","volume":"274","author":"P Gy\u00f6rgyi","year":"2019","unstructured":"Gy\u00f6rgyi, P., & Kis, T. (2019). A probabilistic approach to pickup and delivery problems with time window uncertainty. European Journal of Operational Research, 274(3), 909\u2013923.","journal-title":"European Journal of Operational Research"},{"issue":"1","key":"5417_CR12","doi-asserted-by":"crossref","first-page":"187","DOI":"10.1016\/j.ejor.2018.12.043","volume":"276","author":"AS Hanbazazah","year":"2019","unstructured":"Hanbazazah, A. S., Abril, L., Erkoc, M., & Shaikh, N. (2019). Freight consolidation with divisible shipments, delivery time windows, and piecewise transportation costs. European Journal of Operational Research, 276(1), 187\u2013201.","journal-title":"European Journal of Operational Research"},{"key":"5417_CR13","doi-asserted-by":"crossref","first-page":"548","DOI":"10.1016\/j.ejor.2018.05.034","volume":"271","author":"W Hu","year":"2018","unstructured":"Hu, W., Toriello, A., & Dessouky, M. (2018). Integrated inventory routing and freight consolidation for perishable goods. European Journal of Operational Research, 271, 548\u2013560.","journal-title":"European Journal of Operational Research"},{"issue":"7","key":"5417_CR14","doi-asserted-by":"crossref","first-page":"2059","DOI":"10.1016\/j.cor.2005.08.010","volume":"34","author":"TL James","year":"2007","unstructured":"James, T. L., Brown, E. C., & Keeling, K. B. (2007). A hybrid grouping genetic algorithm for the cell formation problem. Computers & Operations Research, 34(7), 2059\u20132079.","journal-title":"Computers & Operations Research"},{"key":"5417_CR15","doi-asserted-by":"crossref","first-page":"39","DOI":"10.1016\/j.ins.2019.06.051","volume":"503","author":"H Liu","year":"2019","unstructured":"Liu, H., Du, W., & Guo, Z. (2019). A multi-population evolutionary algorithm with single-objective guide for many-objective optimization. Information Sciences, 503, 39\u201360.","journal-title":"Information Sciences"},{"issue":"2","key":"5417_CR16","doi-asserted-by":"crossref","first-page":"672","DOI":"10.1016\/j.ejor.2005.05.012","volume":"175","author":"Q Lu","year":"2006","unstructured":"Lu, Q., & Dessouky, M. M. (2006). A new insertion-based construction heuristic for solving the pickup and delivery problem with time windows. European Journal of Operational Research, 175(2), 672\u2013687.","journal-title":"European Journal of Operational Research"},{"key":"5417_CR17","doi-asserted-by":"crossref","first-page":"454","DOI":"10.1016\/j.cie.2019.02.001","volume":"129","author":"B Lv","year":"2019","unstructured":"Lv, B., Yang, B., & Zhu, X. (2019). Operational optimization of transit consolidation in multimodal transport. Computers & Industrial Engineering, 129, 454\u2013464.","journal-title":"Computers & Industrial Engineering"},{"key":"5417_CR18","doi-asserted-by":"crossref","first-page":"167","DOI":"10.1016\/j.cor.2017.01.018","volume":"82","author":"MY Maknoon","year":"2017","unstructured":"Maknoon, M. Y., Soumis, F., & Baptiste, P. (2017). An integer programming approach to scheduling the transshipment of products at cross-docks in less-than-truckload industries. Computers & Operations Research, 82, 167\u2013179.","journal-title":"Computers & Operations Research"},{"key":"5417_CR19","first-page":"10876","volume":"257","author":"BJD Moor","year":"2023","unstructured":"Moor, B. J. D., Creemers, S., & Boute, R. N. (2023). Breaking truck dominance in supply chains: Proactive freight consolidation and modal split transport. International Journal of Production Economics, 257, 10876.","journal-title":"International Journal of Production Economics"},{"key":"5417_CR20","doi-asserted-by":"crossref","first-page":"113959","DOI":"10.1016\/j.eswa.2020.113959","volume":"165","author":"H Park","year":"2021","unstructured":"Park, H., Son, D., Koo, B., & Jeong, B. (2021). Waiting strategy for the vehicle routing problem with simultaneous pickup and delivery using genetic algorithm. Expert Systems with Applications, 165, 113959.","journal-title":"Expert Systems with Applications"},{"key":"5417_CR21","doi-asserted-by":"crossref","first-page":"116","DOI":"10.1016\/j.tre.2018.10.009","volume":"120","author":"J P\u00e9rez","year":"2018","unstructured":"P\u00e9rez, J., Lange, J. C., & Tancrez, J. S. (2018). A multi-hub express shipment service network design model with flexible hub assignment. Transportation Research Part E-Logistics & Transportation Review, 120, 116\u2013131.","journal-title":"Transportation Research Part E-Logistics & Transportation Review"},{"issue":"4","key":"5417_CR22","doi-asserted-by":"crossref","first-page":"656","DOI":"10.1109\/21.286385","volume":"24","author":"M Srinivas","year":"1994","unstructured":"Srinivas, M., & Patnaik, L. M. (1994). Adaptive probabilities of crossover and mutation in genetic algorithms. IEEE Transactions on Systems, Man, and Cybernetics, 24(4), 656\u2013667.","journal-title":"IEEE Transactions on Systems, Man, and Cybernetics"},{"key":"5417_CR23","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/j.trb.2018.07.002","volume":"116","author":"P Sun","year":"2018","unstructured":"Sun, P., Veelenturf, L. P., Hewitt, M., & Van Woensel, T. (2018). The time-dependent pickup and delivery problem with time windows. Transportation Research Part B: Methodological, 116, 1\u201324.","journal-title":"Transportation Research Part B: Methodological"},{"issue":"3","key":"5417_CR24","doi-asserted-by":"crossref","first-page":"755","DOI":"10.1016\/j.cie.2011.11.025","volume":"62","author":"AS Tasan","year":"2012","unstructured":"Tasan, A. S., & Gen, M. (2012). A genetic algorithm based approach to vehicle routing problem with simultaneous pick-up and deliveries. Computers & Industrial Engineering, 62(3), 755\u2013761.","journal-title":"Computers & Industrial Engineering"},{"key":"5417_CR25","doi-asserted-by":"crossref","first-page":"111","DOI":"10.1016\/j.cie.2015.02.005","volume":"83","author":"C Wang","year":"2015","unstructured":"Wang, C., Mu, D., Zhao, F., & Sutherland, J. W. (2015). A parallel simulated annealing method for the vehicle routing problem with simultaneous pickup\u2013delivery and time windows. Computers & Industrial Engineering, 83, 111\u2013122.","journal-title":"Computers & Industrial Engineering"},{"issue":"1","key":"5417_CR26","doi-asserted-by":"crossref","first-page":"84","DOI":"10.1016\/j.cie.2011.08.018","volume":"62","author":"HF Wang","year":"2012","unstructured":"Wang, H. F., & Chen, Y. Y. (2012). A genetic algorithm for the simultaneous delivery and pickup problems with time window. Computers & Industrial Engineering, 62(1), 84\u201395.","journal-title":"Computers & Industrial Engineering"},{"key":"5417_CR27","doi-asserted-by":"crossref","first-page":"248","DOI":"10.1016\/j.tre.2016.10.001","volume":"95","author":"K Yang","year":"2016","unstructured":"Yang, K., Yang, L., & Gao, Z. (2016). Planning and optimization of intermodal hub-and-spoke network under mixed uncertainty. Transportation Research Part E-Logistics & Transportation Review, 95, 248\u2013266.","journal-title":"Transportation Research Part E-Logistics & Transportation Review"}],"container-title":["Annals of Operations Research"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10479-023-05417-z.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s10479-023-05417-z\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10479-023-05417-z.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,4,9]],"date-time":"2025-04-09T15:55:56Z","timestamp":1744214156000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s10479-023-05417-z"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023,6,10]]},"references-count":28,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2025,3]]}},"alternative-id":["5417"],"URL":"https:\/\/doi.org\/10.1007\/s10479-023-05417-z","relation":{},"ISSN":["0254-5330","1572-9338"],"issn-type":[{"value":"0254-5330","type":"print"},{"value":"1572-9338","type":"electronic"}],"subject":[],"published":{"date-parts":[[2023,6,10]]},"assertion":[{"value":"24 May 2023","order":1,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"10 June 2023","order":2,"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 known competing financial interests or personal relationships that could have appeared to influence the work reported in this paper.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of interest"}}]}}