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

 Congestion Control: A Dynamic Approach

 Abstract: Congestion control is a very important concept used in practical networks. Congestion of a networkoccurs when a network carries such high traffic of data that the quality of service deteriorates. In moder...

Selection of Legendre Moments for Content Based Image Retrieval Using ACO Based Algorithm

Abstract : Feature selection is an important step in Content Based Image Retrieval (CBIR) which has a great impact on reducing complexity and increasing efficiency of CBIR frameworks. Swarm Intelligence (SI) methods, as...

Introducing Two Level Verification Model for Reduction of Uncertainty of Message Exchange in Inter Agent Communication in Organizational-Multi-Agent Systems Engineering, O-MaSE

The last decade has seen tremendous advancements in the field of Multi-Agent Systems. Inter-agent communication is the most integral part of any MAS. The problem of impreciseness and obscurity in agent communication has...

 Resource Allocation in Cloud computing: A Comparative study

Abstract: Cloud computing is summed up as a different model for allowing favorable, network as per demand to use shared devices of computational resources which are collected and then released with marginal management ef...

 Investigating ATM System Accessibility for People with Visual  Impairments

 The aim of this paper is to draw attention for the evaluation of the accessibility and usability of Automated Teller Machine (ATM) systems from the point of view of visually impaired persons. It suggests that &n...

Download PDF file
  • EP ID EP120406
  • DOI -
  • Views 85
  • 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