Online Disjoint Vehicle Routing with Application to AGV Routing

[1]  M. Desrochers,et al.  A Generalized Permanent Labelling Algorithm For The Shortest Path Problem With Time Windows , 1988 .

[2]  D. R. Fulkerson,et al.  Constructing Maximal Dynamic Flows from Static Flows , 1958 .

[3]  J. M. A. Tanchoco,et al.  Conflict-free shortest-time bidirectional AGV routeing , 1991 .

[4]  James T. Lin,et al.  Deadlock prediction and avoidance based on Petri nets for zone-control automated guided vehicle systems , 1995 .

[5]  Robert E. Tarjan,et al.  Amortized efficiency of list update and paging rules , 1985, CACM.

[6]  George L. Nemhauser,et al.  Handbooks in operations research and management science , 1989 .

[7]  Nils J. Nilsson,et al.  A Formal Basis for the Heuristic Determination of Minimum Cost Paths , 1968, IEEE Trans. Syst. Sci. Cybern..

[8]  Kap Hwan Kim,et al.  Deadlock prevention for automated guided vehicles in automated container terminals , 2006, OR Spectr..

[9]  Gerhard J. Woeginger,et al.  Minimum-cost strong network orientation problems: Classification, complexity, and algorithms , 1999, Networks.

[10]  Wei-Chang Yeh,et al.  Deadlock prediction and avoidance for zone-control AGVS , 1998 .

[11]  Ekkehard Köhler,et al.  Dynamic Routing of Automated Guided Vehicles in Real-time , 2008 .

[12]  N. G. F. Sancho,et al.  Shortest Path Problems with Time Windows on Nodes and Arcs , 1994 .

[13]  Alexander Schrijver,et al.  Combinatorial optimization. Polyhedra and efficiency. , 2003 .

[14]  Amos Fiat,et al.  Lower bounds for on-line graph problems with application to on-line circuit and optical routing , 1996, STOC '96.

[15]  Rolf H. Möhring,et al.  Conflict-free Real-time AGV Routing , 2004, OR.

[16]  Jie Gao,et al.  Trade-Offs between Stretch Factor and Load-Balancing Ratio in Routing on Growth-Restricted Graphs , 2009, IEEE Transactions on Parallel and Distributed Systems.

[17]  Rajan Batta,et al.  Developing Conflict-Free Routes for Automated Guided Vehicles , 1993, Oper. Res..

[18]  Amos Fiat,et al.  On-line routing of virtual circuits with applications to load balancing and machine scheduling , 1997, JACM.

[19]  Allan Borodin,et al.  Online computation and competitive analysis , 1998 .

[20]  Hyunbo Cho,et al.  Graph-theoretic deadlock detection and resolution for flexible manufacturing systems , 1995, IEEE Trans. Robotics Autom..

[21]  J. Desrosiers,et al.  Methods for routing with time windows , 1986 .

[22]  M. Desrochers,et al.  A reoptimization algorithm for the shortest path problem with time windows , 1988 .

[23]  Gerhard J. Woeginger,et al.  Semi-online scheduling with decreasing job sizes , 2000, Oper. Res. Lett..

[24]  MengChu Zhou,et al.  Resource-oriented Petri nets for deadlock avoidance in automated manufacturing , 2000, Proceedings 2000 ICRA. Millennium Conference. IEEE International Conference on Robotics and Automation. Symposia Proceedings (Cat. No.00CH37065).

[25]  Mam Riess Jones.  Color Coding , 1962, Human factors.

[26]  Yuval Rabani,et al.  On-line admission control and circuit routing for high performance computing and communication , 1994, Proceedings 35th Annual Symposium on Foundations of Computer Science.

[27]  Iris F. A. Vis,et al.  Survey of research in the design and control of automated guided vehicle systems , 2006, Eur. J. Oper. Res..

[28]  Rolf H. Möhring,et al.  Traffic Networks and Flows over Time , 2009, Algorithmics of Large and Complex Networks.

[29]  F. Beaufils,et al.  FRANCE , 1979, The Lancet.

[30]  Leon J. Osterweil,et al.  On Two Problems in the Generation of Program Test Paths , 1976, IEEE Transactions on Software Engineering.

[31]  R. Möhring,et al.  Conflict-free Vehicle Routing : Load Balancing and Deadlock Prevention , 2008 .

[32]  Nicos Christofides,et al.  An algorithm for the resource constrained shortest path problem , 1989, Networks.