A novel discrete Rat swarm optimization (DRSO) algorithm for solving the traveling salesman problem
Toufik Mzili, Mohammed Essaid Riffi, Ilyass Mzili, Gaurav Dhiman
Abstract
Metaheuristics are often used to find solutions to real and complex problems. These algorithms can solve optimization problems and provide solutions close to the global optimum in an acceptable and reasonable time. In this paper, we will present a new bio-inspired metaheuristic based on the natural chasing and attacking behaviors of rats in nature, called Rat swarm optimizer. Which has given good results in solving several continuous optimization problems, and adapted it to solve a discrete, NP-hard, and classical optimization problem that is the traveling salesman problem (TSP) while respecting the natural behavior of rats. To test the efficiency of the adaptation of our proposal, we applied the adapted rat swarm optimization (RSO) algorithm on some reference instances of TSPLIB. The obtained results show the performance of the proposed method in solving the traveling salesman problem (TSP).