Research On Scheduling Problem Of Airport Parking Service With Complex Constraints

With the rapid development of civil aviation,the company has launched a free airport docking service in response to the increasing pressure of competition.This service not only provides convenience for customers,but also enhances competitiveness of enterprises.Therefore,how to reduce operating costs is called for the key issues to be studied in this paper.The airport docking service includes both the Vehicle Routing Problem(VRP)and the Vehicle Scheduling for Air-passenger.This paper first introduces the research background and significance of the problem,and clarifies the main research content.Secondly,the principle and classification of the vehicle routing problem are introduced,and the related algorithms for solving the vehicle routing problem are compared.Then according to the characteristics of airport parking service,the vehicle path length and customer satisfaction are taken as the objective function,and the complex constraints are set on the model.Constraints include the maximum load of the vehicle,the time window requirements of the customer to the destination,and the time window requirements for the customer to return to the airport.Considering that not only some passengers get on the bus but also some passengers get off at the same destination,so the number of customers cannot exceed the vehicle limit after the vehicle passes through a certain location.Then the principle of ant colony algorithm and the selection of parameters are introduced,and the algorithm is improved accordingly.Based on the improved ant colony algorithm,the established model is analyzed and solved.The logic flow of the ant colony model is expounded.The feasibility of using the improved ant colony algorithm to solve the model is verified by an example simulation.This paper compares the relationship between the shortest path,customer satisfaction and the minimum number of vehicles.At the same time,it analyzes the influence of the relevant ant colony algorithm parameters on the solution model.Finally,it is verified by the Maldivian airport dispatch problem.The results of this paper show that the win-win situation of minimum transportation cost and high customer satisfaction can be obtained when the improved ant colony algorithm is used to solve the problem of airport parking service with complex constraints.