.png){kind=icon}
返回
Evolutionary based heuristic for bin packing problem
.png){kind=icon}
PRE
AI
DOI：10.1016/j.cie.2008.01.007.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
In this paper, we investigate the use of evolutionary based heuristic to the one-dimensional bin packing problem (BPP). Unlike other evolutionary heuristics used with optimization problems, a non-specialized and non-hybridized algorithm is proposed and analyzed for solving BPP. The algorithm uses a modified permutation with separators encoding scheme, unique concept of separators' movements during mutation, and separators removal as a technique of problem size reduction. The set of experiments confirmed that the proposed approach is comparable to much more complicated algorithms. (C) 2008 Elsevier Ltd. All rights reserved.
Keyword:
Bin packing
Evolutionary algorithms
Heuristics
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
6.5
论文数:
1.0W
被引数:
3.8W
机构
暂无机构信息
引用论文
.png){kind=icon}
分享收藏 没有更多内容
没有更多内容