A Heuristic for the Two-Dimensional Irregular Bin Packing Problem with Limited Rotations
Author:
Publisher
Springer International Publishing
Link
http://link.springer.com/content/pdf/10.1007/978-3-030-55789-8_24
Reference14 articles.
1. Abeysooriya, R.P., Bennell, J.A., Martinez-Sykora, A.: Jostle heuristics for the 2d-irregular shapes bin packing problems with free rotation. Int. J. Prod. Econ. 195, 12–26 (2018)
2. Bennell, J.A., Dowsland, K.A., Dowsland, W.B.: The irregular cutting-stock problem–a new procedure for deriving the no-fit polygon. Comput. Oper. Res. 28(3), 271–287 (2001)
3. Burke, E.K., Hellier, R.S., Kendall, G., Whitwell, G.: Complete and robust no-fit polygon generation for the irregular stock cutting problem. Eur. J. Oper. Res. 179(1), 27–49 (2007)
4. Elkeran, A.: A new approach for sheet nesting problem using guided cuckoo search and pairwise clustering. Eur. J. Oper. Res. 231(3), 757–769 (2013)
5. Imamichi, T., Yagiura, M., Nagamochi, H.: An iterated local search algorithm based on nonlinear programming for the irregular strip packing problem. Discrete Optim. 6(4), 345–361 (2009)
Cited by 6 articles. 订阅此论文施引文献 订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. An iteratively doubling binary search for the two-dimensional irregular multiple-size bin packing problem raised in the steel industry;Computers & Operations Research;2024-02
2. An Iterative Compression Method for the Two-Dimensional Irregular Packing Problem With Lead Lines;IEEE Access;2024
3. Heuristics for the two-dimensional irregular bin packing problem with limited rotations;Computers & Operations Research;2023-12
4. A hierarchical hyper-heuristic for the bin packing problem;Soft Computing;2022-05-07
5. An iteratively doubling local search for the two-dimensional irregular bin packing problem with limited rotations;Computers & Operations Research;2022-01
1.学者识别学者识别
2.学术分析学术分析
3.人才评估人才评估
"同舟云学术"是以全球学者为主线，采集、加工和组织学术论文而形成的新型学术文献查询和分析系统，可以对全球学者进行文献检索和人才价值评估。用户可以通过关注某些学科领域的顶尖人物而持续追踪该领域的学科进展和研究前沿。经过近期的数据扩容，当前同舟云学术共收录了国内外主流学术期刊6万余种，收集的期刊论文及会议论文总量共计约1.5亿篇，并以每天添加12000余篇中外论文的速度递增。我们也可以为用户提供个性化、定制化的学者数据。欢迎来电咨询！咨询电话：010-8811{复制后删除}0370
www.globalauthorid.com
TOP
Copyright © 2019-2024 北京同舟云网络信息技术有限公司 京公网安备11010802033243号 京ICP备18003416号-3