2

A practical methodology for reproducible experimentation: an application to the Double-row Facility Layout Problem
Reproducibility of experiments is a complex task in stochastic methods such as evolutionary algorithms or metaheuristics in general. …
Citar DOI
Efficient iterated greedy for the two-dimensional bandwidth minimization problem
Graph layout problems are a family of combinatorial optimization problems that consist of finding an embedding of the vertices of an …
Citar DOI
A MILP-based heuristic algorithm for transmission expansion planning problems
In the last years, a lot of effort was placed into approximated or relaxed models and heuristic and metaheuristic algorithms to solve …
Citar DOI
Accurate thermal prediction model for building-integrated photovoltaics systems using guided artificial intelligence algorithms
Citar DOI
Monitoring Volcanic and Tectonic Sandbox Analogue Models Using the Kinect v2 Sensor
Citar DOI
A variable neighborhood search approach for cyclic bandwidth sum problem
In this paper, we tackle the Cyclic Bandwidth Sum Problem, consisting in minimizing the sum of the bandwidth of the edges of an input …
Citar DOI
An efficient heuristic algorithm for software module clustering optimization
In the lifecycle of software projects, maintenance tasks usually entail 75% of the total costs, where most efforts are spent in …
Citar DOI
Out of the Niche: Using Direct Search Methods to Find Multiple Global Optima
Multimodal optimization deals with problems where multiple feasible global solutions coexist. Despite sharing a common objective …
Citar DOI
A general variable neighborhood search approach for the minimum load coloring problem
The minimum load coloring problem consists of finding a 2-coloring function that assign either a color red or blue to each node of a …
Citar DOI
Max-min dispersion with capacity and cost for a practical location problem
Diversity and dispersion problems deal with selecting a subset of elements from a given set in such a way that their diversity is …
Citar DOI