首页 | 官方网站   微博 | 高级检索  
     

多目标混合遗传算法求解流水车间调度问题
引用本文:杨开兵.多目标混合遗传算法求解流水车间调度问题[J].电脑与信息技术,2008,16(2):28-30.
作者姓名:杨开兵
作者单位:大连工业大学信息科学与工程学院,辽宁,大连,116034
摘    要:为高效地求解多目标流水车间调度问题,提出了一种多目标混合遗传算法,此算法将局部搜索融入进化计算中,采用非劣解并行局部搜索策略,并依据基于Pareto支配关系的个体排序数和密度值进行适应度赋值,以加速算法的收敛,保持群体多样性.仿真结果表明,新算法能够有效地解决多目标流水车间调度问题.

关 键 词:混合遗传算法  流水车间调度  适应度赋值  局部搜索  多目标  混合  遗传算法  求解  车间调度问题  Shop  Scheduling  Flow  仿真结果  群体多样性  收敛  加速算法  赋值  适应度  密度值  序数  支配关系  Pareto  搜索策略  并行  非劣解
文章编号:1005-1228(2008)02-0028-03
修稿时间:2008年1月21日

Multi-Objective Hybrid Genetic Algorithm for Flow Shop Scheduling
YANG Kai-bing.Multi-Objective Hybrid Genetic Algorithm for Flow Shop Scheduling[J].Computer and Information Technology,2008,16(2):28-30.
Authors:YANG Kai-bing
Affiliation:YANG Kai-bing(College of Information Science , Engineering,Dalian Polytechnic University,Dalian,Liaoning 116034,China)
Abstract:To efficiently solve multi-objective flow shop scheduling problems,a new multi-objective hybrid genetic algorithm(MOHGA) was proposed.A Pareto parallel local search strategy was used,the individual fitness based on the rank of the individual and its density value was evaluated,a elistist strategy was adopted to improve the convergence of the algorithm and preserve diversity in the population.The concept of Pareto dominance was used to assign fitness to the solutions and in the local search procedure.The sim...
Keywords:hybrid genetic algorithm  flow shop scheduling  fitness assignment  local search  
本文献已被 CNKI 维普 万方数据 等数据库收录!
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司    京ICP备09084417号-23

京公网安备 11010802026262号