Multi-objective cellular memetic algorithm Online publication date: Mon, 08-Aug-2022
by Xianghong Lin; Tingyu Ren; Jie Yang; Xiangwen Wang
International Journal of Computing Science and Mathematics (IJCSM), Vol. 15, No. 3, 2022
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.
Existing subscribers:
Go to Inderscience Online Journals to access the Full Text of this article.
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 Computing Science and Mathematics (IJCSM):
Login with your Inderscience username and 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
Our Blog 
Follow us on Twitter 
Visit us on Facebook