Abstract
Deployed US Navy aircraft carriers must stock a large number of spare parts to support the various types of aircraft embarked on the ship. The sparing policy determines the spares that will be stocked on the ship to keep the embarked aircraft ready to fly. Given a fleet of ten or more aircraft carriers and a cost of approximately 50 million dollars per carrier plus the cost of spares maintained in warehouses in the United States, the sparing problem constitutes a significant portion of the Navy’s resources. The objective of this work is to find a minimum-cost sparing policy that meets the readiness requirements of the embarked aircraft. This is a very large, nonlinear, integer optimization problem. The cost function is piecewise linear and convex while the constraint mapping is highly nonlinear. The distinguishing characteristics of this problem from an optimization viewpoint are that a large number of decision variables are required to be integer and that the nonlinear constraint functions are essentially “black box” functions; that is, they are very difficult (and expensive) to evaluate and their derivatives are not available. Moreover, they are not convex. Integer programming problems with a large number of variables are difficult to solve in general and most successful approaches to solving nonlinear integer problems have involved linear approximation and relaxation techniques that, because of the complexity of the constraint functions, are inappropriate for attacking this problem. We instead employ a pattern search method to each iteration of an interior point-type algorithm to solve the relaxed version of the problem. From the solution found by the pattern search on each interior point iteration, we begin another pattern search on the integer lattice to find a good integer solution. The best integer solution found across all interations is returned as the optimal solution. The pattern searches are distributed across a local area network of non-dedicated, heterogeneous computers in an office environment, thus, drastically reducing the time required to find the solution.
Similar content being viewed by others
References
D.P. Bertsekas and J.N. Tsitsiklis, Parallel and Distributed Computation: Numerical Methods” Athena Scientific: Belmont, 1997.
J.Burrows and J.Gardner, “PC ARROWs User’s Manual, Version1.0, VolumeII: PC ARROWs mathematical concepts and supporting theory,” Tech. Report 046, Navy Ships Parts Control Center, March 1994.
A.V. Fiacco and G.P. McCormick, Nonlinear Programming Sequential Unconstrained Minimization Techniques, SIAM, Philadelphia, 1990.
S.C. Graves, “A multi-echelon inventory model for a repairable item with one-for-one replenishment,” Management Science, vol. 31 no.10, pp. 1247–1256, 1985.
D.Gross, B.Gu, and R.M. Soland, “Iterative solution methods for obtaining the steady-state probability distributions of Markovian multi-echelon repairable item inventory systems,” Computers in Operations Research, vol. 20, no.8, pp. 817–828, 1993.
G.Hadley and T.M. Whitin, Analysis of Inventory Systems, Prentice-Hall: Engelwood Cliffs N.J., 1963.
P.D. Hough, T.G. Kolda, and V.J. Torczon, Asynchronous parallel search for nonlinear optimization, SAND 2000-8213, Sandia National Laboratory, January 2000.
N.A. Lynch, Distributed algorithms, Morgan Kaufmann Publishers, Inc: San Francisco, 1997.
O.L. Mangasarian, “Parallel gradient distribution in unconstrained optimization,” SIAM Journal on Control and Optimization vol. 33, no.6, pp. 1916–1925, 1995.
J.A. Muckstadt, “A model for a multi-item, multi-echelon, multi-indenture inventory system,” Management Science vol. 20, no.4, pp. 472–481, 1973.
R.H. Nickel, S.C. Goodwyn, W.Nunn, J.W. Tolle, and I.Mikolic-Torreira, A multi-indenture, multi-echelon readiness-based-sparing (MIMERBS) model, Research Memorandum 99-19, Center for Naval Analyses, April 1999.
R.H. Nickel, S.C. Goodwyn, J.W. Tolle, and I.Mikolic-Torreira, Summary report: Multi-echelon air wing readiness-based sparing, Research Memorandum D0000679.A2, Center for Naval Analyses, July 2000.
R.H. Nickel and J.Jondrow, An efficient, multi-echelon sparing approach, Research Memorandum 98-88, Center for Naval Analyses, September 1998.
W.Nunn and R.H. Nickel, Part replacement time analysis, Research Memorandum D0000743.A1, Center for Naval Analyses, April 2000.
J.D. Parsons and S.C. Goodwyn, Aviation logistics model, Research Contribution 576, Center for Naval Analyses, January 1988.
C.C. Sherbrooke, Optimal Inventory Modeling of Systems: Multi-Echelon Techniques, John Wiley & Sons: New York, 1992.
B.Wilkinson and M.Allen, Parallel Programming: Techniques and Applications using Networked Workstations and Parallel Computers, Prentice Hall, Upper Saddle River, 1999.
S.J. Wright, Primal-Dual Interior Point Methods, Philadelphia: SIAM, 1997.
Author information
Authors and Affiliations
Rights and permissions
About this article
Cite this article
Nickel, R.H., Mikolic-Torreira, I. & Tolle, J.W. Computing Aviation Sparing Policies: Solving a Large Nonlinear Integer Program. Comput Optim Applic 35, 109–126 (2006). https://doi.org/10.1007/s10589-006-6445-1
Received:
Revised:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s10589-006-6445-1