Abstract
Medicines or drugs have unique characteristics of short life cycle, small size, light weight, restrictive distribution time and the need of temperature and humidity control (selected items only). Thus, logistics companies often use different types of vehicles with different carrying capacities, and considering fixed and variable costs in service delivery, which make the vehicle assignment and route optimization more complicated. In this study, we formulate the problem to a multi-type vehicle assignment and mixed integer programming route optimization model with fixed fleet size under the constraints of distribution time and carrying capacity. Given non-deterministic polynomial hard and optimal algorithm can only be used to solve small-size problem, a hybrid particle swarm intelligence (PSI) heuristic approach, which adopts the crossover and mutation operators from genetic algorithm and 2-opt local search strategy, is proposed to solve the problem. We also adapt a principle based on cost network and Dijkstra’s algorithm for vehicle scheduling to balance the distribution time limit and the high loading rate. We verify the relative performance of the proposed method against several known optimal or heuristic solutions using a standard data set for heterogeneous fleet vehicle routing problem. Additionally, we compare the relative performance of our proposed Hybrid PSI algorithm with two intelligent-based algorithms, Hybrid Population Heuristic algorithm and Improved Genetic Algorithm, using a real-world data set to illustrate the practical and validity of the model and algorithm.
Similar content being viewed by others
References
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–34.
Brandão, J. (2011). A Tabu search algorithm for the heterogeneous fixed fleet vehicle routing problem. Computers & Operations Research, 38(1), 140–151.
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–1944.
Croes, G. A. (1958). A method for solving traveling-salesman problems. Operations Research, 6(6), 791–812.
Dijkstra, E. W. (1959). A note on two problems in connexon with graphs. Numerische Mathematik, 1(1), 269–271.
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.
Euchi, J. (2017). The vehicle routing problem with private fleet and multiple common carriers: Solution with hybrid metaheuristic algorithm. Vehicular Communications, 9, 97–108.
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–68.
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–1567.
Golden, B., Assad, A., Levy, L., & Gheysens, F. (1984). The fleet size and mix vehicle routing problem. Computers & Operations Research, 11(1), 49–66.
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–199.
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–338.
Koç, C., Bektas, T., Jabali, O., & Laporte, G. (2016). Thirty years of heterogeneous vehicle routing. European Journal of Operational Research, 249(1), 1–21.
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–174.
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–89.
Laporte, G. (1992). The vehicle routing problem: An overview of exact and approximate algorithms. European Journal of Operational Research, 59(3), 345–358.
Li, B. (2006). The determinitic dynamic vehicle allocation problem with multiple vehicle type. Journal of Industrial Engineering and Engineering Management, 3, 52–56.
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–2742.
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–1127.
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–908.
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.
Liu, S. (2013). A hybrid population heuristic for the heterogeneous vehicle routing problems. Transportation Research Part E: Logistics and Transportation Review, 54, 67–78.
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–112.
Marinakis, Y., Migdalas, A., & Sifaleras, A. (2017). A hybrid particle swarm optimization–variable neighborhood search algorithm for constrained shortest path problems. European Journal of Operational Research, 261(3), 819–834.
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–1056.
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–19.
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.
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–74.
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–712.
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.
Taillard, É. D. (1999). A heuristic column generation method for the heterogeneous fleet VRP. RAIRO-Operations Research, 33(1), 1–14.
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–22.
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–158.
Wang, Q., Ji, Q., & Chiu, C. H. (2014). Optimal routing for heterogeneous fixed fleets of multi-compartment vehicles. Mathematical Problems in Engineering, 2014, 1–11.
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–636.
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–320.
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–71.
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–527.
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–28.
Acknowledgement
This project was partially supported by the research funding by the National Natural Science Foundation of China (71302169) and the Natural Science Foundation of Hebei Province, China (G2019202488). Our deepest gratitude goes to the anonymous reviewers and editor for their careful review and comments and thoughtful suggestions that have helped improve this paper substantially.
Author information
Authors and Affiliations
Corresponding author
Additional information
Publisher's Note
Springer Nature remains neutral with regard to jurisdictional claims in published maps and institutional affiliations.
Rights and permissions
About this article
Cite this article
Wu, X., Li, R., Chu, CH. et al. Managing pharmaceuticals delivery service using a hybrid particle swarm intelligence approach. Ann Oper Res 308, 653–684 (2022). https://doi.org/10.1007/s10479-021-04012-4
Accepted:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s10479-021-04012-4