| 注册
首页|期刊导航|信阳师范学院学报(自然科学版)|Job-shop调度问题的离散布谷鸟搜索算法求解

Job-shop调度问题的离散布谷鸟搜索算法求解

储泽楠 王庆喜

信阳师范学院学报(自然科学版)Issue(3):442-445,4.
信阳师范学院学报(自然科学版)Issue(3):442-445,4.DOI:10.3969/j.issn.1003-0972.2015.03.033

Job-shop调度问题的离散布谷鸟搜索算法求解

Discrete Cuckoo Search Algorithm for Job-shop Scheduling Problem

储泽楠 1王庆喜1

作者信息

  • 1. 安阳工学院计算机科学与信息工程学院,河南安阳455000
  • 折叠

摘要

Abstract

Based on Cuckoo search algorithm and Ranked Order Value, a kind of discrete Cuckoo search algorithm ( DCS) was proposed.The classic LA of Job-shop problem was solved by using the DCS, the results of simulation data showed that the convergence speed, accuracy and stability of the proposed algorithm were much better than that of PSO and fireflies optimization algorithm, which proved the feasibility and effectiveness of the DCS algorithm.

关键词

作业车间调度/布谷鸟搜索算法/升序排列规则

Key words

job shop scheduling/Cuckoo search algorithm/ranked order value

分类

信息技术与安全科学

引用本文复制引用

储泽楠,王庆喜..Job-shop调度问题的离散布谷鸟搜索算法求解[J].信阳师范学院学报(自然科学版),2015,(3):442-445,4.

基金项目

国家科技重大专项项目(2012ZX04011-012);国家自然科学基金项目(U1204613);河南省重点科技攻关项目(142102310188);安阳工学院青年科研基金项目 ()

信阳师范学院学报(自然科学版)

OA北大核心CSTPCD

1003-0972

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