| Vehicle Routing Problem(VRP)is a classic combination optimization problem in Operation Research community.The original VRP problem and its sub-problem models have a widely applications among economy,transportation and environment protection area,i.e.Supply Chain Management,Transportation Optimization Problem and Hazard Waste Collection Problem.And also,VRP problem is a classic NP-Hard optimization problem.Thus the development of methods which are used to solve VRP problem has a significant means to the advancement of optimization technology development.Multi Ant Colony System(MACS)is one kind of methods which are used to solve complex optimization problem.It solve multi objective optimization problem by dividing multi objective optimization problem into single objective ones.These single objective problems are solved by multi Ant Colony Optimization(ACO)procedures which run independently and by combining the results of different ACOs together the original multi objective optimization problem is solved.This method has been applied to a huge amount of different optimization problems.This study abstracts a new VRP model from an important practical problem,then methods were designed to solve the new problem.The main work of this study includes:(1)A new model of VRP problem is constructed.Then the model is analyzed and the main points of solving this model are summarized.(2)Based on the problem analysis,the main problem of this study was divided into two sub-problems,and then these two problems were solved.(3)The main problem of this study was solved based on newly designed rules and the methods which were used to solve the two sub-problems.(4)The three algorithms were tested using benchmark tests which were generated from classic VRP benchmark tests.The computation results showed that all of the algorithms which are described in this paper have a good performance in solving the new VRP problem model with relatively low time costs and high robustness. |
PDF Full Text Request