首页> 外文会议>International Work-Conference on the Interplay Between Natural and Artificial Computation >Improving Cutting-Stock Plans with Multi-objective Genetic Algorithms
【24h】

Improving Cutting-Stock Plans with Multi-objective Genetic Algorithms

机译:用多目标遗传算法改善切割股票计划

获取原文

摘要

In this paper, we confront a variant of the cutting-stock problem with multiple objectives. The starting point is a solution calculated by a heuristic algorithm, termed SHRP, that aims to optimize the two main objectives, i.e. the number of cuts and the number of different patterns. Here, we propose a multi-objective genetic algorithm to optimize other secondary objectives such as changeovers, completion times of orders pondered by priorities and open stacks. We report experimental results showing that the multi-objective genetic algorithm is able to improve the solutions obtained by SHRP on the secondary objectives.`
机译:在本文中,我们面临着多种目标的切割股票问题的变种。起始点是由启发式算法(称为SHRP)计算的解决方案,该解决方案旨在优化两个主要目标,即削减的数量和不同模式的数量。在这里,我们提出了一种多目标遗传算法来优化其他次要目标,例如ReplayOver,按优先级和开放堆叠思考的订单的完成时间。我们报告了实验结果表明,多目标遗传算法能够改善SHRP在次要目标上获得的解决方案.`

著录项

相似文献

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

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号