首页> 外文会议>AME 2010;International conference on advanced mechanical engineering >A Hybrid Approach Based on Artificial Neural Network(ANN) and Differential Evolution(DE) for Job-shop Scheduling Problem
【24h】

A Hybrid Approach Based on Artificial Neural Network(ANN) and Differential Evolution(DE) for Job-shop Scheduling Problem

机译:基于人工神经网络和差分进化(DE)的作业车间调度问题的混合方法

获取原文

摘要

In this paper, we proposed a new hybrid approach, combining ANN and DE(Differential Evolution), for job-shop scheduling. Job-shop scheduling can be decomposed into a constraint satisfactory part and an optimization part for a specified scheduling objective. For this, an NN and DE-based hybrid scheduling approach is proposed in this paper. First, several specific types of neuron are designed to describe these processing constraints, detecting whether constraints are satisfied and resolving the conflicts by their feedback adjustments. Constructed with these neurons, the constraint neural network (CNN) can generate a feasible solution for the JSSP. CNN here corresponds to the constraint satisfactory part. A gradient search algorithm can be applied to guide CNN operations if an optimal solution needs to be found at a fixed sequence. For sequence optimization, a DE is employed. Through many simulation experiments and practical applications, it is shown that the approach can be used to model real production scheduling problems and to efficiently find an optimal solution. The hybrid approach is an ideal combination of the constraint analysis and the optimization scheduling method.
机译:在本文中,我们提出了一种新的混合方法,将ANN和DE(差分演化)相结合,用于作业车间调度。车间调度可以分解为约束满意部分和用于指定调度目标的优化部分。为此,本文提出了一种基于NN和DE的混合调度方法。首先,设计几种特定类型的神经元来描述这些处理约束,检测约束是否满足并通过其反馈调整来解决冲突。用这些神经元构造的约束神经网络(CNN)可以为JSSP生成可行的解决方案。 CNN在此对应于约束满足部分。如果需要以固定顺序找到最佳解决方案,则可以将梯度搜索算法应用于指导CNN操作。对于序列优化,采用DE。通过许多仿真实验和实际应用,表明该方法可用于对实际生产计划问题进行建模并有效地找到最佳解决方案。混合方法是约束分析和优化调度方法的理想组合。

著录项

相似文献

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

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号