The Nature of Nature: Why Nature-Inspired Algorithms Work
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...
        Saved in:
      
    
          | Published in | Nature-Inspired Computing and Optimization Vol. 10; pp. 1 - 27 | 
|---|---|
| Main Authors | , , | 
| Format | Book Chapter | 
| Language | English | 
| Published | 
        Switzerland
          Springer International Publishing AG
    
        2017
     Springer International Publishing  | 
| Series | Modeling and Optimization in Science and Technologies | 
| Subjects | |
| Online Access | Get full text | 
| ISBN | 9783319509198 3319509195  | 
| ISSN | 2196-7326 2196-7334  | 
| DOI | 10.1007/978-3-319-50920-4_1 | 
Cover
| Summary: | 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 neighbourhoods 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. | 
|---|---|
| ISBN: | 9783319509198 3319509195  | 
| ISSN: | 2196-7326 2196-7334  | 
| DOI: | 10.1007/978-3-319-50920-4_1 |