arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 2407.18532math.OCcs.AI
收藏

混合Logit模型下受限品类优化的外逼近与超模割

Outer Approximation and Super-modular Cuts for Constrained Assortment Optimization under Mixed-Logit Model

School of Computing and Information Systems, Singapore Management University(新加坡管理大学计算与信息系统学院)

Hoang Giang Pham, Tien Mai

AI总结:

本文研究混合Logit模型下的品类优化问题,通过推导基于单调超模和凸组件的有效割并结合割平面或分支割平面方法精确求解,在求解质量和计算时间上均优于现有方法。

摘要:

本文研究混合Logit顾客选择模型下的品类优化问题。尽管几十年来品类优化一直是收益管理的重要课题,但混合Logit模型被认为是建模和预测顾客购买行为最通用和灵活的方法之一。现有的精确方法主要依赖混合整数线性规划(MILP)或二阶锥(CONIC)重构,从而可使用现成求解器精确求解。然而,这些方法通常存在连续松弛弱的问题,且在求解大规模实例时速度较慢。我们的工作通过关注目标函数中可证明为单调超模和凸的组件来解决该问题。这使我们能够推导出有效割来外逼近非线性目标函数。随后,我们证明这些有效割可以结合到割平面或分支割平面方法中以精确求解该问题。大量实验表明,我们的方法在求解质量和计算时间上均持续优于先前的方法。

英文摘要:

In this paper, we study the assortment optimization problem under the mixed-logit customer choice model. While assortment optimization has been a major topic in revenue management for decades, the mixed-logit model is considered one of the most general and flexible approaches for modeling and predicting customer purchasing behavior. Existing exact methods have primarily relied on mixed-integer linear programming (MILP) or second-order cone (CONIC) reformulations, which allow for exact problem solving using off-the-shelf solvers. However, these approaches often suffer from weak continuous relaxations and are slow when solving large instances. Our work addresses the problem by focusing on components of the objective function that can be proven to be monotonically super-modular and convex. This allows us to derive valid cuts to outer-approximate the nonlinear objective functions. We then demonstrate that these valid cuts can be incorporated into Cutting Plane or Branch-and-Cut methods to solve the problem exactly. Extensive experiments show that our approaches consistently outperform previous methods in terms of both solution quality and computation time.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑