A tactical time slot management problem under mixed logit demand
研究了订阅式上门配送中，考虑客户偏好异质性的时间槽管理问题，提出结合混合Logit模型的整数规划与自适应大邻域搜索算法，实现大规模实例的高效求解。
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.