Abstract
The Multiple Traveling Salesman Problem(MTSP) is an extension of the traveling salesman problem(TSP).MTSP is a classical combinatorial optimization problem with more complexity and applicability.The MTSP with the up-limit of the cities to be visited for each salesman was studied and the self-organizing algorithm(SOA) was introduced to solve the problem.The MTSP was transformed into a TSP by introducing virtual cities and the local fitness of virtual city was defined to deal with the relevant constraints.The computational results with a number of benchmark problems show that SOA can be effectively applied in solving the proposed MTSP with superior performance.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
