Evolution algorithms in combinatorial optimization (Q1104056)
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 4054941
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Evolution algorithms in combinatorial optimization |
scientific article; zbMATH DE number 4054941 |
Statements
Evolution algorithms in combinatorial optimization (English)
0 references
1988
0 references
The paper deals with a presentation of evolution algorithms. The replicator equation is introduced and an application to the graph partitioning problem (GPP) is given. A new generic algorithm for the traveling salesman problem is given. Numerical results are presented. In the last section the network algorithm for the GPP is applied. A number of other questions are also discussed. Reviewer's remark: This algorithm can be easily applied to the symmetric traveling salesman problem.
0 references
Darwinian algorithm
0 references
superlinear speedup
0 references
combinatorial optimization
0 references
evolution algorithms
0 references
replicator equation
0 references
graph partitioning problem
0 references
generic algorithm
0 references
traveling salesman problem
0 references
Numerical results
0 references
network algorithm
0 references
0.98436546
0 references
0 references
0 references
