首页> 外文期刊>Expert Systems with Application >Effective hierarchical optimization by a hierarchical multi-space competitive genetic algorithm for the flexible job-shop scheduling problem
【24h】

Effective hierarchical optimization by a hierarchical multi-space competitive genetic algorithm for the flexible job-shop scheduling problem

机译:通过分层的多空间竞争遗传算法对柔性作业车间调度问题进行有效的分层优化

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

摘要

In this paper, we propose a new optimization technique, the hierarchical multi-space competitive distributed genetic algorithm (HmcDGA), which is effective for the hierarchical optimization problem. It is an extension of the multi-space competitive distributed genetic algorithm (mcDGA), which was proposed by the authors. The mcDGA efficiently finds an optimal solution with a low computational cost by increasing the number of individuals in a solution space in which it is likely to exist. An optimization method that is divided into several levels of hierarchy is called a hierarchical optimization. Several hierarchical optimization techniques have been proposed, including the hierarchical genetic algorithm (HGA). In hierarchical optimization, a complex problem is divided into a hierarchical collection of simpler problems, and each level is optimized independently. In this way, complex problems can be solved without the need to develop problem-specific operators. However, in the conventional HGA, this results in a high computational cost because the genetic algorithm (GA) is repeated many times at upper and lower level. The HmcDGA is a hybrid of the mcDGA and HGA, and it has some of the advantages of each one; for example, the HmcDGA can find an optimal solution at low computational cost and without requiring special operations. This allows it to be applied to a wide variety of optimization problems. Therefore, the HmcDGA may become the powerful optimization algorithm that can solve various problems. In this paper, we apply the proposed HmcDGA to the flexible job-shop scheduling problem (FJSP) which is one of the complex combinational optimization problem and confirm its effectiveness. Simulation results show that the HmcDGA can find solutions that are comparable to those found by using GAs developed specifically for the FJSP, the HmcDGA is not required a lot of computational costs comparing to the HGA. (C) 2015 Elsevier Ltd. All rights reserved.
机译:在本文中,我们提出了一种新的优化技术,即分层多空间竞争分布式遗传算法(HmcDGA),该算法可有效解决分层优化问题。这是作者提出的多空间竞争分布式遗传算法(mcDGA)的扩展。 mcDGA通过增加可能存在的解决方案空间中的个体数量来有效地找到计算成本低的最佳解决方案。分为几个层次结构的优化方法称为层次结构优化。已经提出了几种分层优化技术,包括分层遗传算法(HGA)。在分层优化中,将复杂的问题划分为较简单问题的分层集合,并且每个级别均独立优化。这样,无需开发特定问题的运算符就可以解决复杂的问题。然而,在常规的HGA中,这导致高计算成本,因为遗传算法(GA)在上层和下层被重复多次。 HmcDGA是mcDGA和HGA的混合体,具有每个优点。例如,HmcDGA可以以较低的计算成本找到最佳解决方案,而无需进行特殊操作。这使其可以应用于各种优化问题。因此,HmcDGA可能成为可以解决各种问题的强大优化算法。在本文中,我们将提出的HmcDGA应用于柔性作业车间调度问题(FJSP),该问题是复杂的组合优化问题之一,并确认了其有效性。仿真结果表明,HmcDGA可以找到与使用专为FJSP开发的GA所找到的解决方案相当的解决方案,与HGA相比,HmcDGA不需要大量的计算成本。 (C)2015 Elsevier Ltd.保留所有权利。

著录项

相似文献

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

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号