Name
Abstract | ||
|---|---|---|
Optimization problems can be found in several real application domains such as engineering, medicine, mathematics, mechanics, physics, mining, games, design, and biology, among others. There exist several techniques to the efficient solving of these problems, which can be organized in two groups: exact and approximate methods. Metaheuristics are one of the most famous and widely used approximate methods for solving optimization problems. Most of them are known for being inspired on interesting behaviors that can be found on the nature, such as the way in which ants, bees and fishes found food, or the way in which fireflies and bats move on the environment. However, solving optimization problems via metaheuristics is not always a simple trip. In this paper, we analyze and discuss from an usability standpoint how the effort needed to design and implement efficient and robust metaheuristics can be conveniently managed and reduced. |
Year | DOI | Venue |
|---|---|---|
2015 | 10.1007/978-3-319-21380-4_101 | Communications in Computer and Information Science |
Keywords | Field | DocType |
Optimization problems,Metaheuristics,Local solution,Optimal solution | Computer science,Usability,Artificial intelligence,Optimization problem,Metaheuristic | Conference |
Volume | ISSN | Citations |
528 | 1865-0929 | 0 |
PageRank | References | Authors |
0.34 | 6 | 7 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Ricardo Soto | 1 | 194 | 47.59 |
| Broderick Crawford | 2 | 446 | 73.74 |
| Rodrigo Olivares | 3 | 45 | 9.07 |
| Cristian Galleguillos | 4 | 30 | 5.96 |
| Kathleen Crawford | 5 | 0 | 1.69 |
| Franklin Johnson | 6 | 23 | 2.67 |
| Fernando Paredes | 7 | 230 | 27.21 |