A benders decomposition approach for an integrated airline schedule design and fleet assignment problem with flight retiming, schedule balance, and demand recapture

2011 ◽  
Vol 210 (1) ◽  
pp. 213-244 ◽  
Author(s):  
Hanif D. Sherali ◽  
Ki-Hwan Bae ◽  
Mohamed Haouari
Keyword(s):  
Assignment Problem ◽  
Benders Decomposition ◽  
Fleet Assignment ◽  
Decomposition Approach ◽  
Schedule Design ◽  
Fleet Assignment Problem ◽  
Airline Schedule

scholarly journals Variable Neighborhood Search to solve an airline fleet sizing and fleet assignment problem

2019 ◽  
Vol 37 ◽  
pp. 258-265
Author(s):  
Slavica Dožić ◽  
Ana Jelović ◽  
Milica Kalić ◽  
Mirjana Čangalović
Keyword(s):  
Assignment Problem ◽  
Variable Neighborhood Search ◽  
Neighborhood Search ◽  
Fleet Assignment ◽  
Fleet Sizing ◽  
Fleet Assignment Problem ◽  
Airline Fleet

scholarly journals Study on Fleet Assignment Problem Model and Algorithm

2013 ◽  
Vol 2013 ◽  
pp. 1-5
Author(s):  
Yaohua Li ◽  
Na Tan
Keyword(s):  
Assignment Problem ◽  
Production Data ◽  
Revenue Maximization ◽  
Mutation Operator ◽  
Fleet Assignment ◽  
Problem Model ◽  
Passenger Flows ◽  
Fleet Assignment Problem ◽  
The Difference ◽  
Crossover And Mutation

The Fleet Assignment Problem (FAP) of aircraft scheduling in airlines is studied, and the optimization model of FAP is proposed. The objective function of this model is revenue maximization, and it considers comprehensively the difference of scheduled flights and aircraft models in flight areas and mean passenger flows. In order to solve the model, a self-adapting genetic algorithm is supposed to solve the model, which uses natural number coding, adjusts dynamically crossover and mutation operator probability, and adopts intelligent heuristic adjusting to quicken optimization pace. The simulation with production data of an airline shows that the model and algorithms suggested in this paper are feasible and have a good application value.

Sign in / Sign up

Export Citation Format

Share Document