On interval covering salesman problem Online publication date: Mon, 13-May-2024
by Siba Prasada Tripathy; Amit Tulshyan; Samarjit Kar; Tandra Pal
International Journal of Advanced Intelligence Paradigms (IJAIP), Vol. 27, No. 3/4, 2024
Abstract: After a disaster, during humanitarian relief transportation or mass fatality management, cost of journey between two places may be uncertain due to the variation of degree of devastation in the affected area. In such scenarios, a viable model is essential to handle the situation in cost-effective and reliable manner which is able to handle this uncertainty. In this paper, we introduce interval covering salesman problem (ICSP), where cost of an edge is represented by interval number. ICSP is a variant of covering salesman problem (CSP) which is helpful for many real-world problems in uncertain environment. Here, we formulate a mathematical model for ICSP with uncertain cost associated with the cost of travel between two nodes/places. We have proposed a metameric genetic algorithm (MGA) for ICSP and presented its simulation results. For implementation, we have used some benchmark TSP instances by changing the costs to interval numbers.
Existing subscribers:
Go to Inderscience Online Journals to access the Full Text of this article.
If you are not a subscriber and you just want to read the full contents of this article, buy online access here.Complimentary Subscribers, Editors or Members of the Editorial Board of the International Journal of Advanced Intelligence Paradigms (IJAIP):
Login with your Inderscience username and password:
Want to subscribe?
A subscription gives you complete access to all articles in the current issue, as well as to all articles in the previous three years (where applicable). See our Orders page to subscribe.
If you still need assistance, please email subs@inderscience.com
Our Blog 
Follow us on Twitter 
Visit us on Facebook