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

多目标整数线性规划的新$ε$ -约束方法:Pareto前沿表示法

New $ε$-constraint methods for multi-objective integer linear programming: a Pareto front representation approach

Mariana Mesquita-Cunha, José Rui Figueira, Ana Paula Barbosa-Póvoa

摘要:

使用生成方法处理多目标问题具有一些有趣的优点,因为它为决策者提供了关于非支配点集(帕累托前沿)的完整信息和对问题的清晰概述。然而,为决策者提供许多解决方案也可能是压倒性的。作为替代方法,呈现帕累托前沿的一组代表性解可能是有利的。选择这样的代表集本身也是一个多目标问题,必须考虑要呈现的解的数量、一致性和/或代表的覆盖范围,以保证其质量。本文提出了三个算法的表示问题的多目标整数线性规划问题的两个或两个以上的目标函数,他们中的每一个处理的每一个维度的问题(基数,覆盖,和一致性)。这些算法都是基于$ε$约束的方法。此外,本文还提出了克服帕累托前界估计不佳的策略。该算法进行了测试的能力,有效地产生整个帕累托前或其表示。均匀性和基数算法被证明是非常有效的二进制和整数问题,在文献中是最好的。覆盖率和均匀性算法都能在其目标对象上提供良好的质量表示,而基数算法似乎是最灵活的,对于基数较低的表示和基数较高的覆盖率来说,它能保持均匀性。

英文摘要:

Dealing with multi-objective problems by using generation methods has some interesting advantages since it provides the decision-maker with the complete information about the set of non-dominated points (Pareto front) and a clear overview of the problem. However, providing many solutions to the decision-maker might also be overwhelming. As an alternative approach, presenting a representative set of solutions of the Pareto front may be advantageous. Choosing such a representative set is by itself also a multi-objective problem that must consider the number of solutions to present, the uniformity, and/or the coverage of the representation, to guarantee its quality. This paper proposes three algorithms for the representation problem for multi-objective integer linear programming problems with two or more objective functions, each one of them dealing with each dimension of the problem (cardinality, coverage, and uniformity). Such algorithms are all based on the $ε$-constraint approach. In addition, the paper also presents strategies to overcome poor estimations of the Pareto front bounds. The algorithms were tested on the ability to efficiently generate the whole Pareto front or its representation. The uniformity and cardinality algorithms proved to be very efficient both in binary and integer problems, being amongst the best in the literature. Both coverage and uniformity algorithms provide good quality representations on their targeted objective, while the cardinality algorithm appears to be the most flexible, privileging uniformity for lower cardinality representations and coverage on higher cardinality.

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

↑