An efficient genetic algorithm for the traveling salesman problem with precedence constraints (Q1848588)
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: An efficient genetic algorithm for the traveling salesman problem with precedence constraints |
scientific article; zbMATH DE number 1827385
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | An efficient genetic algorithm for the traveling salesman problem with precedence constraints |
scientific article; zbMATH DE number 1827385 |
Statements
An efficient genetic algorithm for the traveling salesman problem with precedence constraints (English)
0 references
13 November 2002
0 references
traveling salesman problem with precedence constraints
0 references
genetic algorithm
0 references
topological sort
0 references
optimization
0 references
0 references
0 references
0 references
0.8257555365562439
0 references
0.8041106462478638
0 references
0.7999210357666016
0 references
0.7874048948287964
0 references
0.7842763662338257
0 references
