A double-loop hybrid algorithm for the traveling salesman problem with arbitrary neighbourhoods (Q1681325)
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 double-loop hybrid algorithm for the traveling salesman problem with arbitrary neighbourhoods |
scientific article; zbMATH DE number 6811919
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A double-loop hybrid algorithm for the traveling salesman problem with arbitrary neighbourhoods |
scientific article; zbMATH DE number 6811919 |
Statements
A double-loop hybrid algorithm for the traveling salesman problem with arbitrary neighbourhoods (English)
0 references
23 November 2017
0 references
traveling salesman problem
0 references
arbitrary neighbourhoods
0 references
boundary-based encoding scheme
0 references
hybrid algorithm
0 references
close-enough
0 references
0 references
0 references
0 references
