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

Celý popis

Uloženo v:

Podrobná bibliografie
Vydáno v:	Knowledge-based systems Ročník 227; s. 107199
Hlavní autoři:	Kanna, S.K. Rajesh, Sivakumar, K., Lingaraj, N.
Médium:	Journal Article
Jazyk:	angličtina
Vydáno:	Amsterdam Elsevier B.V 05.09.2021 Elsevier Science Ltd
Témata:	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
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!

Buďte první, kdo okomentuje tento záznam!