多仓库环星问题:一个多面体研究和精确算法
Multiple Depot Ring Star Problem: A polyhedral study and exact algorithm
AI总结:
本文研究了多仓库环星问题,提出了一种混合整数线性规划模型,并通过有效的不等式加强线性规划松弛,进而开发了分支定界算法以求解该问题,通过大量计算实验评估了算法性能。
摘要:
多仓库环星问题(MDRSP)是一个重要的组合优化问题,出现在光纤网络设计和使用固定传感设备和自主车辆收集数据的应用中。给定客户和仓库的位置,目标是(i)找到一组简单循环,使得每个循环(环)经过一部分客户和恰好一个仓库;(ii)将未访问的客户分配给已访问的客户或仓库;(iii)最小化路由成本之和,即循环成本和分配成本之和。本文为MDRSP提出了一种混合整数线性规划模型,并提出了有效的不等式以加强线性规划松弛。此外,本文还进行了多面体分析,并推导了MDRSP的面诱导结果。所有这些结果随后用于开发分支定界算法以获得MDRSP的最优解。通过在多个测试实例上的广泛计算实验评估了分支定界算法的性能。
英文摘要:
The Multiple Depot Ring-Star Problem (MDRSP) is an important combinatorial optimization problem that arises in the context of optical fiber network design, and in applications pertaining to collecting data using stationary sensing devices and autonomous vehicles. Given the locations of a set of customers and a set of depots, the goal is to (i) find a set of simple cycles such that each cycle (ring) passes through a subset of customers and exactly one depot, (ii) assign each non-visited customer to a visited customer or a depot, and (iii) minimize the sum of the routing costs, i.e., the cost of the cycles and the assignment costs. We present a mixed integer linear programming formulation for the MDRSP and propose valid inequalities to strengthen the linear programming relaxation. Furthermore, we present a polyhedral analysis and derive facet-inducing results for the MDRSP. All these results are then used to develop a branch-and-cut algorithm to obtain optimal solutions to the MDRSP. The performance of the branch-and-cut algorithm is evaluated through extensive computational experiments on several classes of test instances.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。