Abstract
The problem treated involves a mixed fleet of vehicles comprising two types of vehicles: K//1 tanker-type vehicles capable of refueling themselves and other vehicles, and K//2 nontanker vehicles incapable of refueling. The two groups of vehicles have different fuel capacities as well as different fuel consumption rates. The problem is to find the tanker refueling sequence that maximizes the range attainable for the K//2 nontankers. The problem is first formulated as a nonlinear mixed-integer program and reduced to a linear program for a fixed sequence which may be solved by a simple recursive procedure. It is proven that a 'unit refueling sequence' composed of one tanker refueling at each of K//1 refueling operations is optimal. In addition, the problem of designing the 'minimum fleet' required for a given set of K//2 nontankers to attain maximal range is resolved.
Original language | English |
---|---|
Pages (from-to) | 315-328 |
Number of pages | 14 |
Journal | Naval Research Logistics Quarterly |
Volume | 32 |
Issue number | 2 |
DOIs | |
State | Published - 1 Jan 1985 |
ASJC Scopus subject areas
- General Engineering