摘要
针对作业车间调度问题,提出改进的混合蛙跳算法.采用基于工件操作的蛙体结构,定义青蛙的相似性和距离,构造相应的青蛙移位策略,有效克服工件机器顺序的约束限制,保证青蛙新位置的可行性.通过经典算例仿真计算结果表明,该算法能有效求解较大规模的作业车间调度问题.
An improved shuffled frog-leaping algorithm is proposed for job shop scheduling problem.In this algorithm,the structure of frog is dependent on job operations.The similarity and distance between frogs are defined.A new displacement strategy is constructed,so that the constraint of machine sequence is overcome and the feasibility of frog＇s new position is assured.Simulation results on benchmark problems show that this algorithm can effectively solve large job shop scheduling problems.
出处
《深圳大学学报（理工版）》
EI
CAS
北大核心
2010年第4期391-395,共5页
Journal of Shenzhen University(Science and Engineering)
基金
国家自然科学基金资助项目(60772148)~~
关键词
人工智能
混合蛙跳算法
作业车间调度
智能计算
NP-hand组合优化
artificial intelligence
shuffled frog-leaping algorithm
job shop scheduling
intelligence computing
NP-hand optimization
