Genetic whale optimisation algorithm for solving travelling salesman problem
by Amit Kumar
International Journal of Artificial Intelligence and Soft Computing (IJAISC), Vol. 8, No. 2, 2024

Abstract: Travelling salesman problem (TSP) is a hard combinatorial optimisation problem that has an enormous discrete search space with an excess of potential solutions. In this condition, it is impossible to carry out an exhaustive search using merely brute force. Whale optimisation algorithm (WOA) is a recent nature-inspired metaheuristic algorithm that is widely being utilised for the modern intelligent solution approach for hard optimisation problems. It is inspired by the spiral bubble-net hunting strategy of humpback whales. In this paper, a new discrete genetic operators-based whale optimisation algorithm (GWOA) has been presented for addressing the TSP. Further, experiments-based comparison of the GWOA with some recently proposed discrete particle swarm optimisation algorithms shows that the former is able to find better quality tours for TSP.

Online publication date: Thu, 04-Jul-2024

The full text of this article is only available to individual subscribers or to users at subscribing institutions.

 
Existing subscribers:
Go to Inderscience Online Journals to access the Full Text of this article.

Pay per view:
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 Artificial Intelligence and Soft Computing (IJAISC):
Login with your Inderscience username and password:

Username:        Password:          Forgotten your 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