Bridging Reinforcement Learning and Planning to Solve Combinatorial Optimization Problems with Nested Sub-Tasks
Combinatorial Optimization (CO) problems have been intensively studied for decades with a wide range of applications. For some classic CO problems, e.g., the Traveling Salesman Problem (TSP), both traditional planning algorithms and the emerging reinforcement learning have made solid progress in rec...
Main Authors: | Xiaohan Shan, Pengjiu Wang, Mingda Wan, Dong Yan, Jialian Li, Jun Zhu |
---|---|
Format: | Article |
Language: | English |
Published: |
Tsinghua University Press
2023-12-01
|
Series: | CAAI Artificial Intelligence Research |
Subjects: | |
Online Access: | https://www.sciopen.com/article/10.26599/AIR.2023.9150025 |
Similar Items
-
Evaluating Typical Algorithms of Combinatorial Optimization to Solve Continuous-Time Based Scheduling Problem
by: Alexander A. Lazarev, et al.
Published: (2018-04-01) -
A review on learning to solve combinatorial optimisation problems in manufacturing
by: Cong Zhang, et al.
Published: (2023-03-01) -
Solving Flexible Job-Shop Scheduling Problem with Heterogeneous Graph Neural Network Based on Relation and Deep Reinforcement Learning
by: Hengliang Tang, et al.
Published: (2024-08-01) -
A Systematic Review of Hyper-Heuristics on Combinatorial Optimization Problems
by: Melissa Sanchez, et al.
Published: (2020-01-01) -
Residual Scheduling: A New Reinforcement Learning Approach to Solving Job Shop Scheduling Problem
by: Kuo-Hao Ho, et al.
Published: (2024-01-01)