The Optimizing Multiple Travelling Salesman Problem Using Genetic Algorithm |
Author(s): |
| Dr. B. S. E. Zoraida , Bharathidasan University, Trichirappalli; R.Jayasutha, Bharathidasan University, Trichirappalli |
Keywords: |
| mTSP, VRP, Genetic algorithm, Chromosome method, Optimization. |
Abstract |
|
The traveling salesman problem (TSP) supports the idea of a single salesperson traveling in a continuous trip visiting all n cities exactly once and returning to the starting point. The multiple traveling salesman problems (mTSP) is complex combinatorial optimization problem, which is a generalization of the well-known Travelling Salesman Problem (TSP), where one or more salesman can be used in the path. In this paper mTSP has also been studied and solved with GA in the form of the vehicle scheduling problem. The existing model is new models are compared to both mathematically and experimentally. This work presents a chromosome methodology setting up the MTSP to be solved using a GA. |
Other Details |
|
Paper ID: IJSRDV1I5040 Published in: Volume : 1, Issue : 5 Publication Date: 01/08/2013 Page(s): 1200-1203 |
Article Preview |
|
|
|
|
