Abstract
Travelling Salesman Problem (TSP) is a NP-Hard combinatorial optimization problem and many real life problems are constrained replica of it which possesses exponential time complexity and requires heavy combination capability. In this work a new nature inspired meta-heuristics called Egyptian Vulture Optimization Algorithm (EVOA) is being introduced and presented for the first time and illustrated with examples how it can be utilized for the constrained graph based problems and is utilized to solve the various dimensional datasets of the traditional travelling salesman problem. There are not many discrete optimization bio-inspired algorithms available in the literature and in that respect it is a novel one which can readily utilized for the graph based and assignment based problems. This EVOA is inspired by the natural and skilled phenomenal habits, unique perceptions and intelligence of the Egyptian Vulture bird for carry out the livelihood and acquisition of food which is inevitable for any kind of organisms. The Egyptian Vulture bird is one of the few birds who are known for showing dexterous capability when it comes to its confrontation with tough challenges and usage of tools with combinations of force and weakness finding ability. The results show that the Egyptian Vulture Optimization meta-heuristics has potential for deriving solutions for the TSP combinatorial problem and it is found that the quality and perfection of the solutions for the datasets depend mainly on the number of dimensions when considerable for the same number of iterations.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Egyptian Vulture details, http://en.wikipedia.org/wiki/Egyptian_Vulture
Vulture Photo, http://www.flickr.com/photos/spangles44/5600556141
Blum, C., Roli, A.: Metaheuristics in Combinatorial Optimization: Overview and Conceptual Comparison. ACM Comput. Survey 35, 268–308 (2003)
Kennedy, J., Eberhart, R.: Particle Swarm Optimization. In: IEEE International Conference on Neural Networks, vol. 4, pp. 1942–1948 (1995)
Karaboga, D.: An Idea Based on Honey Bee Swarm for Numerical Optimization. Technical Report TR06, Erciyes University (2005)
Kashan, A.H.: League Championship Algorithm: A New Algorithm for Numerical Function Optimization. In: International Conference of Soft Computing and Pattern Recognition, pp. 43–48. IEEE Computer Society, Washington, DC (2009)
Yang, X.S., Deb, S.: Cuckoo search via Levy flights, In: World Congress on Nature & Biologically Inspired Computing, pp. 210-214. IEEE Publication, USA (2009)
Yang, X.-S.: A New Metaheuristic Bat-Inspired Algorithm. In: González, J.R., Pelta, D.A., Cruz, C., Terrazas, G., Krasnogor, N. (eds.) NICSO 2010. SCI, vol. 284, pp. 65–74. Springer, Heidelberg (2010)
Kirkpatrick, S., Gelatt Jr., C.D., Vecchi, M.P.: Optimization by Simulated Annealing. Science 220(4598), 671–680 (1983)
Storn, R., Price, K.: Differential Evolution - A Simple and Efficient Heuristic for Global Optimization Over Continuous Spaces. Journal of Global Optimization 11(4), 341–359 (1997)
Farmer, J.D., Packard, N., Perelson, A.: The Immune System, Adaptation and Machine Learning. Physica D 22, 187–204 (1986)
Geem, Z.W., Kim, J.H., Loganathan, G.V.: A new heuristic optimization algorithm: harmo-ny search. Simulation 76, 60–68 (2001)
Krishnanand, K., Ghose, D.: Glowworm swarm optimization for simultaneous capture of multiple local optima of multimodal functions. Swarm Intelligence 3(2), 87–124 (2009)
Haddad, O.B., et al.: Honey-bees mating optimization (HBMO) algorithm: a new heuristic approach for water resources optimization. Water Resources Management 20(5), 661–680 (2006)
Tamura, K., Yasuda, K.: Primary Study of Spiral Dynamics Inspired Optimization. IEEE Transactions on Electrical and Electronic Engineering 6, S98–S100 (2011)
Hamed, S.H.: The intelligent water drops algorithm: a nature-inspired swarm-based optimization algorithm. International Journal of Bio-Inspired Computation 1, 71–79 (2009)
Civicioglu, P.: Transforming geocentric cartesian coordinates to geodetic coordinates by using differential search algorithm. Computers & Geosciences 46, 229–247 (2012)
Tayarani-N, M.H., Akbarzadeh-T, M.R.: Magnetic Optimization Algorithms a new synthesis. In: IEEE Congress on Evolutionary Computation, pp. 2659–2664 (2008)
Reynolds, C.W.: Flocks, herds and schools: A distributed behavioral model. Computer Graphics 21, 25–34 (1987)
Kaveh, A., Talatahari, S.: A Novel Heuristic Optimization Method: Charged System Search. Acta Mechanica 213, 267–289 (2010)
Gandomi, A.H., Alavi, A.H.: Krill Herd Algorithm: A New Bio-Inspired Optimization Algorithm. Communications in Nonlinear Science and Numerical Simulation (2012)
Tamura, K., Yasuda, K.: Spiral Dynamics Inspired Optimization. Journal of Advanced Computational Intelligence and Intelligent Informatics 15, 1116–1122 (2011)
Wolpert, D.H., Macready, W.G.: No free lunch theorems for Optimization. IEEE Transactions on Evolutionary Computation 1, 67–82 (1997)
Liang, Y.C., et al.: Virus Optimization Algorithm for Curve Fitting Problems. In: IIE Asian Conference (2011)
Dataset Library, http://elib.zib.de/pub/mp-testdata/tsp/tsplib/tsplib.html
Lin, S., Kernighan, B.W.: An effective heuristic algorithm for the travelling salesman problem. Operations Research 21, 498–516 (1973)
Helsgaun, K.: An effective implementation of the linkernighan travelling salesman heuristic. European Journal of Operational Research 126(1), 106–130 (2000)
Applegate, D., Bixby, R.E., Chvátal, V., Cook, W.: TSP Cuts Which Do Not Conform to the Template Paradigm. In: Jünger, M., Naddef, D. (eds.) Computational Combinatorial Optimization. LNCS, vol. 2241, pp. 261–304. Springer, Heidelberg (2001)
Hahsler, M., Hornik, K.: TSP Infrastructure for the Travelling Salesperson Problem (2007)
Dantzig, G.B., Fulkerson, D.R., Johnson, S.M.: Solution of a Large-scale Traveling Salesman Problem. Operations Research 2, 393–410 (1954)
Miller, P.J.: Exact Solution of Large Asymmetric Traveling Salesman Problems. Science 251, 754–761 (1991)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2013 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Sur, C., Sharma, S., Shukla, A. (2013). Solving Travelling Salesman Problem Using Egyptian Vulture Optimization Algorithm – A New Approach. In: Kłopotek, M.A., Koronacki, J., Marciniak, M., Mykowiecka, A., Wierzchoń, S.T. (eds) Language Processing and Intelligent Information Systems. IIS 2013. Lecture Notes in Computer Science, vol 7912. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-38634-3_28
Download citation
DOI: https://doi.org/10.1007/978-3-642-38634-3_28
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-38633-6
Online ISBN: 978-3-642-38634-3
eBook Packages: Computer ScienceComputer Science (R0)