A multi-stage monte carlo sampling based stochastic programming model for the dynamic vehicle allocation problem

Advances in Transportation Studies

Volumn , Issue 12, 2007, Pages 27-44

  Fan, W ^a   Machemehl, R B ^b  

^a UNIVERSITY OF TEXAS AT TYLER   (United States)

^b The University of Texas at Austin   (United States)

Author keywords

Dynamic vehicle allocation; Monte carlo sampling based method (MCSBM); Multistage; Simulation; Stochastic programming

Indexed keywords

DECISION MAKING UNDER UNCERTAINTY; MONTE CARLO SAMPLING; MULTI-STAGE STOCHASTIC PROGRAMMING; MULTISTAGE; OPTIMIZATION UNDER UNCERTAINTY; SIMULATION; STOCHASTIC PROGRAMMING MODEL; VEHICLE ALLOCATION;

ALGORITHMS; INDUSTRY; MONTE CARLO METHODS; TRUCKS;

STOCHASTIC PROGRAMMING;

EID: 58449117567     PISSN: 18245463     EISSN: None     Source Type: Journal    
DOI: None     Document Type: Article

References (20)

1. Beale, E.M., Dantzig, G.B. and Watson, R.D., 1986, A first order approach to a class of multi-time period stochastic programming problems, Mathematical Program Study 27, pp. 103-177.
2. Birge, J., 1985, Decomposition and partitioning techniques for multistage stochastic linear programs, Operations Research 33, pp. 989-1007.
3. Bookbinder, J.H. and Sethi, S.P., 1980, The dynamic transportation problem: a survey, Naval Research Logistic Quarterly 27, pp. 447-452.
4. Cheung, R.K. and Powell, W., SHAPE, 2000: A stochastic hybrid approximation procedure for twostage stochastic programs, Operations Research 48(1), pp. 73-79.
5. Cheung, R.K. and Chen, C-Y., 1998, A two-stage stochastic network model and solution methods for dynamic empty container allocation problem, Transportation Science 32, No. 2, pp. 142-162.
6. Dantzig, G., 1955, Linear programming under uncertainty, Management Science 1, pp. 197-206.
7. Dantzig, G. and Wolfe, P., 1960, Decomposition principle for linear programs, Operations Research 8, pp. 101-111.
8. Dejax, P.J. and Crainic, T.G., 1987, A review of empty flows and fleet management models in freight transportation, Transportation Science 21, pp. 227-247.
9. Fleten, S. E, Hoyland, K. and Wallace, S.W., 2002, The performance of stochastic dynamic and fixed mix portfolio models, European Journal of Operational Research 140, pp. 37-49.
10. Frantzeskakis, L.F. and Powell, W.B., 1990, A successive linear approximation procedure for stochastic, dynamic vehicle allocation problems, Transportation Science 24, pp. 40-57.
11. Hoyland, K. and Wallace, S.W., 2001, Generating scenario trees for multistage decision problems, Management Science 47, pp. 295-307, No. 2.
12. Jordan, W.C. and Turnquist, M.A., 1983, A stochastic, dynamic model for railroad car distribution, Transportation Science 17, pp. 123-145.
13. Kouwenberg, R., 2001, Scenario generation and stochastic programming models for asset liability management, European Journal of Operational Research 134, pp. 279-292.
14. Morton, D.P., 2002, Stochastic optimization, The University of Texas at Austin.
15. Powell, W.B., 1986, A stochastic model of the dynamic vehicle allocation problem, Transportation Science 20, pp. 117-129.
16. Wallace, S., 1986, Solving stochastic programs with network recourse, Networks 16, pp. 295-317.
17. Wets, R., 1983, Solving stochastic programs with simple recourse, Stochastics 10, pp. 219-242.
18. Wollmer, R., 1980, Two state linear programming under uncertainty with 0-1 integer first stage variables, Mathematical Programming 19, pp. 279-288.
19. Zenios, S.A., 1998, Dynamic models for fixed-income portfolio management under uncertainty, Journal of Economic Dynamics and Control 22, pp. 1517-1541.
20. Ziemba, W., 1970, Computational algorithms for convex stochastic programs with simple recourse, Operations Research 18, pp. 414-431.