Loading...
1 results
Search Results
Now showing 1 - 1 of 1
- A hybrid approach GABC-LS to solve mTSPPublication . Pereira, Sílvia de Castro; Pires, Eduardo J. Solteiro; Oliveira, Paulo B. de MouraThe Multiple Traveling Salesman Problem (mTSP) is an interesting combinatorial optimization problem due to its numerous real-life applications. It is a problem where m salesmen visit a set of n cities so that each city is visited once. The primary purpose is to minimize the total distance traveled by all salesmen. This paper presents a hybrid approach called GABC-LS that combines an evolutionary algorithm with the swarm intelligence optimization ideas and a local search method. The proposed approach was tested on two instances and produced some better results than the best-known solutions reported in the literature.