Research On Rolling Scheduling Method Of Cabin Cleaning Staff Vehicles Between Areas Of An Airport

During the COVID-19 epidemic,cabin cleaning has become one of the most important aspects of airport ground protection services.There are many corridors and aprons in large hub airports.In order to meet the cabin cleaning needs of flights parked in different areas,it is necessary to effectively allocate the limited cabin cleaning staff in the airport.Given the long distances between the corridors and the apron areas,inter-area transfers of cabin cleaning staff are performed by airport dispatchers calling staff vehicles.However,the current method of scheduling staff vehicles at airports is still the traditional manual scheduling,with low corresponding utilization rate of vehicles and untimely response.Therefore,there is an urgent need to design a more efficient and scientific scheduling method of cabin cleaning staff vehicle.Based on an airport field research report,this thesis first analyzes the business process of manually scheduling staff vehicles from the cause of scheduling demand,which is described as the transfer task of cabin cleaning staff between areas,and puts forward the staff vehicle rolling scheduling problem by combining the characteristics of tasks being issued at any time.Secondly,the rolling scheduling problem of staff vehicles is abstracted into an open-loop pickup and delivery vehicle routing problem with task time windows,and a multi-objective staff vehicle rolling scheduling model is constructed with vehicle travel cost minimization and task delay time minimization using constraints such as maximum vehicle loading capacity limit and transfer task time windows.Then,based on turning dynamic problems into static ones,the staff vehicle real-time scheduling problem is split and solved using the method of rolling scheduling.Two types of rolling scheduling trigger strategy have been proposed.And from them,urgent task trigger strategy and re-scheduling strategy are proposed.On this basis,the rolling scheduling algorithm is designed and solved by gurobi.Finally,the above rolling scheduling algorithm is simulated and experimented in the actual context of a large international hub airport.The results show that the algorithm can respond to the transfer task in a shorter time and effectively reduce the vehicle operation cost.By comparing the results of subsequent experiments,the optimal rolling scheduling strategy is selected under different task periods and target weights.In a conclusion,the method which can dynamically and flexibly respond to new tasks that continuously enter the airport will provide an effective solution to the scheduling problem of inter-area staff vehicles in large hub airports.