arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~
arXiv 2409.12436math.OC
收藏

基于随机选择的离散规划的近似求解

Approximate Resolution of Stochastic Choice-based Discrete Planning

Jiajie Zhang, Yun Hui Lin, Gerardo Berbeglia

AI总结:

本文提出一个通用建模框架和混合整数线性规划方法,结合分解算法,用于求解随机选择下的离散规划问题,并在约束品类优化和设施选址中证明(近)最优性,且改进了指数选择模型下的现有技术。

摘要:

基于随机选择的离散规划是一类广泛的决策问题,其特点是涉及规划者和一组顾客的序贯决策过程。企业或规划者首先决定向顾客提供哪些选项的子集,而顾客则根据这些选项的效用进行选择。该问题在诸多领域有广泛应用,包括品类规划、产品线设计和设施选址。这些问题的一个关键特征是,企业无法完全观察顾客的效用或偏好,这导致了内在的和特有的不确定性。文献中的大多数工作研究了特定类型的不确定性,从而产生了定制化的决策模型,随后使用为利用特定模型结构而设计的专用算法进行处理。\n在本文中,我们提出了一个建模框架,能够解决这一系列序贯问题,适用于多种不确定性。然后,我们利用一种近似方案,开发了一种自适应的混合整数线性规划方法。为了加速求解过程,我们进一步开发了一种高效的分解方法。我们证明了我们的求解框架能够为广泛的问题类别提供被证明(接近)最优的解。我们通过将我们的方法应用于三个经典应用问题来说明这一点:约束品类优化和两个设施选址问题。通过大量的计算实验,我们展示了我们的方法在解质量和计算速度方面的性能,并提供了计算见解。特别是,当我们使用我们的方法在指数选择模型下求解约束品类优化问题时,它改进了现有技术水平。

英文摘要:

Stochastic choice-based discrete planning is a broad class of decision-making problems characterized by a sequential decision-making process involving a planner and a group of customers. The firm or planner first decides a subset of options to offer to the customers, who, in turn, make selections based on their utilities of those options. This problem has extensive applications in many areas, including assortment planning, product line design, and facility location. A key feature of these problems is that the firm cannot fully observe the customers' utilities or preferences, which results in intrinsic and idiosyncratic uncertainties. Most works in the literature have studied a specific type of uncertainty, resulting in customized decision models that are subsequently tackled using ad-hoc algorithms designed to exploit the specific model structure. In this paper we propose a modeling framework capable of solving this family of sequential problems that works for a large variety of uncertainties. We then leverage an approximation scheme and develop an adaptable mixed-integer linear programming method. To speed up the solution process, we further develop an efficient decomposition approach. We show that our solution framework can yield solutions proven to be (near-)optimal for a broad class of problems. We illustrate this by applying our approach to three classical application problems: constrained assortment optimization and two facility location problems. Through extensive computational experiments, we demonstrate the performance of our approach in terms of both solution quality and computational speed, and provide computational insights. In particular, when we use our method to solve the constrained assortment optimization problem under the Exponomial choice model, it improves the state-of-the-art.

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

↑