Name
Abstract | ||
|---|---|---|
In industry, the concept of complex systems is becoming relevant due to the diverse applications in operations research. Many of these complex problems are NP-hard and it is difficult to approach them with complete optimization techniques. The use of metaheuristics has had good results and in particular, the design of binary algorithms based on continuous metaheuristics of swarm intelligence. In this article, we apply the binarization mechanism based on the percentile concept. We apply the percentile concept to the sine-cosine algorithm (SCOA) in order to solve the multidimensional backpack problem (MKP). The experiments are designed to demonstrate the usefulness of the percentile concept in binarization. In addition, we verify the efficiency of our algorithm through reference instances. The results indicate that the binary Percentile Sine-Cosine Optimization Algorithm (BPSCOA) obtains adequate results when evaluated with a combinatorial problem such as the MKP. |
Year | DOI | Venue |
|---|---|---|
2019 | 10.1007/978-3-030-19810-7_13 | ARTIFICIAL INTELLIGENCE METHODS IN INTELLIGENT ALGORITHMS |
Keywords | DocType | Volume |
Combinatorial optimization,KnapSack,Metaheuristics,Percentile | Conference | 985 |
ISSN | Citations | PageRank |
2194-5357 | 0 | 0.34 |
References | Authors | |
0 | 4 | |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Hernan Pinto | 1 | 0 | 1.01 |
| Alvaro Peña | 2 | 0 | 0.68 |
| Matías Valenzuela | 3 | 0 | 1.01 |
| Andrés Fernández | 4 | 0 | 0.68 |