| 注册
首页|期刊导航|计算机应用与软件|求解JSP的改进差分进化算法

求解JSP的改进差分进化算法

张敬敏 李霞

计算机应用与软件2013,Vol.30Issue(6):143-146,4.
计算机应用与软件2013,Vol.30Issue(6):143-146,4.DOI:10.3969/j.issn.1000-386x.2013.06.039

求解JSP的改进差分进化算法

AN IMPROVED DIFFERENTIAL EVOLUTION ALGORITHM FOR JOB-SHOP SCHEDULING PROBLEM

张敬敏 1李霞1

作者信息

  • 1. 石家庄经济学院信息工程学院 河北石家庄050031
  • 折叠

摘要

Abstract

Aiming at the job-shop scheduling problem,an improved differential evolution algorithm is proposed.In it a kind of new real order number coding method is designed,the processing machines are given their real number.The coding method has good versatility,and is suitable for job-shop scheduling problems under different conditions.On this basis,through the improvement of mutation operator,the evolutionary process will not produce invalid solution,and the operation speed of the algorithm is improved as well.In order to raise the diversity of the population,scaling factor is also improved in this algorithm.Through the calculation of twelve universe standard typical examples,the validity and feasibility of the algorithm are verified.

关键词

作业车间调度/差分进化算法/次序号/变异算子/缩放因子

Key words

Job-shop scheduling / Differential evolution algorithm /Order number / Mutation operator / Scaling factor

分类

信息技术与安全科学

引用本文复制引用

张敬敏,李霞..求解JSP的改进差分进化算法[J].计算机应用与软件,2013,30(6):143-146,4.

基金项目

河北省科技计划项目(11213525D). (11213525D)

计算机应用与软件

OA北大核心CSCDCSTPCD

1000-386X

访问量0
|
下载量0
段落导航相关论文