PRELIMINARY STUDIES ON THE FIXED DESTINATION MMTSP SOLVED BY DISCRETE FIREFLY ALGORITHM

The fixed destination MmTSP (multi-depot multiple travelling salesman problem) is an np hard problem, which can’t be solved in polynomial time. Against the traditional TSP problem here there are more travelling salesmen which seek out the cities. Every city is visited by once by any of the salesmen and after the round route the salesman go back to its home location. But unlike at the TSP the salesman does not start from the same location. The firefly algorithm is a member of the swarm optimizations family. Originally it was developed to solve continuous state space problems but with discretization it is capable to solve combinatorial problems also. In this article we will show a potential discretization variant. In the firefly algorithm every firefly represent a solution. In our algorithm the salesmen using a multi chromosome model, where there are a separate list for every salesman for the cities to visit.