引用本文:邓超,钱斌,胡蓉,等.融合规则的HEDA求解带工件批量运输的三阶段装配集成调度问题[J].控制与决策,2020,35(10):2507-2513
【打印本页】   【HTML】   【下载PDF全文】   查看/发表评论  【EndNote】   【RefMan】   【BibTex】
←前一篇|后一篇→ 过刊浏览    高级检索
本文已被:浏览次   下载 本文二维码信息
码上扫一扫!
分享到: 微信 更多
融合规则的HEDA求解带工件批量运输的三阶段装配集成调度问题
邓超1, 钱斌1,2, 胡蓉2, 王凌3, 孙在省2
(1. 昆明理工大学机电工程学院,昆明650500;2. 昆明理工大学信息与自动化学院,昆明650500;3. 清华大学自动化系,北京100084)
摘要:
针对现有三阶段装配集成调度问题模型将各工件在运输阶段的运输时间简化设定为相同常量,未考虑运输车辆数量和车载重量有限会导致工件需按批量分别运输的实际情况,研究以最小化总完工时间为目标的带工件批量运输的加工、运输、装配三阶段装配集成调度问题(three-stage assembly integrated scheduling problem with job batch transportation,3sAISP_JBT)和求解算法.首先,分阶段建立3sAISP_JBT的数学模型;其次,分别提出求解运输、装配阶段对应子问题的先完工先运输(first completed first transported,FCFT)规则和先到先装配(first come first assembly,FCFA)规则,以降低求解3sAISP_JBT的整体计算复杂度;再次,提出一种融合多种规则的混合分布估计算法(hybrid estimation of distribution algorithm with rules,HEDA_R)求解3sAISP_JBT;最后,通过仿真实验和算法比较验证了所提出算法的有效性.
关键词:  三阶段  集成调度  EDA算法  规则  工件批量  运输
DOI:10.13195/j.kzyjc.2019.0307
分类号:TP391
基金项目:国家自然科学基金项目(51665025, 61963022, 61873328).
Rule-based hybrid EDA for three-stage assembly integrated scheduling problem with job batches transportation
DENG Chao1,QIAN Bin1,2,HU Rong2,WANG Ling3,SUN Zai-xing2
(1. School of Mechanical and Electronic Engineering,Kunming University of Science and Technology,Kunming 650500,China;2. School of Information Engineering and Automation,Kunming University of Science and Technology,Kunming650500,China;3. Department of Automation,Tsinghua University,Beijing100084,China)
Abstract:
In the existing research on the three-stage assembly integrated scheduling problem model, the transportation time of each job is simplified to the same constant at the transportation stage. In practical situations, however, jobs are supposed to be transported separately in batches, due to the limitation of the number and the load capacity of transport vehicles. This paper studies the three-stage assembly integrated scheduling problem with job batches transportation (3sAISP_JBT) and the corresponding algorithm. The criterion of 3sAISP_JBT is to minimize the maximum completion time. Firstly, a mathematical model of 3sAISP_JBT is formulated in stages. Secondly, in order to reduce the overall computational complexity of solving 3sAISP_JBT, the first completed first transported(FCFT) rule and the first come first assembly(FCFA) rule are proposed for the sub-problems in the transportation and assembly stages, respectively. Thirdly, a hybrid estimation of distribution algorithm with rules(hybrid estimation of distribution algorithm with rules,HEDA_R) is proposed to solve 3sAISP_JBT. Finally, simulation experiments and algorithm comparisons verify the effectiveness of the proposed algorithms.
Key words:  three-stage  integrated scheduling  estimation of distribution algorithm  rule  job batch  transportation

用微信扫一扫

用微信扫一扫