scholarly journals Airline ground operations: Schedule recovery optimization approach with constrained resources

2021 ◽  
Vol 128 ◽  
pp. 103129
Author(s):  
Jan Evler ◽  
Ehsan Asadi ◽  
Henning Preis ◽  
Hartmut Fricke
Transport ◽  
2016 ◽  
Vol 31 (1) ◽  
pp. 76-83 ◽  
Author(s):  
Qian Zhang ◽  
Qingcheng Zeng ◽  
Hualong Yang

In container terminals, the planned berth schedules often have to be revised because of disruptions caused by severe weather, equipment failures, technical problems and other unforeseen events. In this paper, the problem of berth schedule recovery is addressed to reduce the influences caused by disruptions. A multi-objective, multi-stage model is developed considering the characteristics of different customers and the trade-off of all parties involved. An approach based on the lexicographic optimization is designed to solve the model. Numerical experiments are provided to illustrate the validity of the proposed Model A and algorithms. Results indicate that the designed Model A and algorithm can tackle the berth plan recovery problem efficiently because the beneficial trade-off among all parties involved are considered. In addition, it is more flexible and feasible with the aspect of practical applications considering that the objective order can be adjusted by decision makers.


2020 ◽  
Vol 54 (6) ◽  
pp. 1703-1722 ◽  
Author(s):  
Narges Soltani ◽  
Sebastián Lozano

In this paper, a new interactive multiobjective target setting approach based on lexicographic directional distance function (DDF) method is proposed. Lexicographic DDF computes efficient targets along a specified directional vector. The interactive multiobjective optimization approach consists in several iteration cycles in each of which the Decision Making Unit (DMU) is presented a fixed number of efficient targets computed corresponding to different directional vectors. If the DMU finds one of them promising, the directional vectors tried in the next iteration are generated close to the promising one, thus focusing the exploration of the efficient frontier on the promising area. In any iteration the DMU may choose to finish the exploration of the current region and restart the process to probe a new region. The interactive process ends when the DMU finds its most preferred solution (MPS).


2016 ◽  
Vol 18 (1) ◽  
pp. 114
Author(s):  
She Wei ◽  
Huang Huang ◽  
Guan Chunyun ◽  
Chen Fu ◽  
Chen Guanghui

Sign in / Sign up

Export Citation Format

Share Document