Real-time fleet management at eCourier Ltd

Operations Research/ Computer Science Interfaces Series

Volumn 38, Issue , 2007, Pages 219-238

  Attanasio, Andrea ^a   Bregman, Jay ^b   Ghiani, Gianpaolo ^c   Manni, Emanuele ^c  

^a UNIVERSITY OF CALABRIA   (Italy)

^b eCourier Ltd   (United Kingdom)

^c UNIVERSITY OF SALENTO   (Italy)

Author keywords

Courier industry; Global positioning system; Job allocation; Real time fleet management; Same day courier; Travel time forecasting

Indexed keywords

EID: 84888581634     PISSN: 1387666X     EISSN: None     Source Type: Book Series    
DOI: 10.1007/978-0-387-71722-7_10     Document Type: Article

References (33)

1. Bent, R. W., and Van Hentenryck, P., 2004, Scenario-based planning for partially dynamic vehicle routing with stochastic customers, Operations Research. 52: 977-987.
2. Bertsekas, D. P., 1995, Dynamic Programming and Optimal Control, Athena Scientific, Belmont, MA.
3. Bertsimas, D. J., 1992, A vehicle routing problem with stochastic demand, Operations Research. 40: 574-585.
4. Bertsimas, D. J., and van Ryzin, G., 1991, A stochastic and dynamic vehicle routing problem in the Euclidean plane, Operations Research. 39: 601-615.
5. Bertsimas, D. J., and van Ryzin, G., 1993, Stochastic and dynamic vehicle routing problem in the Euclidean plane with multiple capacitated vehicles, Operations Research. 41: 60-76.
6. Bertsimas, D. J., and Simchi-Levi, D., 1996, A new generation of vehicle routing research: robust algorithms, addressing uncertainty, Operations Research. 44: 286-303.
7. Birge, J. R., and Louveaux, F. V., 1997, Introduction to Stochastic Programming, Springer-Verlag, New York.
8. Branke, J., Middendorf, M., Noeth, G., and Dessouky, M., 2005, Waiting strategies for dynamic vehicle routing, Transportation Science. 39: 298-312.
9. Cathey, F. W., and Dailey, D. J., 2003, A prescription for transit arrival/departure prediction using automatic vehicle location data, Transportation Research Part C: Emerging Technologies. 11: 241-264.
10. Chen, Z. L., and Xu, H., 2006, Dynamic column generation for dynamic vehicle routing with time windows, Transportation Science. 40(1): 74-88.
11. Crainic, T. G., Toulouse, M., and Gendreau, M., 1997, Towards a taxonomy of parallel tabu search algorithm, INFORMS Journal on Computing. 9: 61-72.
12. Desaulniers, G., Desrosiers, J., Erdmann, A., Solomon, M. M., and Soumis, F., 2001, VRP with pickup and delivery, in: The vehicle routing problem, P. Toth and D. Vigo eds., SIAM Monographs on Discrete Mathematics and Applications, SIAM Publishing, Philadelphia, pp. 225-242.
13. Fabri, A., and Recht, P., 2006, On dynamic pickup and delivery vehicle routing with several time windows and waiting times, Transportation Research Part B: Methodological. 40(4): 335-350.
14. Gendreau, M., Laporte, G., and Séguin, R., 1996, Stochastic vehicle routing, European Journal of Operational Research. 88: 3-12.
15. Gendreau, M., and Potvin, J. Y., 1998, Dynamic routing and dispatching, in: Fleet Management and logistics, T. G. Crainic and G. Laporte eds., Kluwer, Boston, pp. 115-126.
16. Ghiani, G., Guerriero, F., Laporte, G., and Musmanno, R., 2003, Real-time vehicle routing: solution concepts, algorithms and parallel computing strategies, European Journal of Operational Research. 151: 1-11.
17. Hertz, A., Laporte, G., and Nanchen-Hugo, P., 1999, Improvement procedures for the undirected rural postman problem, INFORMS Journal on Computing. 11: 53-62.
18. Jaillet, P., 1988, A priori solution of the traveling salesman problem in which a random subset of customers are visited, Operations Research. 36: 929-936.
19. Jaillet, P., and Odoni, A. R., 1988, The probabilistic vehicle routing problem, in: Vehicle Routing: Methods and Studies, B. L. Golden and A. A. Assad eds., North-Holland, Amsterdam, The Netherlands, pp. 293-318.
20. Mitrović-Minić, S., and Laporte, G., 2004, Waiting strategies for the dynamic pickup and delivery problem with time windows, Transportation Research Part B: Methodological. 38: 635-655.
21. Montgomery, D. C., Johnson, L. A., and Gardiner, J. S., 1990, Forecasting and Time Series Analysis, 2nd ed., McGraw-Hill, New York.
22. Papastavrou, J. D., 1996, A stochastic and dynamic routing policy using branching processes with state dependent migration, European Journal of Operational Research. 95: 167-177.
23. Powell, W. B., Sheffi, Y., Nickerson, K. S., Butterbaugh, K., and Atherton, S., 1988, Maximizing profits for North American Van Lines' truckload division: a new framework for pricing and operations, Interfaces. 18(1): 21-41.
24. Powell, W. B., Jaillet, P., and Odoni, A. R., 1995, Stochastic and dynamic networks and routing, in: Handbook in OR and MS, Volume 8: Network Routing, M. Ball, T. Magnanti, C. Monma, and G. Nemhauser eds., Elsevier Science, Amsterdam, pp. 141-295.
25. Powell, W. B., 1996, A stochastic formulation of the dynamic assignment problem, with an application to truckload motor carriers, Transportation Science. 30: 195-219.
26. Psaraftis, H. N., 1988, Dynamic vehicle routing problems, in: Vehicle Routing: Methods and Studies, B. L. Golden and A. A. Assad eds., North-Holland, Amsterdam, pp. 223-248.
27. Psaraftis, H. N, 1995, Dynamic vehicle routing: status and prospects, Annals of Operations Research. 61: 143-164.
28. Puterman, M. L., 1994, Markov Decision Processes, Wiley, New York.
29. Resende, M., Pardalos, P., and Eksioglu, S., 1999, Parallel metaheuristics for combinatorial optimization, Journal of Heuristics. 3: 44-62.
30. Solomon, M. M., 1987, Algorithms for the vehicle-routing and scheduling problems with time window constraints, Operations Research. 35(2): 254-265.
31. Sennott, L. I., 1999, Stochastic Dynamic Programming and the Control of Queueing Systems, Wiley, New York.
32. Swihart, M. R., and Papastavrou, J. D., 1999, A stochastic and dynamic model for the singlevehicle pick-up and delivery problem, European Journal of Operational Research. 114: 447-464.
33. Thomas, B. W., and White III, C. C., 2004, Anticipatory route selection, Transportation Science. 38: 473-487.