Variable neighbourhood search algorithms for asymmetric travelling salesman problems (Q2627435)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 6724751
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Variable neighbourhood search algorithms for asymmetric travelling salesman problems |
scientific article; zbMATH DE number 6724751 |
Statements
Variable neighbourhood search algorithms for asymmetric travelling salesman problems (English)
0 references
31 May 2017
0 references
Summary: The aim of the research is to find the best neighbourhood structures for the shaking step and the local search step in the variable neighbourhood search algorithm (VNS) when applied to the asymmetric travelling salesman problem (ATSP). Many variants of the VNS algorithm are proposed based on their neighbourhood structures. The performances of these VNS algorithms are tested with the benchmark instances of the ATSP, one of the best known logistics problems.
0 references
asymmetric TSP
0 references
travelling salesman problem
0 references
ATSP
0 references
variable neighbourhood search
0 references
VNS
0 references
NP-hard
0 references
combinatorial problems
0 references
neighbourhood structures
0 references
logistics
0 references
0.8095932602882385
0 references
0.7950657606124878
0 references
0.786691427230835
0 references
0.7832127213478088
0 references
