Research And Design Of Vehicle Schedule Algorithm In Vehicle Dispatching System Of Large-Scale Sports Meeting

Vehicle schedule algorithms are concerned with efficiency to scheduling vehicle to trips in order of getting the lowest cost. In large-scale sports meeting, we should not only schedule vehicle to trips on time but also need reducing the cost in scheduling. Therefore, vehicle schedule algorithm research plays an important role in large-scale sports meeting vehicle schedule system.Traditional vehicle schedule algorithm includes simulated annealing vehicle schedule algorithm, taboo search vehicle schedule algorithm and iterated local search vehicle schedule algorithm. These algorithms try to find better solutions by exploring the neighborhood of a single solution. This paper proposes a new algorithm population-based iterated local search. Under a lot of experiments with different data sets, the algorithm uses "block-move" neighborhood which is better than shift neighborhood and swap neighborhood. Another contribution of this paper is the detailed experiments results of comparing PILS with many other vehicle schedule algorithms. The results show that PILS is better than tabu search and iterated local search.This paper firstly introduces the vehicle schedule algorithm research and development status, and elaborates the basic theoretical knowledge related to this research. Then it gives out an analysis and summary to the current vehicle schedule algorithms and describes these algorithms’ advantages and shortcomings. After that, this paper introduces the population-based iterated local search algorithm PILS, including problem definition, mathematical modeling, basic principles of the algorithm and algorithm description. Then it makes a large number of performance comparison experiments with different data sets. After that, it assesses and analyzes the performance differences among current several types of vehicle schedule algorithms. Finally, this paper gives out summary and prospect of vehicle schedule.