Memes co‐evolution strategies for fast convergence in solving single machine scheduling problems

• Main Authors: Huang, Wei-Hsiu, Chang, Pei‐Chann, Lim, Meng-Hiot, Zhang, Zhenzhen
• Other Authors: School of Electrical and Electronic Engineering
• Format: Article
• Language: English
• Published: 2013
• Subjects: DRNTU::Engineering::Computer science and engineering::Theory of computation::Analysis of algorithms and problem complexity
• Online Access: https://hdl.handle.net/10356/105005; http://hdl.handle.net/10220/17018; http://dx.doi.org/10.1080/00207543.2011.649799
• Institution: Nanyang Technological University

In recent years, researchers have become more aware of the significance and importance of memes in computational problem‐solving. It is now generally accepted that collectively, memes as a group or population undergo evolution just like genes, competition and collaboration. In this paper, we present a memes co‐evolutionary framework for solving the single machine total weighted tardiness problem. The mechanisms of memes co‐evolution serve to promote diversity not just in the solutions, but also within the memes that participate in the search. Our results show convincingly that the memes co‐evolution strategies are able to improve the performance in solving several difficult benchmarks of weighted tardiness single‐machine scheduling problems.