An efficient heuristic algorithm for arbitrary shaped rectilinear block packing problem
Author:
Publisher
Elsevier BV
Subject
Management Science and Operations Research,Modelling and Simulation,General Computer Science
Reference28 articles.
1. Two-dimensional packing problems: a survey;Lodi;European Journal of Operational Research,2002
2. Heuristics for the container loading problem;Pisinger;European Journal of Operational Research,2002
3. A genetic algorithm for a 2D industrial packing problem;Hopper;Computers & Industrial Engineering,1999
4. Developing a simulated annealing algorithm for the cutting stock problem;Lai;Computers & Industrial Engineering,1997
5. A hybrid genetic algorithm-heuristic for a two-dimensional orthogonal packing problem;Gonçalves;European Journal of Operational Research,2007
Cited by 12 articles. 订阅此论文施引文献 订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. Comprehensive Evaluation Method of Arrangement, Scheduling and Route of Multi-vehicle;2022 34th Chinese Control and Decision Conference (CCDC);2022-08-15
2. Development of algorithms for the formation and placement of N-dimensional orthogonal polyhedrons into containers of complex geometric shape;The International Journal of Advanced Manufacturing Technology;2021-04-20
3. Solving the Problem of Packing Objects of Complex Geometric Shape into a Container of Arbitrary Dimension;Proceedings of the 30th International Conference on Computer Graphics and Machine Vision (GraphiCon 2020). Part 2;2020-12-17
4. Development of Algorithms for the Correct Visualization of Two-Dimensional and Three-Dimensional Orthogonal Polyhedrons;Lecture Notes in Electrical Engineering;2020
5. Exact algorithms for the rectilinear block packing problem;Journal of Advanced Mechanical Design, Systems, and Manufacturing;2018
1.学者识别学者识别
2.学术分析学术分析
3.人才评估人才评估
"同舟云学术"是以全球学者为主线，采集、加工和组织学术论文而形成的新型学术文献查询和分析系统，可以对全球学者进行文献检索和人才价值评估。用户可以通过关注某些学科领域的顶尖人物而持续追踪该领域的学科进展和研究前沿。经过近期的数据扩容，当前同舟云学术共收录了国内外主流学术期刊6万余种，收集的期刊论文及会议论文总量共计约1.5亿篇，并以每天添加12000余篇中外论文的速度递增。我们也可以为用户提供个性化、定制化的学者数据。欢迎来电咨询！咨询电话：010-8811{复制后删除}0370
www.globalauthorid.com
TOP
Copyright © 2019-2024 北京同舟云网络信息技术有限公司 京公网安备11010802033243号 京ICP备18003416号-3