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...

Ausführliche Beschreibung

Bibliographische Detailangaben

Veröffentlicht in:	European journal of operational research Jg. 265; H. 1; S. 65 - 80
Hauptverfasser:	Yang, Zhao, Xiao, Ming-Qing, Ge, Ya-Wei, Feng, De-Long, Zhang, Lei, Song, Hai-Fang, Tang, Xi-Lang
Format:	Journal Article
Sprache:	Englisch
Veröffentlicht:	Elsevier B.V 16.02.2018
Schlagworte:	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
Online-Zugang:	Volltext
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!