Abstract
Ant colony optimisation is a population-based advanced approach for finding the solution of difficult problems with the help of a bioinspired approach from the behaviour of natural ants. The ant colony algorithm is a propelled optimisation method which is utilised to take care of combinatorial optimisation problems. The significant features of this algorithm are the utilisation of a mixture of preinformation and postinformation for organizing great solutions. The ant colony algorithm is used in this paper for solving the travelling salesman problem of the real set of data and getting the optimal results on graphs. This algorithm is an meta-heuristic algorithm in which we used the 2-opt local search method for tour construction and roulette wheel selection method for selection of nodes while constructing the route. The results show that this algorithm can efficiently find the optimal path of the hundred cities with minimum time and cost.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
References
Escario, J.B., Jimenez, J.F., Giron-sierra, J.M.: Ant Colony Extended: Experiments on the Travelling Salesman Problem (2014)
Adham, M.T., Bentley, P.J.: An artificial ecosystem algorithm applied to the travelling salesman problem. In: Proceedings of the 2014 conference companion on Genetic and evolutionary computation companion—GECCO Comp ’14, pp. 155–156 (2014)
Wei, X., Han, L., Hong, L.: A modified ant colony algorithm for traveling salesman problem. IJCCC 9(5), 633–643 (2014)
Yu, Y., Chen, Y., Li, T.: A new design of genetic algorithm for solving TSP. Comput. Sci. Optim. (CSO) (2011)
O’Neill, M., Poli, R., Langdon, W.B., McPhee, N.F.: A field guide to genetic programming. In: Genetic Programming and Evolvable Machines, Mar 2008
Science, C., Engineering, S.: An approach to combinatorial problems by mapreduce based ant colony optimization. 4(1), 1009–1014 (2014)
Jing, S., Yan-ping, B., Hong-ping, H., Jin-na, L.: Using the Improved Ant Colony Algorithm to Solve the Chinese TSP. In: 2014 International Conference on Future Computer and Communication Engineering (ICFCCE 2014) (2014)
Dorigo, M., Stutzle, T.: Ant Colony Optimization: Overview and Recent Advances‖, Technical Report No. TR/IRIDIA/2009-013, pp. 1–32 (2009)
Runka, A.: Evolving an Edge Selection Formula for Ant Colony Optimization. 08 July 2009
Xu, S., Wang, Y., Huang, A.: Application of imperialist competitive algorithm on solving the traveling salesman problem. Algorithms 7, 229–242 (2014)
Mavrovouniotis, M.: Ant colony optimization with self-adaptive evaporation rate in dynamic environments. no. CCI. In: Oliver, R., Rickard, N. (eds.) Efficiently Vectorized Code for Population Based optimization Algorithms. 28 Mar 2013
Wei, X.: Parameters analysis for basic ant colony optimization algorithm in TSP. 7(4), 159–170 (2014)
Meşecan, İ., Bucak, İ.Ö., Asilkan, Ö.: Searching for the shortest path through group processing for TSP. Math. Comput. Appl. 16, 53–65 (2011)
Noraini, M.R., Geragthy, J.: Genetic Algorithm Performance With Different Selection Strategies in Solving TSP, (WCE 2011). London, U.K
Kanoh, H., Ochiai, J., Kameda, Y.: Pheromone trail initialization with local optimal solutions in ant colony optimization. Int. J. Knowl.-Based Intell. Eng. Syst. 18, 11–21 (2014)
Orld, R.E.A.L., Roblems, D.E.P., Rea, W.I.D.E.A., Etwork, R.O.A.D.N.: Hybrid Ant Colony Optimization for on Real Time and Predicted Traffic In, pp. 379–389 (2014)
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2016 Springer Science+Business Media Singapore
About this paper
Cite this paper
Sourabh Joshi, Sarabjit Kaur (2016). Ant Colony Optimization Meta-heuristic for Solving Real Travelling Salesman Problem. In: Shetty, N., Prasad, N., Nalini, N. (eds) Emerging Research in Computing, Information, Communication and Applications . Springer, Singapore. https://doi.org/10.1007/978-981-10-0287-8_5
Download citation
DOI: https://doi.org/10.1007/978-981-10-0287-8_5
Published:
Publisher Name: Springer, Singapore
Print ISBN: 978-981-10-0286-1
Online ISBN: 978-981-10-0287-8
eBook Packages: EngineeringEngineering (R0)