Urban Vehicle Routing Based on Ant Colony Algorithm

To solve the problem of urban traffic vehicle routing,an improved ant colony system(ACS) algorithm was proposed.The algorithm focuses on both distance and time costs of path planning.Its search rules and flow charts were given.Based on extensive simulation results,the effects of parameters of the algorithm on the convergence performance,including convergence rate and convergence accuracy,were discussed,and a set of empirical parameters were obtained.The reasons for fake optimal paths involved in the search were analyzed.Further,the algorithm was optimized by controlling the convergence rate and forcing the convergence toward to the optimal path.The simulation result indicates that the optimization is effective in restraining fake optimal paths and has a convergence rate within 2 cycles per search.