Multiple Ant-Colony Optimization for Network Routing
CW '02 Proceedings of the First International Symposium on Cyber Worlds (CW'02)
A GIS supported ant algorithm for the linear feature covering problem with distance constraints
Decision Support Systems
International Journal of Geographical Information Science
Ant colony system: a cooperative learning approach to the traveling salesman problem
IEEE Transactions on Evolutionary Computation
Data mining with an ant colony optimization algorithm
IEEE Transactions on Evolutionary Computation
| Hi-index | 0.00 |
Conventional methods have difficulties in forming optimal paths when raster data are used and multi-objectives are involved. This paper presents a new method of using ant colony optimization (ACO) for solving optimal path-covering problems on unstructured raster surfaces. The novelty of this proposed ACO includes the incorporation of a couple of distinct features which are not present in classical ACO. A new component, the direction function, is used to represent the 'visibility' in the path exploration. This function is to guide an ant walking toward the final destination more efficiently. Moreover, a utility function is proposed to reflect the multi-objectives in planning applications. Experiments have shown that classical ACO cannot be used to solve this type of path optimization problems. The proposed ACO model can generate near optimal solutions by using hypothetical data in which the optimal solutions are known. This model can also find the near optimal solutions for the real data set with a good convergence rate. It can yield much higher utility values compared with other common conventional models.