• 主题
高级搜索  >
历史搜索 清空历史
首页> 外文会议>Business and Information Management, 2008. ISBIM '08 >Solving the Rectangular Packing Problem of the Discrete Particle Swarm Algorithm
【24h】

Solving the Rectangular Packing Problem of the Discrete Particle Swarm Algorithm

机译：求解离散粒子群算法的矩形堆积问题

获取原文
页面导航
  • 摘要
  • 著录项
  • 相似文献
  • 相关主题

摘要

The problem of rectangular packing in the two-dimensional cutting issues is studied in this paper. Because packing problem can be provided through the nesting rules (the remainder rectangular packing rule) into combinatorial optimization problem, a Discrete Particle Swarm Optimization Algorithm (DPSO) is proposed according to the characteristics of optimize the combination of discrete issues. In this DPSO algorithm, the location, speed and computing rules of the particle are redefined in order to find the optimize result in the search of the discrete solution space. The obtained results are better than the results published in the literature.
机译：本文研究了二维切割问题中的矩形堆积问题。由于可以通过嵌套规则（剩余的矩形堆积规则）将堆积问题提供给组合优化问题，因此针对离散问题组合的优化特点，提出了一种离散粒子群优化算法（DPSO）。在该DPSO算法中，重新定义了粒子的位置，速度和计算规则，以便在搜索离散解空间时找到优化结果。获得的结果优于文献中公布的结果。

著录项

相似文献

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

客服邮箱：kefu@zhangqiaokeyan.com

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

  • 客服微信

  • 服务号