Solving the Aerial Fleet Refueling Problem Using Group Theoretic Tabu Search
The aerial fleet refueling problem (AFRP) is concerned with the efficient and effective use of a heterogeneous set of tanker (refueling) aircraft, located at diverse geographical locations, in the required operations associated with the deployment of a diverse fleet of military aircraft to a foreign theater of activity. Typically, the “receiving” aircraft must traverse great distances over large bodies of water and/or over other inhospitable environs where no ground based refueling resources exist. Lacking the ability to complete their flights without refueling, each receiving aircraft must be serviced one or more times during their deployment flights by means of in-flight refueling provided by one of the available tanker aircraft.
Abstract excerpt © Elsevier
Mathematical and Computer Modelling
Barnes, J. ., Wiley, V. ., Moore, J. ., & Ryer, D. . (2004). Solving the aerial fleet refueling problem using group theoretic tabu search. Mathematical and Computer Modelling, 39(6–8), 617–640. https://doi.org/10.1016/S0895-7177(04)90544-4