随机团队定向问题

中文摘要 AI 辅助

本文分析了随机团队定向问题（STOP），它是团队定向问题（TOP）的随机变体。在STOP中，旅行时间由随机变量表示，目标是确定一组路线以最大化预期收集的利润。我们将该问题建模为两阶段随机整数规划，并提出一种基于整数L型方法的精确求解方法。我们还考虑了一组非线性机会约束，以将搜索限制在高可靠性路线上。在第一阶段，选择一组路线；在第二阶段， recourse（ recourse 指补救措施）评估所选路线的预期利润。我们提出了一组新的最优性割，并通过考虑有效不等式和约束提升来强化模型。计算结果使用文献中的标准TOP基准数据集对该算法进行了全面分析。

英文摘要

This paper analyses the Stochastic Team Orienteering Problem (STOP), a stochastic variant of the Team Orienteering Problem (TOP). In the STOP, travel times are represented by random variables. The objective is to determine a set of routes that maximises the expected collected profit. We model the problem as a two-stage stochastic integer program and propose an exact solution method based on the Integer L-shaped method. We also consider a set of non-linear chance constraints to restrict the search to highly reliable routes. In the first-stage, a set of routes is selected, while in the second-stage the recourse evaluates the expected profit of the selected routes. We present a new set of optimality cuts and strengthen the formulation by considering valid inequalities and constraints liftings. Computational results provide a comprehensive analysis of the algorithm using the standard TOP benchmark dataset from the literature.

发表机构

• University of Turin（都灵大学）
• Université Laval（拉瓦尔大学）

机构由 AI 辅助整理，请以论文原文为准。