Abstract
A traveling salesman problem (TSP) is an assignment problem (AP) with additional conditions, in which the intent is to find the best possible way of visiting all the planned cities only once and returning back to the starting city that minimizes the travel distance (or time or cost) on the whole. In the modern world with all the transportation facilities, TSP plays a most important role. The well-known 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 additional optimal tour plans (OTPs). For the identified TSPs, the OTP and the additional OTP are formed by applying the proposed T-SOFT method. The central aspire of developing additional OTPs by the administration is to have the best possible decision during the critical and disaster situations. Thereby, the additional OTPs become a base for subsequent analysis by the administration 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.
