Multipopulation genetic algorithms with different interaction structures to solve flexible job-shop scheduling problems: A network science perspective

Abstract

Populations of multipopulation genetic algorithms (MPGAs) parallely evolve with some interaction mechanisms. Previous studies have shown that the interaction structures can impact on the performance of MPGAs to some extent. This paper introduces the concept of complex networks such as ring-shaped networks and small-world networks to study how interaction structures and their parameters influence the MPGAs, where subpopulations are regarded as nodes and their interaction or migration of elites between subpopulations as edges. After solving the flexible job-shop scheduling problem (FJSP) by MPGAs with different parameters of interaction structures, simulation results were measured by criteria, such as success rate and average optimal value. The analysis reveals that (1) the smaller the average path length (APL) of the network is, the higher the propagation rate will be; (2) the performance of MPGAs increased first and then decreased along with the decrease of APL, indicating that, for better performance, the networks should have a proper APL, which can be adjusted by changing the structural parameters of networks; and (3) because the edge number of small-world networks remains unchanged with different rewiring possibilities of edges, the change in performance indicates that the MPGA can be improved by a more proper interaction structure of subpopulations as other conditions remain unchanged.