Development of Deer Hunting linked Earthworm Optimization Algorithm for solving large scale Traveling Salesman Problem

Traveling Salesman Problem (TSP) has been seen in diverse applications, which is proven to be NP-complete in most cases. Even though there are multiple heuristic techniques, the problem is still a complex combinatorial optimization problem. The candidate solutions are chosen by considering only a se...

Ausführliche Beschreibung

Gespeichert in:

Bibliographische Detailangaben
Veröffentlicht in:	Knowledge-based systems Jg. 227; S. 107199
Hauptverfasser:	Kanna, S.K. Rajesh, Sivakumar, K., Lingaraj, N.
Format:	Journal Article
Sprache:	Englisch
Veröffentlicht:	Amsterdam Elsevier B.V 05.09.2021 Elsevier Science Ltd
Schlagworte:	Algorithms Candidates Combinatorial analysis Complexity Convergence Deer Earthworm-based Deer Hunting Optimization Algorithm Heuristic Heuristic methods Hunting Hybridization Meta-heuristic algorithm Minimized Traveling Distance Optimization Optimization algorithms Traveling Salesman Problem Worms Meta-heuristic algorithm Minimized Traveling Distance Hybridization Traveling Salesman Problem Earthworm-based Deer Hunting Optimization Algorithm
ISSN:	0950-7051, 1872-7409
Online-Zugang:	Volltext
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!

Schreiben Sie den ersten Kommentar!