Cover Image

A Preliminary Study On Firefly Algorithm Approach For Travelling Salesman Problem

Travelling Salesman Problem is a mathematical problem that describes a salesman problem in finding the shortest distance to travel to all the cities given that each city is visited once only. Travelling Salesman Problem is nondeterministic and a polynomial time problem, which makes the conventional...

Full description

Saved in:
Bibliographic Details
Main Authors: Ismail, Mohd Muzafar, Che Hasan, Mohd Hanif, Mohamad @ Ab Rahman, Syahrul Hisham, Jaafar, Hazriq Izzuan
Format: Conference or Workshop Item
Language:English
Published: 2013
Online Access:http://eprints.utem.edu.my/id/eprint/10651/1/2013_Conf._3July_SETNC2013_%281%29.pdf
http://eprints.utem.edu.my/id/eprint/10651/
Tags: Add Tag
No Tags, Be the first to tag this record!
id my.utem.eprints.10651
record_format eprints
spelling my.utem.eprints.106512021-06-29T14:04:45Z http://eprints.utem.edu.my/id/eprint/10651/ A Preliminary Study On Firefly Algorithm Approach For Travelling Salesman Problem Ismail, Mohd Muzafar Che Hasan, Mohd Hanif Mohamad @ Ab Rahman, Syahrul Hisham Jaafar, Hazriq Izzuan Travelling Salesman Problem is a mathematical problem that describes a salesman problem in finding the shortest distance to travel to all the cities given that each city is visited once only. Travelling Salesman Problem is nondeterministic and a polynomial time problem, which makes the conventional mathematical optimization techniques, irrelevant to solve the problem. This paper explores the use of one of swarm intelligence available, Firefly Algorithm in finding the optimal solution of the problem. Each firefly in Firefly Algorithm represents a candidate solution of the Travelling Salesman Problem. The candidate solution is modeled using a voting technique where each dimension of the firefly in search space represents a city that need to be visited by the salesman. The city with largest vote will be the initial city of the salesman, while the city with least vote, will be the second last city visited by the salesman before going back to the first city, he comes from. Each of this candidate solution has a distance that correlates with the fitness value of the firefly. A firefly will try to improve the solution its represents by moving closer to other fireflies with better fitness values, in the search space. This process is repeated until a stopping condition reached. The performance of the proposed approach is benchmark with a case study. 2013-07-03 Conference or Workshop Item PeerReviewed text en http://eprints.utem.edu.my/id/eprint/10651/1/2013_Conf._3July_SETNC2013_%281%29.pdf Ismail, Mohd Muzafar and Che Hasan, Mohd Hanif and Mohamad @ Ab Rahman, Syahrul Hisham and Jaafar, Hazriq Izzuan (2013) A Preliminary Study On Firefly Algorithm Approach For Travelling Salesman Problem. In: Science & Engineering Technology National Conference 2013, 3-4 July 2013, Kuala Lumpur, Malaysia..
institution Universiti Teknikal Malaysia Melaka
building UTEM Library
collection Institutional Repository
continent Asia
country Malaysia
content_provider Universiti Teknikal Malaysia Melaka
content_source UTEM Institutional Repository
url_provider http://eprints.utem.edu.my/
language English
description Travelling Salesman Problem is a mathematical problem that describes a salesman problem in finding the shortest distance to travel to all the cities given that each city is visited once only. Travelling Salesman Problem is nondeterministic and a polynomial time problem, which makes the conventional mathematical optimization techniques, irrelevant to solve the problem. This paper explores the use of one of swarm intelligence available, Firefly Algorithm in finding the optimal solution of the problem. Each firefly in Firefly Algorithm represents a candidate solution of the Travelling Salesman Problem. The candidate solution is modeled using a voting technique where each dimension of the firefly in search space represents a city that need to be visited by the salesman. The city with largest vote will be the initial city of the salesman, while the city with least vote, will be the second last city visited by the salesman before going back to the first city, he comes from. Each of this candidate solution has a distance that correlates with the fitness value of the firefly. A firefly will try to improve the solution its represents by moving closer to other fireflies with better fitness values, in the search space. This process is repeated until a stopping condition reached. The performance of the proposed approach is benchmark with a case study.
format Conference or Workshop Item
author Ismail, Mohd Muzafar
Che Hasan, Mohd Hanif
Mohamad @ Ab Rahman, Syahrul Hisham
Jaafar, Hazriq Izzuan
spellingShingle Ismail, Mohd Muzafar
Che Hasan, Mohd Hanif
Mohamad @ Ab Rahman, Syahrul Hisham
Jaafar, Hazriq Izzuan
A Preliminary Study On Firefly Algorithm Approach For Travelling Salesman Problem
author_facet Ismail, Mohd Muzafar
Che Hasan, Mohd Hanif
Mohamad @ Ab Rahman, Syahrul Hisham
Jaafar, Hazriq Izzuan
author_sort Ismail, Mohd Muzafar
title A Preliminary Study On Firefly Algorithm Approach For Travelling Salesman Problem
title_short A Preliminary Study On Firefly Algorithm Approach For Travelling Salesman Problem
title_full A Preliminary Study On Firefly Algorithm Approach For Travelling Salesman Problem
title_fullStr A Preliminary Study On Firefly Algorithm Approach For Travelling Salesman Problem
title_full_unstemmed A Preliminary Study On Firefly Algorithm Approach For Travelling Salesman Problem
title_sort preliminary study on firefly algorithm approach for travelling salesman problem
publishDate 2013
url http://eprints.utem.edu.my/id/eprint/10651/1/2013_Conf._3July_SETNC2013_%281%29.pdf
http://eprints.utem.edu.my/id/eprint/10651/
_version_ 1703963853919879168
score 13.226497

Similar Items