【24h】

Bioinspired approach for 3D packaging problem

机译:BioinSpired方法3D包装问题

获取原文

摘要

The article deals with one of the most important optimization problems - the problem of three-dimensional packaging (3DP) of various sized elements. It belongs to the class of NP-hard and complex problems. The formulation and restrictions of the 3DPP are considered in the article. Bioinspired approach that uses a multi-level evolution and partially allows to avoid a preliminary convergence of algorithms. Genetic and evolutionary algorithms which obtain sets of quasi-optimal solutions in polynomial time were developed. To carry out computational experiments on test examples (benchmarks) the authors developed a software on the basis of bioinspired approach for the 3DPP. Conducted tests and experiments allow possible to clarify the theoretical estimations of algorithm time complexity. In the best case algorithms the time complexity is represented as O (n), in the worst case - O (n).
机译:本文涉及最重要的优化问题之一 - 各种大小元素的三维包装(3DP)的问题。它属于NP - 艰难和复杂问题的类别。在文章中考虑了3DPP的制定和限制。使用多级演化的BioInspired方法,部分允许避免算法的初步趋同。开发了在多项式时间中获得诸如最优解的遗传和进化算法。为了在测试示例(基准测试)上进行计算实验(基准),作者在3DPP的BioInspired方法的基础上开发了一种软件。进行的测试和实验允许阐明算法时间复杂性的理论估计。在最佳情况下,在最坏的情况下,时间复杂度表示为O(n) - O(n)。

著录项

相似文献

  • 外文文献
  • 中文文献
  • 专利
获取原文

客服邮箱:kefu@zhangqiaokeyan.com

京公网安备:11010802029741号 ICP备案号:京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有
  • 客服微信

  • 服务号