Single-based and Population-Based Metaheuristics Algorithms Performances in Solving NP-hard Problems

Metaheuristics is one of the most well-known field researches uses to find optimum solution for Non-deterministic polynomial hard problems (NP-Hard), that are difficult an optimal in a time. Over time many algorithms have been developed based on heuristics solve real-life problems, this paper will introduce Metaheuristic-based and its classifications, problems. It also compare performance two metaheuristic-based (Elephant Herding optimization algorithm Tabu Search) Traveling Salesman Problem (TSP), which known problem belongs widely used evaluations different metaheuristics-based algorithms. experimental results EHO TS solving 10 from TSPLIB95.