{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,27]],"date-time":"2025-11-27T20:57:49Z","timestamp":1764277069535,"version":"3.37.3"},"reference-count":39,"publisher":"Springer Science and Business Media LLC","issue":"1-2","license":[{"start":{"date-parts":[[2021,3,11]],"date-time":"2021-03-11T00:00:00Z","timestamp":1615420800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2021,3,11]],"date-time":"2021-03-11T00:00:00Z","timestamp":1615420800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Ann Oper Res"],"published-print":{"date-parts":[[2022,1]]},"DOI":"10.1007\/s10479-021-04012-4","type":"journal-article","created":{"date-parts":[[2021,3,11]],"date-time":"2021-03-11T20:02:40Z","timestamp":1615492960000},"page":"653-684","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":9,"title":["Managing pharmaceuticals delivery service using a hybrid particle swarm intelligence approach"],"prefix":"10.1007","volume":"308","author":[{"given":"Xiaodan","family":"Wu","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-9437-8837","authenticated-orcid":false,"given":"Ruichang","family":"Li","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Chao-Hsien","family":"Chu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Richard","family":"Amoasi","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Shan","family":"Liu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2021,3,11]]},"reference":[{"issue":"1","key":"4012_CR1","doi-asserted-by":"publisher","first-page":"29","DOI":"10.1016\/j.jksues.2014.04.007","volume":"29","author":"B Afshar-Nadjafi","year":"2017","unstructured":"Afshar-Nadjafi, B., & Afshar-Nadjafi, A. (2017). A constructive heuristic for time-dependent multi-depot vehicle routing problem with time-windows and heterogeneous fleet. Journal of king Saud University-Engineering sciences, 29(1), 29\u201334.","journal-title":"Journal of king Saud University-Engineering sciences"},{"issue":"1","key":"4012_CR3","doi-asserted-by":"publisher","first-page":"140","DOI":"10.1016\/j.cor.2010.04.008","volume":"38","author":"J Brand\u00e3o","year":"2011","unstructured":"Brand\u00e3o, J. (2011). A Tabu search algorithm for the heterogeneous fixed fleet vehicle routing problem. Computers & Operations Research, 38(1), 140\u2013151.","journal-title":"Computers & Operations Research"},{"key":"4012_CR4","first-page":"1939","volume":"16","author":"MJ Chen","year":"2008","unstructured":"Chen, M. J., Zhang, Z. S., & Shi, J. F. (2008). Study on ant colony algorithm for multi-depots vehicle routing problem with multiple constraints. China Mechanical Engineering, 16, 1939\u20131944.","journal-title":"China Mechanical Engineering"},{"issue":"6","key":"4012_CR5","doi-asserted-by":"publisher","first-page":"791","DOI":"10.1287\/opre.6.6.791","volume":"6","author":"GA Croes","year":"1958","unstructured":"Croes, G. A. (1958). A method for solving traveling-salesman problems. Operations Research, 6(6), 791\u2013812.","journal-title":"Operations Research"},{"issue":"1","key":"4012_CR6","doi-asserted-by":"publisher","first-page":"269","DOI":"10.1007\/BF01386390","volume":"1","author":"EW Dijkstra","year":"1959","unstructured":"Dijkstra, E. W. (1959). A note on two problems in connexon with graphs. Numerische Mathematik, 1(1), 269\u2013271.","journal-title":"Numerische Mathematik"},{"key":"4012_CR7","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. (2020). A taxonomic review of metaheuristic algorithms for solving the vehicle routing problem and its variants. Computers & Industrial Engineering, 140, 106242.","journal-title":"Computers & Industrial Engineering"},{"key":"4012_CR8","doi-asserted-by":"publisher","first-page":"97","DOI":"10.1016\/j.vehcom.2017.04.005","volume":"9","author":"J Euchi","year":"2017","unstructured":"Euchi, J. (2017). The vehicle routing problem with private fleet and multiple common carriers: Solution with hybrid metaheuristic algorithm. Vehicular Communications, 9, 97\u2013108.","journal-title":"Vehicular Communications"},{"key":"4012_CR9","first-page":"60","volume":"27","author":"X Ge","year":"2013","unstructured":"Ge, X., Wang, X., & Deng, L. (2013). Research on open and dynamic vehicle routing problems based on joint distribution. Journal of Industrial Engineering and Engineering Management, 27, 60\u201368.","journal-title":"Journal of Industrial Engineering and Engineering Management"},{"issue":"2","key":"4012_CR10","doi-asserted-by":"publisher","first-page":"1552","DOI":"10.1016\/j.amc.2006.02.043","volume":"181","author":"C Gencer","year":"2006","unstructured":"Gencer, C., Top, I., & Aydogan, E. K. (2006). A new intuitional algorithm for solving heterogeneous fixed fleet routing problems: Passenger pickup algorithm. Applied Mathematics and Computation, 181(2), 1552\u20131567.","journal-title":"Applied Mathematics and Computation"},{"issue":"1","key":"4012_CR11","doi-asserted-by":"publisher","first-page":"49","DOI":"10.1016\/0305-0548(84)90007-8","volume":"11","author":"B Golden","year":"1984","unstructured":"Golden, B., Assad, A., Levy, L., & Gheysens, F. (1984). The fleet size and mix vehicle routing problem. Computers & Operations Research, 11(1), 49\u201366.","journal-title":"Computers & Operations Research"},{"issue":"2","key":"4012_CR12","first-page":"193","volume":"20","author":"H Guo","year":"2011","unstructured":"Guo, H., Yang, J., Ma, Z., & Li, L. (2011). Optimizing mine materials heterogeneous vehicle distribution by improved genetic algorithm. Operations research and Management Science, 20(2), 193\u2013199.","journal-title":"Operations research and Management Science"},{"issue":"2","key":"4012_CR13","doi-asserted-by":"publisher","first-page":"321","DOI":"10.1007\/s10479-018-2938-4","volume":"275","author":"T Henke","year":"2019","unstructured":"Henke, T., Speranza, M. G., & Wascher, G. (2019). A branch-and-cut algorithm for the multi-compartment vehicle routing problem with flexible compartment sizes. Annals of Operations Research, 275(2), 321\u2013338.","journal-title":"Annals of Operations Research"},{"issue":"1","key":"4012_CR14","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/j.ejor.2015.07.020","volume":"249","author":"C Ko\u00e7","year":"2016","unstructured":"Ko\u00e7, C., Bektas, T., Jabali, O., & Laporte, G. (2016). Thirty years of heterogeneous vehicle routing. European Journal of Operational Research, 249(1), 1\u201321.","journal-title":"European Journal of Operational Research"},{"key":"4012_CR15","doi-asserted-by":"publisher","first-page":"162","DOI":"10.1016\/j.tre.2019.07.012","volume":"129","author":"R Kramer","year":"2019","unstructured":"Kramer, R., Cordeau, J., & Iori, M. (2019). Rich vehicle routing with auxiliary depots and anticipated deliveries: an application to pharmaceutical distribution. Transportation Research Part E-logistics and Transportation Review, 129, 162\u2013174.","journal-title":"Transportation Research Part E-logistics and Transportation Review"},{"key":"4012_CR16","doi-asserted-by":"publisher","first-page":"81","DOI":"10.1016\/j.trd.2013.04.001","volume":"23","author":"YJ Kwon","year":"2013","unstructured":"Kwon, Y. J., Choi, Y. J., & Lee, D. H. (2013). Heterogeneous fixed fleet vehicle routing considering carbon emission. Transportation Research Part D: Transport and Environment, 23, 81\u201389.","journal-title":"Transportation Research Part D: Transport and Environment"},{"issue":"3","key":"4012_CR17","doi-asserted-by":"publisher","first-page":"345","DOI":"10.1016\/0377-2217(92)90192-C","volume":"59","author":"G Laporte","year":"1992","unstructured":"Laporte, G. (1992). The vehicle routing problem: An overview of exact and approximate algorithms. European Journal of Operational Research, 59(3), 345\u2013358.","journal-title":"European Journal of Operational Research"},{"key":"4012_CR18","first-page":"52","volume":"3","author":"B Li","year":"2006","unstructured":"Li, B. (2006). The determinitic dynamic vehicle allocation problem with multiple vehicle type. Journal of Industrial Engineering and Engineering Management, 3, 52\u201356.","journal-title":"Journal of Industrial Engineering and Engineering Management"},{"issue":"9","key":"4012_CR19","doi-asserted-by":"publisher","first-page":"2734","DOI":"10.1016\/j.cor.2005.10.015","volume":"34","author":"F Li","year":"2007","unstructured":"Li, F., Golden, B., & Wasil, E. (2007). A record-to-record travel algorithm for solving the heterogeneous fleet vehicle routing problem. Computers & Operations Research, 34(9), 2734\u20132742.","journal-title":"Computers & Operations Research"},{"issue":"6","key":"4012_CR20","doi-asserted-by":"publisher","first-page":"1111","DOI":"10.1016\/j.tre.2010.02.004","volume":"46","author":"X Li","year":"2010","unstructured":"Li, X., Tian, P., & Aneja, Y. P. (2010). An adaptive memory programming metaheuristic for the heterogeneous fixed fleet vehicle routing problem. Transportation Research Part E: Logistics and Transportation Review, 46(6), 1111\u20131127.","journal-title":"Transportation Research Part E: Logistics and Transportation Review"},{"issue":"10","key":"4012_CR21","first-page":"896","volume":"201","author":"J Li","year":"2018","unstructured":"Li, J., Wang, D., & Zhang, J. (2018). Heterogeneous fixed fleet vehicle routing problem based on fuel and carbon emissions. Journal of Cleaner Production, 201(10), 896\u2013908.","journal-title":"Journal of Cleaner Production"},{"issue":"1","key":"4012_CR22","first-page":"74","volume":"23","author":"J Li","year":"2008","unstructured":"Li, J., Zhang, Y., & Da, Q. (2008). Research on heterogeneous vehicle routing problem with hard time windows for the third party logistics. Journal of Systems Engineering, 23(1), 74.","journal-title":"Journal of Systems Engineering"},{"key":"4012_CR23","doi-asserted-by":"publisher","first-page":"67","DOI":"10.1016\/j.tre.2013.03.010","volume":"54","author":"S Liu","year":"2013","unstructured":"Liu, S. (2013). A hybrid population heuristic for the heterogeneous vehicle routing problems. Transportation Research Part E: Logistics and Transportation Review, 54, 67\u201378.","journal-title":"Transportation Research Part E: Logistics and Transportation Review"},{"key":"4012_CR24","doi-asserted-by":"publisher","first-page":"100","DOI":"10.1016\/j.trc.2015.06.016","volume":"70","author":"S Mancini","year":"2016","unstructured":"Mancini, S. (2016). A real-life multi depot multi period vehicle routing problem with a heterogeneous fleet: formulation and adaptive large neighborhood search based matheuristic. Transportation Research Part C-emerging Technologies, 70, 100\u2013112.","journal-title":"Transportation Research Part C-emerging Technologies"},{"issue":"3","key":"4012_CR25","doi-asserted-by":"publisher","first-page":"819","DOI":"10.1016\/j.ejor.2017.03.031","volume":"261","author":"Y Marinakis","year":"2017","unstructured":"Marinakis, Y., Migdalas, A., & Sifaleras, A. (2017). A hybrid particle swarm optimization\u2013variable neighborhood search algorithm for constrained shortest path problems. European Journal of Operational Research, 261(3), 819\u2013834.","journal-title":"European Journal of Operational Research"},{"issue":"13","key":"4012_CR26","doi-asserted-by":"publisher","first-page":"1051","DOI":"10.1016\/j.ifacol.2019.11.334","volume":"52","author":"Y Meliani","year":"2019","unstructured":"Meliani, Y., Hani, Y., Elhaq, S. L., & Mhamedi, A. E. (2019). A developed Tabu Search algorithm for heterogeneous fleet vehicle routing problem. IFAC-PapersOnLine, 52(13), 1051\u20131056.","journal-title":"IFAC-PapersOnLine"},{"key":"4012_CR27","first-page":"1","volume":"290","author":"D Michelle","year":"2018","unstructured":"Michelle, D., Simon, B., Nagesh, S., Mehrdad, A., Pascal, P., & Nishikant, M. (2018). A genetic column generation algorithm for sustainable spare part delivery: application to the Sydney droppoint network. Annals of Operations Research, 290, 1\u201319.","journal-title":"Annals of Operations Research"},{"key":"4012_CR28","doi-asserted-by":"publisher","first-page":"113361","DOI":"10.1016\/j.dss.2020.113361","volume":"138","author":"JA Nasir","year":"2020","unstructured":"Nasir, J. A., & Kuo, Y. H. (2020). A decision support framework for home health care transportation with simultaneous multi-vehicle routing and staff scheduling synchronization. Decision Support Systems, 138, 113361.","journal-title":"Decision Support Systems"},{"key":"4012_CR29","doi-asserted-by":"publisher","first-page":"5","DOI":"10.1007\/s10479-017-2642-9","volume":"273","author":"PHV Penna","year":"2017","unstructured":"Penna, P. H. V., Subramanian, A., Ochi, L. S., Vidal, T., & Prins, C. (2017). A hybrid heuristic for a broad class of vehicle routing problems with heterogeneous fleet. Annals of Operations Research, 273, 5\u201374.","journal-title":"Annals of Operations Research"},{"issue":"5","key":"4012_CR30","doi-asserted-by":"publisher","first-page":"695","DOI":"10.1016\/j.trc.2009.08.004","volume":"18","author":"PP Repoussis","year":"2010","unstructured":"Repoussis, P. P., & Tarantilis, C. D. (2010). Solving the fleet size and mix vehicle routing problem with time windows via adaptive memory programming. Transportation Research Part C: Emerging Technologies, 18(5), 695\u2013712.","journal-title":"Transportation Research Part C: Emerging Technologies"},{"key":"4012_CR31","doi-asserted-by":"publisher","first-page":"106571","DOI":"10.1016\/j.cie.2020.106571","volume":"146","author":"K Sethanan","year":"2020","unstructured":"Sethanan, K., & Jamrus, T. (2020). Hybrid differential evolution algorithm and genetic operator for multi-trip vehicle routing problem with backhauls and heterogeneous fleet in the beverage logistics industry. Computers & Industrial Engineering, 146, 106571.","journal-title":"Computers & Industrial Engineering"},{"issue":"1","key":"4012_CR32","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1051\/ro:1999101","volume":"33","author":"\u00c9D Taillard","year":"1999","unstructured":"Taillard, \u00c9. D. (1999). A heuristic column generation method for the heterogeneous fleet VRP. RAIRO-Operations Research, 33(1), 1\u201314.","journal-title":"RAIRO-Operations Research"},{"key":"4012_CR33","first-page":"1","volume":"1","author":"AA Taleizadeh","year":"2019","unstructured":"Taleizadeh, A. A., Hajisami, E., & Nooridaryan, M. (2019). A robust optimization model for coordinating pharmaceutical reverse supply chains under return strategies. Annals of Operations Research, 1, 1\u201322.","journal-title":"Annals of Operations Research"},{"issue":"1","key":"4012_CR34","doi-asserted-by":"publisher","first-page":"148","DOI":"10.1016\/S0377-2217(02)00669-0","volume":"152","author":"CD Tarantilis","year":"2004","unstructured":"Tarantilis, C. D., Kiranoudis, C. T., & Vassiliadis, V. S. (2004). A threshold accepting metaheuristic for the heterogeneous fixed fleet vehicle routing problem. European Journal of Operational Research, 152(1), 148\u2013158.","journal-title":"European Journal of Operational Research"},{"key":"4012_CR35","first-page":"1","volume":"2014","author":"Q Wang","year":"2014","unstructured":"Wang, Q., Ji, Q., & Chiu, C. H. (2014). Optimal routing for heterogeneous fixed fleets of multi-compartment vehicles. Mathematical Problems in Engineering, 2014, 1\u201311.","journal-title":"Mathematical Problems in Engineering"},{"issue":"05","key":"4012_CR36","first-page":"629","volume":"25","author":"XB Wang","year":"2010","unstructured":"Wang, X. B., & Li, Y. J. (2010). Study on multi-type vehicles and single centre vehicle routing problem with backhauls. Journal of Systems Engineering, 25(05), 629\u2013636.","journal-title":"Journal of Systems Engineering"},{"issue":"2","key":"4012_CR37","doi-asserted-by":"publisher","first-page":"303","DOI":"10.1007\/s10479-015-1792-x","volume":"242","author":"B Yao","year":"2016","unstructured":"Yao, B., Yu, B., Hu, P., Gao, J., & Zhang, M. (2016). An improved particle swarm optimization for carton heterogeneous vehicle routing problem with a collection depot. Annals of Operations Research, 242(2), 303\u2013320.","journal-title":"Annals of Operations Research"},{"issue":"2","key":"4012_CR38","doi-asserted-by":"publisher","first-page":"55","DOI":"10.4995\/ijpme.2017.5916","volume":"5","author":"M Yousefikhoshbakht","year":"2017","unstructured":"Yousefikhoshbakht, M., & Dolatnejad, A. (2017). A column generation for the heterogeneous fixed fleet open vehicle routing problem. International Journal of Production Management and Engineering, 5(2), 55\u201371.","journal-title":"International Journal of Production Management and Engineering"},{"key":"4012_CR39","doi-asserted-by":"publisher","first-page":"511","DOI":"10.1016\/j.trb.2019.03.009","volume":"122","author":"Y Yu","year":"2019","unstructured":"Yu, Y., Wang, S., Wang, J., & Huang, M. (2019). A branch-and-price algorithm for the heterogeneous fleet green vehicle routing problem with time windows. Transportation Research Part B-methodological, 122, 511\u2013527.","journal-title":"Transportation Research Part B-methodological"},{"key":"4012_CR40","first-page":"1","volume":"1","author":"S Zandkarimkhani","year":"2020","unstructured":"Zandkarimkhani, S., Mina, H., Biuki, M., & Govindan, K. (2020). A chance constrained fuzzy goal programming approach for perishable pharmaceutical supply chain network design. Annals of Operations Research, 1, 1\u201328.","journal-title":"Annals of Operations Research"}],"container-title":["Annals of Operations Research"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10479-021-04012-4.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s10479-021-04012-4\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10479-021-04012-4.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,1,4]],"date-time":"2022-01-04T02:10:05Z","timestamp":1641262205000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s10479-021-04012-4"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021,3,11]]},"references-count":39,"journal-issue":{"issue":"1-2","published-print":{"date-parts":[[2022,1]]}},"alternative-id":["4012"],"URL":"https:\/\/doi.org\/10.1007\/s10479-021-04012-4","relation":{},"ISSN":["0254-5330","1572-9338"],"issn-type":[{"type":"print","value":"0254-5330"},{"type":"electronic","value":"1572-9338"}],"subject":[],"published":{"date-parts":[[2021,3,11]]},"assertion":[{"value":"24 February 2021","order":1,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"11 March 2021","order":2,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}