Affiliation:
1. Department of Mathematics, College of Engineering and Technology, SRM Institute of Science and Technology, Kattankulathur, Tamilnadu, India
Abstract
A groundbreaking study employs interval arithmetic to address the challenging multi-objective interval traveling salesperson problem. Customizing methods like a nearest neighbor, branch and bound, two-way heuristics, and dynamic programming effectively resolve this complex problem. Preserving interval values without the need for classical form conversion is a significant advantage. Researchers validated this approach through extensive experiments, consistently demonstrating superior outcomes compared to existing methods. These algorithmic approaches were optimized for Python 3.11 64-bit to enhance processing speed and efficiency.
Subject
Artificial Intelligence,General Engineering,Statistics and Probability
Reference41 articles.
1. Solution of a large-scale traveling-salesman problem;George Ahuja Dantzig;Journal of the Operations Research Society of America,1954
2. Applications of network optimization;Ravindra Ahuja;Handbooks in Operations research and Management Science,1998
3. Enhanced traveling salesman problem solving by genetic algorithm technique (TSPGA);Buthainah Fahran Al-Dulaimi;World Academy of Science, Engineering and Technology,2008
4. The N-city traveling salesperson problem: Statistical mechanics and the Metropolis algorithm;Ernesto Bonomi;SIAM Review,1984
5. An efficient genetic algorithm for multi-objective solid travelling salesman problem under fuzziness;Chiranjit Changdar;Swarm and Evolutionary Computation,2014