Study On Ant Colony Algorithm And Its Application For Logistic Transportation Vehicle Scheduling Problem

The paper introduces Ant Colony Algorithm(ACA)'s bionic principle, expounds its implementation procedure. It analyzes and studies the five basic models of ACA, compares their difference on performance by simulation experiments. It synthesizes several typical modified ACA which are brought forward by scholars. It lists several important parameters which affect algorithm performance, does discussion and analysis on them, gets the affection degree of them . It discusses ACA's time complexity and space complexity. It studies ACA's parameter setting, brings forward a parameter self-adapting setting ACA. Simulation experiments prove the improved ACA is right.It applies the improved ACA to logistic transportation vehicle scheduling problem(VSP) . Due to the VSP can be sorted as non-time window and time window, it gives the ACA implementation procedure respectively. The validity of ACA in VSP is proved by actual vehicle scheduling experiments.