Research On Multi-Commodity Pickup And Delivery Vehicles Routing Problem And Cat Swarm Optimization

The problem of unpaired delivery route optimization has gradually attracted scholars’attention due to its theory and practical significance.The main characteristic of this problem is that the customer’s request is divided into a shipment request and a purchase request,and the customer’s request can be satisfied by other customers or deports.This kind of problem exists widely in real life,such as the rebalancing of goods between multiple deports in an enterprise Questions,etc.At present,research on the optimization of unpaired pick-up and delivery vehicle routes is mainly focused on single-type transport goods,single-transport vehicles,and single deports.There is compatibility between multiple types of transport goods,multi-transport vehicles,multi-depots,and transport goods.There are few studies on sexual constraints and other issues.This article analyzes and researches the optimization of the delivery vehicle routing problem with product compatibility constraints from multiple perspectives.The specific research content is as follows:(1)A study on the optimization of multi-commodity pick-up and delivery vehicle routing in a single deports with commodity compatibility constraints.Consider the compatibility constraints of goods during transportation,that is,certain types of goods cannot coexist in one car during transportation,and the number of garages and deports is 1 and are in the same location.During the service of customers,the type of goods and the quantity of each type of goods can be split.The customer’s purchase types can be split but the quantity of each type of goods cannot be split.The optimization goal is to minimize the total transportation cost on the premise of meeting all customer requests.The total transportation cost includes the running cost of the vehicle and the fixed cost of the vehicle.Firstly,the mathematical model of the problem is established.According to the characteristics of the problem,the corresponding cat swarm optimization is designed,and the cat swarm optimization is improved.The solution to the problem is discussed from different angles and relevant experiments are performed.The effects of the grouping rate,the combination of different neighborhood strategies,and the algorithm flow in the cat swarm optimization were discussed.Finally,a better performing cat swarm optimization was determined.On this basis,the influence of factors such as the split mode and compatibility between products are further explored.(2)Research on the optimization of multi-deports and multi-commodity pick-up and delivery vehicle routing with product compatibility constraints.Based on the study of the single deport problem,consider the case of multiple deports,and the garage and the deport are not in the same location.In the multi-deports problem,different deports can provide different types of goods to be accommodated.Combined with factors such as the location of the deport,it will affect the path of the vehicle and the loading and unloading plan of the vehicle at different points.To solve the problem,first establish a corresponding mathematical model and design a corresponding cat swarm algorithm.The grouping rate in the cat swarm optimization,the combination of neighborhood strategies,and the effects of different processes of the algorithm are discussed.Finally,a better cat swarm optimization is determined.Furthermore,for different constraints,the influence of the splitting mode and the compatibility between products are discussed,and the feasibility and stability of the algorithm are verified.