Using Local Searches Algorithms with Ant Colony Optimization for the Solution of TSP Problems
Swarm intelligence is a relatively new approach to problem solving that takes inspiration from the social behaviors of insects and other animals. Ants, in particular, have inspired a number of methods and techniques among which the most studied and successful is the general-purpose optimization technique, also known as ant colony optimization, In computer science and operations research, the ant colony optimization algorithm (ACO) is a probabilistic technique for solving computational problems which can be reduced to finding good paths through graphs. Ant Colony Optimization (ACO) algorithm is used to arrive at the best solution for TSP. In this article, the researcher has introduced ways to use a great deluge algorithm with the ACO algorithm to increase the ability of the ACO in finding the best tour (optimal tour). Results are given for different TSP problems by using ACO with great deluge and other local search algorithms.
2. Marco Dorigo, Thomas Stu¨ tzle”, (2004), Ant Colony Optimization
3. Federico Greco, (2008), Travelling Salesman Problem
4. J. Basic. Appl. Sci. Res., 2(3)2336-2341, (2012), A New Hybrid Algorithm for Optimization Using PSO and GDA
5. D. Karapetyan, G. Gutin, (2012), Efficient Local Search Algorithms for Known and New Neighborhoods for the Generalized Traveling Salesman Problem
6. Andrej Kazakov, (2009), Travelling Salesman Problem : Local Search and Divide and Conquer working together
7. Alfonsas misevičius, armantas ostreika, antanas šimaitis, vilius žilevičius, (2007), vol.36, no.2, improving local search for the traveling salesman problem.
8. Almufti, S. Mohammed (2017), " Using Swarm Intelligence for solving NP-Hard Problems", Academic Journal of Nawroz University, doi
( https ://doi.org/10.25007/ajnu.v6n3a78 ).
This work is licensed under a Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 International License.
Authors who publish with this journal agree to the following terms:
- Authors retain copyright and grant the journal right of first publication with the work simultaneously licensed under a Creative Commons Attribution License [CC BY-NC-ND 4.0] that allows others to share the work with an acknowledgment of the work's authorship and initial publication in this journal.
- Authors are able to enter into separate, additional contractual arrangements for the non-exclusive distribution of the journal's published version of the work (e.g., post it to an institutional repository or publish it in a book), with an acknowledgment of its initial publication in this journal.
- Authors are permitted and encouraged to post their work online (e.g., in institutional repositories or on their website) prior to and during the submission process, as it can lead to productive exchanges, as well as earlier and greater citation of published work (See The Effect of Open Access).
AJNU is committed to protecting the privacy of the users of this journal website. The names, personal particulars and e-mail addresses entered in this website will be used only for the stated purposes of this journal and will not be made available to third parties without the user's permission or due process. Users consent to receive communication from the AJNU for the stated purposes of the journal. Queries with regard to privacy may be directed to firstname.lastname@example.org.