• Corpus ID: 12618910

The Aircraft Routing with Air Refueling Problem: Exact and Greedy Approaches

  title={The Aircraft Routing with Air Refueling Problem: Exact and Greedy Approaches},
  author={Tanya E. Kannon and Sarah G. Nurre and Brian J. Lunday and Raymond R. Hill},
We consider the problem of finding the least cost route for an aircraft between a predetermined starting and target location while ensuring either enough fuel is on board or acquired en route via refueling for completion of the route. Other considerations of this problem include adherence to regulations for threat and no-fly zones and to regulations for the minimum fuel needed on an aircraft in the case of an emergency or flawed refueling operation. We prove that this problem is NP-hard… 

Figures and Tables from this paper

Air refueling tanker allocation based on a multi-objective zero-one integer programming model
To solve the problem of identifying the locations along an aircraft flight path at which to conduct aerial refueling, given a limited number of refueling stations, the problem is mathematically presented as an interval multi-objective zero-one integer programming model.
Improving the Air Mobility Command's Air Refueler Route Building Capabilities
Abstract : We consider the problem of routing an aircraft (receiver) from a starting location to a target and back to an ending location while maintaining a fuel level above a predetermined level
The aircraft routing problem with refueling
A mixed-integer linear program (MILP) that utilizes a combination of a network transformation and a formulation that creatively decouples refueling decisions from the nodes within the network and a dynamic program (DP) that applies a node-labeling approach based on a modification of Dijkstra's algorithm.
Air refueling optimisation for more agile and efficient military deployment operations
Strategic airlift is a crucial capability for any country that wants to protect its global interests around the world. Air refueling may offer more agile and efficient airlift capabilities by


Analysis of Fuel Consumption for an Aircraft Deployment with Multiple Aerial Refuelings
Abstract : The purpose of the research has been to derive an algorithm that finds optimal aerial refueling segments (non-instantaneous) for a single aircraft deployment while also accounting for
Algorithms for Routing an Unmanned Aerial Vehicle in the Presence of Refueling Depots
An approximation algorithm is developed for the single Unmanned Aerial Vehicle routing problem where there are multiple depots and the vehicle is allowed to refuel at any depot, and fast construction and improvement heuristics are proposed to solve the same.
Daily Aircraft Routing and Scheduling
Results show that significant profit improvement can be generated by solving the DARSP using the approach and that this can be obtained in a reasonable amount of CPU time.
Flight String Models for Aircraft Fleeting and Routing
A single model and solution approach is presented to solve simultaneously the fleet assignment and aircraft routing problems and is robust in that it can capture costs associated with aircraft connections and complicating constraints such as maintenance requirements.
A Green Vehicle Routing Problem
Applications of Operations Research in the Air Transport Industry
An overview of several important areas of operations research applications in the air transport industry, including the various stages of aircraft and crew schedule planning; revenue management; and the planning and operations of aviation infrastructure (airports and air traffic management).
A Formal Basis for the Heuristic Determination of Minimum Cost Paths
How heuristic information from the problem domain can be incorporated into a formal mathematical theory of graph searching is described and an optimality property of a class of search strategies is demonstrated.
Computers and Intractability: A Guide to the Theory of NP-Completeness
Horn formulae play a prominent role in artificial intelligence and logic programming. In this paper we investigate the problem of optimal compression of propositional Horn production rule knowledge
Network flows - theory, algorithms and applications
In-depth, self-contained treatments of shortest path, maximum flow, and minimum cost flow problems, including descriptions of polynomial-time algorithms for these core models are presented.
Management science
By outlining some basic ideas, this first of a series of six articles will demonstrate that efficient practice management is not only desirable, but also achievable.