| The process of physical transportation vehicle scheduling is complicated and changeable. At present, there is still no convincible ways and suitable mathematical means to solve this kind of problem. What' more, instructing science theories are also wanted in this scope. In order to solve these problems, we usually use the heuristic method to help us make scientific decisions and get more benefits with less cost in the transportation systems.The Ant Colony Algorithms (ACA) is a new method for optimization, which is based on the research on the ant colony. It iterates to the best answer according to selective strategy and information element, which is generated by each ant The traditional algorithms have the problems of early converged or stopped This paper first analyzes the factors producing and then introduces a new solution.This paper makes improvements in the selective strategy and the updating rules of the information element in order to accelerate the convergent speed and enhance the searching ability.Based on the modem physical technology, especially the vehicle scheduling and the ant algorism theories, this paper makes a deeply research in theories, methods and models aiming at Ihe present problems. The vehicle scheduling is a new researching scope involving multiple subjects. Based on the basic theories, This paper introduces the ant algorism to solve the vehicle scheduling problems. This paper also gives a deep discussion on the optimization of the vehicles' counts. Furthermore, this thesis searches some new methods for the vehicle scheduling problems with or without time-window. Then, in order to verify the algorism, this paper programs the scheduling procedures with Matalab language. At last, the paper also discusses some problems involving calculations.The conclusion of this diesis is realistic both in theory and in application for setting up comtemporaneity physical transportation vehicle scheduling system, and it is valuable for the study of ant colony Algorithm.
|
PDF Full Text Request