2021
DOI: 10.24996/10.24996/ijs.2021.62.5.34
|View full text |Cite
|
Sign up to set email alerts
|

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

Abstract: Metaheuristics is one of the most well-known field of researches uses to find optimum solution for Non-deterministic polynomial hard problems (NP-Hard), that are difficult to find an optimal solution in a polynomial time. Over time many algorithms have been developed based on the heuristics to solve difficult real-life problems, this paper will introduce Metaheuristic-based algorithms and its classifications, Non-deterministic polynomial hard problems. It also will compare the performance two metaheuristic-bas… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1
1

Citation Types

0
9
0
1

Year Published

2021
2021
2024
2024

Publication Types

Select...
6
3

Relationship

1
8

Authors

Journals

citations
Cited by 16 publications
(10 citation statements)
references
References 11 publications
0
9
0
1
Order By: Relevance
“…Numerous academic disciplines, including economics, computer science, engineering, and medicine, have difficulties that naturally requires optimization. Numerous researchers worldwide have focused on the creation of optimization algorithms [4]. The main objective of optimization algorithms, which are often referred to as search methods, is the construction of an ideal solution to an optimization problem such that the provided quantity is optimized subject to a potential set of constraints.…”
Section: Metaheuristicsmentioning
confidence: 99%
“…Numerous academic disciplines, including economics, computer science, engineering, and medicine, have difficulties that naturally requires optimization. Numerous researchers worldwide have focused on the creation of optimization algorithms [4]. The main objective of optimization algorithms, which are often referred to as search methods, is the construction of an ideal solution to an optimization problem such that the provided quantity is optimized subject to a potential set of constraints.…”
Section: Metaheuristicsmentioning
confidence: 99%
“…The pheromone trails will guide other ants to the food source. It has been shown by (Almufti, Marqas, Othman, & Sallow, 2021) that the indirect communication between the ants via pheromone trails known as stigmergy enables them to find the shortest paths between their nest and food sources. This is explained in an idealized setting in Figure 1.…”
Section: Ant Colony Optimization (Aco)mentioning
confidence: 99%
“…TSP is an NP-hard problem in combinatorial optimization (Almufti, Marqas, Othman, & Sallow, 2021). Given a set of cities in which every city must be visited once only and return to the starting city for completing a tour such that the length of the tour is the shortest among all possible tours (Blum, 2005).…”
Section: Traveling Salesman Problem (Tsp)mentioning
confidence: 99%
“…CSO ; Article no.AJRCOS.69197 systems are made up of a population of simple individual's agents interacting locally with each other and with the environment around themselves [1]. During the past years, various successful Swarm Intelligence appears that s of living beings in the nature, such as Ant Colony Optimization (ACO) that inspired by the behavior of Ant in ], Particle Swarm Optimization (PSO) algorithm concept roots from the social behavior of organisms such as fishing ], Bat Colony Optimization (BA) which inspired the bio-inspired sonar or echolocation ], Artificial Bee Colony (ABC) that is inspired from the intelligent, raging behavior of real honey bees in searching for food sources "nectar", and announcing other bees in the nest about the 2,13], Elephant Herding Optimization (EHO) inspired by herding behaviors of elephants in their clan [14,15,16]. According to P. Agarwal and S. Mehta in [17], S.…”
Section: Cat Swarm Optimizationmentioning
confidence: 99%