Particular fine-grained parallel GA for simulation study of distributed human-based GA

The paper proposes and investigates a particular fine-grained parallel genetic algorithm (GA) for understanding the behaviors of a similar distributed human-based GA through simulations. The particular fine-grained parallel GA restricts interactions between individuals in terms of not space but time, which can occur in real human interactions. Specifically, it gives each individual its own cycle time for encountering other individuals according to a probability distribution. The simulation results show that the GA performance depends on the setting of the encounter timings for the individuals.

[1]  Alex Kosorukoff,et al.  Human based genetic algorithm , 2001, 2001 IEEE International Conference on Systems, Man and Cybernetics. e-Systems and e-Man for Cybernetics in Cyberspace (Cat.No.01CH37236).

[2]  Enrique Alba,et al.  Cellular genetic algorithms , 2014, GECCO.

[3]  Mario Köppen,et al.  Distributed human-based genetic algorithm utilizing a mobile ad hoc network , 2013, 2013 IEEE International Conference on Cybernetics (CYBCO).

[4]  Daniel Stutzbach,et al.  Characterizing unstructured overlay topologies in modern P2P file-sharing systems , 2008, TNET.

[5]  Reiko Tanese,et al.  Distributed Genetic Algorithms , 1989, ICGA.

[6]  Yuji Oie,et al.  Inducing Scale-Free Characteristics of Dynamic Unstructured P2P Networks , 2012, 2012 IEEE 26th International Conference on Advanced Information Networking and Applications.

[7]  Jon Crowcroft,et al.  A survey and comparison of peer-to-peer overlay network schemes , 2005, IEEE Communications Surveys & Tutorials.

[8]  Bernard Manderick,et al.  Fine-Grained Parallel Genetic Algorithms , 1989, ICGA.

[9]  Albert,et al.  Emergence of scaling in random networks , 1999, Science.