运筹与管理 ›› 2017, Vol. 26 ›› Issue (6): 35-40.DOI: 10.12005/orms.2017.0134

• 理论分析与方法探讨 • 上一篇    下一篇

求解机器人制造单元调度问题的化学反应优化算法

赵晓飞1, 2, 郭秀萍1   

  1. 1.西南交通大学 经济管理学院,四川 成都 610031;
    2.重庆文理学院 经济管理学院,重庆 永川 402160
  • 收稿日期:2015-12-20 出版日期:2017-06-25
  • 作者简介:赵晓飞(1980-),男,四川盐享人,博士研究生,研究方向:生产调度优化、智能算法;郭秀萍(1977-),女,内蒙古武川人,副教授,博士,博士生导师,研究方向:调度优化,智能算法。
  • 基金资助:
    国家自然科学资金资助项目(71471151,70901064,71201132,71090402);新世纪优秀人才支持计划(NCET-11-0709);教育部创新团队(IRT0860);重庆市教委科学技术项目(KJ1501133,KJ1711293);永川区自然科学基金资助项目(Ycstc, 2014nc8002)

Chemical Reaction Optimization Algorithm for SolvingRobotic Cell Scheduling Problem

ZHAO Xiao-fei1,2, GUO Xiu-ping1   

  1. 1.School of Economics and Management, Southwest Jiaotong University, Chengdu 610031, China;
    2.College of Economics and Management, Chongqing University of Art and Sciences, Yongchuan 402160, China
  • Received:2015-12-20 Online:2017-06-25

摘要: 针对多类型工件加工机器人制造单元调度NP难题,提出一种局部搜索的化学反应优化算法。该算法采用基于迭代次数的线性排序选择,维持解的多样性;构建紧后工件阻塞时间最小化交换的邻域结构加快收敛速度。此外,该算法主要参数由正交试验获得。通过求解随机产生的算例,仿真结果表明,化学反应优化算法优于遗传算法,提出算法较化学反应优化算法能更有效地搜索到更好解。

关键词: 机器人制造单元, 化学反应算法, 局部搜索

Abstract: A multiple part-type robotic cell scheduling problem is NP-hard. A chemical reaction optimization algorithm based on local search is proposed. In order to maintain the solution diversity, linear ranking selection based on iteration number is applied. Minimization of Blocking Time Close Part Swap is constructed for the sake of speeding up convergence. In addition, the main parameters of proposed algorithm are investigated based on Taguchi method of design-of-experiment, and a set of suitable parameters is suggested. Finally, the presented algorithm is compared to GA by solving randomly generated stances, and the results show that the algorithm is more effectively.

Key words: robotic cell, chemical reaction optimization, local search

中图分类号: