Melola Discovery

← Melola Discovery

Open access Jurnal SINTA 3

LEADERS AND FOLLOWERS ALGORITHM FOR TRAVELING SALESMAN PROBLEM

BAREKENG: Jurnal Ilmu Matematika dan Terapan · Vol. 18 No. 1 (2024) · pp. 0449–0456

DOI
10.30598/barekengvol18iss1pp0449-0456
ISSN
2615-3017, 1978-7227
Published
2024-03-01
Publisher
PATTIMURA UNIVERSITY
Language
eng
License
creativecommons.org/licenses/by-sa/4.0

Abstract

Leaders and Followers algorithm is a metaheuristics algorithm. In solving continuous optimization, this algorithm is proved to be better than other well-known algorithms, such as Genetic Algorithm and Particle Swarm Optimization. This paper aims to apply the Leaders and Followers algorithm for the Traveling Salesman Problem (TSP), a well-known combinatorial optimization problem to minimize distance. There are some modifications in order to fit the algorithm in TSP problems. Some most-used-problems in TSP are used to test this algorithm. The result is that the Leaders and Followers algorithm performs well, stable, and guarantees the optimality of the obtained solution in TSP with fewer than 20 cities. In TSP with a bigger number of cities, the proposed algorithm is not stable and might has difficulties in finding the optimal solutions.

Collaboration network of the authors

36 authors · 91 co-authorship links · 17 across different organisations

Hover or tap a name to highlight its co-authors. Double-click to open the author's page.

  • University of Brawijaya
  • National Research and Innovation Agency
  • Institut Teknologi Sepuluh Nopember
  • Indonesian Institute of Sciences
  • Universitas Jember
  • University of Bangka Belitung
  • Universiti Teknologi MARA
  • Affiliation unknown
  • Different organisations
  • Same organisation
  • Affiliation unknown
  • Thicker line = more joint articles · bigger circle = more articles
Show as table
Co-authorOrganisationJoint articles
Wayan Firdaus MahmudyUniversity of Brawijaya2
Dwi Mifta MahananiAffiliation unknown2
Safrizal Ardana ArdiyansaAffiliation unknown2
Eric JuliantoAffiliation unknown2
Avin MaulanaInstitut Teknologi Sepuluh Nopember2
Hilmi Aziz BukhoriAffiliation unknown2
Asyrofa RahmiUniversity of Brawijaya1
Muchammad Chandra Cahyo UtomoUniversity of Brawijaya1
Ahmad Afif SupiantoUniversity of Brawijaya1
Vicky ZilvanIndonesian Institute of Sciences1
Hilman Ferdinandus PardedeNational Research and Innovation Agency1
Onky PrasetyoUniversity of Brawijaya1
R. Budiarianto Suryo KusumoNational Research and Innovation Agency1
M. Rafael Andika PutraAffiliation unknown1
Zuraidah FitriahAffiliation unknown1
Indah YantiAffiliation unknown1
Noor HidayatAffiliation unknown1
Abdi Negara GuciAffiliation unknown1
Fery WidhiatmokoAffiliation unknown1
Mila KurniawatyAffiliation unknown1
Komang Agus Arta WijayaAffiliation unknown1
Natasha Clarissa MaharaniAffiliation unknown1
Haidar Ahmad FajriAffiliation unknown1
Natasha Clarrisa MaharaniAffiliation unknown1
Saiful BukhoriUniversitas Jember1
Elayaraja AruchunanAffiliation unknown1
Isnani DartiAffiliation unknown1
Ach KhozaimiAffiliation unknown1
Wuryansari Muharini KusumawinahyuAffiliation unknown1
Elyas KustiawanUniversity of Bangka Belitung1
Mohd Razif ShamsuddinAffiliation unknown1
Feby Indriana YusufAffiliation unknown1
Nur Atiqah Sia AbdullahUniversiti Teknologi MARA1
Regina VincentiaAffiliation unknown1

Affiliations come from OpenAlex; journal OAI-PMH metadata carries none. Authors without an OpenAlex ID are matched by name, which can merge or split people.

Metadata source: OAI-PMH (metadata jurnal) https://ojs3.unpatti.ac.id/index.php/barekeng/oai, first harvested 5 Nov 2026, last seen 5 Nov 2026.
Original metadata (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">LEADERS AND FOLLOWERS ALGORITHM FOR TRAVELING SALESMAN PROBLEM</dc:title>
	<dc:creator>Angmalisang, Helen Yuliana</dc:creator>
	<dc:creator>Anam, Syaiful</dc:creator>
	<dc:description xml:lang="en-US">Leaders and Followers algorithm is a metaheuristics algorithm. In solving continuous optimization, this algorithm is proved to be better than other well-known algorithms, such as Genetic Algorithm and Particle Swarm Optimization. This paper aims to apply the Leaders and Followers algorithm for the Traveling Salesman Problem (TSP), a well-known combinatorial optimization problem to minimize distance. There are some modifications in order to fit the algorithm in TSP problems. Some most-used-problems in TSP are used to test this algorithm. The result is that the Leaders and Followers algorithm performs well, stable, and guarantees the optimality of the obtained solution in TSP with fewer than 20 cities. In TSP with a bigger number of cities, the proposed algorithm is not stable and might has difficulties in finding the optimal solutions.</dc:description>
	<dc:publisher xml:lang="en-US">PATTIMURA UNIVERSITY</dc:publisher>
	<dc:date>2024-03-01</dc:date>
	<dc:type>info:eu-repo/semantics/article</dc:type>
	<dc:type>info:eu-repo/semantics/publishedVersion</dc:type>
	<dc:format>application/pdf</dc:format>
	<dc:identifier>https://ojs3.unpatti.ac.id/index.php/barekeng/article/view/10669</dc:identifier>
	<dc:identifier>10.30598/barekengvol18iss1pp0449-0456</dc:identifier>
	<dc:source xml:lang="en-US">BAREKENG: Jurnal Ilmu Matematika dan Terapan; Vol 18 No 1 (2024): BAREKENG: Journal of Mathematics and Its Application; 0449-0456</dc:source>
	<dc:source>2615-3017</dc:source>
	<dc:source>1978-7227</dc:source>
	<dc:source>10.30598/barekengvol18iss1year2024</dc:source>
	<dc:language>eng</dc:language>
	<dc:relation>https://ojs3.unpatti.ac.id/index.php/barekeng/article/view/10669/7497</dc:relation>
	<dc:rights xml:lang="en-US">Copyright (c) 2024 Helen Yuliana Angmalisang, Syaiful Anam</dc:rights>
	<dc:rights xml:lang="en-US">http://creativecommons.org/licenses/by-sa/4.0</dc:rights>
</oai_dc:dc>