Modified Discrete Firefly Algorithm Combining Genetic Algorithm for Traveling Salesman Problem
| Main Authors: | Teng, Ling; Shenyang Normal University, Li, Hang; Shenyang Normal University |
|---|---|
| Format: | Article info application/pdf eJournal |
| Bahasa: | eng |
| Terbitan: |
Universitas Ahmad Dahlan
, 2018
|
| Subjects: | |
| Online Access: |
http://journal.uad.ac.id/index.php/TELKOMNIKA/article/view/4752 http://journal.uad.ac.id/index.php/TELKOMNIKA/article/view/4752/5307 |
| ctrlnum |
article-4752 |
|---|---|
| fullrecord |
<?xml version="1.0"?>
<dc schemaLocation="http://www.openarchives.org/OAI/2.0/oai_dc/ http://www.openarchives.org/OAI/2.0/oai_dc.xsd"><title lang="en-US">Modified Discrete Firefly Algorithm Combining Genetic Algorithm for Traveling Salesman Problem</title><creator>Teng, Ling; Shenyang Normal University</creator><creator>Li, Hang; Shenyang Normal University</creator><subject lang="en-US">firefly algorithm; traveling salesman problem; genetic algorithm; neighborhood search algorithm</subject><description lang="en-US">The Firefly Algorithm (FA) has a few disadvantages in solving the constrained global optimization problem, including that it is difficult to produce initial population, the size of relative attractiveness has nothing to do with the absolute brightness of fireflies, the inertia weight does not take full advantage of the information of objective function, and it cannot better control and constrain the mobile distance of firefly. In this paper, we propose a novel method based on discrete firefly algorithm combining genetic algorithm for traveling salesman problem. We redefine the distance of firefly algorithm by introducing swap operator and swap sequence to avoid algorithm easily falling into local solution and accelerate convergence speed. In addition, we adopt dynamic mechanism based on neighborhood search algorithm. Finally, the comparison experiment results show that the novel algorithm can search perfect solution within a short time, and greatly improve the effectiveness of solving the traveling salesman problem, it also significantly improves computing speed and reduces iteration number.</description><publisher lang="en-US">Universitas Ahmad Dahlan</publisher><contributor lang="en-US"/><date>2018-02-01</date><type>Journal:Article</type><type>Other:info:eu-repo/semantics/publishedVersion</type><type>Other:</type><type>File:application/pdf</type><identifier>http://journal.uad.ac.id/index.php/TELKOMNIKA/article/view/4752</identifier><identifier>10.12928/telkomnika.v16i1.4752</identifier><source lang="en-US">TELKOMNIKA (Telecommunication Computing Electronics and Control); Vol 16, No 1: February 2018; 424-431</source><source>2302-9293</source><source>1693-6930</source><source>10.12928/telkomnika.v16i1</source><language>eng</language><relation>http://journal.uad.ac.id/index.php/TELKOMNIKA/article/view/4752/5307</relation><rights lang="0">Copyright (c) 2020 Universitas Ahmad Dahlan</rights><rights lang="0">http://creativecommons.org/licenses/by-sa/4.0</rights><recordID>article-4752</recordID></dc>
|
| language |
eng |
| format |
Journal:Article Journal Other:info:eu-repo/semantics/publishedVersion Other Other: File:application/pdf File Journal:eJournal |
| author |
Teng, Ling; Shenyang Normal University Li, Hang; Shenyang Normal University |
| title |
Modified Discrete Firefly Algorithm Combining Genetic Algorithm for Traveling Salesman Problem |
| publisher |
Universitas Ahmad Dahlan |
| publishDate |
2018 |
| topic |
firefly algorithm traveling salesman problem genetic algorithm neighborhood search algorithm |
| url |
http://journal.uad.ac.id/index.php/TELKOMNIKA/article/view/4752 http://journal.uad.ac.id/index.php/TELKOMNIKA/article/view/4752/5307 |
| contents |
The Firefly Algorithm (FA) has a few disadvantages in solving the constrained global optimization problem, including that it is difficult to produce initial population, the size of relative attractiveness has nothing to do with the absolute brightness of fireflies, the inertia weight does not take full advantage of the information of objective function, and it cannot better control and constrain the mobile distance of firefly. In this paper, we propose a novel method based on discrete firefly algorithm combining genetic algorithm for traveling salesman problem. We redefine the distance of firefly algorithm by introducing swap operator and swap sequence to avoid algorithm easily falling into local solution and accelerate convergence speed. In addition, we adopt dynamic mechanism based on neighborhood search algorithm. Finally, the comparison experiment results show that the novel algorithm can search perfect solution within a short time, and greatly improve the effectiveness of solving the traveling salesman problem, it also significantly improves computing speed and reduces iteration number. |
| id |
IOS1164.article-4752 |
| institution |
Universitas Ahmad Dahlan |
| institution_id |
62 |
| institution_type |
library:university library |
| library |
Perpustakaan Universitas Ahmad Dahlan |
| library_id |
467 |
| collection |
Journal of Education and Learning |
| repository_id |
1164 |
| subject_area |
Pendidikan |
| city |
KOTA YOGYAKARTA |
| province |
DAERAH ISTIMEWA YOGYAKARTA |
| repoId |
IOS1164 |
| first_indexed |
2022-01-01T21:25:05Z |
| last_indexed |
2022-01-01T21:25:05Z |
| recordtype |
dc |
| merged_child_boolean |
1 |
| _version_ |
1722532504146018304 |
| score |
17.610468 |