首页> 外文期刊>Structural and Multidisciplinary Optimization >An efficient decomposed multiobjective genetic algorithm for solving the joint product platform selection and product family design problem with generalized commonality
【24h】

An efficient decomposed multiobjective genetic algorithm for solving the joint product platform selection and product family design problem with generalized commonality

机译:一种有效的分解多目标遗传算法,用于解决具有通用性的联合产品平台选择和产品族设计问题

获取原文
获取原文并翻译 | 示例
       

摘要

Product family optimization involves not only specifying the platform from which the individual product variants will be derived, but also optimizing the platform design and the individual variants. Typically these steps are performed separately, but we propose an efficient decomposed multiobjective genetic algorithm to jointly determine optimal (1) platform selection, (2) platform design, and (3) variant design in product family optimization. The approach addresses limitations of prior restrictive component sharing definitions by introducing a generalized two-dimensional commonality chromosome to enable sharing components among subsets of variants. To solve the resulting high dimensional problem in a single stage efficiently, we exploit the problem structure by decomposing it into a two-level genetic algorithm, where the upper level determines the optimal platform configuration while each lower level optimizes one of the individual variants. The decomposed approach improves scalability of the all-in-one problem dramatically, providing a practical tool for optimizing families with more variants. The proposed approach is demonstrated by optimizing a family of electric motors. Results indicate that (1) decomposition results in improved solutions under comparable computational cost and (2) generalized commonality produces families with increased component sharing under the same level of performance.
机译:产品系列优化不仅涉及指定从中派生单个产品变体的平台,而且还优化平台设计和单个变体。通常,这些步骤是分别执行的,但是我们提出了一种有效的分解多目标遗传算法,以共同确定产品系列优化中的最佳(1)平台选择,(2)平台设计和(3)变型设计。该方法通过引入广义的二维公共染色体来实现变体子集之间的组件共享,从而解决了先前限制性组件共享定义的局限性。为了在单个阶段中有效地解决由此产生的高维问题,我们通过将问题结构分解为两级遗传算法来利用问题结构,其中上层确定最佳的平台配置,而下层则优化单个变量之一。分解后的方法极大地提高了多合一问题的可伸缩性,提供了一种实用工具来优化具有更多变体的系列。通过优化一系列电动机证明了所提出的方法。结果表明:(1)分解可在可比的计算成本下改进解决方案;(2)通用性在相同的性能水平下产生具有增加的组件共享的族。

著录项

相似文献

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

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号