 Optimal refueling strategies for a mixed‐vehicle fleetAbraham Mehrez and Helman I. Stern Naval Research Logistics Quarterly, 1985, vol. 32, issue 2, 315-328 Abstract: The problem treated here involves a mixed fleet of vehicles comprising two types of vehicles: K1 tanker‐type vehicles capable of refueling themselves and other vehicles, and K2 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 K2 nontankers. A tanker refueling sequence is a partition of the tankers into m subsets (2 ≤ m ≤ K1). A given sequence of the partition provides a realization of the number of tankers participating in each successive refueling operation. 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 K1 refueling operations is optimal. In addition, the problem of designing the “minimum fleet” (minimum number of tankers) required for a given set of K2 nontankers to attain maximal range is resolved. Also studied are extensions to the problem with a constraint on the number of refueling operations, different nontanker recovery base geometry, and refueling on the return trip. Date: 1985 Downloads: (external link) Related works: Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text Persistent link: https://EconPapers.repec.org/RePEc:wly:navlog:v:32:y:1985:i:2:p:315-328 Access Statistics for this article More articles in Naval Research Logistics Quarterly from John Wiley & Sons |
Is your work missing from RePEc? Here is how to contribute.
Questions or problems? Check the EconPapers FAQ or send mail to .
EconPapers is hosted by the
School of Business at Örebro University.