Vehicle Routing Optimization Algorithms for Pharmaceutical Supply Chain: A Systematic Comparison

Abstract

Nowadays, supply chain and road networks are full of complexity. Companies can differentiate themselves by offering superior customer service. Therefore, pharmaceutical distributors need to optimize route distribution for efficient and effective delivery to pharmacies, enhancing their competitiveness. In the field of operations research (OR), efficient route optimization is a significant function of the Vehicle Routing Problem (VRP) where the goal is to find the optimal distance travelled. The VRP can be solved using a range of algorithms, comprising exact methods, heuristics and meta-heuristics. This paper gives the basic concepts of some algorithms and these algorithms are compared based on the results. This study also extends its focus to the variation known as the Vehicle Routing Problem with Time Windows (VRPTW), that closely mirrors real-world scenarios, allowing for a more practical assessment of pharmaceutical distribution challenges and optimization solutions.