Bioinspired Computation in Combinatorial Optimization Algorithms and Their Computational Complexity /
Bioinspired computation methods, such as evolutionary algorithms and ant colony optimization, are being applied successfully to complex engineering and combinatorial optimization problems, and it is very important that we understand the computational complexity of these search heuristics. This is th...
| Main Authors: | Neumann, Frank (Author), Witt, Carsten (Author) |
|---|---|
| Corporate Author: | SpringerLink (Online service) |
| Format: | Electronic eBook |
| Language: | English |
| Published: |
Berlin, Heidelberg :
Springer Berlin Heidelberg,
2010.
|
| Series: | Natural Computing Series,
|
| Subjects: | |
| Online Access: | Full Text via HEAL-Link |
Similar Items
-
Bioinspired Computation in Combinatorial Optimization Algorithms and Their Computational Complexity
by: Neumann, Frank
Published: (2010) -
Differential Evolution A Practical Approach to Global Optimization /
by: Price, Kenneth V., et al.
Published: (2005) -
Differential Evolution In Search of Solutions /
by: Feoktistov, Vitaliy
Published: (2006) -
Theoretical Aspects of Local Search
by: Michiels, Wil, et al.
Published: (2007) -
Evolutionary Algorithms for Solving Multi-Objective Problems Second Edition /
by: Coello, Carlos A. Coello, et al.
Published: (2007)