Flight Test Mission Reassignment for Civil Aircraft Based on Flexible Job Shop Problem

被引:0
作者
Mi, Yi [1 ]
Li, Aijun [1 ]
Song, Hao [2 ]
机构
[1] Northwestern Polytech Univ, Sch Automat, Xian, Shaanxi, Peoples R China
[2] Commercial Aircraft Corp China Ltd COMAC, Flight Test Ctr, Shanghai, Peoples R China
关键词
Flight Test Mission; Mission Assignment; F[!text type='JS']JS[!/text]P; PSO; Neighborhood Operations; Example Simulation; GENETIC ALGORITHM; HYBRID;
D O I
暂无
中图分类号
T [工业技术];
学科分类号
08 ;
摘要
Civil aircraft represent intricate technical systems, and their flight test is a system engineering process. This process is essential for verifying their compliance with airworthiness regulations and operational requirements. In this process, planning flight test missions is a type of combinatorial optimization problem. The solution gives an optimal allocation plan adhering to operational constraints. Assigning flight test missions for civil aircraft involves numerous uncertainties and very often, requires unforeseen adjustments. The original missions need to be reassigned due to these adjustments in a scientific way. In this paper, considering the scenarios that emerged during real civil aircraft flight tests, a multi-objective flight test mission planning model is established based on the Flexible Job Shop Problem (FJSP) model. The model is specifically tailored to the flight text mission reassignment. Examples of flight test scenarios that require mission reassignments are addressed using the FJSP model proposed in this paper and optimized using the Particle Swarm Optimization algorithm. Two rounds of initial population updates were conducted to obtain overall extreme values. The results verify the feasibility of obtaining a viable solution for the flight test mission assignment problem under complex constraints derived from real engineering requirements. These solutions can be used to address similar types of engineering problems.
引用
收藏
页码:1436 / 1447
页数:12
相关论文
共 26 条
[1]  
Abdellah Aissou, 2021, IAENG International Journal of Computer Science, V48, P96
[2]   Discrepancy search for the flexible job shop scheduling problem [J].
Ben Hmida, Abir ;
Haouari, Mohamed ;
Huguet, Marie-Jose ;
Lopez, Pierre .
COMPUTERS & OPERATIONS RESEARCH, 2010, 37 (12) :2192-2201
[3]  
Castillo O, 2012, ENG LET, V20, P61
[4]   Multi-resource shop scheduling with resource flexibility [J].
Dauzere-Peres, S ;
Roux, W ;
Lasserre, JB .
EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 1998, 107 (02) :289-305
[5]  
Eberhart R., 1995, Proceedings of the Sixth International Symposium on Micro Machine and Human Science, P39, DOI [DOI 10.1109/MHS.1995.494215, 10.1109/MHS.1995.494215]
[6]  
Feng Kang, 2014, Maintenance and Support Management for Type Certification Flight Test of Large Civil Aircraft
[7]   A hybrid of genetic algorithm and bottleneck shifting for multiobjective flexible job shop scheduling problems [J].
Gao, Jie ;
Gen, Mitsuo ;
Sun, Linyan ;
Zhao, Xiaohui .
COMPUTERS & INDUSTRIAL ENGINEERING, 2007, 53 (01) :149-162
[8]  
Gao Liang, 2012, Intelligent Algorithms and Applications for Flexible Job Shop Scheduling, P3
[9]  
Garey M. R., 1976, Mathematics of Operations Research, V1, P117, DOI 10.1287/moor.1.2.117
[10]  
Gonggui Chen, 2018, IAENG International Journal of Computer Science, V45, P255