Font Size: a A A

The Modeling And Optimization Method Of Airlines Delay Recovery Problem Based Upon The Time-space Network

Posted on:2018-10-18Degree:MasterType:Thesis
Country:ChinaCandidate:Y X MaFull Text:PDF
GTID:2322330533960219Subject:Mathematics
Abstract/Summary:PDF Full Text Request
It is inevitable to encounter emergencies such as bad weather,aircraft failure and so on,when the plane in the sky.At this moment,the first priority for an airline is to solve problems with available resources in the shortest time and at the minimum cost.To solve those problems,we need to do the aircraft maintenance,rearrange the schedule of flights,and pacificate passengers.And rearrange the schedule of flights is the priority.In this paper,the author imitated instances constantly through building different models and study to seek the improvement plan.As a result,the author found the methods to shorten the time of schedule rearrangement so that the airline companies can lessen the costs.This paper briefly introduces the problem of aircrew rescheduling.Then,the new representing method is designed to construct a new Tabu search algorithm.The characteristic of this calculation is it analyzes the computational efficiency is higher with fast convergence speed and stable calculation result.The results show that the cost of waste can be reduced and better plans can be offered for airlines.Secondly,in this paper involves the aircrew recovery.While,most of them are aiming to single type of airplane,but in practice the airlines may invoke different types of aircraft to recover flights.In this paper,a time-space network mathematical model is built for aircrew recovery of multi-type of airplanes based upon time space network,and a heuristic binary search algorithm is proposed to solve the mathematical model.The feasibility and effectiveness of the proposed model and algorithm are verified.By the simulation results,it shows that it algorithm can offer an optimized recovery scheme in a relatively limited time.Finally minimum vertex cover and BP(Bethe-Peierls)equation algorithm were used to solve it.Results indicate: The usage of minimum vertex cover and BP equation algorithm accelerate the time of aircrew scheduling recovery.Then BP equations were used to transfer the nonlinear polynomial NP-hard problem into linear polynomial solving problem.The computational complexity was reduced and the physical methods were used to solve the mathematical model at the first time.That solves the shortcomings of the complex nonlinear programming formula successfully and creates a great deal of study space for furtherimprovement of aircrew scheduling.
Keywords/Search Tags:Tabu search algorithm, time-space network, Heuristic binary search algorithm, BP(Bethe-Peierls) equation, minimum vertex cover, energy function
PDF Full Text Request
Related items