Scheduling the Brazilian OR conference.
No Thumbnail Available
Date
2022
Journal Title
Journal ISSN
Volume Title
Publisher
Abstract
In this paper, we propose an efficient matheuristic approach for solving the problem of
scheduling the Brazilian OR conference. The event has traditionally around 300 presentations
across a period of 3 to 4 days, and building a schedule for the technical sessions is an ardu-
ous task. The developed algorithm integrates the concepts of iterated local search and simulated annealing with two mathematical programming-based procedures. The idea is to
group the presentations via a clustering procedure, and handle the side constraints in a subproblem via an integer programming formulation. A set partitioning procedure is applied at
the end of the algorithm to find the optimal combination of clusters found during the
search. We first assess the performance of the method by comparing our results with those
attained by other algorithms from the literature on two existing sets of artificial instances
derived from two other conferences. Next, we executed our approach on real-life instances
derived from different SBPO editions, and compared the solutions with the manual solutions,
when available, or with upper bounds (we solve a maximisation problem) found by an exact
algorithm from the literature. The results obtained show that the matheuristic is capable of
achieving high quality solutions both on the artificial and real-life instances.
Description
Keywords
Combinatorial optimisation, Metaheuristics, Practice of OR, Decision support systems
Citation
CORREIA, R. et al. Scheduling the Brazilian OR conference. Journal of the Operational Research Society, v. 73, n. 7, p. 1487-1498, 2022. Disponível em: <https://www.tandfonline.com/doi/full/10.1080/01605682.2021.1915194>. Acesso em: 06 jul. 2023.