检索规则说明:AND代表“并且”;OR代表“或者”;NOT代表“不包含”;(注意必须大写,运算符两边需空一格)
检 索 范 例 :范例一: (K=图书馆学 OR K=情报学) AND A=范并思 范例二:J=计算机应用与软件 AND (U=C++ OR U=Basic) NOT M=Visual
机构地区:[1]广东工业大学广东省计算机集成制造重点实验室,广东广州510006
出 处:《机械设计与制造》2014年第3期230-233,共4页Machinery Design & Manufacture
基 金:国家自然科学基金资助项目(No.51205068,51175094);国家科技支撑计划项目(No.2012BAF12B10);广东省自然科学资助基金(No.S2012040007784)
摘 要:单熔炼炉批调度问题属于不一致任务单机批调度问题,熔炼批加工时间与批内任务需熔炼重量之和为线性函数关系。建立了单熔炼炉最小化最大任务完工时间的优化模型,提出了基于任务分批序列的混合粒子群算法(HPSOB)进行优化求解。该算法使用随机生成的任务分批序列作为粒子,采用批重量匹配(BWF)启发式规则对违背批重量约束的染色体进行修复。为避免早熟问题,算法引入遗传算法中的交叉操作和变异操作,通过粒子同个体最好解和群体最好解的交叉以及粒子自身的变异方式来搜索最优解。仿真实验结果验证了HPSOB算法的有效性。Scheduling of a single melting furnace is one of single batch-processing machine with non-identical job sizes (SBMN) in precision casting of mould.In the scheduling problem,the processing time of a batch is a linear function of total melting weight of all jobs in the batch.The optimization model was established to minimize the makespan,and the hybrid particle swarm optimization based batch sequence (HPSOB) was used to minimize the makespan.In the HPSOB algorithm,a particle represented a sequence of batches which jobs were assigned,and the Batch Weight-Fit(BWF)heuristic was proposed to repair chromosomes violated the batch weight constraint.In order to avoid the premature convergence problem,the HPSO introduced the crossover and mutation operator in genetic algorithm,and searched for the optimal solution by crossing between particles and individual extrema and group extrema and mutating the particles themselves.Simulation experimental results demonstrated that the HPSOB algorithm is effective.
分 类 号:TH16[机械工程—机械制造及自动化] TH166
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在链接到云南高校图书馆文献保障联盟下载...
云南高校图书馆联盟文献共享服务平台 版权所有©
您的IP:216.73.216.69