A double-loop hybrid algorithm for the traveling salesman problem with arbitrary neighbourhoods

•A collaboration-based double-loop hybrid algorithm is proposed.•Neighbourhoods are generalized to arbitrarily connected regions in Euclidean space.•A novel boundary-based encoding scheme for obtaining the solution is presented.•The proposed algorithm can obtain a high-quality path in a reasonable t...

Celý popis

Podrobná bibliografie

Vydáno v:	European journal of operational research Ročník 265; číslo 1; s. 65 - 80
Hlavní autoři:	Yang, Zhao, Xiao, Ming-Qing, Ge, Ya-Wei, Feng, De-Long, Zhang, Lei, Song, Hai-Fang, Tang, Xi-Lang
Médium:	Journal Article
Jazyk:	angličtina
Vydáno:	Elsevier B.V 16.02.2018
Témata:	Arbitrary neighbourhoods Boundary-based encoding scheme Close-enough Hybrid algorithm Traveling salesman problem Traveling salesman problem Arbitrary neighbourhoods Boundary-based encoding scheme Hybrid algorithm Close-enough
ISSN:	0377-2217, 1872-6860
On-line přístup:	Získat plný text
Tagy:	Přidat tag Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!