The nature of nature: Why nature-inspired algorithms work

    Research output: Chapter in Book/Report/Conference proceedingChapter (Book)Researchpeer-review

    2 Citations (Scopus)

    Abstract

    Nature has inspired many algorithms for solving complex problems. Understanding how and why these natural models work leads not only to new insights about nature, but also to an understanding of deep relationships between familiar algorithms. Here, we show that network properties underlie and define a whole family of nature-inspired algorithms. In particular, the network defined by neighbor hoods within landscapes (real or virtual) underlies the searches and phase transitions mediate between local and global search. Three paradigms drawn from computer science—dual-phase evolution, evolutionary dynamics and generalized local search machines—provide theoretical foundations for understanding how nature-inspired algorithms function. Several algorithms provide useful examples, especially genetic algorithms, ant colony optimization and simulated annealing.

    Original languageEnglish
    Title of host publicationNature-Inspired Computing and Optimization
    Subtitle of host publicationTheory and Applications
    EditorsSrikanta Patnaik, Xin-She Yang, Kazumi Nakamatsu
    Place of PublicationCham, Switzerland
    PublisherSpringer
    Pages1-27
    Number of pages27
    ISBN (Electronic)9783319509204
    ISBN (Print)9783319509198
    DOIs
    Publication statusPublished - 2017

    Publication series

    NameModeling and Optimization in Science and Technologies
    PublisherSpringer
    Volume10
    ISSN (Print)2196-7326
    ISSN (Electronic)2196-7334

    Keywords

    • Dual-phase evolution
    • Evolutionary dynamics
    • Generalized local search machines
    • Nature-inspired algorithms

    Cite this