A Preliminary Study On Firefly Algorithm Approach For Travelling Salesman Problem

• 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/
• Institution: Universiti Teknikal Malaysia Melaka

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...