Vestnik Yuzhno-Ural'skogo Universiteta. Seriya Matematicheskoe Modelirovanie i Programmirovanie
RUS  ENG    JOURNALS   PEOPLE   ORGANISATIONS   CONFERENCES   SEMINARS   VIDEO LIBRARY   PACKAGE AMSBIB  
General information
Latest issue
Archive
Submit a manuscript

Search papers
Search references

RSS
Latest issue
Current issues
Archive issues
What is RSS



Vestnik YuUrGU. Ser. Mat. Model. Progr.:
Year:
Volume:
Issue:
Page:
Find






Personal entry:
Login:
Password:
Save password
Enter
Forgotten password?
Register


Vestnik YuUrGU. Ser. Mat. Model. Progr., 2020, Volume 13, Issue 4, Pages 107–118 (Mi vyuru575)  

Programming & Computer Software

PNACO: parallel algorithm for neighbour joining hybridized with ant colony optimization on multi-core system

W. B. Yahiaa, M. W. Al-Neamab, G. E. Arifa

a Tikrit University, Tikrit, Iraq
b Mosul University, Mosul, Iraq

Abstract: One of the most interesting and relevant approaches for solving optimization problems are parallel algorithms that work simultaneously with a large number of tasks. The paper presents a new parallel algorithm for NACO that is a hybrid algorithm that consists of the Ant Colony Optimization method combined with the Neighbour Joining method to get accurate and efficient results when solving the Traveling Salesman Problem. Through carrying out comprehensive experiments using a wide variety of real dataset sizes and the multi-core system, the practical results show that the developed program outperforms NACO in terms of execution time and consumed storage space. Availability and implementation: source codes in MATLAB 2017 are publicly available at Internet.

Keywords: ant colony optimization, neighbour joining method, traveling salesman problem, parallel algorithm, multi-core system.

DOI: https://doi.org/10.14529/mmp200409

Full text: PDF file (741 kB)
References: PDF file   HTML file

UDC: 519.172.2+519.174+510.5
MSC: 05C10, 03D15, 68W10
Received: 27.08.2020
Language:

Citation: W. B. Yahia, M. W. Al-Neama, G. E. Arif, “PNACO: parallel algorithm for neighbour joining hybridized with ant colony optimization on multi-core system”, Vestnik YuUrGU. Ser. Mat. Model. Progr., 13:4 (2020), 107–118

Citation in format AMSBIB
\Bibitem{YahAl-Ari20}
\by W.~B.~Yahia, M.~W.~Al-Neama, G.~E.~Arif
\paper PNACO: parallel algorithm for neighbour joining hybridized with ant colony optimization on multi-core system
\jour Vestnik YuUrGU. Ser. Mat. Model. Progr.
\yr 2020
\vol 13
\issue 4
\pages 107--118
\mathnet{http://mi.mathnet.ru/vyuru575}
\crossref{https://doi.org/10.14529/mmp200409}


Linking options:
  • http://mi.mathnet.ru/eng/vyuru575
  • http://mi.mathnet.ru/eng/vyuru/v13/i4/p107

    SHARE: VKontakte.ru FaceBook Twitter Mail.ru Livejournal Memori.ru


    Citing articles on Google Scholar: Russian citations, English citations
    Related articles on Google Scholar: Russian articles, English articles
  • Number of views:
    This page:31
    Full text:12
    References:5

     
    Contact us:
     Terms of Use  Registration to the website  Logotypes © Steklov Mathematical Institute RAS, 2021