Combinatorial Optimization Problems and Metaheuristics: Review, Challenges, Design, and Development
In the past few decades, metaheuristics have demonstrated their suitability in addressing complex problems over different domains. This success drives the scientific community towards the definition of new and better-performing heuristics and results in an increased interest in this research field....
Main Authors: | Fernando Peres, Mauro Castelli |
---|---|
Format: | Article |
Language: | English |
Published: |
MDPI AG
2021-07-01
|
Series: | Applied Sciences |
Subjects: | |
Online Access: | https://www.mdpi.com/2076-3417/11/14/6449 |
Similar Items
-
A review of simheuristics: Extending metaheuristics to deal with stochastic combinatorial optimization problems
by: Angel A. Juan, et al.
Published: (2015-12-01) -
A Novel Approach to Combinatorial Problems: Binary Growth Optimizer Algorithm
by: Dante Leiva, et al.
Published: (2024-05-01) -
Recent trends in metaheuristics for stochastic combinatorial optimization
by: Gutjahr Walter
Published: (2011-03-01) -
Nature-Inspired Metaheuristic Techniques for Combinatorial Optimization Problems: Overview and Recent Advances
by: Md Ashikur Rahman, et al.
Published: (2021-10-01) -
Embedded Learning Approaches in the Whale Optimizer to Solve Coverage Combinatorial Problems
by: Marcelo Becerra-Rozas, et al.
Published: (2022-11-01)