arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 2312.01404math.OC
收藏

一种求解时空依赖旅行商问题的精确框架

An Exact Framework for Solving the Space-Time Dependent TSP

Isaac Rudich, Quentin Cappart, Manuel López-Ibáñez, Michael Römer, Louis-Martin Rousseau

AI总结:

针对时空依赖型旅行商问题这类双层优化问题计算成本高的难题,提出结合决策图与Peel-and-Bound分支定界技术的精确求解框架,经ARP基准测试验证具备可扩展性,能生成可靠启发式解且多为精确解。

摘要:

许多现实场景需要求解双层优化问题,这类问题包含一个外层离散优化问题,以及一个涉及高成本计算或黑盒计算的内层问题。这种情况出现在时空依赖型旅行商问题的变体中,例如规划访问多个天体的太空任务时。由于涉及的天体持续存在相对运动,规划这类任务面临巨大挑战。其中存在一个外层组合问题,即找出访问天体的最优顺序;还有一个内层优化问题,需要确定每对天体之间旅行的最优出发时间和轨迹。天体的持续运动使内层问题变得复杂,导致其计算成本高昂。本文提出了一种利用决策图(DDs)和基于决策图的分支定界技术Peel-and-Bound的新型框架,只要内层问题优化器的质量足够,就能为这类双层优化问题求得精确解。该框架利用特定问题的知识来加快搜索过程,并将所需的高成本评估次数降至最低。作为案例研究,我们将该框架应用于小行星路径规划问题(ARP)——这是全局轨迹优化中的一个基准问题。实验结果证明了该框架的可扩展性,以及其为ARP算例生成可靠启发式解的能力。其中许多解都是精确的,这取决于内层问题优化器的假定质量。

英文摘要:

Many real-world scenarios involve solving bi-level optimization problems in which there is an outer discrete optimization problem, and an inner problem involving expensive or black-box computation. This arises in space-time dependent variants of the Traveling Salesman Problem, such as when planning space missions that visit multiple astronomical objects. Planning these missions presents significant challenges due to the constant relative motion of the objects involved. There is an outer combinatorial problem of finding the optimal order to visit the objects and an inner optimization problem that requires finding the optimal departure time and trajectory to travel between each pair of objects. The constant motion of the objects complicates the inner problem, making it computationally expensive. This paper introduces a novel framework utilizing decision diagrams (DDs) and a DD-based branch-and-bound technique, Peel-and-Bound, to achieve exact solutions for such bi-level optimization problems, assuming sufficient inner problem optimizer quality. The framework leverages problem-specific knowledge to expedite search processes and minimize the number of expensive evaluations required. As a case study, we apply this framework to the Asteroid Routing Problem (ARP), a benchmark problem in global trajectory optimization. Experimental results demonstrate the framework's scalability and ability to generate robust heuristic solutions for ARP instances. Many of these solutions are exact, contingent on the assumed quality of the inner problem's optimizer.

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

↑