Favourable subpopulation migration strategy for travelling salesman problem
by Abhishek Chandar; Akshay Srinivasan; G. Paavai Anand
International Journal of Business Intelligence and Data Mining (IJBIDM), Vol. 20, No. 3, 2022

Abstract: Most of the existing migration strategies are complex in nature which results in high computation time. Since the introduction of parallel genetic algorithms, they are known for obtaining better optimal solutions at the cost of more computation. Migration has played a significant role in maintaining genetic diversity of the population. This paper aims to propose a new migration strategy that improves the performance of the parallel genetic algorithm in solving NP hard problems. In order to assess its behaviour, various travelling salesman problem datasets are considered since it is a perfect example of an NP hard problem. The algorithm is based on an island model approach where one subpopulation is nurtured by the other subpopulations by taking turns during the migration process to progressively reach the optimal solution. In turn, the nurtured subpopulation provides a feedback loop to the subpopulation with poor fitness value based on certain criteria to be met. An extensive study was conducted to understand the optimal parameters values in which the proposed algorithm works best.

Online publication date: Mon, 11-Apr-2022

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 Business Intelligence and Data Mining (IJBIDM):
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