On combinatorial optimization motivated by biology (Q2369066)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 5020472
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | On combinatorial optimization motivated by biology |
scientific article; zbMATH DE number 5020472 |
Statements
On combinatorial optimization motivated by biology (English)
0 references
28 April 2006
0 references
This article presents an overview of multiobjective combinatorial problems and the similarities some of their solution methods have with biological processes. After a short introduction on multiobjective problems and Pareto optimality, the authors proceed to describe two solution techniques: the extremal optimization metaheuristic and the backward-forward greedy method. These methods are similar to processes in the immune system and ant foraging, respectively. The article concludes with an example derived from the traveling salesman problem.
0 references
multiobjective combinatorial optimization
0 references
extremal optimization
0 references
Pareto optimality
0 references
greedy method
0 references
immune system
0 references
ant foraging
0 references
traveling salesman problem
0 references
0 references
0.7565197944641113
0 references
0.754254937171936
0 references
0.7433251142501831
0 references