arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 1905.07428math.OC
收藏

双目标整数规划问题的精确算法

An exact algorithm for biobjective integer programming problems

Saliha Doğan, Özlem Karsu, Firdevs Ulus

摘要:

我们提出了一个精确的算法来解决双目标整数规划问题,出现在各种应用的运筹学。该算法基于求解Pascoletti-Serafini标量化来搜索目标空间中的指定区域(框),并返回非受控点的集合。我们用不同的策略实现了该算法,其中标量化模型参数和分裂规则的选择不同。然后,我们推导出解决的标量化模型的数量上的界限,并通过计算实验作为精确的算法和时间限制下的解决方案的方法来证明的变种的性能。实验表明,不同的策略在不同的方面有优势:虽然有些是更快地找到整个集合的非支配解决方案,其他返回高质量的解决方案的代表性时,运行时间的限制。我们还比较了所提出的方法与现有的算法。我们的实验结果表明,令人满意的行为,我们的算法,特别是当运行时间限制,因为它实现了更好的覆盖率的整个边界与较少的解决方案相比,现有的算法。

英文摘要:

We propose an exact algorithm for solving biobjective integer programming problems, which arise in various applications of operations research. The algorithm is based on solving Pascoletti-Serafini scalarizations to search specified regions (boxes) in the objective space and returns the set of nondominated points. We implement the algorithm with different strategies, where the choices of the scalarization model parameters and splitting rule differ. We then derive bounds on the number of scalarization models solved; and demonstrate the performances of the variants through computational experiments both as exact algorithms and as solution approaches under time restriction. The experiments demonstrate that different strategies have advantages in different aspects: while some are quicker in finding the whole set of nondominated solutions, others return good-quality solutions in terms of representativeness when run under time restriction. We also compare the proposed approach with existing algorithms. The results of our experiments show the satisfactory behaviour of our algorithm, especially when run under time limit, as it achieves better coverage of the whole frontier with a smaller number of solutions compared to the existing algorithms.

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

↑