Please wait a minute...
Frontiers of Information Technology & Electronic Engineering

ISSN 2095-9184

Frontiers of Information Technology & Electronic Engineering  2016, Vol. 17 Issue (8): 717-729   https://doi.org/10.1631/FITEE.1500287
  本期目录
海豚群算法
伍天骐(),姚敏,杨建华
浙江大学计算机科学与技术学院
Dolphin swarm algorithm
Tian-qi WU(),Min YAO,Jian-hua YANG
School of Computer Science and Technology, Zhejiang University, Hangzhou 310027, China
 全文: PDF(654 KB)  
摘要:

群体智能算法采取分布式解决问题的策略,已成功应用于很多传统算法难以解决的优化问题。目前已有粒子群算法、遗传算法、蜂群算法、蚁群算法等已经成功实现且效果良好的算法,但在优化对象日益复杂的今天,这些算法越来越难以满足人们对精度和时间的要求,而改进这些算法所带来的收益也越来越低。在这种情况下,设计一种新的算法来更好地解决优化问题变得越来越有意义。海豚有很多值得关注的生物特性和生活习性,如回声定位、信息交流、合作分工等。通过将这些生物特性和生活习性与群体智能的思想结合起来,引入优化问题中,我们提出了一种新的算法——海豚群算法,并给出了算法的相关定义,详细阐述了算法中搜寻、呼叫、接受、捕猎四个关键阶段。为了验证海豚群算法的效果,使用了10个性质各异的基准函数对海豚群算法以及粒子群算法、遗传算法、蜂群算法进行实验,并将4个函数的收敛速度和基准函数结果进行比较。实验结果表明,海豚群算法在大多数情况下,特别是在低维单峰函数、高维多峰函数、步长函数、带随机变量的函数中表现良好,具有收敛速度先慢后快、阶段性收敛、不易陷入局部最优、对基准函数具体性质没有要求等特点,尤其适用于适应度函数调用次数较多、使用个体较少的优化问题。

Abstract

By adopting the distributed problem-solving strategy, swarm intelligence algorithms have been successfully applied to many optimization problems that are difficult to deal with using traditional methods. At present, there are many well-implemented algorithms, such as particle swarm optimization, genetic algorithm, artificial bee colony algorithm, and ant colony optimization. These algorithms have already shown favorable performances. However, with the objects becoming increasingly complex, it is becoming gradually more difficult for these algorithms to meet human’s demand in terms of accuracy and time. Designing a new algorithm to seek better solutions for optimization problems is becoming increasingly essential. Dolphins have many noteworthy biological characteristics and living habits such as echolocation, information exchanges, cooperation, and division of labor. Combining these biological characteristics and living habits with swarm intelligence and bringing them into optimization problems, we propose a brand new algorithm named the ‘dolphin swarm algorithm’ in this paper. We also provide the definitions of the algorithm and specific descriptions of the four pivotal phases in the algorithm, which are the search phase, call phase, reception phase, and predation phase. Ten benchmark functions with different properties are tested using the dolphin swarm algorithm, particle swarm optimization, genetic algorithm, and artificial bee colony algorithm. The convergence rates and benchmark function results of these four algorithms are compared to testify the effect of the dolphin swarm algorithm. The results show that in most cases, the dolphin swarm algorithm performs better. The dolphin swarm algorithm possesses some great features, such as first-slow-then-fast convergence, periodic convergence, local-optimum-free, and no specific demand on benchmark functions. Moreover, the dolphin swarm algorithm is particularly appropriate to optimization problems, with more calls of fitness functions and fewer individuals.

Key wordsSwarm intelligence    Bio-inspired algorithm    Dolphin    Optimization
收稿日期: 2015-09-04      出版日期: 2016-08-18
通讯作者: 伍天骐     E-mail: TainchWu@gmail.com
Corresponding Author(s): Tian-qi WU   
 引用本文:   
伍天骐,姚敏,杨建华. 海豚群算法[J]. Frontiers of Information Technology & Electronic Engineering, 2016, 17(8): 717-729.
Tian-qi WU,Min YAO,Jian-hua YANG. Dolphin swarm algorithm. Front. Inform. Technol. Electron. Eng, 2016, 17(8): 717-729.
 链接本文:  
https://academic.hep.com.cn/fitee/CN/10.1631/FITEE.1500287
https://academic.hep.com.cn/fitee/CN/Y2016/V17/I8/717
1 Bonabeau, E., Dorigo, M., Theraulaz, G., 1999. Swarm Intelligence: from Natural to Artificial Systems. Oxford University Press.
2 Cura, T., 2012. A particle swarm optimization approach to clustering. Expert Syst. Appl., 39(1):1582–1588.
3 Dorigo, M., Birattari, M., 2010. Ant colony optimization. In: Sammut, C., Webb, G.I. (Eds.), Encyclopedia of Machine Learning. Springer, p.36–39.
4 Dorigo, M., Maniezzo, V., Colorni, A., 1996. Ant system: optimization by a colony of cooperating agents. IEEE Trans. Syst. Man Cybern. B, 26(1):29–41.
5 Ducatelle, F., di Caro, G.A., Gambardella, L.M., 2010. Principles and applications of swarm intelligence for adaptive routing in telecommunications networks. Swarm Intell., 4(3):173–198.
6 Eberhart, R.C., Kennedy, J., 1995. A new optimizer using particle swarm theory. Proc. 6th Int. Symp. on Micro Machine and Human Science, p.39–43.
7 Eberhart, R.C., Shi, Y.H., 2001. Particle swarm optimization: developments, applications and resources. Proc. Congress on Evolutionary Computation, p.81–86.
8 Garnier, S., Gautrais, J., Theraulaz, G., 2007. The biological principles of swarm intelligence. Swarm Intell., 1(1):3–31.
9 Karaboga, D., 2005. An Idea Based on Honey Bee Swarm for Numerical Optimization. Technical Report-TR06, Erciyes University, Turkey.
10 Karaboga, D., Basturk, B., 2007. A powerful and efficient algorithm for numerical function optimization: artificial bee colony (ABC) algorithm. J. Glob. Optim., 39(3):459–471.
11 Karaboga, D., Gorkemli, B., Ozturk, C., , 2014. A comprehensive survey: artificial bee colony (ABC) algorithm and applications. Artif. Intell. Rev., 42(1):21–57.
12 Kennedy, J., 2010. Particle swarm optimization. In: Sammut, C., Webb, G.I. (Eds.), Encyclopedia of Machine Learning. Springer, p.760–766.
13 Mitchell, M., 1998. An Introduction to Genetic Algorithms. MIT Press.
14 Mohan, B.C., Baskaran, R., 2012. A survey: ant colony optimization based recent research and implementation on several engineering domains. Expert Syst. Appl., 39(4): 4618–4627.
15 Parpinelli, R.S., Lopes, H.S., 2011. New inspirations in swarm intelligence: a survey. Int. J. Bio-inspired Comput., 3(1):1–16.
16 Poli, R., Kennedy, J., Blackwell, T., 2007. Particle swarm optimization. Swarm Intell., 1(1):33–57.
17 Saleem, M., di Caro, G.A., Farooq, M., 2011. Swarm intelligence based routing protocol for wireless sensor networks: survey and future directions. Inform. Sci., 181(20):4597–4624.
18 Whitley, D., 1994. A genetic algorithm tutorial. Stat. Comput., 4(2):65–85.
19 Yao, X., Liu, Y., Lin, G.M., 1999. Evolutionary programming made faster. IEEE Trans. Evol. Comput., 3(2):82–102.
Viewed
Full text


Abstract

Cited

  Shared   
  Discussed