2

A sim-learnheuristic algorithm for the stochastic and context-aware team orienteering problem
This paper addresses the Team Orienteering Problem (TOP) with stochastic, context-aware travel times. Traditionally, simheuristics have …
Cite DOI
Exact and metaheuristic approaches for a real-world discrete lot-sizing and scheduling problem in the automotive industry
We address a production scheduling problem arising in the seat manufacturing auto industry, characterised by multiple racetracks and a …
Cite DOI
Optimizing the two-dimensional bandwidth problem under the maximum norm using exact and heuristic approaches
This paper addresses the Two-dimensional Bandwidth Minimization Problem (2D-BMP) using the L∞-norm distance, focusing on embedding a …
Cite DOI
Scatter search: foundations and implementations
Cite DOI URL
A scalable GRASP algorithm for the targeted misinformation blocking problem
The research on Social Network Analysis has exponentially grown in the last decades due to the relevance of social networks in the …
Cite DOI
Double Roman Domination Problem: An iterated local search approach
In the last few decades, graph domination problems have attracted the attention of both academics and practitioners. In these problems, …
Cite DOI
Heurísticas contra el caos aéreo: un caso real de resolución de incidencias operativas en una aerolínea
El sector de la aviación se enfrenta a importantes retos diarios derivados de incidencias en su operativa, tales como retrasos, …
Cite
Mathematical formulation and heuristic methods for the Min--Max Sitting Arrangement Problem in the Cycle
The Cyclic Min–Max Sitting Arrangement (CMMSA) is an NP-hard problem which seeks to embed the vertices of a signed input graph, …
Cite DOI URL
Metaheuristic algorithms for the induced p-median problem with upgrades
Facility location problems (FLPs) are a family of optimisation problems with significant social impact. This class of problems has been …
Cite DOI
Scheduling Long-Distance Transport Operations under Labor Regulations: A Hybrid Optimization Approach
This work solves a case study of a transportation company that aims to plan the maximum number of jobs requested by customers that must …
Cite DOI