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...
Saved in:
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!
|
Similar Items
-
Magnetic Optimization Algorithm Approach For Travelling Salesman Problem
by: Ismail, Mohd Muzafar, et al.
Published: (2012) -
The retrace traveling salesman problem : a new extension of traveling salesman problem
by: Arbain, Juraidawati
Published: (2003) -
Solving standard traveling salesman problem and multiple traveling salesman problem by using branch-and-bound
by: Shakila, Saad, et al.
Published: (2014) -
Swarm intelligence algorithms’ solutions to the travelling salesman’s problem
by: Odili, Julius Beneoluchi, et al.
Published: (2020) -
Genetic algorithm software for solving the travelling salesman problem
by: Sekharan, Vijayan Sandiara
Published: (1996)