A tactical time slot management problem under mixed logit demand

Le résumé fourni par la source

Abstract We study the tactical time slot management problem under mixed logit demand for attended home delivery in subscription settings. We propose a static mixed-integer linear programming model that integrates delivery slot assortment, price discount decisions, and routing optimization while capturing customer heterogeneity through the mixed logit model. To overcome the computational challenges posed by simulation-based choice probabilities, we develop a simulation-based Adaptive Large Neighborhood Search method aligned with a Sample Average Approximation reformulation. Computational experiments on large-scale instances demonstrate the effectiveness of our approach in capturing stochastic customer behavior and preference heterogeneity, providing a scalable and flexible method for optimizing time slot management under complex demand structures.

Ce résumé expose les affirmations des auteurs. BNTIC ne l’interprète pas comme une validation indépendante des résultats.