IJMSC Vol. 12, No. 1, 8 Feb. 2026
Cover page and Table of Contents: PDF (size: 1059KB)
PDF (1059KB), PP.29-41
Views: 0 Downloads: 0
SP Technique, Multi-stage, Scenario Tree Method, Recourse Problem, Numerical Simulation
This paper explores the use of stochastic optimization techniques to address the aircraft allocation problem under uncertain passenger demand. The proposed stochastic allocation model successfully meets the study’s objectives by demonstrating how uncertainty in passenger demand can be effectively incorporated into aircraft assignment decisions through a two-stage stochastic programming framework. Simulation results across multiple demand scenarios show that the model provides stable and adaptive allocations that minimize total cost while maintaining service quality, even under high variability. Incorporating the simple recourse approach enables post-decision flexibility, reducing penalties for unmet demand, and the use of Geometric Brownian Motion (GBM) offers a realistic representation of continuous demand fluctuations over time. These outcomes confirm the model’s practical value in bridging deterministic planning and real-time decision environments. While future research will focus on extending the model to a Markov Decision Process (MDP) framework and integrating real-time data streams, the current results establish a solid foundation by quantifying how uncertainty directly impacts fleet utilization, cost efficiency, and service reliability.
Md. Mehedi Hasan, Mohammad Babul Hasan, Sujon Chandra Sutradhar, "A Simple Recourse Strategy for Efficient Allocation of Aircrafts for Satisfying Uncertain Passenger Demands", International Journal of Mathematical Sciences and Computing(IJMSC), Vol.12, No.1, pp. 29-41, 2026. DOI: 10.5815/ijmsc.2026.01.03
[1]Abara, J., 1989. Applying Integer Linear Programming to the Fleet Assignment Problem. Interfaces (Providence). 19, 20–28.
[2]Bae, K.H., 2010. Integrated Airline Operations: Schedule Design, Fleet Assignment, Aircraft Routing, and Crew Scheduling.
[3]Barnhart, C., Boland, N.L., Clarke, L.W., Johnson, E.L., Nemhauser, G.L., Shenoi, R.G., 1998. Flight String Models for Aircraft Fleeting and Routing. Transp. Sci. 32, 208–220.
[4]Basdere, M., Bilge, U., 2014. Operational aircraft maintenance routing problem with remaining time consideration. Eur. J. Oper. Res. 235, 315- 328.
[5]G. Dantzig: Linear Programming and Extensions, Princeton University Press, 1963, pp.572-597.
[6]College of Civil Aviation, Nanjing University of Aeronautics and Astronautics, Nanjing 211106, China.
[7]National Key Laboratory of Air Traffic Flow Management, Nanjing 210016, China.
[8]Department of Industrial Systems Engineering and Management, National University of Singapore, Singapore 119077, Singapore.
[9]Practice and Theory of Automated Timetabling III, Third International Conference, PATAT 2000, Konstanz, Germany, August 16-18, 2000, Selected Papers.
[10]Wei, K.; Vaze, V.; Jacquillat, A. Airline timetable development and fleet assignment incorporating passenger choice. Transp. Sci. 2020, 54, 139–163. [CrossRef]
[11]Rushmeier, R.A.; Kontogiorgis, S.A. Advances in the optimization of airline fleet assignment. Transp. Sci. 1997, 31, 159–169. [CrossRef].
[12]Abara, J., 1989. Applying integer linear programming to the fleet assignment problem. Interface 19, 20–28.
[13]Berge, M., Hopperstad, C., 1993. Demand driven dispatch: A method of dynamic aircraft capacity assignment models and algorithms. Operations Research 41, 153–168.
[14]Shao, S., Sherali, H.D., Haouari, M., 2015. A Novel Model and Decomposition Approach for the Integrated Airline Fleet Assignment, Aircraft Routing, and Crew Pairing Problem.
[15]Transp. Sci. Sherali, H.D., Bae, K.-H., Haouari, M., 2013. An Integrated Approach for Airline Flight Selection and Timing, Fleet Assignment, and Aircraft Routing. Transp. Sci.