IDEAS home Printed from https://ideas.repec.org/a/ibn/masjnl/v12y2018i8p142.html
   My bibliography  Save this article

Travelling Salesman Problem Solution Based-on Grey Wolf Algorithm over Hypercube Interconnection Network

Author

Listed:
  • Ameen Shaheen
  • Azzam Sleit
  • Saleh Al-Sharaeh

Abstract

Travelling Salesman Problem (TSP) is one of the most popular NP-complete problems for the researches in the field of computer science which focused on optimization. TSP goal is to find the minimum path between cities with a condition of each city must to visit exactly once by the salesman. Grey Wolf Optimizer (GWO) is a new swarm intelligent optimization mechanism where it success in solving many optimization problems. In this paper, a parallel version of GWO for solving the TSP problem on a Hypercube Interconnection Network is presented. The algorithm has been compared to the alternative algorithms. Algorithms have been evaluated analytically and by simulations in terms of execution time, optimal cost, parallel runtime, speedup and efficiency. The algorithms are tested on a number of benchmark problems and found parallel Gray wolf algorithm is promising in terms of speed-up, efficiency and quality of solution in comparison with the alternative algorithms. Â

Suggested Citation

  • Ameen Shaheen & Azzam Sleit & Saleh Al-Sharaeh, 2018. "Travelling Salesman Problem Solution Based-on Grey Wolf Algorithm over Hypercube Interconnection Network," Modern Applied Science, Canadian Center of Science and Education, vol. 12(8), pages 142-142, August.
    • Handle: RePEc:ibn:masjnl:v:12:y:2018:i:8:p:142
    as

    Download full text from publisher

    File URL: https://ccsenet.org/journal/index.php/mas/article/download/76080/42502
    Download Restriction: no
    File URL: https://ccsenet.org/journal/index.php/mas/article/view/76080
    Download Restriction: no
    ---><---

    References listed on IDEAS

    as
    1. L. Ingber & B. Rosen, 1992. "Genetic algorithms and very fast simulated reannealing: A comparison," Lester Ingber Papers 92ga, Lester Ingber.
    Full references (including those not matched with items on IDEAS)

    Most related items

    These are the items that most often cite the same works as this one and are cited by the same works as this one.
    1. Bergey, Paul K. & Ragsdale, Cliff, 2005. "Modified differential evolution: a greedy random strategy for genetic recombination," Omega, Elsevier, vol. 33(3), pages 255-265, June.
    2. L. Ingber, 2022. "Quantum Variables in Finance," Lester Ingber Papers 22qv, Lester Ingber.
    3. Victor Lebreton, 2007. "Le trading algorithmique," Université Paris1 Panthéon-Sorbonne (Post-Print and Working Papers) hal-00332823, HAL.
    4. Michael Saah Hayford & Bithin Datta, 2021. "Source Characterization of Multiple Reactive Species at an Abandoned Mine Site Using a Groundwater Numerical Simulation Model and Optimization Models," IJERPH, MDPI, vol. 18(9), pages 1-42, April.
    5. Dimitris Bertsimas & Omid Nohadani, 2010. "Robust optimization with simulated annealing," Journal of Global Optimization, Springer, vol. 48(2), pages 323-334, October.
    6. L. Ingber, 1992. "Generic mesoscopic neural networks based on statistical mechanics of neocortical interactions," Lester Ingber Papers 92gm, Lester Ingber.
    7. Natasha Stout & Amy Knudsen & Chung Kong & Pamela McMahon & G. Gazelle, 2009. "Calibration Methods Used in Cancer Simulation Models and Suggested Reporting Guidelines," PharmacoEconomics, Springer, vol. 27(7), pages 533-545, July.
    8. B Suman & P Kumar, 2006. "A survey of simulated annealing as a tool for single and multiobjective optimization," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 57(10), pages 1143-1160, October.
    9. M. Bowman & L. Ingber, 1997. "Canonical momenta of nonlinear combat," Lester Ingber Papers 97cm, Lester Ingber.
    10. Pereira, Robert, 2000. "Genetic Algorithm Optimisation for Finance and Investments," MPRA Paper 8610, University Library of Munich, Germany.
    11. Lester Ingber & Radu Paul Mondescu, 2000. "Optimization of Trading Physics Models of Markets," Papers physics/0007075, arXiv.org.
    12. Leung, T. W. & Chan, Chi Kin & Troutt, Marvin D., 2003. "Application of a mixed simulated annealing-genetic algorithm heuristic for the two-dimensional orthogonal packing problem," European Journal of Operational Research, Elsevier, vol. 145(3), pages 530-542, March.
    13. L. Ingber & R.P. Mondescu, 2003. "Automated internet trading based on optimized physics models of markets," Lester Ingber Papers 03ai, Lester Ingber.
    14. L. Ingber, 1996. "Adaptive simulated annealing (ASA): Lessons learned," Lester Ingber Papers 96as, Lester Ingber.
    15. Mayer, D. G. & Belward, J. A. & Burrage, K., 1996. "Use of advanced techniques to optimize a multi-dimensional dairy model," Agricultural Systems, Elsevier, vol. 50(3), pages 239-253.
    16. L. Ingber, 2018. "Quantum Variables in Finance and Neuroscience," Lester Ingber Papers 18qv, Lester Ingber.
    17. H. Le Thi & A. Vaz & L. Vicente, 2012. "Optimizing radial basis functions by d.c. programming and its use in direct search for global derivative-free optimization," TOP: An Official Journal of the Spanish Society of Statistics and Operations Research, Springer;Sociedad de Estadística e Investigación Operativa, vol. 20(1), pages 190-214, April.
    18. Mayer, D. G. & Belward, J. A. & Widell, H. & Burrage, K., 1999. "Survival of the fittest--genetic algorithms versus evolution strategies in the optimization of systems models," Agricultural Systems, Elsevier, vol. 60(2), pages 113-122, May.
    19. L. Ingber, 2018. "Quantum calcium-ion interactions with EEG," Lester Ingber Papers 18qc, Lester Ingber.
    20. Y. Diouane & S. Gratton & L. Vicente, 2015. "Globally convergent evolution strategies for constrained optimization," Computational Optimization and Applications, Springer, vol. 62(2), pages 323-346, November.

    More about this item

    JEL classification:

    • R00 - Urban, Rural, Regional, Real Estate, and Transportation Economics - - General - - - General
    • Z0 - Other Special Topics - - General

    Statistics

    Access and download statistics

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:ibn:masjnl:v:12:y:2018:i:8:p:142. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    If CitEc recognized a bibliographic reference but did not link an item in RePEc to it, you can help with this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Canadian Center of Science and Education (email available below). General contact details of provider: https://edirc.repec.org/data/cepflch.html .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.