TY - JOUR
T1 - Managing pharmaceuticals delivery service using a hybrid particle swarm intelligence approach
AU - Wu, Xiaodan
AU - Li, Ruichang
AU - Chu, Chao Hsien
AU - Amoasi, Richard
AU - Liu, Shan
N1 - Funding Information:
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.
Publisher Copyright:
© 2021, The Author(s), under exclusive licence to Springer Science+Business Media, LLC, part of Springer Nature.
PY - 2022/1
Y1 - 2022/1
N2 - 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.
AB - 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.
UR - http://www.scopus.com/inward/record.url?scp=85102286985&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=85102286985&partnerID=8YFLogxK
U2 - 10.1007/s10479-021-04012-4
DO - 10.1007/s10479-021-04012-4
M3 - Article
AN - SCOPUS:85102286985
SN - 0254-5330
VL - 308
SP - 653
EP - 684
JO - Annals of Operations Research
JF - Annals of Operations Research
IS - 1-2
ER -