期刊文献+

基于NP框架和仿真的MRO调度问题研究

Research on MRO Scheduling Problem Based on NP Framework and Simulation
下载PDF
导出
摘要 与传统的制造业调度问题相比,MRO(Maintenance, Repair and Overhaul,即航空维修,包括飞机维护、修理和翻修)系统面临更多的不确定性和复杂性,如拆分-修理-组装的三级结构、待维修件质量水平的不确定、物料匹配需求以及不确定工艺路线和工时。文中针对MRO调度问题建立以最小化期望权重延误时间为目标的混合整数线性规划模型,然而,使用传统的优化方法很难对此类NP-hard问题求得最优解,于是提出一种基于嵌套分割(NP)算法框架的混合算法NP/NEH/OCBA对该问题进行求解,最后,通过基于实际背景的算例验证了模型的可行性并对比分析了NP/NEH/OCBA算法与其它相似算法的优势。 MRO is the abbreviation of aviation maintenance,namely,maintenance,repair and overhaul.Compared to the traditional manufacturing system,several key characteristics make MRO scheduling problem different and difficult to handle,such as:disassembly-repair-assembly three-level structure,material matching requirements,stochastic routings and variable processing times.On the basis of a detailed analysis of the MRO scheduling problem,a mixed integer linear programming model with the goal of minimizing the expected total weighted tardiness is presented.However,it is difficult to obtain the optimal solution for this type of NP-hard problem by using traditional optimization methods.This paper develops a hybrid algorithm based on NP framework,namely,NP/NEH/OCBA to solve this problem.Finally,the characteristics of different algorithms are analyzed by the numerical examples based on the practical background.
作者 丁金想 褚恒之 栾世超 于光远 DING Jin-xiang;CHU Heng-zhi;LUAN Shi-chao;YU Guang-yuan(AVIC China Areo-Polytechnology Establishment,Beijing 100028;Beijing Hangxie Certification Center Co.,Ltd.,Beijing 100028,China)
出处 《物流工程与管理》 2024年第4期93-98,共6页 Logistics Engineering and Management
关键词 航空维修 不确定工艺路线 不确定工时 嵌套分割 仿真优化 aviation maintenance stochastic routings variable processing times nested partitions simulation optimization
  • 相关文献

参考文献4

二级参考文献25

  • 1Oarey M R, Johnson D S. Computers and Intractability: A Guide to the Theory of N-P-Completeness [M]. San Francisco, USA: Freeman WH, 1979.
  • 2Croes G A. A Method for Solving Traveling Salesman Problems [J]. Operations Research (S0030-364X), 1958, 6(6): 791-812.
  • 3Lin S. Computer Solutions to the Traveling Salesman Problem [J]. Bell System Technical Journal (S0005-8580), 1965, 44(10): 2245-2269.
  • 4Lin S, Kemighan B W. An Effective Heuristic Algorithm for the Traveling Salesman Problem [J]. Operations Research (S0030-364X), 1973, 21 (2): 498-516.
  • 5Olafsson S, Leyuan Shi. An Integrated Framework for Deterministic and Stochastic Optimization [C]// Proceedings of the 1997 Winter Simulation Conference. USA: IEEE, 1997: 358-365.
  • 6Liang P, Yuupeng Pan, Leyuan Sift. Nested Partitions Method for the Local Pickup and Delivery Problem [C]// Automation Science and Engineering, 2006. CASE '06. IEEE International Conference. USA: IEEE, 2006: 375-380.
  • 7Leyuan Sin, Hwang P Q. A Method for Real-time Scheduling Problems [C]//Object-Oriented Real-Time Dependable Systems, 1997. Proceedings. Third International Workshop. USA: IEEE, 1997:172-176.
  • 8Leyuan Shi. Nested Partition Method for Global Optimization [J]. Operations Research (S0030-364X), 2000, 48(3): 390-407.
  • 9GONG Wenbo, HO Yuchi, ZHAI Wengang. Stochastic comparison algorithm for discrete optimization with estimation [ J ]. SIAM Journal on Optimization, 1999,10(2):384-404.
  • 10YAN D, MUKAI H. Stochastic discrete optimization [ J ]. SIAM Journal Control and Optimization, 1992, 30(3) :594-612.

共引文献12

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

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