The Issue Of Vehicle Routing Problem On Account Of Mixing Behavior Ant Colony Optimization Algorithm Research

Vehicle routing problem(VRP) is studied on the problem of how to realizetransportation cost optimized dispatching by reasonable planning route and the relatedtheory and algorithm to solve this question is always the research topic of combinationoptimization and Operational research because it has important value to reduce logisticvalue. The vehicle problem could be divided into different categories by different goalspeople required.the paper firstly analyzes the current research status and vehicle routingclassification researched on the VRP at home and abroad. The VRP could be furtherrefinement into the vehicle routing problem with time window(VRPTW) mainly basedon the limit of the time to visit client point. On the basis of time, it can be divided intosingal and multiple depot. In view of the VRPTW, some intelligent algorithm constantlyemerging, and ant colony optimization algorithm has been widely concerned. InPrevious studies, the ant only select the next node by one way without changing theselecting node method so that it will lead the search into local optimum which narrowthe scope of the search and never consider the diversity of animal behavior. Forheuristic factor, many people only consider the impact of some factors on the localpathwithout considering the influence of the global path So the main content as follow:(1) The ant algorithm could be modified aimed at the existing problems of currentant algorithm to comprehensively consider the influence of selecting routing methodlocal and general and also diversity of artificial ants selecting routing method. The antalgorithm are established based on the mixing mechanism intelligent after further antintelligent that each artificial ant could choose its behavior norms through bettering thetransition probability and heuristic factor of ant algorithm.(2) From two kinds, we state the VRPTW which use the modified mixing behaviorAnt Algorithm method.The result shows that the modified mixing behavior antalgorithm is effective by the simulation experiment which apply the genetic algorithmand mixing behavior ant algorithm to solve the muptiple depot routing problem.