Ant Colony Optimization for Tourist Route

Ant Colony Optimization is a relatively new meta-heuristic that has proven its quality and versatility on various combinatorial optimization problems such as the traveling
salesman problem, the vehicle routing problem and the job shop scheduling problem. The inspiring source of ACO is the pheromone trail laying and following behavior of real ants, which use pheromones as a communication medium. In this project the ACO algorithm to routing problems in traveling cities under static and dynamic conditions. This study is divided into three parts. The first part aims to identify various connecting cities in Thailand with appropriate distances. The second part of this research involves formulating and applying the ACO algorithms to find the shortest path based on the distance calculated from source to destination cities. The ACO routing will then be applied on the constructed cities, taking into consideration different traffic conditions. The final part of the study focused on finding the shortest path and calculation of cost based on the distance traveled.