Comparison Study of Multiple Traveling Salesmen Problem using  Genetic Algorithm

Journal Title: IOSR Journals (IOSR Journal of Computer Engineering) - Year 2013, Vol 13, Issue 3

Abstract

 Multiple traveling salesman problems (MTSP) are a typical computationally complex combinatorial optimization problem, which is an extension of the famous traveling salesman problem (TSP). The MTSP can be  generalized to a wide variety of routing and scheduling problems. The paper makes the attempt to show how  Genetic Algorithm (GA) can be applied to the MTSP with ability constraint. In this paper, we compare MTSP in  term of distance and iteration by considering several set of cities. The computational results show that the  proposed algorithm can find competitive solutions within rational time, especially for large scale problems

Authors and Affiliations

Shalini Singh

Keywords

Related Articles

 Smart Combined Video Tool

 Abstract: In today’s world there are many tools for video editing, video compression, video conversion. But they require more time which is not affordable by today’s modern applications. And also there is no facili...

 Crawler with Search Engine based Simple Web Application System for Forum Mining

 Abstract : Now-a-days the growth of online users increased infinitely depending upon the information in web sources. Web mining is an important term to manage the data from web which has different categorization as...

 K Means Clustering Algorithm for Partitioning Data Sets Evaluated From Horizontal Aggregations

 Data mining refers to the process of analyzing the data from different perspectives and summarizing it into useful information that is mostly used by the different users for analyzing the data as well as for p...

 Net Neutrality – A Look at the Future of Internet

 Abstract: The Internet is an indispensable medium. The success story of Internet has evolved free from complex government regulation. But there is an increasing threat that Internet Service Providers (ISPs) will al...

 Evaluate the Effectiveness of Test Suite Prioritization Techniques Using APFD Metric

 Abstract: Regression testing is a testing activity that is performed to provide confidence that changes do not  harm the existing behavior of the software. Test suites tend to grow in size as software evolves...

Download PDF file
  • EP ID EP120406
  • DOI -
  • Views 72
  • Downloads 0

How To Cite

Shalini Singh (2013).  Comparison Study of Multiple Traveling Salesmen Problem using  Genetic Algorithm. IOSR Journals (IOSR Journal of Computer Engineering), 13(3), 17-22. https://europub.co.uk/articles/-A-120406