Research on Airport Refueling Vehicle Scheduling Problem Based on Greedy Algorithm

  • Zhurong Wang
  • You Li
  • Xinhong Hei
  • Haining Meng
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 10954)


Aiming at airport refueling vehicle scheduling problem (ARVSP), the mathematical model with time window constraints is established. Firstly, considering the distance between refueling vehicle and flight, and in view of the influence of flight refueling service time windows on service flight selection, an evaluation function is designed to achieve the least total vehicle distance and the minimum required vehicle. And then based on the evaluation function, a greedy algorithm is proposed to solve airport refueling vehicle scheduling problem. Finally, the correctness and effectiveness of the proposed model are verified by a practical case of airport refueling vehicle scheduling problem.


Airport refueling vehicle scheduling Greedy algorithm Evaluation function 



The research presented is supported in part by the National Natural Science Foundation (NO:U1334211, 61773313,61602375), Shaanxi Province Key Research and Development Plan Project (NO:2015KTZDGY0104, 2017ZDXM-GY-098). The Key Laboratory Project of Shaanxi Provincial Department of Education (NO:17JS100).


  1. 1.
    Norin, A., Värbrand, P.: Scheduling de-icing vehicles within airport logistics: a heuristic algorithm and performance evaluation. J. Oper. Res. Soc. 63(8), 1116–1125 (2012)CrossRefGoogle Scholar
  2. 2.
    Cheung, A., Ip, W.H., Lu, D., Lai, C.L.: An aircraft service scheduling model using genetic algorithms. J. Manufact. Technol. Manage. 16(1), 109–119 (2005)CrossRefGoogle Scholar
  3. 3.
    Jie, Z., Gao, J.: Research on problems in airport ground service scheduling. J. Hebei North Univ. 24(6), 60–62 (2016)Google Scholar
  4. 4.
    Li, D., Li, M., Meng, X., et al.: A hyperheuristic approach for intercell scheduling with single processing machines and batch processing machines. IEEE Trans. Syst. Man Cybern. Syst. 45(2), 315–325 (2015)CrossRefGoogle Scholar
  5. 5.
    Chang, H.-C., Chen, Y.-P., Liu, T.-K., Chou, J.-H.: Solving the flexible job shop scheduling problem with makespan optimization by using a hybrid Taguchi-Genetic algorithm. IEEE Comput. Soc. 3, 1740–1754 (2015)Google Scholar
  6. 6.
    Liu, B., Wang, L., Jin, Y.-H.: An effective PSO-based memetic algorithm for flow shop scheduling. IEEE Trans. Syst. Man Cybern. Part B (Cybern.) 37(1), 18–27 (2007)CrossRefGoogle Scholar
  7. 7.
    Sarkar, U.K., Chakrabarti, P.P., Ghose, S., et al.: A simple 0.5-bounded greedy algorithm for the 0/1 knapsack problem. Inf. Process. Lett. 42(42), 173–177 (1992)MathSciNetCrossRefGoogle Scholar
  8. 8.
    Shao, W., Pi, D., Shao, Z.: A hybrid iterated greedy algorithm for the distributed no-wait flow shop scheduling problem. In: Evolutionary Computation, pp. 9–16. IEEE Computer Society (2017)Google Scholar
  9. 9.
    Zhang, H., Fang, B., Hu, M.: An algorithm on task scheduling in structural parallel control mechanism. J. Softw. 12(5), 706–710 (2001)Google Scholar
  10. 10.
    Civil Aviation Administration of China. Civil aviation, Normal Operation Standard of Airline Flight (execution). Civil Aviation Bureau General Division, Beijing (2013)Google Scholar

Copyright information

© Springer International Publishing AG, part of Springer Nature 2018

Authors and Affiliations

  • Zhurong Wang
    • 1
  • You Li
    • 1
  • Xinhong Hei
    • 1
  • Haining Meng
    • 1
  1. 1.School of Computer Science and EngineeringXi’an University of TechnologyXi’anChina

Personalised recommendations