Flow Diversion Strategies for Routing in Integrated Automatic Shipment Handling Systems

The integrated automatic shipment handling systems (IASHSs) in large freight terminals and distribution centers are complex and increasingly congested due to the increase of freight volume. Shipments in IASHS need to be handled by a large amount of equipment. Thus, optimization-based tactical and operational planning models and methods for how the shipments are routed through the network of equipment in IASHS are required. To reduce the total shipment travel time, this paper studies a flow diversion strategy for routing shipments from their origins to their destinations, using multiple paths. This strategy is further leveraged to develop a destination reassignment strategy and time control strategy. We formulate these strategies as mathematical models and evaluate their effectiveness in static and adaptive implementations via numerical experiments. They are also compared to the classical shortest path oriented strategies.

[1]  Seyed M. R. Iravani,et al.  Structural Flexibility: A New Perspective on the Design of Manufacturing and Service Operations , 2005, Manag. Sci..

[2]  Joel M. Calabrese,et al.  Simultaneous determination of lot sizes and routing mix in job shops , 1991 .

[3]  J. Tanchoco,et al.  Design procedures and implementation of the segmented flow topology (SFT) for discrete material flow systems , 1997 .

[4]  Patrice Marcotte,et al.  A Strategic Flow Model of Traffic Assignment in Static Capacitated Networks , 2004, Oper. Res..

[5]  Sigrún Andradóttir,et al.  Server Assignment Policies for Maximizing the Steady-State Throughput of Finite Queueing Systems , 2001, Manag. Sci..

[6]  Narayan Raman.  Input control in job shops , 1995 .

[7]  Michel Gendreau,et al.  Diversion Issues in Real-Time Vehicle Dispatching , 2000, Transp. Sci..

[8]  David K. Smith.  Network Flows: Theory, Algorithms, and Applications , 1994 .

[9]  Marc Goetschalckx,et al.  Shared Storage Policies Based on the Duration Stay of Unit Loads , 1990 .

[10]  Noud Gademann,et al.  Optimal routing in an automated storage/retrieval system with dedicated storage , 1995 .

[11]  David Eppstein,et al.  Finding the k shortest paths , 1994, Proceedings 35th Annual Symposium on Foundations of Computer Science.

[12]  Omar Drissi-Kaïtouni,et al.  A Dynamic Traffic Assignment Model and a Solution Algorithm , 1992, Transp. Sci..

[13]  Leon F. McGinnis,et al.  T𝕙roughput Rate Maximization In Flexible Manufacturing Cells , 1988 .

[14]  Alexander Shapiro,et al.  Finding Optimal Material Release Times Using Simulation-Based Optimization , 1999 .

[15]  Stephen C. Graves,et al.  Storage-Retrieval Interleaving in Automatic Warehousing Systems , 1977 .

[16]  Michal Pióro,et al.  On efficient max-min fair routing algorithms , 2003, Proceedings of the Eighth IEEE Symposium on Computers and Communications. ISCC 2003.

[17]  Gerald L. Thompson,et al.  A Dynamic Space-Time Network Flow Model for City Traffic Congestion , 1987, Transp. Sci..

[18]  M. Brandeau,et al.  Note. Optimal Storage Assignment Policies for Automated Storage and Retrieval Systems with Stochastic Demands , 1998 .

[19]  Chris Hendrickson,et al.  Schedule Delay and Departure Time Decisions in a Deterministic Model , 1981 .

[20]  George G. Polak,et al.  Job release policy and printed circuit board assembly , 2003 .

[21]  Elsayed A. Elsayed,et al.  Order processing in automated storage/retrieval systems with due dates , 1996 .

[22]  Jung-Hoon Lee,et al.  A real-time traffic control scheme of multiple AGV systems for collision free minimum time motion: a routing table approach , 1998, IEEE Trans. Syst. Man Cybern. Part A.

[23]  Ali Yalcin,et al.  Dynamic routing and the performance of automated manufacturing cells , 2000 .