一类分式0-1规划问题的分枝定界算法
A branch and bound algorithm for a fractional 0-1 programming problem
摘要:
我们考虑一个分数0-1规划问题中出现的制造业。问题在于机器与在这些机器上加工的部件一起聚类成制造单元,使得部件的单元内加工最大化,单元间运动最小化。该问题被称为细胞形成问题(CFP),它是一个具有布尔变量和约束的NP-难优化问题,目标函数为分数阶。由于CFP具有较高的计算复杂性,因此有许多算法被用于求解CFP,本文提出了一种分枝定界算法,该算法能够精确求解具有可变单元数和分组功效目标函数的CFP。该算法找到了最佳的解决方案,从文献中的35个流行的基准实例中的21个,并为其余14个实例,它找到了良好的解决方案接近最知名的。
英文摘要:
We consider a fractional 0-1 programming problem arising in manufacturing. The problem consists in clustering of machines together with parts processed on these machines into manufacturing cells so that intra-cell processing of parts is maximized and inter-cell movement is minimized. This problem is called Cell Formation Problem (CFP) and it is an NP-hard optimization problem with Boolean variables and constraints and with a fractional objective function. Because of its high computational complexity there are a lot of heuristics developed for it. In this paper we suggest a branch and bound algorithm which provides exact solutions for the CFP with a variable number of cells and grouping efficacy objective function. This algorithm finds optimal solutions for 21 of the 35 popular benchmark instances from literature and for the remaining 14 instances it finds good solutions close to the best known.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。