{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,7]],"date-time":"2026-04-07T22:41:15Z","timestamp":1775601675304,"version":"3.50.1"},"reference-count":45,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2023,2,15]],"date-time":"2023-02-15T00:00:00Z","timestamp":1676419200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2023,2,15]],"date-time":"2023-02-15T00:00:00Z","timestamp":1676419200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"funder":[{"DOI":"10.13039\/501100012226","name":"Fundamental Research Funds for the Central Universities","doi-asserted-by":"publisher","award":["2020YJS095"],"award-info":[{"award-number":["2020YJS095"]}],"id":[{"id":"10.13039\/501100012226","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Oper Res Int J"],"published-print":{"date-parts":[[2023,3]]},"DOI":"10.1007\/s12351-023-00751-3","type":"journal-article","created":{"date-parts":[[2023,2,21]],"date-time":"2023-02-21T21:16:02Z","timestamp":1677014162000},"update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":10,"title":["Time-dependent vehicle routing problem of perishable product delivery considering the differences among paths on the congested road"],"prefix":"10.1007","volume":"23","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-4803-8775","authenticated-orcid":false,"given":"Fang","family":"Zhao","sequence":"first","affiliation":[]},{"given":"Bingfeng","family":"Si","sequence":"additional","affiliation":[]},{"given":"Zhenlin","family":"Wei","sequence":"additional","affiliation":[]},{"given":"Tianwei","family":"Lu","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2023,2,15]]},"reference":[{"key":"751_CR1","doi-asserted-by":"publisher","first-page":"389","DOI":"10.1007\/s10696-011-9122-3","volume":"25","author":"P Amorim","year":"2013","unstructured":"Amorim P, Meyr H, Almeder C, Almada-Lobo B (2013) Managing perishability in production-distribution planning: a discussion and review. Flex Serv Manuf J 25:389\u2013413","journal-title":"Flex Serv Manuf J"},{"key":"751_CR3","unstructured":"Beijing Transport Institute (2019) Interpretation of traffic index. http:\/\/www.nitrafficindex.com\/about.jsp. Accessed 23 Nov 2019"},{"key":"751_CR4","doi-asserted-by":"publisher","first-page":"58","DOI":"10.1016\/j.cor.2019.06.001","volume":"111","author":"L Chen","year":"2019","unstructured":"Chen L, Liu Y, Langevin A (2019) A multi-compartment vehicle routing problem in cold-chain distribution. Comput Oper Res 111:58\u201366","journal-title":"Comput Oper Res"},{"key":"751_CR5","doi-asserted-by":"publisher","first-page":"773","DOI":"10.1109\/TEVC.2016.2519378","volume":"20","author":"R Cheng","year":"2016","unstructured":"Cheng R, Jin Y, Olhofer M, Sendhoff B (2016) A reference vector guided evolutionary algorithm for many-objective optimization. IEEE Trans Evol Comput 20:773\u2013791","journal-title":"IEEE Trans Evol Comput"},{"key":"751_CR6","doi-asserted-by":"publisher","first-page":"104","DOI":"10.3141\/2168-13","volume":"2168","author":"RG Conrad","year":"2010","unstructured":"Conrad RG, Figliozzi MA (2010) Algorithms to quantify impact of congestion on time-dependent real-world urban freight distribution networks. Transp Res Rec 2168:104\u2013113","journal-title":"Transp Res Rec"},{"key":"751_CR7","doi-asserted-by":"publisher","first-page":"80","DOI":"10.1287\/mnsc.6.1.80","volume":"6","author":"GB Dantzig","year":"1959","unstructured":"Dantzig GB, Ramser JH (1959) The truck dispatching problem. Manag Sci 6:80\u201391","journal-title":"Manag Sci"},{"key":"751_CR8","doi-asserted-by":"crossref","unstructured":"Deb K, Agrawal S, Pratap A, Meyarivan T (2002) A fast and elitist multiobjective genetic algorithm: NSGA-II. IEEE Trans Evol Comput 6:0\u2013197","DOI":"10.1109\/4235.996017"},{"key":"751_CR9","doi-asserted-by":"publisher","first-page":"577","DOI":"10.1109\/TEVC.2013.2281535","volume":"18","author":"K Deb","year":"2014","unstructured":"Deb K, Jain H (2014) An evolutionary many-objective optimization algorithm using reference-point-based nondominated sorting approach, part I: solving problems with box constraints. IEEE Trans Evol Comput 18:577\u2013601","journal-title":"IEEE Trans Evol Comput"},{"key":"751_CR10","doi-asserted-by":"publisher","first-page":"28","DOI":"10.1007\/s10696-011-9125-0","volume":"24","author":"P Farahani","year":"2012","unstructured":"Farahani P, Grunow M, G\u00fcnther HO (2012) Integrated production and distribution planning for perishable food products. Flex Serv Manuf J 24:28\u201351","journal-title":"Flex Serv Manuf J"},{"key":"751_CR11","doi-asserted-by":"publisher","first-page":"306","DOI":"10.1111\/j.1937-5956.2007.tb00261.x","volume":"16","author":"M Ferguson","year":"2007","unstructured":"Ferguson M, Koenigsberg O (2007) How should a firm manage deteriorating inventory? Prod Oper Manag 16:306\u2013321","journal-title":"Prod Oper Manag"},{"key":"751_CR12","unstructured":"Gevaers R, Voorde EV, Vanelslander T (2009) Characteristics of innovations in last mile logistics-using best practices, case studies and making the link with green and sustainable logistics. European Transport Conference, Netherlands."},{"key":"751_CR13","doi-asserted-by":"publisher","first-page":"251","DOI":"10.1016\/j.tre.2016.10.014","volume":"97","author":"AR G\u00fcner","year":"2017","unstructured":"G\u00fcner AR, Murat A, Chinnam RB (2017) Dynamic routing for milk-run tours with time windows in stochastic time-dependent networks. Transp Res Part E: Logist Transp Rev 97:251\u2013267","journal-title":"Transp Res Part E: Logist Transp Rev"},{"key":"751_CR14","doi-asserted-by":"publisher","first-page":"80","DOI":"10.1016\/j.tifs.2016.11.016","volume":"61","author":"YH Hsiao","year":"2017","unstructured":"Hsiao YH, Chen MC, Chin CL (2017) Distribution planning for perishable foods in cold chains with quality concerns: formulation and solution procedure. Trends Food Sci Technol 61:80\u201393","journal-title":"Trends Food Sci Technol"},{"key":"751_CR15","doi-asserted-by":"publisher","first-page":"862","DOI":"10.1108\/IJLM-01-2017-0002","volume":"29","author":"YH Hsiao","year":"2018","unstructured":"Hsiao YH, Chen MC, Lu KY, Chin CL (2018) Last-mile distribution planning for fruit-and-vegetable cold chains. Int J Logist Manag 29:862\u2013886","journal-title":"Int J Logist Manag"},{"key":"751_CR16","doi-asserted-by":"publisher","first-page":"282","DOI":"10.1287\/trsc.2017.0775","volume":"53","author":"A H\u00fcbner","year":"2018","unstructured":"H\u00fcbner A, Ostermeier M (2018) A multi-compartment vehicle routing problem with loading and unloading costs. Transp Sci 53:282\u2013300","journal-title":"Transp Sci"},{"key":"751_CR17","doi-asserted-by":"publisher","first-page":"379","DOI":"10.1016\/S0377-2217(02)00147-9","volume":"144","author":"S Ichoua","year":"2003","unstructured":"Ichoua S, Gendreau M, Potvin JY (2003) Vehicle dispatching with time-dependent travel times. Eur J Oper Res 144:379\u2013396","journal-title":"Eur J Oper Res"},{"key":"751_CR18","unstructured":"INRIX index Methodology (2020) INRIX National Traffic Scorecard. http:\/\/scorecard.inrix.com\/scorecard. Accessed 26 March 2020"},{"key":"751_CR19","unstructured":"Ishimaru JM, Hallenbeck ME, Nee J (2000) Weekend freeway performance and the use of HOV lanes on weekends. Publication WA-RD 488.1. Washington State Transportation Commission, 2000"},{"key":"751_CR20","doi-asserted-by":"publisher","first-page":"83","DOI":"10.1007\/s10696-011-9077-4","volume":"22","author":"AL Kok","year":"2010","unstructured":"Kok AL, Hans EW, Schutten JMJ, Zijim WHM (2010) A dynamic programming heuristic for vehicle routing with time-dependent travel times and required breaks. Flex Serv Manuf J 22:83\u2013108","journal-title":"Flex Serv Manuf J"},{"key":"751_CR21","doi-asserted-by":"publisher","first-page":"362","DOI":"10.1080\/19427867.2017.1366120","volume":"11","author":"BA Kumar","year":"2019","unstructured":"Kumar BA, Jairam R, Arkatkar SS, Vanajakshi L (2019) Real time bus travel time prediction using k-NN classifier. Transp Lett 11:362\u2013372","journal-title":"Transp Lett"},{"key":"751_CR22","doi-asserted-by":"crossref","unstructured":"Lin DJ, Tsao WL, Yu CH, Liu HH (2019) The Travel Time Prediction by Machine Learning Methods with Traffic Data in Chiayi City, Taiwan. In: 4th International Conference on Electromechanical Control Technology and Transportation (ICECTT)","DOI":"10.1109\/ICECTT.2019.00065"},{"key":"751_CR23","doi-asserted-by":"publisher","DOI":"10.1016\/j.knosys.2019.06.021","volume":"188","author":"CS Liu","year":"2020","unstructured":"Liu CS, Kou G, Zhou XC, Peng Y et al (2020) Time-dependent vehicle routing problem with time windows of city logistics with a congestion avoidance approach. Knowl-Based Syst 188:104813","journal-title":"Knowl-Based Syst"},{"key":"751_CR24","doi-asserted-by":"publisher","first-page":"101","DOI":"10.1016\/j.cie.2017.10.010","volume":"114","author":"ZJ Ma","year":"2017","unstructured":"Ma ZJ, Wu Y, Dai Y (2017) A combined order selection and time-dependent vehicle routing problem with time windows for perishable product delivery. Comput Ind Eng 114:101\u2013113","journal-title":"Comput Ind Eng"},{"key":"751_CR25","doi-asserted-by":"publisher","first-page":"185","DOI":"10.1287\/trsc.26.3.185","volume":"26","author":"C Malandraki","year":"1992","unstructured":"Malandraki C, Daskin MS (1992) Time dependent vehicle routing problems: formulations, properties and heuristic algorithms. Transp Sci 26:185\u2013200","journal-title":"Transp Sci"},{"key":"751_CR26","doi-asserted-by":"publisher","first-page":"154","DOI":"10.1016\/j.matcom.2018.01.006","volume":"155","author":"HM Moonam","year":"2019","unstructured":"Moonam HM, Qin X, Zhang J (2019) Utilizing data mining techniques to predict expected freeway travel time from experienced travel time. Math Comput Simul 155:154\u2013167","journal-title":"Math Comput Simul"},{"key":"751_CR27","doi-asserted-by":"publisher","first-page":"151","DOI":"10.1016\/j.cie.2017.05.004","volume":"109","author":"KKH Ng","year":"2017","unstructured":"Ng KKH, Lee CKM, Zhang SZ, Wu K et al (2017) A multiple colonies artificial bee colony algorithm for a capacitated vehicle routing problem and re-routing strategies under time-dependent traffic congestion. Comput Ind Eng 109:151\u2013168","journal-title":"Comput Ind Eng"},{"key":"751_CR28","doi-asserted-by":"publisher","first-page":"285","DOI":"10.1016\/j.jfoodeng.2007.07.008","volume":"85","author":"A Osvald","year":"2008","unstructured":"Osvald A, Stirn LZ (2008) Vehicle routing algorithm for the distribution of fresh vegetables and similar perishable food. J Food Eng 85:285\u2013295","journal-title":"J Food Eng"},{"key":"751_CR29","doi-asserted-by":"publisher","first-page":"57","DOI":"10.1016\/j.ins.2014.08.068","volume":"292","author":"SHR Pasandideh","year":"2015","unstructured":"Pasandideh SHR, Niaki STA, Asadi K (2015) Bi-objective optimization of a multi-product multi-period three-echelon supply chain problem under uncertain environments: NSGA-II and NRGA. Inf Sci 292:57\u201374. https:\/\/doi.org\/10.1016\/j.ins.2014.08.068","journal-title":"Inf Sci"},{"key":"751_CR30","doi-asserted-by":"publisher","first-page":"2365","DOI":"10.1007\/s12351-018-0423-0","volume":"20","author":"SHR Pasandideh","year":"2020","unstructured":"Pasandideh SHR, Niaki STA, Abdollahi R (2020) Modeling and solving a bi-objective joint replenishment-location problem under incremental discount: MOHSA and NSGA-II. Oper Res Int J 20:2365\u20132396. https:\/\/doi.org\/10.1007\/s12351-018-0423-0","journal-title":"Oper Res Int J"},{"key":"751_CR31","doi-asserted-by":"publisher","DOI":"10.1007\/s12351-020-00593-3","author":"ASN Qamsari","year":"2020","unstructured":"Qamsari ASN, Hosseini-Motlagh SM, Ghannadpour SF (2020) A column generation approach for an inventory routing problem with fuzzy time windows. Oper Res Int J. https:\/\/doi.org\/10.1007\/s12351-020-00593-3","journal-title":"Oper Res Int J"},{"key":"751_CR32","doi-asserted-by":"publisher","first-page":"1763","DOI":"10.1007\/s12351-019-00521-0","volume":"21","author":"B Rabbouch","year":"2021","unstructured":"Rabbouch B, Sa\u00e2daoui F, Mraihi R (2021) Efficient implementation of the genetic algorithm to solve rich vehicle routing problems. Oper Res Int J 21:1763\u20131791. https:\/\/doi.org\/10.1007\/s12351-019-00521-0","journal-title":"Oper Res Int J"},{"key":"751_CR33","doi-asserted-by":"publisher","unstructured":"Rabbouch B, Mraihi R, Sa\u00e2daoui F (2017) A recent brief survey for the multi depot heterogenous vehicle routing problem with time windows. In: Proceedings of the 17th edition of the international conference on hybrid intelligent systems (HIS 2017), pp. 147\u2013157. https:\/\/doi.org\/10.1007\/978-3-319-76351-4_15","DOI":"10.1007\/978-3-319-76351-4_15"},{"key":"751_CR34","doi-asserted-by":"publisher","first-page":"605","DOI":"10.1016\/j.apm.2019.01.047","volume":"70","author":"A Rahbari","year":"2019","unstructured":"Rahbari A, Nasiri MM, Werner F, Musavi M et al (2019) The vehicle routing and scheduling problem with cross-docking for perishable products under uncertainty: two robust bi-objective models. Appl Math Modell 70:605\u2013625","journal-title":"Appl Math Modell"},{"key":"751_CR35","doi-asserted-by":"publisher","first-page":"156","DOI":"10.1016\/j.cor.2019.03.015","volume":"107","author":"SUK Rohmer","year":"2019","unstructured":"Rohmer SUK, Claassen GDH, Laporte G (2019) A two-echelon inventory routing problem for perishable products. Comput Oper Res 107:156\u2013172","journal-title":"Comput Oper Res"},{"issue":"81\u201394","key":"751_CR36","first-page":"14","volume":"50","author":"R Salih-Elamin","year":"2020","unstructured":"Salih-Elamin R, Al-Deek H (2020) Short-term prediction for bike share systems\u2019 travel time under the effects of weather conditions. Advance Transp Stud 50(81\u201394):14","journal-title":"Advance Transp Stud"},{"key":"751_CR37","doi-asserted-by":"publisher","first-page":"293","DOI":"10.1016\/j.tre.2019.06.015","volume":"128","author":"CE Schmidt","year":"2019","unstructured":"Schmidt CE, Silva ACL, Darvish M, Coelho LC (2019) The time-dependent location-routing problem. Transp Res Part e: Logist Transp Rev 128:293\u2013315","journal-title":"Transp Res Part e: Logist Transp Rev"},{"key":"751_CR38","unstructured":"Sharmila RB, Velaga NR (2019) A weighted K-NN based approach for corridor level travel-time prediction. In: Transportation Research Board 98th Annual Meeting, Washington, D.C. America."},{"key":"751_CR39","doi-asserted-by":"publisher","DOI":"10.1016\/j.tre.2020.101942","volume":"138","author":"P Sun","year":"2020","unstructured":"Sun P, Veelenturf LP, Hewitt M, Van Woensel T (2020) Adaptive large neighborhood search for the time-dependent profitable pickup and delivery problem with time windows. Transp Res Part E Logist Transp Rev 138:101942","journal-title":"Transp Res Part E Logist Transp Rev"},{"key":"751_CR40","unstructured":"Tomtom (2020) Tomtom traffic index measuring congestion worldwide. http:\/\/www.tomtom.com\/en_gb\/trafficindex\/#\/about. Accessed 26 Mar 2020"},{"key":"751_CR41","unstructured":"Van VDA, Gary BL (1998) Evolutionary computation and convergence to a pareto front. In: Late Breaking Papers at the Genetic Programming 1998 Conference, California, America."},{"key":"751_CR42","doi-asserted-by":"publisher","first-page":"16","DOI":"10.3141\/1802-03","volume":"1802","author":"M Vaziri","year":"2002","unstructured":"Vaziri M (2002) Development of highway congestion index with fuzzy set models. Transp Res Rec 1802:16\u201322","journal-title":"Transp Res Rec"},{"key":"751_CR43","doi-asserted-by":"publisher","first-page":"146","DOI":"10.1016\/j.tre.2016.01.011","volume":"88","author":"YY Xiao","year":"2016","unstructured":"Xiao YY, Konak A (2016) The heterogeneous green vehicle routing and scheduling problem with time-varying traffic congestion. Transp Res Part E Logist Transp Rev 88:146\u2013166","journal-title":"Transp Res Part E Logist Transp Rev"},{"key":"751_CR44","first-page":"1093","volume":"20","author":"HL Yang","year":"2020","unstructured":"Yang HL, Zhao L, Ye D, Ma JS (2020) Disturbance management for vehicle routing with time window changes. Oper Res 20:1093\u20131112","journal-title":"Oper Res"},{"issue":"73\u201383","key":"751_CR45","first-page":"11","volume":"1","author":"M Zhang","year":"2019","unstructured":"Zhang M (2019) Intelligent route scheduling method for non-full-loaded vehicle based on unbalanced data mining. Advance Transp Stud 1(73\u201383):11","journal-title":"Advance Transp Stud"},{"key":"751_CR46","doi-asserted-by":"publisher","DOI":"10.1016\/j.jclepro.2019.118428","volume":"242","author":"FE Zulvia","year":"2020","unstructured":"Zulvia FE, Kuo RJ, Nugroho DY (2020) A many-objective gradient evolution algorithm for solving a green vehicle routing problem with time windows and time dependency for perishable products. J Cleaner Prod 242:118428","journal-title":"J Cleaner Prod"}],"container-title":["Operational Research"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s12351-023-00751-3.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s12351-023-00751-3\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s12351-023-00751-3.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,3,26]],"date-time":"2023-03-26T22:26:43Z","timestamp":1679869603000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s12351-023-00751-3"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023,2,15]]},"references-count":45,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2023,3]]}},"alternative-id":["751"],"URL":"https:\/\/doi.org\/10.1007\/s12351-023-00751-3","relation":{},"ISSN":["1109-2858","1866-1505"],"issn-type":[{"value":"1109-2858","type":"print"},{"value":"1866-1505","type":"electronic"}],"subject":[],"published":{"date-parts":[[2023,2,15]]},"assertion":[{"value":"29 October 2020","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"28 February 2022","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"6 October 2022","order":3,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"15 February 2023","order":4,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Declaration"}},{"value":"The authors declare that they have no known competing for 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"}}],"article-number":"5"}}