Title: On interval covering salesman problem

Authors: Siba Prasada Tripathy; Amit Tulshyan; Samarjit Kar; Tandra Pal

Addresses: Department of Computer Science and Engineering, National Institute of Technology Durgapur, West Bengal, India ' Department of Information Technology National Institute of Technology Durgapur, West Bengal, India ' Department of Mathematics, National Institute of Technology Durgapur, West Bengal, India ' Department of Computer Science and Engineering, National Institute of Technology Durgapur, West Bengal, India

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.

Keywords: travelling salesman problem; covering salesman problem; uncertainty; interval numbers; metameric genetic algorithm; MGA; global parent.

DOI: 10.1504/IJAIP.2024.138569

International Journal of Advanced Intelligence Paradigms, 2024 Vol.27 No.3/4, pp.266 - 282

Received: 04 May 2018
Accepted: 03 Jun 2018
Published online: 13 May 2024 *

Full-text access for editors Full-text access for subscribers Purchase this article Comment on this article