Integrated Planning Of Aircraft Fleet With Maintenance And Research On Adaptive Algorithm For Job Optimization

Operational aircraft need to carry out a series of complicated ground support operations before taking off.Due to the limited space and limited supporting resources,many aircrafts will compete for ground space and resources frequently.The missions of the aircrafts are always very compact,multi-batch of setting out to do battle circularly,with features of high strength,complexity,continuity,sudden and so on.Doing the ground support operations well for a large number of military fleet in a complex environment.To ensure the aircraft efficient and safe dispatch is the primary purpose of the logistics support system and also the fighting capacity of the entire combat system.It is of great significance to coordinate and plan the operations of the aircraft,reasonably allocate the resources,and shorten the processing time of the aircrafts.Doing so can improve the efficiency of the dispatching and the utilization rate of the resources,and also can reduce the life cycle cost of the aircrafts and keep high-strength battle.An optimization model with matching constraint,conflict constraint and timing constraint is established and a whole period adapted optimization algorithm is proposed to solve the problem of aircraft maintenance.The algorithm mainly solves two core problems.The first problem is to assign aircrafts to gates waiting for maintenance.The second problem is to process operations of each aircraft which entered the gate.A rule-based gate assignment algorithm is proposed for the allocation of gate for aircraft,which can balance the aircraft on each gate and determine the order of aircraft entering the gate.Furthermore,a score function is designed to help the aircraft to choose a better gate.The maintenance of the aircrafts can be abstracted as a hybrid job shop scheduling problem(HJSP),and a variable neighborhood search algorithm is proposed to optimize the process scheduling of the aircrafts.For the inherent structure of the scheduling problem,the algorithm adopts three kinds of neighborhood structures based on the insertion operation or the exchange operation.The three neighborhood structures optimize the aircraft maintenance time by different neighborhood movement.In addition,the performance of the proposed algorithm is evaluated by the experimental test,which proves the effectiveness of the algorithm.