Performance characteristics of alternative genetic algorithmic approaches to the traveling salesman problem using path representation: An empirical study (Q1296791)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Performance characteristics of alternative genetic algorithmic approaches to the traveling salesman problem using path representation: An empirical study |
scientific article; zbMATH DE number 1320324
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Performance characteristics of alternative genetic algorithmic approaches to the traveling salesman problem using path representation: An empirical study |
scientific article; zbMATH DE number 1320324 |
Statements
Performance characteristics of alternative genetic algorithmic approaches to the traveling salesman problem using path representation: An empirical study (English)
0 references
14 November 1999
0 references
combinational analysis
0 references
computational analysis
0 references
genetic algorithms
0 references
traveling salesman problem
0 references
statistical experimental design
0 references
0 references
0.8252767324447632
0 references
0.815274178981781
0 references
0.8141712546348572
0 references
