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 proceedingChapterpeer-review

    7 Citations (Scopus)


    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 languageEnglish
    Title of host publicationIntelligent Information and Database Systems - 8th Asian Conference, ACIIDS 2016, Proceedings
    EditorsNgoc Thanh Nguyen, Bogdan Trawinski, Tzung-Pei Hong, Hamido Fujita
    Number of pages9
    ISBN (Print)9783662493809
    Publication statusPublished - 2016

    Publication series

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


    • Dynamic diversity flower pollination algorithm
    • Flower pollination algorithm
    • Multimodal optimization problems


    Dive into the research topics of 'Dynamic Diversity Population Based Flower Pollination Algorithm for Multimodal Optimization'. Together they form a unique fingerprint.

    Cite this