| 注册
首页|期刊导航|计算机与现代化|基于基因表达式的克隆选择算法求解JSP问题

基于基因表达式的克隆选择算法求解JSP问题

尚涛

计算机与现代化Issue(4):155-159,5.
计算机与现代化Issue(4):155-159,5.DOI:10.3969/j.issn.1006-2475.2012.04.043

基于基因表达式的克隆选择算法求解JSP问题

Gene Expression-based Clonal Selection Algorithm for Job Shop Scheduling Problem

尚涛1

作者信息

  • 1. 武汉科技大学信息科学与工程学院,湖北武汉430065
  • 折叠

摘要

Abstract

Based on the characteristics of job shop scheduling problem, gene expression-based clonal selection algorithm is proposed. In this method, using the encoding of gene expression programming to represent scheduling solution, and clonal selection algorithm is utilized as search engine so that the proposed method has more powerful global search ability. Finally, seven kinds of Benchmark instances are tested to verify the effectiveness of the proposed approach. The experimental results show the proposed approach is very effective in solving job shop scheduling problems.

关键词

作业车间调度问题/基因表达式/克隆选择算法

Key words

job shop scheduling problem/gene expression/clonal selection algorithm

分类

信息技术与安全科学

引用本文复制引用

尚涛..基于基因表达式的克隆选择算法求解JSP问题[J].计算机与现代化,2012,(4):155-159,5.

计算机与现代化

OACSTPCD

1006-2475

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