Abstract
This paper presents a Strategy adaptive Genetic Algorithm to address a wide range of sequencing discrete optimization problems. As for the performance analysis, we have applied our algorithm on the Travelling Salesman Problem(TSP).Here we present an innovative crossover scheme which selects a crossover strategy from a consortium of three such crossover strategies, the choice being decided partly by the ability of the strategy to produce fitter off springs and partly by chance. We have maintained an account of each such strategy in producing fit off springs by adopting a model similar to The Ant Colony Optimization. We also propose a new variant of the Order Crossover which retains some of the best edges during the inheritance process. Along with conventional mutation methods we have developed a greedy inversion mutation scheme which is incorporated only if the operation leads to a more economical traversal. This algorithm provides better results compared to other heuristics, which is evident from the experimental results and their comparisons with those obtained using other algorithms.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Similar content being viewed by others
References
Dorigo, M., Stutzle, T.: A Bradford Book. The MIT Press, ISBN 0-262-04219-3
Ahmed, Z.H.: Genetic Algorithm for the Travelling Salesman Problem using sequential constructive crossover. IJBB 3(6) (2010)
Oliver, I., et al.: A study of permutation crossover operators on the travelling salesman problem. In: Proc. of the Second Int. Conf. on Genetic Algorithms, pp. 224–230 (1987)
Davis, L.: Applying Adaptive Algorithms to Epistatic Domains. In: Proceedings of the International Joint Conference on Artificial Intelligence, pp. 162–164 (1985)
Prim, R.C.: Shortest connection networks and some generalizations. Bell System Technical Journal 36, 1389–1401 (1957)
A Novel Set-Based Particle Swarm Optimization Method for Discrete Optimization Problems. IEEE Transactions on Evolutionary Computation 14(2) (April 2010)
Solving Travelling Salesman Problem by Using Improved Ant Colony Optimization Algorithm. International Journal of Information and Education Technology 1(5) (December 2011)
Ray, S.S., Bandyopadhyay, S., Pal, S.K.: Newoperators of genetic algorithms for traveling salesman problem. In: ICPR 2004, Cambridge, UK, vol. 2, pp. 497–500 (2004)
Larranaga, P., Kuijpers, C., Murga, R., Inza, I., Dizdarevic, S.: Genetic algorithms for the travelling salesman problem: a review of representations and operators. Artificial Intell. Rev. 13, 129–170 (1999)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2012 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Mukherjee, S., Ganguly, S., Das, S. (2012). A Strategy Adaptive Genetic Algorithm for Solving the Travelling Salesman Problem. In: Panigrahi, B.K., Das, S., Suganthan, P.N., Nanda, P.K. (eds) Swarm, Evolutionary, and Memetic Computing. SEMCCO 2012. Lecture Notes in Computer Science, vol 7677. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-35380-2_91
Download citation
DOI: https://doi.org/10.1007/978-3-642-35380-2_91
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-35379-6
Online ISBN: 978-3-642-35380-2
eBook Packages: Computer ScienceComputer Science (R0)