Title: Multi-objective cellular memetic algorithm

Authors: Xianghong Lin; Tingyu Ren; Jie Yang; Xiangwen Wang

Addresses: College of Computer Science and Engineering, Northwest Normal University, Lanzhou, Gansu 730070, China ' College of Computer Science and Engineering, Northwest Normal University, Lanzhou, Gansu 730070, China ' College of Computer Science and Engineering, Northwest Normal University, Lanzhou, Gansu 730070, China ' College of Computer Science and Engineering, Northwest Normal University, Lanzhou, Gansu 730070, China

Abstract: This paper presents a multi-objective cellular memetic algorithm (MOCMA) based on k-means clustering, which integrates the clustering-based local search method into multi-objective cellular genetic algorithm. Specifically, according to the objective function values of individuals in each generation, the k-means clustering is used to control the similar individuals gathered in a cluster. Meanwhile, to explore the search space efficiently and get the Pareto optimal solutions in objective space, one individual is selected randomly to undergo local search from each cluster and it will be improved than before. The MOCMA is applied to constrained and unconstrained problems. We analyse the influence of cluster number on the performance of the algorithm, and compare the MOCMA with other evolutionary multi-objective optimisers. It indicates that the proposed MOCMA is efficient for solving the multi-objective optimisation problems.

Keywords: cGAs; cellular genetic algorithm; multi-objective optimisation; k-means clustering; Pareto optimal set; local search.

DOI: 10.1504/IJCSM.2022.124723

International Journal of Computing Science and Mathematics, 2022 Vol.15 No.3, pp.213 - 223

Received: 01 Jul 2021
Accepted: 25 Sep 2021
Published online: 08 Aug 2022 *

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