A Track-Based Conference Scheduling Problem

Vista sencilla de ítem
dc.contributor.authorRiquelme, Fabian
dc.contributor.authorMontero, Elizabeth
dc.contributor.authorPérez Cáceres, Leslie
dc.contributor.authorRojas Morales, Nicolás
dc.date.accessioned2023-06-02T19:22:19Z
dc.date.available2023-06-02T19:22:19Z
dc.date.issued2022-11
dc.descriptionIndexación: Scopus.es
dc.description.abstractThe scheduling of conferences is a challenging task that aims at creating successful conference programs that fulfill an often wide variety of requirements. In this work, we focus on the problem of generating conference programs that organize talks into tracks: subevents within the conference that are group-related talks. The main contributions of this work can be organized into three scopes: literature review, problem formulation and benchmarking, and heuristic approach. We provide a literature review of conference scheduling approaches that organizes these approaches within a timetabling problem taxonomy. We also describe the main characteristics of the conference scheduling approaches in the literature and propose a classification scheme for such works. To study the scheduling of conferences that include tracks, we introduce the definition of the track-based conference scheduling problem, a new problem that incorporates tracks in the conference program. We provide a binary integer linear programming model formulation for this problem. Our formulation considers the availability of presenters, chairs, and organizers, the avoidance of parallel tracks, and best paper sessions, among other classical constraints of conference scheduling problems. Additionally, based on our formulation, we propose a simple instance-generation procedure that we apply to generate a set of artificial instances. We complete our work by proposing a heuristic method based on the simulated annealing metaheuristic for solving the track-based conference scheduling problem. We compare the results obtained by our heuristic approach and the Gurobi solver regarding execution time and solution quality. The results show that the proposed heuristic method is a practical approach for tackling the problem as it obtains solutions in a fraction of the time required by Gurobi, while Gurobi is also unable to obtain an optimal solution in the defined time for a subset of the instances. Finally, from a general perspective, this work provides a new conference scheduling problem formulation that can be extended in the future to include other features common in conference programs. Moreover, thanks to the instance generation procedure, this formulation can be used as a benchmark for designing and comparing new solving approaches. © 2022 by the authors.es
dc.description.urihttps://www.mdpi.com/2227-7390/10/21/3976
dc.identifier.citationMathematics, Volume 10, Issue 21, November 2022, Article number 3976es
dc.identifier.doi10.3390/math10213976
dc.identifier.issn2227-7390
dc.identifier.urihttps://repositorio.unab.cl/xmlui/handle/ria/50297
dc.language.isoenes
dc.publisherMDPIes
dc.rights.licenseAtribución 4.0 Internacional (CC BY 4.0)
dc.rights.urihttps://creativecommons.org/licenses/by/4.0/deed.es
dc.subjectConference schedulinges
dc.subjectInteger linear programming modeles
dc.subjectSimulated annealinges
dc.subjectTrack-based conference schedulinges
dc.titleA Track-Based Conference Scheduling Problemes
dc.typeArtículoes
Archivos
Bloque original
Mostrando 1 - 1 de 1
Miniatura
Nombre:
Riquelme_A_track_based_conference_scheduling.pdf
Tamaño:
440.61 KB
Formato:
Adobe Portable Document Format
Descripción:
TEXTO COMPLETO EN INGLES
Descargar
Bloque de licencias
Mostrando 1 - 1 de 1
No hay miniatura disponible
Nombre:
license.txt
Tamaño:
1.71 KB
Formato:
Item-specific license agreed upon to submission
Descripción:
Descargar
Colecciones
FIng - Artículos de Revista