Metamodeling and the Critic-based approach to multi-level optimization

详细信息	查看全文 | 推荐本文 |

• 作者：Ludmilla Werbos^a ; ^{LDWerbos@memphis.edu} ; Robert Kozma^b ; Rodrigo Silva-Lugo^b ; Giovanni E. Pazienza^b ; ¹ ; Paul J. Werbos^c
• 关键词：Approximate dynamic programming ; Multi-level optimization ; Metamodeling ; Adaptive critic
• 刊名：Neural Networks
• 出版年：2012
• 期刊代码：94_08936080
• 类别：cp
• 出版时间：August, 2012
• 卷：32
• 期：Complete
• 页码：179-185
• 文件大小：459 K

摘要

Large-scale networks with hundreds of thousands of variables and constraints are becoming more and more common in logistics, communications, and distribution domains. Traditionally, the utility functions defined on such networks are optimized using some variation of Linear Programming, such as Mixed Integer Programming (MIP). Despite enormous progress both in hardware (multiprocessor systems and specialized processors) and software (Gurobi) we are reaching the limits of what these tools can handle in real time. Modern logistic problems, for example, call for expanding the problem both vertically (from one day up to several days) and horizontally (combining separate solution stages into an integrated model). The complexity of such integrated models calls for alternative methods of solution, such as Approximate Dynamic Programming (ADP), which provide a further increase in the performance necessary for the daily operation. In this paper, we present the theoretical basis and related experiments for solving the multistage decision problems based on the results obtained for shorter periods, as building blocks for the models and the solution, via Critic-Model-Action cycles, where various types of neural networks are combined with traditional MIP models in a unified optimization system. In this system architecture, fast and simple feed-forward networks are trained to reasonably initialize more complicated recurrent networks, which serve as approximators of the value function (Critic). The combination of interrelated neural networks and optimization modules allows for multiple queries for the same system, providing flexibility and optimizing performance for large-scale real-life problems. A MATLAB implementation of our solution procedure for a realistic set of data and constraints shows promising results, compared to the iterative MIP approach.