Abstract Shuffled frog leaping algorithm is one of the popular used optimization algorithms. This algorithm includes the local search and global search two solving modes, but in this method only the worst frog from divided group is considered for improving location. In this paper, we propose a directional shuffled frog leaping algorithm (DSFLA) by introducing the directional updating and real-time interacting concepts. A direction flag is set for a frog before moving, if the frog goes better in a certain direction, it will get better in a big probability by moving a little further along that direction. The movement counter is set for preventing the frog move forward infinite. Real-time interacting works by sharing the currently optimal positions from the other groups. There should have some similarities among the best ones, and the worst individual could be improved by using those similarities. The experimental results show that the proposed approach is a very effective method for solving test functions.


    Zugriff

    Zugriff prüfen

    Verfügbarkeit in meiner Bibliothek prüfen

    Bestellung bei Subito €


    Exportieren, teilen und zitieren



    Titel :

    Directional Shuffled Frog Leaping Algorithm


    Beteiligte:
    Kong, Lingping (Autor:in) / Pan, Jeng-Shyang (Autor:in) / Chu, Shu-Chuan (Autor:in) / Roddick, John F. (Autor:in)


    Erscheinungsdatum :

    2017-11-03


    Format / Umfang :

    8 pages





    Medientyp :

    Aufsatz/Kapitel (Buch)


    Format :

    Elektronische Ressource


    Sprache :

    Englisch