Research on the Application of Vehicle Routing Problem in Company M Based on AMPL

Abstract

This paper first reviews the current research status of the Vehicle Routing Problem (VRP), and analyzes the achievements of domestic and foreign scholars in VRP variants and the application of intelligent algorithms. Then, it describes in detail the distribution problem of Company M and establishes a mathematical model, which is solved by AMPL software. The research results show that the optimized distribution plan significantly improves the vehicle loading rate, reduces the number of distribution vehicles and the total driving distance, thereby greatly reducing the distribution cost. Specifically, before optimization, three vehicles were needed to complete the distribution task, with a total driving distance of 73.17 kilometers and a total distribution cost of 621.31 yuan; after optimization, only two vehicles are needed, the total driving distance is reduced to 55.56 kilometers, and the total distribution cost is reduced to 419.16 yuan, a cost reduction of 32%. This study verifies the effectiveness of AMPL software in vehicle routing optimization, providing a practical and feasible distribution optimization plan for Company M, significantly improving the efficiency of logistics distribution and reducing operating costs. Future research can further expand the data scale and consider more complex factors in actual scenarios to enhance the applicability and optimization effect of the model.