arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 2205.01356cs.AIcs.DM
收藏

神经组合优化:一个新的领域

Neural Combinatorial Optimization: a New Player in the Field

Andoni I. Garmendia, Josu Ceberio, Alexander Mendiburu

摘要:

神经组合优化试图学习好的算法,以使用神经网络模型和强化学习来解决一系列问题。最近,它的良好性能鼓励了许多从业者开发用于各种组合问题的神经架构。然而,这种算法在传统的优化框架中的结合,提出了许多问题,其性能和实验比较与其他方法,如精确的算法,算法和metallogistics。本文提出了一个批判性的分析,将基于神经网络的算法纳入经典的组合优化框架。随后,进行了全面的研究,分析这些算法的基本方面,包括性能,可移植性,计算成本和推广到更大规模的实例。为此,我们选择线性排序问题作为研究的案例,一个NP难的问题,并开发了一个神经组合优化模型来优化它。最后,我们讨论了如何分析方面适用于一般的学习框架,并建议在该领域的神经组合优化算法的未来工作的新方向。

英文摘要:

Neural Combinatorial Optimization attempts to learn good heuristics for solving a set of problems using Neural Network models and Reinforcement Learning. Recently, its good performance has encouraged many practitioners to develop neural architectures for a wide variety of combinatorial problems. However, the incorporation of such algorithms in the conventional optimization framework has raised many questions related to their performance and the experimental comparison with other methods such as exact algorithms, heuristics and metaheuristics. This paper presents a critical analysis on the incorporation of algorithms based on neural networks into the classical combinatorial optimization framework. Subsequently, a comprehensive study is carried out to analyse the fundamental aspects of such algorithms, including performance, transferability, computational cost and generalization to larger-sized instances. To that end, we select the Linear Ordering Problem as a case of study, an NP-hard problem, and develop a Neural Combinatorial Optimization model to optimize it. Finally, we discuss how the analysed aspects apply to a general learning framework, and suggest new directions for future work in the area of Neural Combinatorial Optimization algorithms.

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

↑