Abstract
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.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Similar content being viewed by others
References
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)
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)
Jie, Z., Gao, J.: Research on problems in airport ground service scheduling. J. Hebei North Univ. 24(6), 60–62 (2016)
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)
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)
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)
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)
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)
Zhang, H., Fang, B., Hu, M.: An algorithm on task scheduling in structural parallel control mechanism. J. Softw. 12(5), 706–710 (2001)
Civil Aviation Administration of China. Civil aviation, Normal Operation Standard of Airline Flight (execution). Civil Aviation Bureau General Division, Beijing (2013)
Acknowledgments
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).
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2018 Springer International Publishing AG, part of Springer Nature
About this paper
Cite this paper
Wang, Z., Li, Y., Hei, X., Meng, H. (2018). Research on Airport Refueling Vehicle Scheduling Problem Based on Greedy Algorithm. In: Huang, DS., Bevilacqua, V., Premaratne, P., Gupta, P. (eds) Intelligent Computing Theories and Application. ICIC 2018. Lecture Notes in Computer Science(), vol 10954. Springer, Cham. https://doi.org/10.1007/978-3-319-95930-6_73
Download citation
DOI: https://doi.org/10.1007/978-3-319-95930-6_73
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-319-95929-0
Online ISBN: 978-3-319-95930-6
eBook Packages: Computer ScienceComputer Science (R0)