Research on Traveling Routes Problems Based on Improved Ant Colony Algorithm

摘要

This paper studies how to obtain a reasonable traveling route among given attractions. Toward this purpose, we propose an objective optimization model of routes choosing, which is based on the improved Ant Colony Algorithm. Furthermore, we make some adjustment in parameters in order to improve the precision of this algorithm. For example, the inspired factor has been changed to get better results. Also, the ways of searching have been adjusted so that the traveling routes will be well designed to achieve optimal effects. At last, we select a series of attractions in Beijing as data to do an experimental analysis, which comes out with an optimum route arrangement for the travelers; that is to say, the models we propose and the algorithm we improved are reasonable and effective.