Dynamic Diversity Population Based Flower Pollination Algorithm for Multimodal Optimization

Jeng-Shyang Pan; Thi-Kien Dao; Trong-The Nguyen; Shu-Chuan Chu; Tien-Szu Pan

doi:10.1007/978-3-662-49381-6_42

Dynamic Diversity Population Based Flower Pollination Algorithm for Multimodal Optimization

Jeng-Shyang Pan, Thi-Kien Dao, Trong-The Nguyen, Shu-Chuan Chu, Tien-Szu Pan

Research output: Chapter in Book/Report/Conference proceeding › Chapter › peer-review

7 Citations (Scopus)

Abstract

Easy convergence to a local optimum, rather than global optimum could unexpectedly happen in practical multimodal optimization problems due to interference phenomena among physically constrained dimensions. In this paper, an altering strategy for dynamic diversity Flower pollination algorithm (FPA) is proposed for solving the multimodal optimization problems. In this proposed method, the population is divided into several small groups. Agents in these groups are exchanged frequently the evolved fitness information by using their own best historical information and the dynamic switching probability is to provide the diversity of searching process. A set of the benchmark functions is used to test the quality performance of the proposed method. The experimental result of the proposed method shows the better performance in comparison with others methods.

Original language	English
Title of host publication	Intelligent Information and Database Systems - 8th Asian Conference, ACIIDS 2016, Proceedings
Editors	Ngoc Thanh Nguyen, Bogdan Trawinski, Tzung-Pei Hong, Hamido Fujita
Publisher	Springer
Pages	440-448
Number of pages	9
ISBN (Print)	9783662493809
DOIs	https://doi.org/10.1007/978-3-662-49381-6_42
Publication status	Published - 2016

Publication series

Name	Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume	9621
ISSN (Print)	0302-9743
ISSN (Electronic)	1611-3349

Keywords

Dynamic diversity flower pollination algorithm
Flower pollination algorithm
Multimodal optimization problems

Access to Document

10.1007/978-3-662-49381-6_42Licence: In Copyright

Cite this

Pan, J-S., Dao, T-K., Nguyen, T-T., Chu, S-C., & Pan, T-S. (2016). Dynamic Diversity Population Based Flower Pollination Algorithm for Multimodal Optimization. In N. T. Nguyen, B. Trawinski, T-P. Hong, & H. Fujita (Eds.), Intelligent Information and Database Systems - 8th Asian Conference, ACIIDS 2016, Proceedings (pp. 440-448). (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 9621). Springer . https://doi.org/10.1007/978-3-662-49381-6_42

Pan, Jeng-Shyang ; Dao, Thi-Kien ; Nguyen, Trong-The et al. / Dynamic Diversity Population Based Flower Pollination Algorithm for Multimodal Optimization. Intelligent Information and Database Systems - 8th Asian Conference, ACIIDS 2016, Proceedings. editor / Ngoc Thanh Nguyen ; Bogdan Trawinski ; Tzung-Pei Hong ; Hamido Fujita. Springer , 2016. pp. 440-448 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)).

@inbook{74430b066a1b490aaa7fbb2b2b05f306,

title = "Dynamic Diversity Population Based Flower Pollination Algorithm for Multimodal Optimization",

abstract = "Easy convergence to a local optimum, rather than global optimum could unexpectedly happen in practical multimodal optimization problems due to interference phenomena among physically constrained dimensions. In this paper, an altering strategy for dynamic diversity Flower pollination algorithm (FPA) is proposed for solving the multimodal optimization problems. In this proposed method, the population is divided into several small groups. Agents in these groups are exchanged frequently the evolved fitness information by using their own best historical information and the dynamic switching probability is to provide the diversity of searching process. A set of the benchmark functions is used to test the quality performance of the proposed method. The experimental result of the proposed method shows the better performance in comparison with others methods.",

keywords = "Dynamic diversity flower pollination algorithm, Flower pollination algorithm, Multimodal optimization problems",

author = "Jeng-Shyang Pan and Thi-Kien Dao and Trong-The Nguyen and Shu-Chuan Chu and Tien-Szu Pan",

year = "2016",

doi = "10.1007/978-3-662-49381-6_42",

language = "English",

isbn = "9783662493809",

series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",

publisher = "Springer ",

pages = "440--448",

editor = "Nguyen, {Ngoc Thanh} and Bogdan Trawinski and Tzung-Pei Hong and Hamido Fujita",

booktitle = "Intelligent Information and Database Systems - 8th Asian Conference, ACIIDS 2016, Proceedings",

}

Pan, J-S, Dao, T-K, Nguyen, T-T, Chu, S-C & Pan, T-S 2016, Dynamic Diversity Population Based Flower Pollination Algorithm for Multimodal Optimization. in NT Nguyen, B Trawinski, T-P Hong & H Fujita (eds), Intelligent Information and Database Systems - 8th Asian Conference, ACIIDS 2016, Proceedings. Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), vol. 9621, Springer , pp. 440-448. https://doi.org/10.1007/978-3-662-49381-6_42

Dynamic Diversity Population Based Flower Pollination Algorithm for Multimodal Optimization. / Pan, Jeng-Shyang; Dao, Thi-Kien; Nguyen, Trong-The et al.

Intelligent Information and Database Systems - 8th Asian Conference, ACIIDS 2016, Proceedings. ed. / Ngoc Thanh Nguyen; Bogdan Trawinski; Tzung-Pei Hong; Hamido Fujita. Springer , 2016. p. 440-448 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 9621).

Research output: Chapter in Book/Report/Conference proceeding › Chapter › peer-review

TY - CHAP

T1 - Dynamic Diversity Population Based Flower Pollination Algorithm for Multimodal Optimization

AU - Pan, Jeng-Shyang

AU - Dao, Thi-Kien

AU - Nguyen, Trong-The

AU - Chu, Shu-Chuan

AU - Pan, Tien-Szu

PY - 2016

Y1 - 2016

N2 - Easy convergence to a local optimum, rather than global optimum could unexpectedly happen in practical multimodal optimization problems due to interference phenomena among physically constrained dimensions. In this paper, an altering strategy for dynamic diversity Flower pollination algorithm (FPA) is proposed for solving the multimodal optimization problems. In this proposed method, the population is divided into several small groups. Agents in these groups are exchanged frequently the evolved fitness information by using their own best historical information and the dynamic switching probability is to provide the diversity of searching process. A set of the benchmark functions is used to test the quality performance of the proposed method. The experimental result of the proposed method shows the better performance in comparison with others methods.

AB - Easy convergence to a local optimum, rather than global optimum could unexpectedly happen in practical multimodal optimization problems due to interference phenomena among physically constrained dimensions. In this paper, an altering strategy for dynamic diversity Flower pollination algorithm (FPA) is proposed for solving the multimodal optimization problems. In this proposed method, the population is divided into several small groups. Agents in these groups are exchanged frequently the evolved fitness information by using their own best historical information and the dynamic switching probability is to provide the diversity of searching process. A set of the benchmark functions is used to test the quality performance of the proposed method. The experimental result of the proposed method shows the better performance in comparison with others methods.

KW - Dynamic diversity flower pollination algorithm

KW - Flower pollination algorithm

KW - Multimodal optimization problems

UR - http://www.scopus.com/inward/record.url?scp=84961231200&partnerID=8YFLogxK

U2 - 10.1007/978-3-662-49381-6_42

DO - 10.1007/978-3-662-49381-6_42

M3 - Chapter

SN - 9783662493809

T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

SP - 440

EP - 448

BT - Intelligent Information and Database Systems - 8th Asian Conference, ACIIDS 2016, Proceedings

A2 - Nguyen, Ngoc Thanh

A2 - Trawinski, Bogdan

A2 - Hong, Tzung-Pei

A2 - Fujita, Hamido

PB - Springer

ER -

Pan J-S, Dao T-K, Nguyen T-T, Chu S-C, Pan T-S. Dynamic Diversity Population Based Flower Pollination Algorithm for Multimodal Optimization. In Nguyen NT, Trawinski B, Hong T-P, Fujita H, editors, Intelligent Information and Database Systems - 8th Asian Conference, ACIIDS 2016, Proceedings. Springer . 2016. p. 440-448. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)). doi: 10.1007/978-3-662-49381-6_42

Dynamic Diversity Population Based Flower Pollination Algorithm for Multimodal Optimization

Abstract

Publication series

Keywords

Access to Document

Other files and links

Fingerprint

Cite this