Abstract
The scheduling problems for airport baggage transport vehicles are much influential to the quality of airport service. An optimal scheduling is very helpful to provide an efficient and safe airport operation and improve customers’ experience. To address the issue, in this paper, a novel genetic algorithm (GA) is proposed for the vehicles scheduling. To enhance the exploitation ability of GA, the algorithm is improved by considering both population diversity and population fitness simultaneously. In the proposed GA, a cooperative mechanism is employed to design the selection operation for genetic algorithm where both exploitation ability and exploration ability can be considered. Numerical experiments are conducted on widely used benchmarks, and several peer meta-heuristic algorithms are also used in performance comparison. To address the airport baggage transport vehicle scheduling problem, real data is adopted in the proposed algorithm for simulation. According to simulation results, the proposed algorithm is feasible and effective to obtain competitive performance and the airport baggage transport vehicles scheduling problem in is well addressed.
Similar content being viewed by others
Explore related subjects
Discover the latest articles, news and stories from top researchers in related subjects.References
Ansola PG, Higuera AG, Otamendi FJ, de las Morenas J (2014) Agent-based distributed control for improving complex resource scheduling: application to airport ground handling operations. IEEE Syst J 8(4):1145–1157
Arabas J, Michalewicz Z, Mulawka J (1994) GAVaPS—a genetic algorithm with varying population size. In: Evolutionary computation, in the proceedings of the first IEEE conference on computational intelligence, vol 1. IEEE Xplore, pp 73–78
Back T (1996) Evolutionary algorithms in theory and pratice. Oxford University Press, Oxford
Bevilacqua M, Ciarapica FEE, Mazzuto G, Paciarotti C (2015) The impact of business growth in the operation activities: a case study of aircraft ground handling operations. Prod Plan Control 26(7):564–587
Cai Z, Wang Y (2006) A multiobjective optimization-based evolutionary algorithm for constrained optimization. IEEE Trans Evol Comput 10:658–675
Castro JLD, Soma NY (2013) A constructive hybrid genetic algorithm for the flowshop scheduling problem. Int J Comput Sci Netw Secur 9:219–223
Clerc M (2006) Particle swarm optimization. ISTE Publishing, Amsterdam
de Rubeis T, Nardi I, Paoletti D et al (2016) Multi-year consumption analysis and innovative energy perspectives: the case study of Leonardo da Vinci International Airport of Rome. Energy Convers Manag 128:261–272
Dorigo M, Stutzle T (2004) Ant colony optimization. MIT Press, Cambridge
Dorigo M, Gambardella L, Middendorf M, Stutzle T (eds) (2002) Special section on ‘ant colony optimization’. In: IEEE transactaions on evolutionary computation, vol 6(4), pp 317–365
Eberhart R, Shi Y, Kennedy J (2001) Swarm intelligence. Morgan Kaufmann, San Mateo
Eiben AE, Smith J (2015) From evolutionary computation to the evolution of things. Nature 521(7553):476–482
Fan LL (2009) Research on vehicles scheduling problems in airport ground service. Master Thesis. Northeastern University, Shenyang
Goldberg D (1989) Genetic algorithms in search, optimization, and machine learning. Addison-Wesley, Reading
Guo W, Wang L, Ge SS, Ren H, Mao Y (2015) Drift analysis of mutation operations for biogeography-based optimization. Soft Comput 19:1881–1892
Holland JH (1975) Adaptation in natural and artificial systems. MIT Press, Cambridge, pp 211–247
Liao TW, Egbelu PJ, Sarker BR, Leu SS (2011) Metaheuristics for project and construction management—a state-of-the-art review. Autom Constr 20(5):491–505
Makhloof MA, Waheed ME, Badawi UAER (2014) Real-time aircraft turnaround operations manager. Prod Plan Control 25(1):2–25
Marintseva K, Yun G, Kachur S (2015) Resource allocation improvement in the tasks of airport ground handling operations. Aviation 19(1):7–13
Michalewicz Z (1992) Genetic algorithms + data structures = evolution programs. Springer, New York
Norin A, Yuan D, Granberg TA, Värbrand P (2012) Scheduling de-icing vehicles within airport logistics: a heuristic algorithm and performance evaluation. J Oper Res Soc 63(8):1116–1125
Oliver I, Smith D, Holland JR (1987) A study of permutation crossover operators on the traveling salesman problem. In: International conference on genetic algorithms, pp 224–230
Onwubolu G, Babu B (2004) New optimization techniques in engineering. Springer, Berlin
Liu H, Zhong F, Ouyang B, et al (2010) An approach for QoS-aware web service composition based on improved genetic algorithm. In: International conference on web information systems and mining. IEEE Xplore, pp 123–128
Padron S, Guimarans D, Ramos JJ (2016) A bi-objective approach for scheduling ground-handling vehicles in airports. Comput Oper Res 71:34–53
Parmee I (2001) Evolutionary and adaptive computing in engineering design. Springer, New York
Peteghem VV, Vanhoucke M (2010) A genetic algorithm for the preemptive and non-preemptive multi-mode resource-constrained project scheduling problem. Eur J Oper Res 201(2):409–418
Schmidt M, Paul A, Cole M, Ploetner KO (2016) Challenges for ground operations arising from aircraft concepts using alternative energy. J Air Transp Manag 56:107–117
Srinivas N, Deb K (1994) Multiobjective optimization using nondominated sorting in genetic algorithms. Evol Comput 2:221–248
Stegmiller M (2014) Detailed design of a multifunctional aircraft ground handling vehicle (Term Thesis). Technical University of Munich
Tang M, Pan S (2015) A hybrid genetic algorithm for the energy-efficient virtual machine placement problem in data centers. Neural Process Lett 41(2):211–221
Tao G, Michalewicz Z (1998) Inver-over operator for the TSP. In: Parallel problem solving from nature, vol V, pp 803–812
Tian YL, Liu H, Feng HC, Wu B, Wu GH (2013) Virtual simulation-based evaluation of ground handling for future aircraft concepts. J Aerosp Inf Syst 10(5):218–228
Tsai CC, Huang HC, Chan CK (2011) Parallel elite genetic algorithm and its application to global path planning for autonomous robot navigation. IEEE Trans Ind Electron 58(10):4813–4821
Vidal T, Crainic TG, Gendreau M et al (2013) A hybrid genetic algorithm with adaptive diversity management for a large class of vehicle routing problems with time-windows. Comput Oper Res 40(40):475–489
Wang L, Haikun T, Yu G (2015) A hybrid genetic algorithm for Job-Shop scheduling problem. In: Proceeding of the IEEE 28th Canadian conference on electrical and computer engineering. Halifax, Canada, May 3–6, pp 271–274
Yao X, Liu Y, Lin G (1999) Evolutionary programming made faster. IEEE Trans Evol Comput 3:82–102
Zhang G, Gao L, Shi Y (2011) An effective genetic algorithm for the flexible job-shop scheduling problem. ACM Trans Intell Syst Technol 38(4):3563–3573
Acknowledgements
This work is sponsored by the National Natural Science Foundation of China under Grant Nos. 71771176, 61503287, 61703406, and supported by Key Lab of Information Network Security, Ministry of Public Security and Key Laboratory of Intelligent Computing & Signal Processing, Ministry of Education.
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
About this article
Cite this article
Guo, W., Xu, P., Zhao, Z. et al. Scheduling for airport baggage transport vehicles based on diversity enhancement genetic algorithm. Nat Comput 19, 663–672 (2020). https://doi.org/10.1007/s11047-018-9703-0
Published:
Issue Date:
DOI: https://doi.org/10.1007/s11047-018-9703-0