Please use this identifier to cite or link to this item: http://hdl.handle.net/10397/55346
Title: Application of disturbance of DNA fragments in swarm intelligence algorithm
Authors: Liu, Y
Niu, B
Chan, FTS 
Liu, R
Sui, C
Keywords: Algorithm
DNA fragments
Swarm intelligence
Issue Date: 2015
Publisher: Springer
Source: Lecture notes in computer science (including subseries Lecture notes in artificial intelligence and lecture notes in bioinformatics) How to cite?
Journal: Lecture notes in computer science (including subseries Lecture notes in artificial intelligence and lecture notes in bioinformatics) 
Abstract: Optimization problem is one of the most important problems encountered in the real world. In order to effectively deal with optimization problem, some intelligence algorithms have been put forward, for example, PSO, GA, etc. To effectively solve this kind of problem, in this paper, crossing strategy of DNA fragments is proposed to explore the effect on intelligence algorithms based on American genetic biologist Morgan theory. We mainly focus on DNA fragment decreasing strategy and DNA fragment increasing strategy based on disturbance in PSO. In order to test the role of the DNA mechanism, three test benchmarks were selected to conduct the analysis of convergence property and statistical property. The simulation results show that the PSO with DNA mechanism have an advantage on algorithm performance efficiency compared with the original proposed PSO. Therefore, DNA mechanism is an effective method for improving swarm Intelligence algorithm performance.
Description: 11th International Conference, ICIC 2015, Fuzhou, China, August 20-23, 2015
URI: http://hdl.handle.net/10397/55346
ISBN: 9783319221854
ISSN: 0302-9743
EISSN: 1611-3349
DOI: 10.1007/978-3-319-22186-1_70
Appears in Collections:Conference Paper

Access
View full-text via PolyU eLinks SFX Query
Show full item record

Page view(s)

35
Last Week
2
Last month
Checked on Sep 18, 2017

Google ScholarTM

Check

Altmetric



Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.