论文部分内容阅读
近年来随着航空运输业的不断发展,有效的机场地面服务成为保证航班正常运行的重要环节之一。针对机场加油车,提出了航班在机场过站期间加油车服务的调度优化问题,以至少需要的加油车数目和加油服务总开始时间最早为双目标建立整数规划模型,继而为了精确求解出该优化问题的Pareto前沿,开发出epsilon约束算法,最后通过算例来说明模型的可行性和算法的有效性。利用数学规划理论建模并开发精确求解算法,为机场资源优化研究提供重要参考。
In recent years, with the continuous development of air transport industry, effective airport ground service has become an important part of ensuring the normal operation of flights. In view of the airport refueling vehicles, the scheduling optimization problem of refueling service during the flight over the airport is proposed. At least the number of refueling vehicles and the total starting time of refueling services are the earliest to set up an integer programming model for the dual objectives. Then, in order to solve the optimization problem accurately, The problem of Pareto frontier, developed epsilon constraint algorithm, and finally by an example to illustrate the feasibility of the model and the effectiveness of the algorithm. Mathematical programming theory is used to model and develop accurate algorithms to provide an important reference for airport resources optimization research.