An Integrated Model and Solution Approach for Fleet Sizing with Heterogeneous Assets

References

• Aardal K., Larsson T. A Benders decomposition based heuristic for the hierarchical production planning problem. Eur. J. Oper. Res. (1990) 45:4–14Crossref, Google Scholar
• Bazaraa M. S., Goode J. J. A survey of various tactics for generating Lagrangean multipliers in the context of Lagrangean duality. Eur. J. Oper. Res. (1979) 3:322–338Crossref, Google Scholar
• Bazaraa M. S., Sherali H. D. Benders partitioning scheme applied to a new formulation of the quadratic assignment problem. Naval Res. Logist. Quart. (1980) 27:29–41Crossref, Google Scholar
• Beaujon G. J., Turnquist M. A. A model for fleet sizing and vehicle allocation. Transportation Sci. (1991) 25:19–45Link, Google Scholar
• Benders J. F. Partitioning procedures for solving mixed-variables programming problems. Numerische Mathematik (1962) 4:238–252Crossref, Google Scholar
• Birge J. R., Louveaux F.Stochastic Programming (1997) (Springer-Verlag, New York) Google Scholar
• Chand S., McClurg T., Ward J. A model for parallel machine replacement with capacity expansion. Eur. J. Oper. Res. (2000) 121:519–531Crossref, Google Scholar
• Chen Z. Solution algorithm for the parallel replacement problem under economy scale. Naval Res. Logist. (1998) 45:279–295Crossref, Google Scholar
• Dejax P. J., Crainic T. G. A review of empty flows and fleet management models in freight transportation. Transportation Sci. (1987) 21:227–247Link, Google Scholar
• Fisher M. L. An applications oriented guide to Lagrangean relaxation. Interfaces (1985) 15:10–21Link, Google Scholar
• Geoffrion A. M., Graves G. W. Multicommodity distribution system design by Benders decomposition. Management Sci. (1974) 20:822–844Link, Google Scholar
• Graves S. C. Using Lagrangean techniques to solve hierarchical production planning problems. Management Sci. (1982) 28:260–275Link, Google Scholar
• Hartman J. C. The parallel replacement problem with demand and capital budgeting constraints. Naval Res. Logist. (2000) 47:40–56Crossref, Google Scholar
• Holmberg K. On using approximations of the Benders master problem. Eur. J. Oper. Res. (1994) 77:111–125Crossref, Google Scholar
• Holmberg K., Hellstrand J. Solving the uncapacitated network design problem by a Lagrangean heuristic and branch-and-bound. Oper. Res. (1998) 46:247–259Link, Google Scholar
• ILOG. CPLEX 6.5 Reference manual. (1999) Google Scholar
• Jones P., Zydiak J., Hopp W. Parallel machine replacement. Naval Res. Logist. (1991) 38:351–365Crossref, Google Scholar
• Jordan W. C., Turnquist M. A. A stochastic, dynamic network model for railroad car distribution. Transportation Sci. (1983) 17:123–145Link, Google Scholar
• Karabakal N., Lohmann J., Bean J. Parallel replacement under capital rationing constraints. Management Sci. (1994) 40:305–319Link, Google Scholar
• Klincewicz J. G., Luss H., Pilcher M. G. Fleet size planning when outside carrier services are available. Transportation Sci. (1990) 24:169–182Link, Google Scholar
• Magnanti T. L., Wong R. T. Accelerating Benders decomposition: Algorithmic enhancement and model selection criteria. Oper. Res. (1981) 29:464–484Link, Google Scholar
• Minoux M., Cottle R. W., Kelmanson M. L., Korte B. Subgradient optimization and Benders decomposition for large scale programming. Mathematical Programming (1984) ( North-Holland, Amsterdam, The Netherlands)Google Scholar
• Powell W. B., Carvalho T. A. Dynamic control of logistics queueing networks for large-scale fleet management. Transportation Sci. (1998) 32:90–109Link, Google Scholar
• Rajagopalan S. Capacity expansion and replacement analysis. Oper. Res. (1998) 46:846–857Link, Google Scholar
• Reeves C. R.Modern Heuristic Techniques for Combinatorial Optimization (1993) (Wiley and Sons, New York) Google Scholar
• Sherali H., Tuncbilek C. Static and dynamic time-space strategic models and algorithms for multilevel rail-car fleet management. Management Sci. (1997) 43:235–250Link, Google Scholar
• Sherali H., Al-Yakoob S. M., Hassan M. M. Fleet management models and algorithms for oil-tanker routing and scheduling problems. IIE Trans. (1999) 31:395–406Crossref, Google Scholar
• Van Roy T. J. A cross decomposition algorithm for capacitated facility location. Oper. Res. (1986) 34:145–163Link, Google Scholar
• Van Slyke R., Wets R. J.-B. L-shaped linear programs with application to optimal control and stochastic programming. SIAM J. Appl. Math. (1969) 17:638–663Crossref, Google Scholar
• Wu P., Hartman J. C., Wilson G. R. A demand-shifting feasibility algorithm for Benders decomposition. Eur. J. Oper. Res.148(3):570–583Crossref, Google Scholar