机场物流中加油车服务调度双目标优化研究

摘要

近年来随着航空运输业的不断发展,有效的机场地面服务成为保证航班正常运行的重要环节之一.针对机场加油车,提出了航班在机场过站期间加油车服务的调度优化问题,以至少需要的加油车数目和加油服务总开始时间最早为双目标建立整数规划模型,继而为了精确求解出该优化问题的Pareto前沿,开发出epsilon约束算法,最后通过算例来说明模型的可行性和算法的有效性.利用数学规划理论建模并开发精确求解算法,为机场资源优化研究提供重要参考.%With the continuous development of aviation transportation in recent years,the effective service on airport ground becomes one of the most important links for ensuring the normal operation of the flight.This paper studies a scheduling optimization problem by tanker truck service during the period of flights at the airport station,which is the needs for refueling vehicle number at least and the earliest refueling service start time are the double goals for optimizing.This paper puts forward an integer programming model of bi-objective optimization problem.Then to obtain the exact Pareto front,we develop an epsilon constraint method.At last,we use an example to demonstrate a possible application of our model as well as the algorithm.The purpose of this work is to obtain exact solution set for the bi-objective optimization problem,which can help practitioners in airport management to optimize critical resources.