Open AccessSeed based plant propagation algorithm for multiple travelling salesman problem
Author(s) -
S. Kalaiarasi,
P. Sriramya
Publication year - 2018
Publication title -
international journal of engineering and technology
Language(s) - English
Resource type - Journals
ISSN - 2227-524X
DOI - 10.14419/ijet.v7i2.33.14823
Subject(s) - travelling salesman problem , 2 opt , bottleneck traveling salesman problem , computer science , christofides algorithm , algorithm , traveling purchaser problem , mathematical optimization , lin–kernighan heuristic , nearest neighbour algorithm , mathematics
Multiple Travelling Salesman Problem is a complex problem in which route for a salesman is assigned to visit a city that has various hurdles such as congested road, damaged road, etc. In recent years biologically inspired algorithms are most widely used to solve many optimization problems. Here seed based plant propagation algorithm is applied for the multiple travelling salesman problem that is also a optimization problem, and the result is compared with a short-cut routing algorithm. The result shows that Seed based Propagation Algorithm is easy to implement since it has few parameters to be utilized and also time complexity is reduced when implemented in multiple travelling salesman problem.