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.
A Deep Reinforcement Learning Approach for Solving the Traveling Salesman Problem with Drone
Suleyman Demirel University(苏莱曼·德米雷尔大学);UNIST(蔚山科学技术院);Korea University(高丽大学);Amazon(亚马逊);University of South Florida(南佛罗里达大学)
强化学习最近在许多组合最优化问题的学习质量解决方案中显示出了希望。特别是,基于注意力的编码器-解码器模型在各种路由问题上表现出很高的效率,包括流动推销员问题(TSP)。不幸的是,它们在TSP with Drone(TSP-D)中表现不佳,需要协调不同的车辆-卡车和无人机。在TSP-D中,两辆车一前一后地移动,并且可能需要在节点处等待另一辆车加入。基于注意力的无状态解码器无法在车辆之间进行这种协调。我们提出了一个混合模型,它使用注意编码器和长短期记忆(LSTM)网络解码器,其中解码器的隐藏状态可以表示所做的动作序列。我们的经验表明,这样的混合模型提高了一个纯粹的基于注意力的模型的解决方案的质量和计算效率。最小-最大容量限制车辆路径问题(mmCVRP)的实验结果也表明,混合模型比基于注意力的模型更适合于多车辆的协调路径问题。所提出的模型展示了与运筹学基线方法相当的结果。