Title: A novel self-organisation model for improving the performance of permutation coded genetic algorithm

Authors: K. Dinesh; J. Amudhavel; R. Rajakumar; P. Dhavachelvan; R. Subramanian

Addresses: Department of Computer Science and Engineering, Pondicherry University, Puducherry, India ' Department of Computer Science and Engineering, KL University, Andhrapradesh, India ' Department of Computer Science and Engineering, Pondicherry University, Puducherry, India ' Department of Computer Science and Engineering, Pondicherry University, Puducherry, India ' Department of Computer Science and Engineering, Pondicherry University, Puducherry, India

Abstract: Genetic algorithms (GA) are extremely powerful among evolutionary principles and being used in variety of fields for solving more complex problems. Varieties of assistive techniques have been proposed to improve the performance of genetic algorithms w.r.t. the nature of the application and self-organisation is one such model, which is aimed at improving the performance of the GAs by all means. The self-organisation models enable the systems to acquire and maintain the structure by themselves, without any external control. It is highly evidenced that it gives greater benefits to solve the complex problems with competent efficiency levels in conjunction with the classical GAs. The combined version of SOM and GA has the power of better exploration. In this way, the work reported in this paper proposes an efficient pattern based self-organisation model for improving the performance of the GA for the combinatorial optimisation problem. The competency of the proposed model is demonstrated by means of a set of well-defined experiments over the selected benchmark travelling salesman problem (TSP) instances. The assessments proved the efficiency of the technique in terms of a set of generic performance criteria like convergence rate, convergence time, error rate, nearest neighbour ratio and distinct individuals.

Keywords: self-organisation technique; genetic algorithm; population seeding technique; travelling salesman problem; TSP; pattern replacement; combinatorial problem.

DOI: 10.1504/IJAIP.2020.109512

International Journal of Advanced Intelligence Paradigms, 2020 Vol.17 No.3/4, pp.299 - 322

Received: 14 Nov 2016
Accepted: 09 Aug 2017
Published online: 11 Sep 2020 *

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