Font Size: a A A

Research On Optimization Of The Scheduling Of Ferry Buses With Time Window

Posted on:2019-01-08Degree:MasterType:Thesis
Country:ChinaCandidate:R AoFull Text:PDF
GTID:2322330569488269Subject:Computer technology
Abstract/Summary:PDF Full Text Request
In the large airports the remote boarding gates are used more frequently,and empty-loaded rate of the ferry bus is high,so the ferry bus scheduling problem,which belongs to airport ground operation scheduling problem,is one of the key factors of the airport efficiency.Heuristic algorithms are more often used in the existing researches,but it can only give relatively feasible solutions,and the efficiency is poor.Time window of the scheduling problem and empty-loaded rate are also less considered.In order to solve the ferry bus scheduling problem,this research obtains the shortest path and the least time of all the aprons through shortest path algorithms,and a ferry bus scheduling model with time window is proposed,and solved by Kuhn-Munktres algorithm to reduce the empty-loaded rate,which is of great importance for improving the airport operating efficiency.Firstly,Floyd algorithm is used to solve the shortest path of aprons,and the shortest path and least driving time are obtained by this method.Dijkstra algorithm is used to solve the shortest path model considering all the aprons' latitude and longitude and the occupied aprons,which obtains the shortest path and least driving time.The experimental results show that the proposed method can effectively generate the shortest path,and by this solution the ferry buses do not pass through the occupied aprons,which effectively avoids collisions between ferry buses and aircrafts.On the basis of the shortest path of all aprons,this paper establishes the ferry bus scheduling model with time window,to ensure that all ferry buses have the least empty-loaded time per passenger and serve the flights within time window.Combining with the flight plan data,the proposed model is equivalently converted into the bipartite graph optimal matching problem,and then the ferry bus scheduling plan is obtained through the Kuhn-Munktres algorithm.The experimental results show that the proposed model can effectively improve the efficiency of the ferry buses and reduce the empty-loaded rate and the total empty-loaded time,and in the meantime,it has a stronger robustness.
Keywords/Search Tags:Ferry Bus Scheduling, Empty-Loaded Rate, Time Window, Kuhn-Munktres Algorithm, Dijkstra Algorithm
PDF Full Text Request
Related items