一维下料问题的进化随机局部搜索框架
An Evolutionary Stochastic-Local-Search Framework for One-Dimensional Cutting-Stock Problems
摘要:
我们引入了一个进化的随机局部搜索(SLS)算法来解决所谓的1/V/D/R下料问题的广义版本。在工业环境中经常会遇到切削库存问题,有效解决这些问题的能力通常会带来巨大的经济效益。传统的基于线性规划的技术已被用来解决这些问题,但它们的灵活性可能会受到限制时,非线性约束和目标函数的介绍。为此,本文提出了一种解决一维下料问题的进化SLS算法。的贡献在于引入一个灵活的结构框架的优化,可以容纳一个大家庭的多元化战略,包括一个新的并行模式适合SLS算法(不一定限于切割股票的问题)。最后,我们通过实验证明在现实世界中的制造问题所考虑的多元化战略的成本降低的好处。
英文摘要:
We introduce an evolutionary stochastic-local-search (SLS) algorithm for addressing a generalized version of the so-called 1/V/D/R cutting-stock problem. Cutting-stock problems are encountered often in industrial environments and the ability to address them efficiently usually results in large economic benefits. Traditionally linear-programming-based techniques have been utilized to address such problems, however their flexibility might be limited when nonlinear constraints and objective functions are introduced. To this end, this paper proposes an evolutionary SLS algorithm for addressing one-dimensional cutting-stock problems. The contribution lies in the introduction of a flexible structural framework of the optimization that may accommodate a large family of diversification strategies including a novel parallel pattern appropriate for SLS algorithms (not necessarily restricted to cutting-stock problems). We finally demonstrate through experiments in a real-world manufacturing problem the benefit in cost reduction of the considered diversification strategies.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。