scholarly journals CONTROL MODEL FOR GROUND CREW SCHEDULING PROBLEM AT SMALL AIRPORTS: CASE OF SERBIA

Transport ◽  
2021 ◽  
Vol 36 (3) ◽  
pp. 235-245
Author(s):  
Lena Đorđević Milutinović ◽  
Dragana Makajić-Nikolić ◽  
Slobodan Antić ◽  
Marija Živić ◽  
Andrej Lisec

Present-day airline industry is quite a competitive field and crew scheduling represents one of the crucial problems due to significant impact on the airline’s cost. The crew scheduling problem is based on the assignment of crew members to operate different tasks of route. The main goal of this paper is to provide an analysis and a solution to one of the biggest problems detected on a small airport in the Serbia - the problem of ground crew scheduling. The paper presents the main characteristics, goals and limitations of a real-life problem identified at this small airport. In order to solve the problem, we developed a dynamic discrete simulation model. The model is developed in a spreadsheet environment of Microsoft Excel. Some of the main limitations found in the development of the model are strong constraints and multiple goals. The model presented in the paper is designed as a useful management tool for smaller airports and is aimed at the improvement of operative processes.

2015 ◽  
Vol 2015 ◽  
pp. 1-14 ◽  
Author(s):  
Cuiying Song ◽  
Wei Guan ◽  
Jihui Ma ◽  
Tao Liu

This paper presents an improved genetic algorithm (GA) with gene recombination for bus crew-scheduling problem in bus company. Unlike existing methods that rely on designing a fixed potential shift set by software, our new method does not need such a potential shift set information. In our method, satisfied shifts are generated through gene recombination in genetic algorithm. We conduct extensive studies based on real-life instances from Beijing Bus Group. Compared with results generated by the current manual method, ant colony algorithm, and CPLEX, computational results show that our algorithms demonstrated very good computational performances. In our tests, the number of the maximum reducing shifts can be beyond 30, especially when trip number is very large. The high relative percentage deviation demonstrated the effectiveness of the algorithm proposed.


2019 ◽  
Vol 70 (11) ◽  
pp. 1965-1982 ◽  
Author(s):  
Shahrzad M. Pour ◽  
Kourosh Marjani Rasmussen ◽  
John H. Drake ◽  
Edmund K. Burke

Sign in / Sign up

Export Citation Format

Share Document