.png){kind=icon}
返回
A genetic algorithm for solving the two-dimensional assortment problem
.png){kind=icon}
PRE
AI
DOI：10.1016/j.cie.2006.03.002.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
Assortment problems arise in various industries such as the steel, paper, textiles and transportation industries. Two-dimensional assortment problems involve finding the best way of placing a set of rectangles within another rectangle whose area is minimized. Such problems are nonlinear and combinatorial. Current mixed integer programming models give optimal solutions, but the computation times are unacceptable. This study proposes a genetic algorithm that incorporates a novel random packing process and an encoding scheme for solving the assortment problem. Numerical examples indicate that the proposed genetic algorithm is considerably more efficient and effective than a fast integer programming model. Errors with respect to the optimal solutions are low such that numerous practical industrial cutting problems can be solved efficiently using the proposed method. (c) 2006 Elsevier Ltd. All rights reserved.
Keyword:
assortment problem
genetic algorithm
random bottom-left procedure
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
6.5
论文数:
1.0W
被引数:
3.8W
机构
暂无机构信息
引用论文
Approximately global optimization for assortment problems using piecewise linearization techniques
.png){kind=icon}
PREAI
分享收藏分享收藏
分享收藏
查看更多内容