Decentralized algorithms for vehicle routing in a stochastic time-varying environment
暂无分享,去创建一个
[1] Feller William,et al. An Introduction To Probability Theory And Its Applications , 1950 .
[2] J. Beardwood,et al. The shortest path through many points , 1959, Mathematical Proceedings of the Cambridge Philosophical Society.
[3] William Feller,et al. An Introduction to Probability Theory and Its Applications , 1967 .
[4] Nicos Christofides,et al. Technical Note - Bounds for the Travelling-Salesman Problem , 1972, Oper. Res..
[5] Brian W. Kernighan,et al. An Effective Heuristic Algorithm for the Traveling-Salesman Problem , 1973, Oper. Res..
[6] Richard C. Larson,et al. Urban Operations Research , 1981 .
[7] Nimrod Megiddo,et al. On the Complexity of Some Common Geometric Location Problems , 1984, SIAM J. Comput..
[8] J. Michael Steele,et al. Probabilistic and Worst Case Analyses of Classical Problems of Combinatorial Optimization in Euclidean Space , 1990, Math. Oper. Res..
[9] Dimitris Bertsimas,et al. A Stochastic and Dynamic Vehicle Routing Problem in the Euclidean Plane , 1991, Oper. Res..
[10] D. Bertsimas,et al. Stochastic and dynamic vehicle routing with general demand and interarrival time distributions , 1993, Advances in Applied Probability.
[11] Dimitris Bertsimas,et al. Stochastic and Dynamic Vehicle Routing in the Euclidean Plane with Multiple Capacitated Vehicles , 1993, Oper. Res..
[12] Said Salhi,et al. Facility Location: A Survey of Applications and Methods , 1996 .
[13] Martin,et al. Finite size and dimensional dependence in the Euclidean traveling salesman problem. , 1996, Physical review letters.
[14] A. Volgenant,et al. Facility location: a survey of applications and methods , 1996 .
[15] O. Bohigas,et al. The random link approximation for the Euclidean traveling salesman problem , 1996, cond-mat/9607080.
[16] David S. Johnson,et al. Asymptotic experimental analysis for the Held-Karp traveling salesman bound , 1996, SODA '96.
[17] Sanjeev Arora,et al. Nearly linear time approximation schemes for Euclidean TSP and other geometric problems , 1997, Proceedings 38th Annual Symposium on Foundations of Computer Science.
[18] Micha Sharir,et al. Efficient algorithms for geometric optimization , 1998, CSUR.
[19] R. Bixby,et al. On the Solution of Traveling Salesman Problems , 1998 .
[20] A. Regan,et al. AN ASYMPTOTICALLY OPTIMAL ALGORITHM FOR THE DYNAMIC TRAVELING REPAIR PROBLEM , 2002 .
[21] Jonathan P. How,et al. COORDINATION AND CONTROL OF MULTIPLE UAVs , 2002 .
[22] Timothy W. McLain,et al. Coordinated target assignment and intercept for unmanned air vehicles , 2002, Proceedings 2002 IEEE International Conference on Robotics and Automation (Cat. No.02CH37292).
[23] Nael B. Abu-Ghazaleh,et al. A taxonomy of wireless micro-sensor network models , 2002, MOCO.
[24] Kevin M. Passino,et al. Cooperative scheduling of tasks for networked uninhabited autonomous vehicles , 2003, 42nd IEEE International Conference on Decision and Control (IEEE Cat. No.03CH37475).
[25] Christos G. Cassandras,et al. Stability properties of a cooperative Receding Horizon controller , 2003, 42nd IEEE International Conference on Decision and Control (IEEE Cat. No.03CH37475).
[26] Corey Schumacher,et al. Task allocation for wide area search munitions with variable path length , 2003, Proceedings of the 2003 American Control Conference, 2003..
[27] Sonia Martínez,et al. Coverage control for mobile sensing networks , 2002, IEEE Transactions on Robotics and Automation.