Skip to main content
Disciplines
Automotive Business IT + Informatics Construction + Real Estate Electrical Engineering + Electronics Energy + Sustainability Insurance + Risk Finance + Banking Management + Leadership Marketing + Sales Mechanical Engineering + Materials
Events
DE
EN
Books
Journals
Topic Page
Marketing
Start single access now
Access for companies
EXTENDED SEARCH
Log in
Top
Published in:
A Binary Grasshopper Optimisation Algorithm Applied to the Set Covering Problem Read chapter Read first chapter

2019 | OriginalPaper | Chapter

Chemical Reaction Optimization for Traveling Salesman Problem Over a Hypercube Interconnection Network

Authors : Ameen Shaheen, Azzam Sleit, Saleh Al-Sharaeh

Published in: Cybernetics and Algorithms in Intelligent Systems

Publisher: Springer International Publishing

Log in

Activate our intelligent search to find suitable subject content or patents.

search-config
loading …

Abstract

Traveling Salesman Problem is a well-known NP-Hard problem, which aims at finding the shortest path between numbers of cities. Chemical Reaction Optimization (CRO) is a recently established meta-heuristic algorithm for solving optimization problems which has successfully solved many optimization problems. The main goal of this paper is to investigate the possibility of parallelizing CRO for solving the TSP problem called (PCRO). PCRO is compared with Genetic Algorithm (GA), which is a well-known meta-heuristic algorithm. Experimental results show relatively better performance for PCRO in terms of execution time, Speedup, optimal cost and Error rate.

Dont have a licence yet? Then find out more about our products and how to get one now:

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!

inform now

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!

inform now

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!

inform now
previous chapter A Mixed Hybrid Conjugate Gradient Method for Unconstrained Engineering Optimization Problems
next chapter The Concept of the Method for Dynamic Control of Traffic Flows on Multi-lane Roads Based on Configurable Information Systems
Literature
1.
Vukmirović, S., Pupavac, D.: The Travelling Salesman Problem in the Function of Transport Network Optimalization. Fakulty of Economics, Interdisciplinary Management Research IX, University in Osijek, Osijek (2013)
2.
Zhan, F., Noon, C.: Shortest path algorithms: an evaluation using real road networks. Transp. Sci. (1996)
3.
Al-Shaikh, A., Khattab, H., Sharieh, A., Sleit, A.: Resource utilization in cloud computing as an optimization problem. Int. J. Adv. Comput. Sci. Appl. (IJACSA) 7(6), 336–342 (2016)
4.
Hoffman, K.L., Padberg, M., Rinaldi, G.: Traveling salesman problem. In: Encyclopedia of Operations Research and Management Science, pp 1573–1578. Springer (2016)CrossRef
5.
Lam, A.Y.S., Li, V.O.K.: Chemical reaction optimization: a tutorial. Memet. Comput. 4, 3–17 (2012)CrossRef
6.
7.
8.
Ostrouchov, G.: Parallel computing on a hypercube: an overview of the architecture and some applications. In: Heiberger, R.M. (ed.) Proceedings of the 19th Symposium on the Interface of Computer Science and Statistics, pp. 27–32. American Statistical Association (1987)
9.
Kiasari, A., Sarbazi-Azad, H.: Analytic performance comparison of hypercubes and star graphs with implementation constraints. J. Comput. Syst. Sci. 74(6), 1000–1012 (2008)MathSciNetCrossRef
10.
Cathleen, L.: “Inside a NASA Production Supercomputing Center” Concept To Reality magazines, Summer/Fall issue (2011)
11.
Mohan, A., Remya, G.: A parallel implementation of ant colony optimization for TSP based on MapReduce framework. Int. J. Comput. Appl. 88(8), 9–12 (2014)
12.
Er, H.R., Erdogan, N.: Parallel genetic algorithm to solve traveling salesman problem on MapReduce framework using Hadoop cluster”. arXiv preprint arXiv:​1401.​6267 (2014)
13.
Sun, J., Wang, Y., Li, J., Gao, K.: Hybrid algorithm based on chemical reaction optimization and Lin-Kernighan local search for the traveling salesman problem (2011)
14.
Shaheen, A., Sleit, A.: Comparing between different approaches to solve the 0/1 Knapsack problem. Int. J. Comput. Sci. Netw. Secur. 16(7), 1–10 (2016)
15.
Barham, R., Sharieh, A., Sliet, A.: Chemical reaction optimization for max flow problem. (IJACSA) Int. J. Adv. Comput. Sci. Appl. 7(8), 189–196 (2016)
16.
17.
Metadata
Title
Chemical Reaction Optimization for Traveling Salesman Problem Over a Hypercube Interconnection Network
Authors
Ameen Shaheen
Azzam Sleit
Saleh Al-Sharaeh
Copyright Year
2019
Book
Cybernetics and Algorithms in Intelligent Systems

Print ISBN: 978-3-319-91191-5

Electronic ISBN: 978-3-319-91192-2

Copyright Year: 2019

DOI
https://doi.org/10.1007/978-3-319-91192-2_43

Premium Partner

    Image Credits