Seed based plant propagation algorithm for multiple travelling salesman problem

  • Authors

    • S Kalaiarasi
    • P Sriramya
    2018-06-08
    https://doi.org/10.14419/ijet.v7i2.33.14823
  • Multiple Travelling Salesman Problem, Seed Dispersal, Short Cut Routing, Plant Propagation Algorithm.

  • 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.

     

     

  • References

    1. [1] Muhammad Sulaiman, Abdellah Salhi1, “A Seed-Based Plant Propagation Algorithm: The Feeding Station Model,†Scientific World Journal, Hindawi Publishing Corporation, Volume 2015, Article ID 904364.

      [2] Andras Kiraly and Janos Abonyi, “Optimization of Multiple Traveling Salesmen Problem by a Novel Representation Based Genetic Algorithmâ€, Intelligent Computational Optimization in Engineering Studies in Computational Intelligence Vol. 366, pp. 241-269, 2011.

      [3] Paul Oberli, Sivakumar Rathinam and Swaroop Darbha, “A Transformation for a Multiple Depot, Multiple Traveling Salesman Problem.†American Control Conference Hyatt Regency Riverfront, St. Louis, MO, USA June 10-12, 2009.

      [4] Abraham P. Punnen. “The Traveling Salesman Problem and Its Variationsâ€.

      [5] Sai Yadlapalli, Sivakumar Rathinam and Swaroop Darbha, “3-Approximation algorithm for a two depot, heterogeneous traveling salesman problemâ€, Vol. 6, No. 1, pp. 141-152, Jan 2012.

      [6] J. A. Lawrence and B. A. Pasternack, Applied Management Science,Wiley, New York, NY, USA, 2002.

      [7] M. Sulaiman and A. Salhi, “A seed-based plant propagation algorithm: the feeding station model,†in Proceedings of the 5th International Conference on Metaheuristics and Nature Inspired Computing, Marrakesh, Morocco, October 2014.

      [8] X.-S. Yang, Nature-Inspired Metaheuristic Algorithms, Luniver Press, Beckington, UK, 2011.

      [9] Gustavo Marfia, David Mack and Giovanni Pau, Cecilia Mascolo “On the Effectiveness of an Opportunistic Traffic Management System for Vehicular Networksâ€, Intelligent Transportation Systems, IEEE Transaction, Vol. 12, No. 4, December 2012.

      [10] Kalaiarasi, P. Sriramya and R. A. Karthika, “A comparative study of sequential algorithm and shortcut routing algorithm on multiple travelling salesman problemâ€, ARPN Journal of Engineering and Applied Sciences, vol. 10, No 13, July 2015.

      [11] Csehi, C. Gy. and Toth, J, "Search for Hamiltonian Cycles," Mathematica J. 13, 2011.

      [12] Asaf Levin and Uri Yovel, “Local search algorithms for multiple-depot vehicle routing andfor multiple traveling salesman problems with proved performance guarantees,†December, 2012.

      [13] Gintaras Vaira and Olga Kurasova, “Parallel Bidirectional Dijkstra's Shortest Path Algorithm,†Proceedings of the 2011 Conference on Databases and Information Systems VIâ€, 2011.

  • Downloads

  • How to Cite

    Kalaiarasi, S., & Sriramya, P. (2018). Seed based plant propagation algorithm for multiple travelling salesman problem. International Journal of Engineering & Technology, 7(2.33), 515-517. https://doi.org/10.14419/ijet.v7i2.33.14823