Research Of Chaotic Particle Swarm Algorithm On Ncident Vehicle Routing Problem With Time Windows

Along with social progress, the logistics industry has been rapidly develop.logistics was enter and create changes in our lives. Incident Vehicle Routing Problem (IVRP) is one branch of vehicle routing problems, research needs or time relationship of IVRP. IVRP belongs to NP-hard problem. There has wide area of application and great economic value for studying this problem.Focus on Incident Vehicle Routing Problem with Time-windows (IVRP-TW), I start from the basic problems of VRP, using the chaos particle swarm optimization (CPSO), focus research with hard time windows, soft time windows and fuzzy time window Vehicle Routing Problem. The main work of this thesis:1. Research the basic principles of chaotic particle swarm algorithm (CPSO) and algorithm process, and describe an adaptive inertia weight factor optimization method for basic problems of VRP, the establishment of an accurate mathematical model, and use the chaotic particle swarm optimization (CPSO) to get a simulation analysis.2. Research the Incident Vehicle Routing Problem with Hard Time-windows (IVRP-HTW), in order to improve the accuracy of the algorithm, using an improved method of adaptive inertia weight factor to chaotic particle swarm optimization algorithm to optimize the experiments with the GA and the standard PSO analogy to prove, this improved particle swarm optimization algorithm efficient mathematical model for solving such problems.3. Research the Incident Vehicle Routing Problem with Soft Time-windows (IVRP-STW). Associated logistics scheduling problem with soft time windows using the logistic function optimization method to improve the chaotic particle algorithm, the same compared with the GA and the standard PSO algorithm, such optimization method can effectively improve the global search of the particles in the particle swarm and the ability of local search, is effective in resolving such problems.4. Research the Incident Vehicle Routing Problem with Fuzzy Time-windows (IVRP-FTW). Compare with the hard time window and the soft time window, the fuzzy time window is more complex in mathematical model’s construction. The article uses the double objective function the method, has established this kind of question mathematical model. In the solution process, in view of the double objective function’s characteristic, has used the method by stages, namely the first stage optimizes the algorithm with a chaos grain of subgroup to come to carry on the solution take the most low cost as the objective function model, obtains the preliminary optimal solution. Then the second stage used the simulation annealing algorithm to use the first stage the preliminary optimal solution to carry on the solution take the user service degree of satisfaction as the objective function mathematical model. The simulation annealing algorithm has to the initial solution dependence not high characteristic, very suitable to solve this kind of question.