GELS-GA: Hybrid metaheuristic algorithm for solving Multiple Travelling Salesman Problem
- 1 November 2014
- conference paper
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- No. 21647143,p. 76-81
Abstract
The Multiple Traveling Salesmen Problem (mTSP) is of the famous and classical problems of research in operations and is accounted as one of the most famous and widely used problems of combinational optimization. Most of the complex problems can be modeled as the mTSP and then be solved. The mTSP is a NP-Complete one; therefore, it is not possible to use the exact algorithms for solving it instead the heuristics methods are often applied for solving such problems. In this paper, a new hybrid algorithm, called GELS-GA, has been presented for solving the mTSP. The utility of GELS-GA is compared with some related works such as GA and ACO and achieves optimality even in highly complex scenarios. Although, the proposed algorithm is simple, it includes an appropriate time of completion and the least traversed distance among existing algorithms.Keywords
This publication has 18 references indexed in Scilit:
- A novel method for solving the multiple traveling salesmen problem with multiple depotsChinese Science Bulletin, 2012
- An ant colony algorithm for solving fixed destination multi-depot multiple traveling salesmen problemsApplied Soft Computing, 2011
- A concise guide to the Traveling Salesman ProblemJournal of the Operational Research Society, 2010
- A Novel Approach to Solve Multiple Traveling Salesmen Problem by Genetic Algorithm2010
- The multiple traveling salesman problem: an overview of formulations and solution proceduresOmega, 2006
- An new self-organizing maps strategy for solving the traveling salesman problemChaos, Solitons & Fractals, 2006
- Integrating target analysis and tabu search for improved scheduling systemsExpert Systems with Applications, 1993
- A Boolean neural network approach for the traveling salesman problemIEEE Transactions on Computers, 1993
- Technical Note—A Note on the Symmetric Multiple Traveling Salesman Problem with Fixed ChargesOperations Research, 1977
- Transformation of Multisalesman Problem to the Standard Traveling Salesman ProblemJournal of the ACM, 1974