Analysis of Asymmetric Mutation Model in Random Local Search

In a standard Evolutionary Algorithms (EAs), one uses the same rate for mutations from bit 1 to bit 0 and its reverse direction. There are many reports that the asymmetric mutation model is a very powerful strategy in EAs to obtain better solutions more efficiently. In this paper, we report stochast...

Full description

Bibliographic Details
Main Authors: Hiroshi Furutani, Makoto Sakamoto, Yifei Du, Kenji Aoki
Format: Article
Language:English
Published: Atlantis Press 2015-04-01
Series:Journal of Robotics, Networking and Artificial Life (JRNAL)
Subjects:
Online Access:https://www.atlantis-press.com/article/21658.pdf