The Research Of Multi Compartment Vehicle Routing Problem With Time Windows

In recent years,with the in-depth study of vehicle paths,the issue of multi-compartment vehicle paths has become an important research direction.In real life,multi compartment vehicles are suitable for many scenarios such as refined oil distribution,garbage collection and cold chain product transportation.Distribution.The implementation of multi-compartment vehicle distribution not only protects the environment and saves non-renewable resources,but also reduces the impact on the company itself.Distribution costs are of great importance to improve service levels and enhance competitiveness.Considering that the problem of multi-compartment vehicle paths has important practical application value,which has not been thoroughly studied in the existing literature.Therefore,this paper explores and studies the multi-compartment vehicle path problem.This paper takes the multi-compartment vehicle path problem as the object of research and introduces the concept of time window according to the time-sensitive requirements of the customer point,compared to the past The study is more relevant.The main findings of this paper are as follows.(1)The current status of research on the multi-compartment vehicle path problem and the solution algorithm is mainly reviewed.The background of the application of the multi-compartment vehicle path problem in the existing literature is introduced in detail;and the extended multi-compartment vehicle path problem is described.research status.Subsequently,the algorithm for solving the multi-compartment vehicle path problem is reviewed and an improved particle swarm algorithm is identified as the solution for this paper to solve the band Algorithm for the time window multi-compartment vehicle path problem.(2)A mathematical model aiming at the shortest transport distance is constructed for the multi-compartment vehicle path problem with time windows.On the basis of the systematic description of the multi-compartment vehicle path problem with time window,reasonablepremises are made to ensure the necessity of the establishment of the model assumptions.Finally,the objective function and constraints of the model are analyzed and a three-subscript cargo flow model with the shortest transport distance as the objective is developed and three-subscript node models.(3)An improved particle swarm algorithm is proposed for solving the multi-compartment vehicle path problem with time windows.The algorithm optimizes the solution process by neighborhood search and path reconnection under the broad framework of the elementary particle swarm algorithm.The improved particle swarm algorithm is compared and analyzed with CPLEX and the solution results of existing literature,which verifies the improved particle swarm algorithm proposed in this paper.Validity of the algorithm.(4)In solving the adapted algorithm for the multi-compartment vehicle path problem with time window,for customer point sizes of 25,50,and 100.of the algorithm,the improved particle swarm algorithm are all able to obtain a satisfactory solution in a reasonable time.The variance of the best solution obtained from 30 random runs is small and the convergence range is within a predetermined number of iterations.The improved particle swarm optimization algorithm proposed in this paper can effectively solve the multi-compartment vehicle path problem with time window.