A Study On Algorithms Of Vehicle Routing Problem

Now the enterprise known as "the third profit source" of the logistics industry in the world economy, led in the modern economy occupy an important position in the national economy and social development and also play an important role. But because the logistics industry is still at a preliminary stage, the various statistics from existing data we can easily find that China's logistics industry in the cost is too high.Therefore, to reduce the cost of the logistics industry will become extremely important.To reduce the cost of logistics costs, logistics costs from the heart - to reduce logistics and distribution logistics and distribution costs is a good way to start. Need to reduce the cost of logistics and distribution, logistics and distribution path optimization is a top priority.Distribution Routing problem, in short, vehicle routing problem (Vehicle Routing Problem, VRP). Since Danting and Ramse VRP problem with the proposed 1959 (Danting & Ramse, 1959), you are highly concerned about domestic and foreign scholars, they had a lot of theoretical research, and proposed a variety of effective solutions; such as EXACT algorithms: branch and bound method (Branch and Bound Approach), K-degree center tree method (K-degree center tree and a related algorithm), etc.; classical heuristics: Conservation Act (Saving Heuristic), scan algorithm (Sweep Alogorithm ) and so on. The modern heuristic algorithms: simulated annealing algorithm (Simulated Annealing), taboo table algorithm (Taboo search), genetic algorithm (Genetic Algorithm), ant colony algorithm (AOC) and so on.In the meantime, based on the behavior of honey bees all bees were developed intelligent algorithm, the optimization is also a hot research field. Bees algorithm which DT Pham (Bee Algorithm, BA), Dervis Karaboga artificial bee colony algorithm (Aritificial Bee Colony, ABC), Dusan Teodorovic and Mauro Dell 'Orco colonies optimization algorithm (Bee Colony Optimization Metaheuristic, BCO) are has a strong representation. In this paper, these three methods of analysis and research, the algorithm BA, ABC, BCO and algorithms described in detail the basic framework to solve the problem and the corresponding pseudo-code. At the same time ABC, BCO on the basis of these two algorithms, drawing on other problems to solve VRP algorithm ideas, such as tabu list algorithm, saving algorithm ,2-opt technology, a very good solution with a vehicle routing problem with time windows (VRPTW). And the simulation of VRPTW problems, and solutions of other algorithms compared to that in the comparison, ABC, BCO algorithm optimization of the final results have been significantly improved. This also explains the use of intelligent algorithms that will swarm the problem in solving the VRP is feasible and is effective. Both were in the use of VRP problem solving process, the discovery of two adaptive algorithms for VRP, and then proposed a joint ABC, BCO two algorithms for solving the integrated solution, the algorithm flow chart for the next study good foundation.In determining the path of the final plan needs to be considered when the objective function of VRP problems contained in the factors. At the end, this article in order to better solve the VRP problem, the objective function to determine the weight of different factors, as well as ABC, BCO algorithm in the setting of some parameters is proposed AHP (AHP), the impact of various some qualitative factors into quantitative expression data, it makes the objective function VRP more multi-objective, more accurate; while making the process so that the two algorithms for solving them to play the role of parameters, so that the results of the algorithm is more optimization.