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

Full description

Saved in:

Bibliographic Details
Published in:	Knowledge-based systems Vol. 227; p. 107199
Main Authors:	Kanna, S.K. Rajesh, Sivakumar, K., Lingaraj, N.
Format:	Journal Article
Language:	English
Published:	Amsterdam Elsevier B.V 05.09.2021 Elsevier Science Ltd
Subjects:	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 Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!

Be the first to leave a comment!