Abstract
Traveling in the community has become a lifestyle. Factors that become obstacles in every traveling activity include determining the destination. In this process, the traveler needs a short route. The Ant Colony algorithm is one of the heuristic methods for finding the right solution in a discrete optimization problem. The purpose of this study is to apply the workings of the Ant Colony Optimization algorithm in Traveling Problem. The information needed is information related to a location between cities and route planning for destination locations. The distance calculation is done by summing the initial distance to the end of the trip and calculating the cost of fuel. ACO has been applied to find optimal solutions to the Traveling Salesman Problem, by giving a number of n points. Keywords : Algorithm Ant Colony Optimization, Travelling Problem
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callMore From: Jurnal Pengajaran Matematika dan Ilmu Pengetahuan Alam
Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
