全部 标题 作者
关键词 摘要

OALib Journal期刊
ISSN: 2333-9721
费用:99美元

查看量下载量

相关文章

更多...

Applying AB classification method in one-dimensional cutting stock problem
一维下料问题的AB分类法

Keywords: one-dimensional cutting stock problem,greedy algorithm,optimization,random search
一维下料问题
,贪心算法,优化,随机搜索

Full-Text   Cite this paper   Add to My Lib

Abstract:

In order to solve large-scale one-dimensional cutting stock problem of calculating difficulties, according to the characteristics of one-dimensional cutting stock problem, the author used random search technology to improve the greedy algorithm and put forward a kind of simple and practical classification method named AB. Experiments show that the algorithm for larger problems can quickly obtain the optimal solution or approximate optimal solution with high accuracy.

Full-Text

comments powered by Disqus

Contact Us

service@oalib.com

QQ:3279437679

WhatsApp +8615387084133