nach oben

Neural Computing and Applications

Erschienen in:

30.08.2017 | Original Article

Discrete greedy flower pollination algorithm for spherical traveling salesman problem

verfasst von: Yongquan Zhou, Rui Wang, Chengyan Zhao, Qifang Luo, Mohamed A. Metwally

Erschienen in: Neural Computing and Applications | Ausgabe 7/2019

Einloggen

Aktivieren Sie unsere intelligente Suche, um passende Fachinhalte oder Patente zu finden.

search-config

KI-gestützte Suche

Aus

Abstract

This paper deals with the spherical traveling salesman problem. In this problem, all cities are located on the surface of a sphere and the cities must be visited exactly once in a tour. We propose a new and effective meta-heuristic algorithm with greedy behavior for solving this problem. The proposed algorithm is based on the discrete flower pollination algorithm, which is a bio-inspired meta-heuristic algorithm enhanced by order-based crossover, pollen discarding behavior and partial behaviors. To evaluate the proposed algorithm, it is compared with four effective existing algorithms (the genetic algorithm, two variants of the genetic algorithm and tabu search) on a set of available spherical traveling salesman instances. The results show the superiority of our algorithm in both solution quality and robustness of the solutions.

Vorheriger Artikel A hybrid conceptual cost estimating model using ANN and GA for power plant projects

Nächster Artikel Adaptive consensus tracking of non-square MIMO nonlinear systems with input saturation and input gain matrix under directed graph

Sie haben noch keine Lizenz? Dann Informieren Sie sich jetzt über unsere Produkte:

Springer Professional "Wirtschaft"

Online-Abonnement

Mit Springer Professional "Wirtschaft" erhalten Sie Zugriff auf:

über 67.000 Bücher
über 340 Zeitschriften

aus folgenden Fachgebieten:

Bauwesen + Immobilien
Business IT + Informatik
Finance + Banking
Management + Führung
Marketing + Vertrieb
Versicherung + Risiko

Jetzt Wissensvorsprung sichern!

Jetzt informieren

Springer Professional "Technik"

Online-Abonnement

Mit Springer Professional "Technik" erhalten Sie Zugriff auf:

über 67.000 Bücher
über 390 Zeitschriften

aus folgenden Fachgebieten:

Automobil + Motoren
Bauwesen + Immobilien
Business IT + Informatik
Elektrotechnik + Elektronik
Energie + Nachhaltigkeit
Maschinenbau + Werkstoffe

Jetzt Wissensvorsprung sichern!

Jetzt informieren

Springer Professional "Wirtschaft+Technik"

Online-Abonnement

Mit Springer Professional "Wirtschaft+Technik" erhalten Sie Zugriff auf:

über 102.000 Bücher
über 537 Zeitschriften

aus folgenden Fachgebieten:

Automobil + Motoren
Bauwesen + Immobilien
Business IT + Informatik
Elektrotechnik + Elektronik
Energie + Nachhaltigkeit
Finance + Banking
Management + Führung
Marketing + Vertrieb
Maschinenbau + Werkstoffe
Versicherung + Risiko

Jetzt Wissensvorsprung sichern!

Jetzt informieren

Arora S (1999) Polynomial time approximation schemes for Euclidean travelling salesman and other geometric problems. J ACM 45(5):753–782CrossRefMATH

Zhang WX, Korf RE (1996) A study of complexity transitions on the asymmetric travelling salesman problem. Artif Intell 81(1–2):223–239CrossRef

Rodriguez A, Ruiz R (2012) The effect of the asymmetry of road transportation networks on the travelling salesman problem. Comput Oper Res 39(7):1566–1576MathSciNetCrossRefMATH

Wang Y, Liu JH (2010) Chaotic particle swarm optimization for assembly sequence planning. Robot Comput Integr Manuf 26(2):212–222CrossRef

Berman P, Karpinski M (2006) Approximation algorithm for TSP. In: SODA’06, Miami, pp 641–648

Matail R (2010) Travelling salesman problem: an overview of applications, formulations, and solution approaches. Travel Salesm Probl Theory Appl. doi:10.5772/12909

Shi P, Jia S (2013) A hybrid artificial bee colony algorithm combined with simulated annealing algorithm for travelling salesman problem. In: IEEE 2013 International conference on information science and cloud computing companion (ISCC-C). doi:10.1109/ISCC-C.2013.13

Tseng S-P (2010) A fast ant colony optimization algorithm for travelling salesman problem. Evol Comput. doi:10.1109/CEC.2010.5586153

Honda K, Nagata Y, Ono I (2013) A parallel genetic algorithm with edge assembly crossover for 100,000-city scale TSPs. In: IEEE 2013 IEEE congress on evolutionary computation (CEC), pp 1278–1285

10.

Duan Y, Sun Y (2009) A particle swarm optimization algorithm with ant search for solving travelling salesman problem. Int Conf Comput Intell Secur 11(14):137–141

11.

Chaudhuri A, De K (2008) A study of travelling salesman problem using fuzzy self-organizing map. Ind Inf Syst. doi:10.5772/13270

12.

Takahash S (2002) The SOM-TSP method for the there-dimension city location problem. In: Proceedings of the 9th international conference on neural information processing. doi:10.1109/ICONIP.2002.1201955

13.

Uğur A, Korukoğlu S, Çalışkan A et al (2009) Genetic algorithm based solution for TSP on a sphere. Math Comput Appl 14(3):219–228

14.

Lomnitz C (1995) On the distribution of distances between random points on a sphere. Bull Seismol Soc Am 85:951–953

15.

Gang W, Zhigang L (2011) Spherical travelling salesman problem constant and its experimental analysis. Appl Res Comput 28:4489–4491

16.

Yang XS (2012) Flower pollination algorithm for global optimization. In: Unconventional computation and natural computation, lecture notes in computer science, vol 445, pp 240–249

17.

Yang XS, Karamanoglu M, He XS (2014) Flower pollination algorithm: a novel approach for multi-objective optimization. Eng Optim 46(9):1222–1237MathSciNetCrossRef

18.

Yang XS, Karamanoglu M, He XS (2013) Multiobjective flower algorithm for optimization. Procedia Comput Sci 18:861–868CrossRef

19.

Sharawi M, Emary E, Saroit IA et al (2014) Flower pollination optimization algorithm for wireless sensor network lifetime global optimization. Int J Soft Comput Eng 4(3):54–59

20.

Abdel-Raouf O, Abdel-Baset M, El-henawy I (2014) A novel hybrid flower pollination algorithm with chaotic harmony search for solving sudoku puzzles. Int J Eng Trends Technol 7(3):126–132CrossRef

21.

Zhou Y, Wang R, Luo Q (2016) Elite opposition-based flower pollination algorithm. Neurocomputing 188:294–310CrossRef

22.

Zhou Y, Wang R (2016) An improved flower pollination algorithm for optimal unmanned undersea vehicle path planning problem. Int J Pattern Recognit Artif Intell 30(4):1659010CrossRef

23.

Wang R, Zhou Y, Qiao S, Huang K (2016) Flower pollination algorithm with bee pollinator for cluster analysis. Inf Process Lett 116(1):1–14CrossRef

24.

El-henawy I, Ismail M (2014) An improved chaotic flower pollination algorithm for solving large integer programming problems. Int J Digit Content Technol Its Appl 8(3):72–81

25.

Wikipedia, Great circle. http://en.wikipedia.org/wiki/Great_circle.2012

26.

Yang XS (2010) Engineering optimization: an introduction with metaheuristic applications. Wiley, New YorkCrossRef

27.

Karaboga D, Basturk B (2007) A powerful and efficient algorithm for numerical function optimization: artificial bee colony (ABC) algorithm. J Glob Optim 39(3):459–471MathSciNetCrossRefMATH

28.

Gao W-F, Liu S-Y (2012) A global best artificial bee colony algorithm for global optimization. J Comput Appl Math 236:2741–2753MathSciNetCrossRefMATH

29.

Fiechter CN (1994) A parallel tabu search algorithm for large travelling salesman problems. Discrete Appl Math 51(3):243–267MathSciNetCrossRefMATH

30.

Abdel-Basset M, Wang G-G, Sangaiah AK, Rushdy E (2017) Krill herd algorithm based on cuckoo search for solving engineering optimization problems. Multimed Tools Appl. doi:10.1007/s11042-017-4803-x

31.

Sangaiah AK, Thangavelu AK, Gao XZ, Anbazhagan N, Saleem Dur M (2015) An ANFIS approach for evaluation of team-level service climate in GSD projects using Taguchi-genetic learning algorithm. Appl Soft Comput 30:628–635CrossRef

32.

Wang G-G, Cai X, Cui Z, Min G, Chen J (2017) High performance computing for cyber physical social systems by using evolutionary multi-objective optimization algorithm. IEEE Trans Emerg Top Comput. doi:10.1109/TETC.2017.2703784

Titel: Discrete greedy flower pollination algorithm for spherical traveling salesman problem
verfasst von: Yongquan Zhou
Rui Wang
Chengyan Zhao
Qifang Luo
Mohamed A. Metwally
Publikationsdatum: 30.08.2017
Verlag: Springer London
Erschienen in: Neural Computing and Applications / Ausgabe 7/2019
Print ISSN: 0941-0643
Elektronische ISSN: 1433-3058
DOI: https://doi.org/10.1007/s00521-017-3176-4

Springer Professional

Abstract

Bitte loggen Sie sich ein, um Zugang zu Ihrer Lizenz zu erhalten.

Sie haben noch keine Lizenz? Dann Informieren Sie sich jetzt über unsere Produkte:

Springer Professional "Wirtschaft"

Springer Professional "Technik"

Springer Professional "Wirtschaft+Technik"

Weitere Artikel der Ausgabe 7/2019

Query-specific optimal convolutional neural ranker

Dynamic optimization based on state transition algorithm for copper removal process

Group decision making with interval fuzzy preference relations based on DEA and stochastic simulation

Forecasting of Turkey’s monthly electricity demand by seasonal artificial neural network

Undersampled face recognition based on virtual samples and representation classification

Numerical treatment of nonlinear singular Flierl–Petviashivili systems using neural networks models

Premium Partner