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.
Using Inverse Optimization to Learn Cost Functions in Generalized Nash Games
University of Maryland(马里兰大学);Norwegian University of Science and Technology(挪威科技大学)
正如Ratliff等人(2014)所证明的那样,逆优化可以用来恢复多人纳什博弈中参与者的目标函数参数。这些博弈涉及多个参与者的最优化问题,其中参与者可以在其目标函数中相互影响。在广义纳什均衡问题(GNEPs)中,一个参与者的可行行动集也受到游戏中其他参与者所采取行动的影响;请参阅Facchinei和Kanzow(2010)了解更多关于这个问题的背景。Rosen(1965)、Harker(1991)和Facchinei et al.(2007)引用的联合/“耦合”约束形式就是这种影响的一个例子,它们在可行域的约束中涉及其他参与者的变量。我们扩展了Ratliff等人的框架。(2014)为具有联合约束的GNEP类找到逆优化解决方案。然后将所得公式应用于道路网络上的模拟多玩家运输问题。此外,我们提供了一些理论结果,这个运输问题有关的扩展框架的运行时间以及唯一性和非唯一性的解决方案,我们的模拟实验。我们看到,我们的模型恢复了与原始参数化产生相同流模式的参数化,并且这在多个网络、关于参与者感知成本的不同假设以及大多数限制性容量设置和相关参与者数量中均适用。该项目的代码可以在https://github.com/sallen7/IO_GNEP上找到。