Finding the shortest path using the ant colony optimization

 
 
 
  • Abstract
  • Keywords
  • References
  • PDF
  • Abstract


    An ant colony optimization(ACO) is a techniquewhich is recently introduced ,and it is applied to solve several np-hard problems ,we can get optimal solution in a short time Main concept of the ACO is based on the behavior of ants in their colony for finding a source of food. They will communicate indirectly through pheromone trails. Computer based simulation is can generate good solution by using artificial ants, by using that general behavior we are solving travelling Sale man problem.


  • Keywords


    Optimization; Quadratic; Pheromone;Trails; NP-Hard.

  • References


      [1] Dweepna Garg and Saurabh Shah “Ant colony optimization for solving traveling salesman problem” vol 5,no 1,January-june 2011

      [2] Potyin J.Y (1993), The Traveling salesman problem: A Neural Network Perspective ORSA Journal of computing, 5 (4), 328-347.https://doi.org/10.1287/ijoc.5.4.328.

      [3] “Ant colony System. A cooperative learning approach to the traveling salesman problem,”IEE transaction on Evolutionary computatiom, vol 1, no-1, pp 53-66, 1997.

      [4] M. Dorigo and G. Di caro,”The Ant colony Optimization meta-heuristic”, in new in optimization, D.corneerl. eds., Mcgraw Hill, London, UK, pp. 11-32, 1999.

      [5] A.I &Kennington, J. L (1986).the asymmetric m-traveling salesman problem, a duality based branch and bound algorithm, Discrete Applied Mathematics,vol NO,13,pp-259-76.

      [6] Lin, S. (1986)”computer solution of the traveling salesman problem”, Bell syst journal 44, 2245-2269.https://doi.org/10.1002/j.1538-7305.1965.tb04146.x.

      [7] Dorigo, M & Gambardella, (1997)”Ant colonies for the traveling salesman problem”Biosystemsm43, 73-81.https://doi.org/10.1016/S0303-2647(97)01708-5.

      [8] “ACO algorithm with guaranteed convergence to the optimal solution”, Information Processing Letters, vol, 82, no.3, pp 145-153, 2002.https://doi.org/10.1016/S0020-0190(01)00258-7.

      [9] Gao Shang Zhang Lei Zhuang fengting Zhang Chunxian School of electronics and information Jianguru University of science and technology, Zhenjiang 212003, china.

      [10] C.S Jeongnad M.H Kim, “Fast parallel simulated annealing for traveling salesman problem”, Neural Network, vol.3 (1990), pp.947-953.

      [11] JinhuiYang,Xiaohushi,MaurizioMarchese and sanctum Liang Yanchum Liang, ”Ant colony optimization for generalized TSP problem”, college of computer science Jilin university,changchum 130012,china.

      [12] Zalilah Abd Aziz, ”Ant colony Hyper-heuristics for Travelling Salesman Problem”, Mara University,2015 IEEE{IRIS 2015}

      [13] Michalis Mavrobouniotis Felipe M.MullerShengxiang yang, “Ant colony optimization with local search for Dynamic Travelling salesman problem: IEEE, vol.47 no. 7, july 2017.

      [14] Hassan Ismkhan,”Effective heuristics for ant colony optimization to handle large scale problem”, swarm and evolutionary computation 32(2017)140-149

      [15] Srikantaparnaik,”Route optimization by Ant colony optimization technique”, school of study on computer science & IT, Raipur(Chhattisgarh)492010,India

      [16] Mateuzsekara Michal Kowalski,AleksandarByrski and bipinindurkhya,”Multi-pheromone ant colony optimization for socio-cognitive simulation process”.vol.51,2015.

      [17] Chi-bin cheng, chun-pin mao,” A modified ant colony system for solving he traveling salesman problems”, mathematical and computer modelling 46(2007).

      [18] Viktor danchuk, oelnabakulich, vitaliysyatko,”An improvement in ant algorithm method for optimizing a transport route with regard to raffix flow”, National transport university, Ukraine.

      [19] Aleksandar kaplarmilanvidakovic,nikolaluburic and mirjanaivanovic,”improving a distributed agent based ant colony optimization for solving traveling salesman problem”, university of novi sad, Serbia.

      [20] LIU shufenLenf Huang and hanlu,”Pheromone model selection in ant colony optimization for the traveling salesman problem”,jilin university, vol 26,No 2,13002,china


 

View

Download

Article ID: 9859
 
DOI: 10.14419/ijet.v7i1.1.9859




Copyright © 2012-2015 Science Publishing Corporation Inc. All rights reserved.