Dynamic vehicle routing with moving demands - part i: low speed demands and high arrival rates

Proceedings of the American Control Conference

Volumn , Issue , 2009, Pages 1454-1459

  Bopardikar, Shaunak D ^a   Smith, Stephen L ^a   Bullo, Francesco ^a   Hespanha, João P ^a  

^a UNIVERSITY OF CALIFORNIA   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ARRIVAL RATES; CONSTANT FACTORS; DYNAMIC VEHICLE ROUTING; DYNAMIC VEHICLE ROUTING PROBLEMS; FIXED SPEED; HAMILTONIAN PATH; LIMITING CASE; LOW SPEED; POISSON PROCESS; PROBLEM PARAMETERS; SPEED RATIO; SUFFICIENT CONDITIONS;

POISSON DISTRIBUTION; SPEED;

VEHICLES;

EID: 70449633232     PISSN: 07431619     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/ACC.2009.5160544     Document Type: Conference Paper

References (15)

1. D. J. Bertsimas and G. J. van Ryzin, "A stochastic and dynamic vehicle routing problem in the Euclidean plane," Operations Research, vol. 39, pp. 601-615, 1991.
2. -, "Stochastic and dynamic vehicle routing in the Euclidean plane with multiple capacitated vehicles," Operations Research, vol. 41, no. 1, pp. 60-76, 1993.
3. J. D. Papastavrou, "A stochastic and dynamic routing policy using branching processes with state dependent immigration," European Journal of Operational Research, vol. 95, pp. 167-177, 1996.
4. E. Frazzoli and F. Bullo, "Decentralized algorithms for vehicle routing in a stochastic time-varying environment," in IEEE Conf. on Decision and Control, Paradise Island, Bahamas, Dec. 2004, pp. 3357-3363.
5. B. Korte and J. Vygen, Combinatorial Optimization: Theory and Algorithms, 3rd ed., ser. Algorithmics and Combinatorics. Springer, 2005, vol. 21.
6. P. Chalasani and R. Motwani, "Approximating capacitated routing and delivery problems," SIAM Journal on Computing, vol. 28, no. 6, pp. 2133-2149, 1999.
7. M. Hammar and B. J. Nilsson, "Approximation results for kinetic variants of TSP," Discrete and Computational Geometry, vol. 27, no. 4, pp. 635-651, 2002.
8. C. S. Helvig, G. Robins, and A. Zelikovsky, "The moving-target traveling salesman problem," Journal of Algorithms, vol. 49, no. 1, pp. 153-174, 2003.
9. Y. Asahiro, E. Miyano, and S. Shimoirisa, "Grasp and delivery for moving objects on broken lines," Theory of Computing Systems, vol. 42, no. 3, pp. 289-305, 2008.
10. S. L. Smith, S. D. Bopardikar, F. Bullo, and J. P. Hespanha, "Dynamic vehicle routing with moving demands - Part II: High speed demands or low arrival rates," in American Control Conference, St. Louis, MO, Jun. 2009, to appear.
11. S. D. Bopardikar, S. L. Smith, F. Bullo, and J. P. Hespanha, "Dynamic vehicle routing for translating demands: Stability analysis and receding-horizon policies," IEEE Transactions on Automatic Control, Mar. 2009, submitted.
12. R. Isaacs, Differential games. John Wiley, 1965.
13. L. Few, "The shortest path and the shortest road through n points in a region," Mathematika, vol. 2, pp. 141-144, 1955.
14. J. Beardwood, J. Halton, and J. Hammersly, "The shortest path through many points," in Proceedings of the Cambridge Philosophy Society, vol. 55, 1959, pp. 299-327.
15. G. Percus and O. C. Martin, "Finite size and dimensional dependence of the Euclidean traveling salesman problem," Physical Review Letters, vol. 76, no. 8, pp. 1188-1191, 1996