Dynamic Vehicle Routing with Moving Demands - Part I: Low speed demands and high arrival rates

被引:3
作者
Bopardikar, Shaunak D. [1 ]
Smith, Stephen L. [1 ]
Bullo, Francesco [1 ]
Hespanha, Joao P. [1 ]
机构
[1] Univ Calif Santa Barbara, Ctr Control Dynam Syst & Computat, Santa Barbara, CA 93106 USA
来源
2009 AMERICAN CONTROL CONFERENCE, VOLS 1-9 | 2009年
关键词
TRAVELING SALESMAN PROBLEM; EUCLIDEAN PLANE; DELIVERY;
D O I
10.1109/ACC.2009.5160544
中图分类号
TP [自动化技术、计算机技术];
学科分类号
0812 ;
摘要
We introduce a dynamic vehicle routing problem in which demands arrive uniformly on a segment and via a temporal Poisson process. Upon arrival, the demands translate perpendicular to the segment in a given direction and with a fixed speed. A service vehicle, with speed greater than that of the demands, seeks to serve these translating demands. For the existence of any stabilizing policy, we determine a necessary condition on the arrival rate of the demands in terms of the problem parameters: (i) the speed ratio between the demand and service vehicle, and (ii) the length of the segment on which demands arrive. Next, we propose a novel policy for the vehicle that involves servicing the outstanding demands as per a translational minimum Hamiltonian path (TMHP) through the moving demands. We derive a sufficient condition on the arrival rate of the demands for stability of the TMHP-based policy, in terms of the problem parameters. We show that in the limiting case in which the demands move much slower than the service vehicle, the necessary and the sufficient conditions on the arrival rate are within a constant factor.
引用
收藏
页码:1454 / 1459
页数:6
相关论文
共 15 条
[1]   Grasp and delivery for moving objects on broken lines [J].
Asahiro, Yuichi ;
Miyano, Eiji ;
Shimoirisa, Shinichi .
THEORY OF COMPUTING SYSTEMS, 2008, 42 (03) :289-305
[2]  
Beardwood J., 1959, P CAMB PHIL SOC, V55, P299, DOI DOI 10.1017/S0305004100034095
[3]   STOCHASTIC AND DYNAMIC VEHICLE-ROUTING IN THE EUCLIDEAN PLANE WITH MULTIPLE CAPACITATED VEHICLES [J].
BERTSIMAS, DJ ;
VANRYZIN, G .
OPERATIONS RESEARCH, 1993, 41 (01) :60-76
[4]   A STOCHASTIC AND DYNAMIC VEHICLE-ROUTING PROBLEM IN THE EUCLIDEAN PLANE [J].
BERTSIMAS, DJ ;
VANRYZIN, G .
OPERATIONS RESEARCH, 1991, 39 (04) :601-615
[5]  
BOPARDIKAR SD, 2009, IEEE T AUT CON UNPUB
[6]   Approximating capacitated routing and delivery problems [J].
Chalasani, P ;
Motwani, R .
SIAM JOURNAL ON COMPUTING, 1999, 28 (06) :2133-2149
[7]  
Few L., 1955, Mathematika, V2, P141, DOI DOI 10.1112/S0025579300000784
[8]   Decentralized algorithms for vehicle routing in a stochastic time-varying environment [J].
Frazzoli, E ;
Bullo, F .
2004 43RD IEEE CONFERENCE ON DECISION AND CONTROL (CDC), VOLS 1-5, 2004, :3357-3363
[9]   Approximation results for kinetic variants of TSP [J].
Hammar, M ;
Nilsson, BJ .
DISCRETE & COMPUTATIONAL GEOMETRY, 2002, 27 (04) :635-651
[10]   The moving-target traveling salesman problem [J].
Helvig, CS ;
Robins, G ;
Zelikovsky, A .
JOURNAL OF ALGORITHMS-COGNITION INFORMATICS AND LOGIC, 2003, 49 (01) :153-174