A new approach to solving the multiple traveling salesperson problem using genetic algorithms (Q2432849)
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: A new approach to solving the multiple traveling salesperson problem using genetic algorithms |
scientific article; zbMATH DE number 5067614
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A new approach to solving the multiple traveling salesperson problem using genetic algorithms |
scientific article; zbMATH DE number 5067614 |
Statements
A new approach to solving the multiple traveling salesperson problem using genetic algorithms (English)
0 references
25 October 2006
0 references
genetic algorithms
0 references
scheduling
0 references
traveling salesman
0 references
0 references
0 references
0.8918065428733826
0 references
0.8645123243331909
0 references
0.8404032588005066
0 references
0.8381151556968689
0 references
