Loading…

Discussions of worker ants’ rule-based CHC dealing with changing environments

Contrary to popular belief, biologists discovered that worker ants are really not all hardworking. It has been found that in three separate 30-strong colonies of black Japanese ants ( Myrmecina nipponica), about 20% of worker ants are diligent, 60% are ordinary, and 20% are lazy. That is called 20:6...

Full description

Saved in:
Bibliographic Details
Published in:Applied soft computing 2010, Vol.10 (1), p.245-250
Main Authors: Kamiya, Akimoto, Abiko, Kazuya, Kobayashi, Shigenobu
Format: Article
Language:English
Subjects:
Citations: Items that this one cites
Items that cite this one
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary:Contrary to popular belief, biologists discovered that worker ants are really not all hardworking. It has been found that in three separate 30-strong colonies of black Japanese ants ( Myrmecina nipponica), about 20% of worker ants are diligent, 60% are ordinary, and 20% are lazy. That is called 20:60:20 rule. Though they are lazy, biologists suggested that lazy worker ants could be contributing something to the colony that is yet to be determined. In our last research, we used CHC (cross generational elitist selection, heterogeneous recombination, and cataclysmic mutation) with the worker ants’ rule (WACHC) aiming at solving optimization problems in changing environments. CHC is a nontraditional genetic algorithm (GA) which combines a conservative selection strategy that always preserves the best individuals found so far with a radical (highly disruptive) recombination operator. In our last research, we verified that WACHC performs better than CHC in only one case of fully changing environment. In this paper, we further discuss our proposed WACHC dealing with changing environment problems with varying degree of difficulty, compare our proposal with hypermutation GA which is also proposed for dealing with changing environment problems, and discuss the difference between our proposal and ant colony optimization algorithms.
ISSN:1568-4946
1872-9681
DOI:10.1016/j.asoc.2009.06.020