A Hybrid Learning–Optimization Framework for the Booking Stays Problem at Summer Resorts via Supervised Variable Fixing

This paper studies the Booking Stays Assignment Problem (BSAP), a large-scale problem in which the Mohammedia Foundation for Social Works of Judges allocates a limited pool of vacation residences among thousands of competing members under priority, quota, preference, and consecutiveness constraints. Our aim is to make the exact solution of this problem both tractable and transparent: we analyze its computational difficulty, accelerate its exact solution, and turn its outcome into an interpretable forecast of each applicant’s chances. Methodologically, we first show that, without its consecutiveness constraints, the BSAP reduces to an efficiently solvable assignment core, so that its difficulty originates in those constraints, and we bound—under an explicit enumeration scheme—the super-exponential overhead they induce. We then recast variable fixing as a supervised binary classification problem over the decision variables: four candidate models (logistic regression, random forest, gradient boosting, and a neural network) are trained on eight seasons of real institutional records (2018–2025), and a confidence threshold pre-fixes the most certain variables while an exact MILP solver resolves the rest. Models are compared on a chronological, out-of-season test (training on 2018–2022, testing on the unseen 2025 season) using dedicated selection measures and proper calibration scores. The main findings confirm a decoupling between the two roles: logistic regression fixes the most variables at zero optimality gap and thus best accelerates the solver, whereas the random forest is the best-calibrated estimator (lowest Brier score and log-loss) and is adopted for the applicant-facing probability. Notably, the neural network, despite its high capacity, is the least well calibrated at the individual level. The resulting framework is transparent, preserves the institution’s priority rules, and provides real-time decision support to both applicants and administrators.

Authors

Institutions

Publication Details

Journal
Tourism and Hospitality
Published
2026-10-14
DOI
https://doi.org/10.3390/tourhosp7100341
Primary Topic
Optimization and Mathematical Programming
Type
article
Field-Weighted Citation Impact
0.00
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

A Hybrid Learning–Optimization Framework for the Booking Stays Problem at Summer Resorts via Supervised Variable Fixing

Soufyane Majdoub, Chakir Loqman
Tourism and Hospitality
Optimization and Mathematical Programming
article

A Hybrid Learning–Optimization Framework for the Booking Stays Problem at Summer Resorts via Supervised Variable Fixing

Soufyane Majdoub, Chakir Loqman
article en

Abstract

This paper studies the Booking Stays Assignment Problem (BSAP), a large-scale problem in which the Mohammedia Foundation for Social Works of Judges allocates a limited pool of vacation residences among thousands of competing members under priority, quota, preference, and consecutiveness constraints. Our aim is to make the exact solution of this problem both tractable and transparent: we analyze its computational difficulty, accelerate its exact solution, and turn its outcome into an interpretable forecast of each applicant’s chances. Methodologically, we first show that, without its consecutiveness constraints, the BSAP reduces to an efficiently solvable assignment core, so that its difficulty originates in those constraints, and we bound—under an explicit enumeration scheme—the super-exponential overhead they induce. We then recast variable fixing as a supervised binary classification problem over the decision variables: four candidate models (logistic regression, random forest, gradient boosting, and a neural network) are trained on eight seasons of real institutional records (2018–2025), and a confidence threshold pre-fixes the most certain variables while an exact MILP solver resolves the rest. Models are compared on a chronological, out-of-season test (training on 2018–2022, testing on the unseen 2025 season) using dedicated selection measures and proper calibration scores. The main findings confirm a decoupling between the two roles: logistic regression fixes the most variables at zero optimality gap and thus best accelerates the solver, whereas the random forest is the best-calibrated estimator (lowest Brier score and log-loss) and is adopted for the applicant-facing probability. Notably, the neural network, despite its high capacity, is the least well calibrated at the individual level. The resulting framework is transparent, preserves the institution’s priority rules, and provides real-time decision support to both applicants and administrators.

Tourism and HospitalityVol. 7(10)
Sidi Mohamed Ben Abdellah University (MA)
Openalex Percentile: Top 17%
Optimization and Mathematical Programming
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.