A parallelizable dynamic fleet management model with random travel times

European Journal of Operational Research

Volumn 175, Issue 2, 2006, Pages 782-805

  Topaloglu, H ^a  

^a Department of Obstetrics Gynecology   (United States)

Author keywords

Approximate dynamic programming; Distributed decision making; Fleet management; Logistics; Transportation

Indexed keywords

DECISION MAKING; DYNAMIC PROGRAMMING; LOGISTICS; NUMERICAL METHODS; PROBLEM SOLVING; RANDOM PROCESSES; TRANSPORTATION;

APPROXIMATE DYNAMIC PROGRAMMING; DISTRIBUTED DECISION-MAKING; FLEET MANAGEMENT; STANDARD BENCHMARK METHODS;

FLEET OPERATIONS;

EID: 33748436406     PISSN: 03772217     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.ejor.2005.06.024     Document Type: Article

References (25)

1. Albayrak S., and Krallmann H. Artificial intelligence in industrial decision making, control and automation. In: Tzafestas S.G., and Verbruggen H.B. (Eds). Distributed Artificial Intelligence in Manufacturing Control (1995), Kluwer Academic Publishers, The Netherlands 247-294
2. Bellman R. Dynamic Programming (1957), Princeton University Press, Princeton
3. Bourbeau B., Crainic T.G., and Gendron B. Branch-and-bound parallelization strategies applied to depot location and container fleet management problem. Parallel Computing 26 1 (2000) 27-46
4. Carvalho T.A., and Powell W.B. A multiplier adjustment method for dynamic resource allocation problems. Transportation Science 34 (2000) 150-164
5. Chien T.W., Balakrishnan A., and Wong R.T. An integrated inventory allocation and vehicle routing problem. Transportation Science 23 2 (1989) 67-76
6. Crainic T., Gendreau M., and Dejax P. Dynamic and stochastic models for the allocation of empty containers. Operations Research 41 (1993) 102-126
7. Dantzig G., and Fulkerson D. Minimizing the number of tankers to meet a fixed schedule. Naval Research Logistics Quarterly 1 (1954) 217-222
8. Dejax P., and Crainic T. A review of empty flows and fleet management models in freight transportation. Transportation Science 21 (1987) 227-247
9. Frantzeskakis L., and Powell W.B. A successive linear approximation procedure for stochastic dynamic vehicle allocation problems. Transportation Science 24 1 (1990) 40-57
10. Fumero F., and Vercellis C. Synchronized development of production, inventory and distribution schedules. Transportation Science 33 3 (1999) 330-340
11. Godfrey G.A., and Powell W.B. An adaptive, dynamic programming algorithm for stochastic resource allocation problems I: Single period travel times. Transportation Science 36 1 (2002) 21-39
12. Godfrey G.A., and Powell W.B. An adaptive, dynamic programming algorithm for stochastic resource allocation problems II: Multi-period travel times. Transportation Science 36 1 (2002) 40-54
13. Hane C., Barnhart C., Johnson E., Marsten R., Nemhauser G., and Sigismondi G. The fleet assignment problem: Solving a large-scale integer program. Mathematical Programming 70 (1995) 211-232
14. Holmberg K., Joborn M., and Lundgren J.T. Improved empty freight car distribution. Transportation Science 32 (1998) 163-173
15. Kenyon A.S., and Morton D.P. Stochastic vehicle routing with random travel times. Transportation Science 37 1 (2003) 69-82
16. Kurose J.F., and Simha R. A microeconomic approach to optimal resource allocation in distributed computer systems. IEEE Transactions on Computers 38 5 (1989) 705-717
17. Laporte G., Louveaux F., and Mercure H. The vehicle routing problem with stochastic travel times. Transportation Science 26 3 (1992) 161-170
18. Powell W.B. A comparative review of alternative algorithms for the dynamic vehicle allocation problem. In: Golden B., and Assad A. (Eds). Vehicle Routing: Methods and Studies (1988), North Holland, Amsterdam 249-292
19. Powell W.B. A stochastic formulation of the dynamic assignment problem, with an application to truckload motor carriers. Transportation Science 30 3 (1996) 195-219
20. Powell W.B., Jaillet P., and Odoni A. Stochastic and dynamic networks and routing. In: Monma C., Magnanti T., and Ball M. (Eds). Handbook in Operations Research and Management Science. Volume on Networks (1995), North Holland, Amsterdam 141-295
21. Powell W.B., Ruszczynski A., and Topaloglu H. Learning algorithms for separable approximations of stochastic optimization problems. Mathematics of Operations Research 29 4 (2004) 814-836
22. Puterman M.L. Markov Decision Processes (1994), John Wiley and Sons Inc., New York
23. Topaloglu, H., Powell, W.B., to appear. Dynamic programming approximations for stochastic, time-staged integer multicommodity flow problems. INFORMS Journal on Computing.
24. Waldspurger C.A., Hogg T., Huberman B.A., Kephart J.O., and Stornetta W.S. Spawn: A distributed computational economy. IEEE Transactions on Software Engineering 18 2 (1992) 103-117
25. Wets R.J.B. Stochastic programs with fixed recourse: the equivalent deterministic problem. SIAM Review 16 (1974) 309-339