Abstract
A traveling salesman problem (TSP) is an assignment problem (AP) with extra conditions, in which the aim is to find the best possible way of visiting all the planned cities only once and returning back to the opening point that minimize the travel distance (or time or cost) on the whole. In the modern world, TSP occupies a major role. The eminent method used to solve the TSPs is the Hungarian method. In this research article, we have identified and established a list of TSPs which are having alternative optimal tour plans (OTPs). For the identified TSPs, the alternative OTPs are generated by applying the proposed TWINS method. The main aim of developing alternative OTPs by the management is to have the best possible decision out of the available alternative solutions. Solution alternatives also can make it easier to make use of these options in the future during disaster situations. The alternatives identified become a base for subsequent analysis by the management and eventually the decision itself.
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.
