Cargando…
Enhancing Hyperheuristics for the Knapsack Problem through Fuzzy Logic
Hyperheuristics rise as powerful techniques that get good results in less computational time than exact methods like dynamic programming or branch and bound. These exact methods promise the global best solution, but with a high computational time. In this matter, hyperheuristics do not promise the g...
Autores principales: | Olivas, Frumen, Amaya, Ivan, Ortiz-Bayliss, José Carlos, Conant-Pablos, Santiago E., Terashima-Marín, Hugo |
---|---|
Formato: | Online Artículo Texto |
Lenguaje: | English |
Publicado: |
Hindawi
2021
|
Materias: | |
Acceso en línea: | https://www.ncbi.nlm.nih.gov/pmc/articles/PMC7850842/ https://www.ncbi.nlm.nih.gov/pubmed/33564300 http://dx.doi.org/10.1155/2021/8834324 |
Ejemplares similares
-
Exploring the Impact of Early Decisions in Variable Ordering for Constraint Satisfaction Problems
por: Ortiz-Bayliss, José Carlos, et al.
Publicado: (2018) -
Experimental Matching of Instances to Heuristics for Constraint Satisfaction Problems
por: Moreno-Scott, Jorge Humberto, et al.
Publicado: (2016) -
Dynamic parameter adaptation for meta-heuristic optimization algorithms through type-2 fuzzy logic
por: Olivas, Frumen, et al.
Publicado: (2018) -
Knapsack problems
por: Kellerer, Hans, et al.
Publicado: (2004) -
Correction to: The Knapsack Problem with Forfeits
por: Cerulli, Raffaele, et al.
Publicado: (2020)