Solving a large cutting problem in the glass manufacturing industry.

European Journal of Operational Research(2020)

引用 17|浏览35
暂无评分
摘要
•The cutting problem of a large glass manufacturer is solved efficiently.•A beam search algorithm with some novel features is developed.•The algorithm performs better than existing alternatives in company’s benchmarks.•The influence of the specific constraints of the glass cutting problem is studied.
更多
查看译文
关键词
Cutting stock problem,Heuristics,Beam search algorithm
AI 理解论文
溯源树
样例
生成溯源树,研究论文发展脉络
Chat Paper
正在生成论文摘要