期刊文献+

基于改进粒子群算法的设备维修调度优化研究 被引量:2

Study on Optimization of Equipment Maintenance Scheduling Based on Modified Particle Swarm Optimization Algorithm
下载PDF
导出
摘要 为保障离散制造企业生产系统的连续性并降低其维修成本,构建了以维修时间最短和维修成本最低为目标的设备维修调度优化模型,并采用改进粒子群算法对模型进行求解。针对标准粒子群算法后期易陷入局部最优的缺点,采用指数函数递减的惯性权重形式来平衡算法的全局搜寻能力和局部搜寻能力,在速度更新公式和位置更新公式中分别引入速度扰动项和飞行时间因子以提高算法的收敛能力。以某机械公司生产车间设备维修调度为例,验证了该方法的有效性和适应性。 To ensure the continuity and reduce the maintenance cost of production system of discrete manufacturing enterprises,an equipment maintenance scheduling optimization model was built for minimizing maintenance time and maintenance cost,and the model was solved with modified particle swarm optimization algorithm.Considering the defect that it is liable to fall into local optimum with the particle swarm optimization algorithm in the later iteration,the discending inertia weight of exponential function was adopted for balancing the global search capability and local search capability of the algorithm,and velocity perturbation and flying time factor were introduced into the velocity updating formula and the location updating formula respectively to improve the convergence ability of the algorithm. The effectiveness and adaptability of the method have been proved via case study of equipment maintenance scheduling of production workshop of a machinery company.
出处 《浙江理工大学学报(自然科学版)》 2017年第6期859-865,共7页 Journal of Zhejiang Sci-Tech University(Natural Sciences)
关键词 设备维修 调度 多目标 改进粒子群算法 equipment maintenance scheduling multi-objective modified particle swarm optimization algorithm
  • 相关文献

参考文献5

二级参考文献54

  • 1王正元,岑凯辉,谭跃进.求解同顺序加工调度问题的一种启发式方法[J].计算机集成制造系统,2004,10(9):1124-1128. 被引量:5
  • 2王正元,谭跃进.三机床置换Flow-shop问题求解的一种新方法[J].系统工程学报,2004,19(6):577-582. 被引量:4
  • 3陈胜,赵林度.实时任务动态调度算法[J].数学的实践与认识,2006,36(2):66-72. 被引量:2
  • 4VILCOT G,BILLAUT J C.A tabu search and a genetic algorithm for solving a bicriteria general job shop scheduling problem[J].European Journal of Operational Research,2008,190(2):398-411.
  • 5GAO Jie,SUN Lin-yan,GENB M.A hybrid genetic and variable neighborhood descent algorithm for flexible job shop scheduling problems[J].Computers & Operations Research,2008,35(9):2892-2907.
  • 6BALAS E,LENSTRA J K,VAZACOPOULOS A.The one-machine problem with delayed precedence constraints and its use in job shop scheduling[J].Management Science,1995,41(1):94-109.
  • 7McCORMICK S T,PINEDO M L.Scheduling n independent job on uniform machines with both flow time and makespan objectives:a parametric analysis[J].Journal of Computing,1995(7):63-77.
  • 8ELKAMEL A,MOHINDRA A.A rolling horizon heuristic for reactive scheduling of batch process operation[J].Engineering Optimization,1999,31(6):763-792.
  • 9LIU Min,HAO Jing-hua,WU Cheng.A prediction based iterative decomposition algorithm for scheduling large-scale job shops[J].Mathematical and Computer Modeling,2008,47(3-4):411-421.
  • 10KELLY J D,ZYNGIER D.Hierarchical decomposition heuristic for scheduling:coordinated reasoning for decentralized and distributed decision-making problems[J].Computers and Chemical Enginee-ring,2008,32(11):2684-2705.

共引文献53

同被引文献42

引证文献2

二级引证文献6

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

内容加载中请稍等...
;
使用帮助 返回顶部