An integrated model and solution approach for fleet sizing with heterogeneous assets

Transportation Science

Volumn 39, Issue 1, 2005, Pages 87-103

  Wu, Peiling ^a,b   Hartman, Joseph C ^a   Wilson, George R ^a  

^a LEHIGH UNIVERSITY   (United States)

^b GENERAL MOTORS CORPORATION   (United States)

Author keywords

Benders decomposition; Fleet replacement; Fleet size and mix

Indexed keywords

ALGORITHMS; INTEGER PROGRAMMING; LAGRANGE MULTIPLIERS; LINEAR PROGRAMMING; MATHEMATICAL MODELS; OPTIMIZATION; TRUCKS;

BENDERS DECOMPOSITION; FLEET REPLACEMENT; FLEET SIZE-AND-MIX;

FLEET OPERATIONS;

EID: 16244368081     PISSN: 00411655     EISSN: None     Source Type: Journal    
DOI: 10.1287/trsc.1030.0050     Document Type: Article

References (30)

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