Evolution algorithms in combinatorial optimization (Q1104056): Difference between revisions
From MaRDI portal
Changed an Item |
Set OpenAlex properties. |
||
| (One intermediate revision by one other user not shown) | |||
| Property / MaRDI profile type | |||
| Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1016/0167-8191(88)90098-1 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2051682049 / rank | |||
Normal rank | |||
Latest revision as of 01:37, 20 March 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Evolution algorithms in combinatorial optimization |
scientific article |
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
