IDEAS home Printed from https://ideas.repec.org/a/eee/soceps/v79y2022ics0038012121001130.html
   My bibliography  Save this article

Predicting success in United States Air Force pilot training using machine learning techniques

Author

Listed:
  • Jenkins, Phillip R.
  • Caballero, William N.
  • Hill, Raymond R.

Abstract

The chronic pilot shortage that has plagued the United States Air Force over the past three years poses a national-level problem that senior military members are working to overcome. Unfortunately, not all pilot candidates successfully complete the necessary training requirements to become fully qualified Air Force pilots, which wastes critical time and resources and only further exacerbates the pilot shortage problem. Therefore, it is important for the Air Force to carefully consider whom they select to attend pilot training. This research examines historical specialized undergraduate pilot training (SUPT) candidate data leveraging a variety of machine learning techniques to obtain insights on candidate success. Computational experimentation is performed to determine how selected machine learning techniques and their respective hyperparameters affect solution quality. Results reveal that the extremely randomized tree machine learning technique can achieve nearly 94% accuracy in predicting candidate success. Additional analysis indicates degree type and commissioning source are the most important features in determining candidate success. Ultimately, this research can inform the modification of future SUPT candidate selection criteria and other related Air Force personnel policies.

Suggested Citation

  • Jenkins, Phillip R. & Caballero, William N. & Hill, Raymond R., 2022. "Predicting success in United States Air Force pilot training using machine learning techniques," Socio-Economic Planning Sciences, Elsevier, vol. 79(C).
    • Handle: RePEc:eee:soceps:v:79:y:2022:i:c:s0038012121001130
    DOI: 10.1016/j.seps.2021.101121
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/S0038012121001130
    Download Restriction: Full text for ScienceDirect subscribers only
    File URL: https://libkey.io/10.1016/j.seps.2021.101121?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    As the access to this document is restricted, you may want to search for a different version of it.

    References listed on IDEAS

    as
    1. Phillip R. Jenkins & Matthew J. Robbins & Brian J. Lunday, 2021. "Approximate Dynamic Programming for Military Medical Evacuation Dispatching Policies," INFORMS Journal on Computing, INFORMS, vol. 33(1), pages 2-26, January.
    2. Bastian, Nathaniel D. & Lunday, Brian J. & Fisher, Christopher B. & Hall, Andrew O., 2020. "Models and methods for workforce planning under uncertainty: Optimizing U.S. Army cyber branch readiness and manning," Omega, Elsevier, vol. 92(C).
    Full references (including those not matched with items on IDEAS)

    Most related items

    These are the items that most often cite the same works as this one and are cited by the same works as this one.
    1. Turan, Hasan Hüseyin & Jalalvand, Fatemeh & Elsawah, Sondoss & Ryan, Michael J., 2022. "A joint problem of strategic workforce planning and fleet renewal: With an application in defense," European Journal of Operational Research, Elsevier, vol. 296(2), pages 615-634.
    2. Rempel, M. & Cai, J., 2021. "A review of approximate dynamic programming applications within military operations research," Operations Research Perspectives, Elsevier, vol. 8(C).
    3. Wang, Qingyi & Reed, Ashley & Nie, Xiaofeng, 2022. "Joint initial dispatching of official responders and registered volunteers during catastrophic mass-casualty incidents," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 159(C).
    4. Black, Ben & Ainslie, Russell & Dokka, Trivikram & Kirkbride, Christopher, 2023. "Distributionally robust resource planning under binomial demand intakes," European Journal of Operational Research, Elsevier, vol. 306(1), pages 227-242.
    5. Wang, Wei & Wang, Shuaian & Zhen, Lu & Qu, Xiaobo, 2022. "EMS location-allocation problem under uncertainties," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 168(C).
    6. Wu, Zhiying & Xu, Guoning & Chen, Qingxin & Mao, Ning, 2023. "Two stochastic optimization methods for shift design with uncertain demand," Omega, Elsevier, vol. 115(C).
    7. Liles, Joseph M. & Robbins, Matthew J. & Lunday, Brian J., 2023. "Improving defensive air battle management by solving a stochastic dynamic assignment problem via approximate dynamic programming," European Journal of Operational Research, Elsevier, vol. 305(3), pages 1435-1449.

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:eee:soceps:v:79:y:2022:i:c:s0038012121001130. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    If CitEc recognized a bibliographic reference but did not link an item in RePEc to it, you can help with this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Catherine Liu (email available below). General contact details of provider: http://www.elsevier.com/locate/seps .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.