2

An iterated greedy algorithm for finding the minimum dominating set in graphs
A dominating set in a graph is a set of vertices such that every vertex outside the set is adjacent to a vertex in the set. The …
Cite DOI URL
Order Batching Problems: taxonomy and literature review
Order Batching is a family of optimization problems related to the process of picking items in a warehouse as part of supply chain …
Cite DOI URL
Variable neighborhood search approach with intensified shake for monitor placement
Several problems are emerging in the context of communication networks and most of them must be solved in reduced computing time since …
Cite DOI
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. …
Cite 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 …
Cite 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 …
Cite DOI
Accurate thermal prediction model for building-integrated photovoltaics systems using guided artificial intelligence algorithms
Cite DOI
Monitoring Volcanic and Tectonic Sandbox Analogue Models Using the Kinect v2 Sensor
Cite 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 …
Cite 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 …
Cite DOI