摘要
派工法则是求解作业车间调度问题的一种简单有效的方法。针对一种装配作业车间调度问题建立仿真模型,并通过基因表达式编程(Gene expression programming,GEP)算法自动产生并搜索最优的派工法则。仿真模型结果表明,在最小平均流程时间和最小平均绝对偏差两个目标函数下,GEP算法都能够找到比现有常用的派工法则更好的解,在计算时间和求解质量方面也都具有优势,并且有较强的鲁棒性。具体设计上,构造属性筛选机制以减少搜索空间,提升搜索性能,采用动态自适应算法提高GEP的搜索效果,通过仿真试验构建不同的生产环境证明了所提算法的有效性。
Dispatching rules is a simple and effective approach for job shop scheduling problems.Aiming at an assembly job shop scheduling problem(AJSP),a simulation model is established and a gene expression programming(GEP)algorithm is proposed to automatically generate and search optimal dispatching rules.Simulation results show that under the two optimization objectives of minimizing mean flow time and mean absolute deviation,the GEP algorithm can find better solutions than existing commonly used dispatching rules and shows advantages in computation time and solving quality,together with a certain level of robustness.Specifically,a feature selection scheme is designed to reduce the search space and improve search performance.A dynamic self-adaptive scheme is also applied to improve the search ability of GEP,and the effectiveness of the proposed algorithm is proved by simulating experiments constructed for different production environments.
作者
吕海利
黄志文
陈建华
王正国
吴姝
韩国震
LÜHaili;HUANG Zhiwen;CHEN Jianhua;WANG Zhengguo;WU Shu;HAN Guozhen(School of Transportation and Logistics Engineering,Wuhan University of Technology,Wuhan 430063;Institute of Logistics System Science and Engineering,Wuhan University of Technology,Wuhan 430063;Ministry of Education Engineering Research Center for Port Logistics Technology and Equipment,Wuhan 430063;Wuhan Tianma Microelectronics Co.,Ltd.,Wuhan 430000)
出处
《机械工程学报》
EI
CAS
CSCD
北大核心
2023年第16期427-434,共8页
Journal of Mechanical Engineering
基金
国家自然科学基金青年科学基金(11701437)
军工项目JGXM(202018HX02)
桂林航天工业学院广西航空物流研究中心基金(19KFJJHKWL04)资助项目。
关键词
基因表达式编程
装配作业车间调度
派工法则
属性选择
gene expression programming
assembly job shop scheduling
dispatching rules
feature selection
