Melola Discovery

← Melola Discovery

Akses terbuka Jurnal SINTA 1

Improved discrete plant propagation algorithm for solving the traveling salesman problem

IAES International Journal of Artificial Intelligence · Vol. 11 No. 1 (2022) · hlm. 13–22

DOI
10.11591/ijai.v11.i1.pp13-22
ISSN
2252-8938, 2089-4872
Terbit
2022-03-01
Penerbit
Institute of Advanced Engineering and Science
Bahasa
eng
Lisensi
creativecommons.org/licenses/by-sa/4.0

Abstrak

The primary goal of traveling salesman problem (TSP) is for a salesman to visit many cities and return to the starting city via a sequence of potential shortest paths. Subsequently, conventional algorithms are inadequate for large-scale problems; thus, metaheuristic algorithms have been proposed. A recent metaheuristic algorithm that has been implemented to solve TSP is the plant propagation algorithm (PPA), which belongs to the rose family. In this research, this existing PPA is modified to solve TSP. Although PPA is claimed to be successful, it suffers from the slow convergence problem, which significantly impedes its applicability for getting good solution. Therefore, the proposed partial-partitioned greedy algorithm (PPGA) offers crossover and three mutation operations (flip, swap, and slide), which allow local and global search and seem to be wise methods to help PPA in solving the TSP. The PPGA performance is evaluated on 10 separate datasets available in the literature and compared with the original PPA. In terms of distance, the computational results demonstrate that the PPGA outperforms the original PPA in nine datasets which assures that it is 90% better than PPA. PPGA produces good solutions when compared with other algorithms in the literature, where the average execution time reduces by 10.73%.

Kata kunci

Jaringan kolaborasi para penulis

9 penulis · 16 tautan kepenulisan bersama · 4 lintas organisasi

Arahkan kursor atau ketuk sebuah nama untuk menyorot rekan penulisnya. Klik dua kali untuk membuka halaman penulis.

  • Shatt Al-Arab University College
  • Universiti Utara Malaysia
  • University of Babylon
  • Afiliasi tidak diketahui
  • Organisasi berbeda
  • Organisasi sama
  • Afiliasi tidak diketahui
  • Garis lebih tebal = lebih banyak artikel bersama · lingkaran lebih besar = lebih banyak artikel
Tampilkan sebagai tabel
Rekan penulisOrganisasiArtikel bersama
Hassan Al-MaziniAfiliasi tidak diketahui2
Yuhanis YusofUniversiti Utara Malaysia1
Rafid SagbanUniversity of Babylon1
Ku Ruhana Ku‐MahamudUniversiti Utara Malaysia1

Afiliasi berasal dari OpenAlex; metadata OAI-PMH jurnal tidak memuatnya. Penulis tanpa ID OpenAlex dicocokkan berdasarkan nama, sehingga dua orang bisa tergabung atau satu orang bisa terpisah.

Sumber metadata: OAI-PMH (metadata jurnal) http://ijai.iaescore.com/index.php/IJAI/oai, pertama di-harvest 8 Nov 2026, terakhir terlihat 16 Nov 2026.
Metadata asli (oai_dc)
<oai_dc:dc xmlns="http://www.openarchives.org/OAI/2.0/" xmlns:dc="http://purl.org/dc/elements/1.1/" xmlns:oai_dc="http://www.openarchives.org/OAI/2.0/oai_dc/" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xsi:schemaLocation="http://www.openarchives.org/OAI/2.0/oai_dc/  http://www.openarchives.org/OAI/2.0/oai_dc.xsd">
	<dc:title xml:lang="en-US">Improved discrete plant propagation algorithm for solving the traveling salesman problem</dc:title>
	<dc:creator>Almazini, Hussein Fouad</dc:creator>
	<dc:creator>Mortada, Salah</dc:creator>
	<dc:creator>Abbas Al-Mazini, Hassan Fouad</dc:creator>
	<dc:creator>Khraibet AL-Behadili, Hayder Naser</dc:creator>
	<dc:creator>Alkenani, Jawad</dc:creator>
	<dc:subject xml:lang="en-US">Optimization; Artificial intelligence; Swarm intelligence</dc:subject>
	<dc:subject xml:lang="en-US">Genetic algorithm; Metaheuristic; Optimization; Plant intelligence</dc:subject>
	<dc:description xml:lang="en-US">The primary goal of traveling salesman problem (TSP) is for a salesman to visit many cities and return to the starting city via a sequence of potential shortest paths. Subsequently, conventional algorithms are inadequate for large-scale problems; thus, metaheuristic algorithms have been proposed. A recent metaheuristic algorithm that has been implemented to solve TSP is the plant propagation algorithm (PPA), which belongs to the rose family. In this research, this existing PPA is modified to solve TSP. Although PPA is claimed to be successful, it suffers from the slow convergence problem, which significantly impedes its applicability for getting good solution. Therefore, the proposed partial-partitioned greedy algorithm (PPGA) offers crossover and three mutation operations (flip, swap, and slide), which allow local and global search and seem to be wise methods to help PPA in solving the TSP. The PPGA performance is evaluated on 10 separate datasets available in the literature and compared with the original PPA. In terms of distance, the computational results demonstrate that the PPGA outperforms the original PPA in nine datasets which assures that it is 90% better than PPA. PPGA produces good solutions when compared with other algorithms in the literature, where the average execution time reduces by 10.73%.</dc:description>
	<dc:publisher xml:lang="en-US">Institute of Advanced Engineering and Science</dc:publisher>
	<dc:contributor xml:lang="en-US"></dc:contributor>
	<dc:date>2022-03-01</dc:date>
	<dc:type>info:eu-repo/semantics/article</dc:type>
	<dc:type>info:eu-repo/semantics/publishedVersion</dc:type>
	<dc:type xml:lang="en-US"></dc:type>
	<dc:format>application/pdf</dc:format>
	<dc:identifier>https://ijai.iaescore.com/index.php/IJAI/article/view/20867</dc:identifier>
	<dc:identifier>10.11591/ijai.v11.i1.pp13-22</dc:identifier>
	<dc:source xml:lang="en-US">IAES International Journal of Artificial Intelligence (IJ-AI); Vol 11, No 1: March 2022; 13-22</dc:source>
	<dc:source>2252-8938</dc:source>
	<dc:source>2089-4872</dc:source>
	<dc:source>10.11591/ijai.v11.i1</dc:source>
	<dc:language>eng</dc:language>
	<dc:relation>https://ijai.iaescore.com/index.php/IJAI/article/view/20867/13272</dc:relation>
	<dc:rights xml:lang="en-US">Copyright (c) 2022 Institute of Advanced Engineering and Science</dc:rights>
	<dc:rights xml:lang="en-US">http://creativecommons.org/licenses/by-sa/4.0</dc:rights>
</oai_dc:dc>