增强多目标0-1规划的分支定界方法
Enhancing Branch-and-Bound for Multi-Objective 0-1 Programming
AI总结:
本文通过扩展多目标探测、割生成及最佳界节点选择规则来增强多目标0-1规划的分支定界算法,在设施选址和背包问题基准上取得优于现有分支定界方法且与最先进目标空间搜索方法相当的结果。
摘要:
在双目标分支定界文献中,一个关键要素是目标分支,即通过上界集对下界集的部分支配,在目标空间中创建更小且不相交的子问题。然而,当考虑三个或更多目标函数时,应用目标分支变得更加复杂,其益处迄今尚不明确。本文研究了在多个目标设置中能够更好地利用目标分支的若干要素。我们将探测(probing)的思想扩展到多个目标,在多个方面对其进行了增强,并表明当与目标分支相结合时,它在CPU时间方面带来了显著的加速。我们还研究了基于目标分支约束的割生成。此外,我们将用于节点选择的最佳界(best-bound)思想推广到多个目标,并表明所提出的规则优于多目标文献中常用的深度优先和广度优先策略。我们还分析了问题特定的分支规则。我们在三类具有三个和四个目标的问题的可用基准实例上测试了所提出的思想,这三类问题分别是有容量约束的设施选址问题、无容量约束的设施选址问题和背包问题。我们增强的多目标分支定界算法优于现有最佳的分支定界方法,并且是第一个在部分问题类别上取得与最先进的目标空间搜索方法具有竞争力甚至略好结果的方法。
英文摘要:
In the bi-objective branch-and-bound literature, a key ingredient is objective branching, i.e. to create smaller and disjoint sub-problems in the objective space, obtained from the partial dominance of the lower bound set by the upper bound set. When considering three or more objective functions, however, applying objective branching becomes more complex, and its benefit has so far been unclear. In this paper, we investigate several ingredients which allow to better exploit objective branching in a multi-objective setting. We extend the idea of probing to multiple objectives, enhance it in several ways, and show that when coupled with objective branching, it results in significant speed-ups in terms of CPU times. We also investigate cut generation based on the objective branching constraints. Besides, we generalize the best-bound idea for node selection to multiple objectives and we show that the proposed rules outperform the, in the multi-objective literature, commonly employed depth-first and breadth-first strategies. We also analyze problem specific branching rules. We test the proposed ideas on available benchmark instances for three problem classes with three and four objectives, namely the capacitated facility location problem, the uncapacitated facility location problem, and the knapsack problem. Our enhanced multi-objective branch-and-bound algorithm outperforms the best existing branch-and-bound based approach and is the first to obtain competitive and even slightly better results than a state-of-the-art objective space search method on a subset of the problem classes.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。