2

A Case Study of a Transportation Company Modeled as a Scheduling Problem
This case study tackles a real-world problem of a transportation company that is modeled as a scheduling optimization problem. The main …
Citar DOI URL
Determining good solutions and validating them with a metaheuristic approach in social network influence minimization problems
The evolution of social networks has given rise to significant challenges associated with the overwhelming amount of information …
Citar DOI URL
A multistart variable neighborhood descent metaheuristic for the board packing problem
The Board Packing Problem (BoPP) considers a rectangular board divided in cells with m rows and n columns. In this problem, a subset …
Citar DOI URL
Efficient heuristics for the obnoxious planar p-median problem with variable sizes
One of the most common problems in locating obnoxious facilities is the obnoxious p-median problem. This problem seeks to maximize the …
Citar DOI URL
A fast metaheuristic approach for the planar multiple obnoxious facility location problem
Abstract The multiple obnoxious facility location problem is one of the most studied problems in the literature of the obnoxious …
Citar DOI URL
Influence of the low-energy backscattering spectrum on the calibration of thin alpha-particle sources
The activity of thin alpha-particle sources with negligible self-absorption can be absolutely determined using 2π counting geometry …
Citar DOI
An efficient variable neighborhood search approach for the facility location problem with the limited choice rule
Abstract One of the most common problems in the expansion of a company consists of deciding the most appropriate locations for their …
Citar DOI URL
Multi-armed bandit for the cyclic minimum sitting arrangement problem
Graphs are commonly used to represent related elements and relationships among them. Signed graphs are a special type of graphs that …
Citar DOI
Tabu search: an application to the minimum dominating set problem
Tabu Search is a metaheuristic renowned for its ability to navigate complex solution spaces by iteratively exploring neighborhoods and …
Citar DOI URL
A novel parallel framework for scatter search
Scatter search (SS) is a well-established metaheuristic for hard combinatorial optimization problems. SS is characterized by its …
Citar DOI