A double-loop hybrid algorithm for the traveling salesman problem with arbitrary neighbourhoods (Q1681325): Difference between revisions
From MaRDI portal
Created a new Item |
Added link to MaRDI item. |
||
| links / mardi / name | links / mardi / name | ||
Revision as of 05:22, 1 February 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A double-loop hybrid algorithm for the traveling salesman problem with arbitrary neighbourhoods |
scientific article |
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
