arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~
arXiv 1802.08637math.OCcs.DS
收藏

多目标离散最优化的网络模型

Network Models for Multiobjective Discrete Optimization

David Bergman, Merve Bodur, Carlos Cardonha, Andre A. Cire

摘要:

本文提供了一个新的框架,解决多目标离散最优化问题的任意数量的目标。我们的框架制定这些问题的网络模型,在枚举帕累托边界相当于解决一个多准则最短路问题在辅助网络。我们设计的技术,利用网络模型,以加快识别的帕累托前沿,最显着的一些操作,以简化网络删除节点和弧,同时保留一组非支配的解决方案。我们表明,该框架产生订单的数量级的性能改进现有的最先进的算法上包含线性和非线性目标函数的五个问题类。

英文摘要:

This paper provides a novel framework for solving multiobjective discrete optimization problems with an arbitrary number of objectives. Our framework formulates these problems as network models, in that enumerating the Pareto frontier amounts to solving a multicriteria shortest path problem in an auxiliary network. We design techniques for exploiting the network model in order to accelerate the identification of the Pareto frontier, most notably a number of operations to simplify the network by removing nodes and arcs while preserving the set of nondominated solutions. We show that the proposed framework yields orders-of-magnitude performance improvements over existing state-of-the-art algorithms on five problem classes containing both linear and nonlinear objective functions.

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

↑