多目标组合优化问题的有效任意时间算法
Effective anytime algorithm for multiobjective combinatorial optimization problems
AI总结:
本文提出一种新的精确任意时间算法,结合三个创新思想,用于多目标组合优化,在480个实例上优于现有算法。
摘要:
在多目标优化中,优化算法的结果是一组有效解,决策者从中选择一个。通常,所有有效解无法在短时间内计算出来,搜索算法不得不提前停止以分析目前找到的解。为了给决策者提供多样化的解,偏好目标空间中分布良好的有效解集。然而,文献中只有少数精确算法能够在任何时刻提供这样的分布良好的解集:我们称之为任意时间算法。我们提出了一种新的精确任意时间算法,用于多目标组合优化,结合了三个新颖的想法来增强任意时间行为。我们将所提出的算法与最先进的任意时间多目标组合优化算法进行了比较,使用了来自不同知名基准的480个实例和四种不同的性能度量:整体非支配向量生成比率、超体积、一般分布和加性epsilon指标。一项全面的实验研究表明,我们的提议在大多数实例中优于以前的算法。
英文摘要:
In multiobjective optimization, the result of an optimization algorithm is a set of efficient solutions from which the decision maker selects one. It is common that not all the efficient solutions can be computed in a short time and the search algorithm has to be stopped prematurely to analyze the solutions found so far. A set of efficient solutions that are well-spread in the objective space is preferred to provide the decision maker with a great variety of solutions. However, just a few exact algorithms in the literature exist with the ability to provide such a well-spread set of solutions at any moment: we call them anytime algorithms. We propose a new exact anytime algorithm for multiobjective combinatorial optimization combining three novel ideas to enhance the anytime behavior. We compare the proposed algorithm with those in the state-of-the-art for anytime multiobjective combinatorial optimization using a set of 480 instances from different well-known benchmarks and four different performance measures: the overall non-dominated vector generation ratio, the hypervolume, the general spread and the additive epsilon indicator. A comprehensive experimental study reveals that our proposal outperforms the previous algorithms in most of the instances.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。