Production , Manufacturing and Logistics Energy-efficient rail guided vehicle routing for two-sided loading / unloading automated freight handling system

Rail-guided vehicles (RGVs) are widely employed in automated freight handling system (AFHS) to transport surging air cargo. Energy-efficient routing of such vehicles is of great interest for both financial and environmental sustainability. Given a multi-capacity RGV working on a linear track in AFHS, we consider its optimal routing under two-sided loading/unloading (TSLU) operations, in which energy consumption is minimized under conflict-avoidance and time window constraints. The energy consumption takes account of routing-dependent gross weight and dynamics of the RGV, and the conflict-avoidance constraints ensure conflict-free transport service under TSLU operations. The problem is formulated as a mixed-integer linear program, and solved by incorporating valid inequalities that exploit structural properties of the problem. The static problem model and solution approach are then integrated with a rolling-horizon approach to solve the dynamic routing problem where air cargo enters and departs from the system dynamically in time. Simulation results suggest that the proposed strategy is able to route an RGV to transport air cargo with an energy cost that is considerably lower than one of the most commonly used heuristic methods implemented in current practice.

[1]  Gerrit K. Janssens,et al.  Vehicle routing problems with loading constraints: state-of-the-art and future directions , 2015, OR Spectr..

[2]  Richard F. Hartl,et al.  A survey on pickup and delivery problems , 2008 .

[3]  Gabriel Lodewijks,et al.  Energy-aware control for automated container terminals using integrated flow shop scheduling and optimal control , 2014 .

[4]  Mauro Dell'Amico,et al.  Branch-and-cut for the pickup and delivery traveling salesman problem with FIFO loading , 2010, Comput. Oper. Res..

[5]  Gilbert Laporte,et al.  Static pickup and delivery problems: a classification scheme and survey , 2007 .

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

[7]  Henry Y. K. Lau,et al.  Joint scheduling of material handling equipment in automated air cargo terminals , 2006, Comput. Ind..

[8]  Gilbert Laporte,et al.  Variable Neighborhood Search for the Pickup and Delivery Traveling Salesman Problem with LIFO Loading , 2007, INFORMS J. Comput..

[9]  Petros A. Ioannou,et al.  Design, simulation, and evaluation of automated container terminals , 2002, IEEE Trans. Intell. Transp. Syst..

[10]  Vernon Ning Hsu,et al.  Scheduling Truck Arrivals at an Air Cargo Terminal , 2010 .

[11]  Gilbert Laporte,et al.  The pickup and delivery traveling salesman problem with first-in-first-out loading , 2009, Comput. Oper. Res..

[12]  Gilbert Laporte,et al.  Dynamic pickup and delivery problems , 2010, Eur. J. Oper. Res..

[13]  Leen Stougie,et al.  On-line single-server dial-a-ride problems , 2001, Theor. Comput. Sci..

[14]  Richard F. Hartl,et al.  A survey on dynamic and stochastic vehicle routing problems , 2016 .

[15]  Jianfeng Mao,et al.  Online dispatching of rail-guided vehicles in an automated air cargo terminal , 2012, 2012 IEEE International Conference on Industrial Engineering and Engineering Management.

[16]  Juan José Salazar González,et al.  A branch‐and‐cut algorithm for the pickup and delivery traveling salesman problem with LIFO loading , 2010, Networks.

[17]  Frank L. Lewis,et al.  Integrated Supervisory and Operational Control of a Warehouse With a Matrix-Based Approach , 2008, IEEE Transactions on Automation Science and Engineering.

[18]  Mauro Dell'Amico,et al.  A rolling horizon algorithm for auto-carrier transportation , 2015 .

[19]  Kees Jan Roodbergen,et al.  Storage yard operations in container terminals: Literature overview, trends, and research directions , 2014, Eur. J. Oper. Res..

[20]  Eugene L. Lawler,et al.  Traveling Salesman Problem , 2016 .

[21]  Michel Gendreau,et al.  A review of dynamic vehicle routing problems , 2013, Eur. J. Oper. Res..

[22]  Mikhail J. Atallah,et al.  Efficient Solutions to Some Transportation Problems with Applications to Minimizing Robot Arm Travel , 1988, SIAM J. Comput..

[23]  Chul E. Kim,et al.  Approximation algorithms for some routing problems , 1976, 17th Annual Symposium on Foundations of Computer Science (sfcs 1976).

[24]  Jianfeng Mao,et al.  Energy-efficient dispatching solution in an automated air cargo terminal , 2013, 2013 IEEE International Conference on Automation Science and Engineering (CASE).

[25]  Shaul P. Ladany,et al.  OPTIMAL ROUTING OF A SINGLE VEHICLE WITH LOADING AND UNLOADING CONSTRAINTS , 1984 .

[26]  Greg N. Frederickson,et al.  Nonpreemptive Ensemble Motion Planning on a Tree , 1993, J. Algorithms.

[27]  Richard F. Hartl,et al.  A survey on pickup and delivery problems , 2008 .

[28]  Bruce L. Golden,et al.  VEHICLE ROUTING: METHODS AND STUDIES , 1988 .

[29]  Gregory Gutin,et al.  The traveling salesman problem , 2006, Discret. Optim..

[30]  G. Laporte,et al.  A branch-and-cut algorithm for the pickup and delivery traveling salesman problem with LIFO loading , 2010 .

[31]  Nicolas Jozefowiez,et al.  The vehicle routing problem: Latest advances and new challenges , 2007 .

[32]  Bruce L. Golden,et al.  The vehicle routing problem : latest advances and new challenges , 2008 .

[33]  Jim Euchner Design , 2014, Catalysis from A to Z.

[34]  Manuel Iori,et al.  Routing problems with loading constraints , 2010 .

[35]  Jean-François Cordeau,et al.  A Branch-and-Cut Algorithm for the Dial-a-Ride Problem , 2006, Oper. Res..

[36]  Loon Ching Tang,et al.  Improving air cargo service through efficient order release , 2010, 2010 7th International Conference on Service Systems and Service Management.

[37]  Dih Jiun Guan,et al.  Routing a Vehicle of Capacity Greater than one , 1998, Discret. Appl. Math..

[38]  Jong Jae Lee,et al.  DISPATCHING RAIL-GUIDED VEHICLES AND SCHEDULING JOBS IN A FLEXIBLE MANUFACTURING SYSTEM , 1999 .

[39]  Egon Balas,et al.  The precedence-constrained asymmetric traveling salesman polytope , 1995, Math. Program..

[40]  Greg N. Frederickson,et al.  Preemptive Ensemble Motion Planning on a Tree , 1992, SIAM J. Comput..

[41]  Ulrich Derigs,et al.  Air cargo scheduling: integrated models and solution procedures , 2013, OR Spectr..

[42]  Gilbert Laporte,et al.  Recent Models and Algorithms for One-to-One Pickup and Delivery Problems , 2008 .

[43]  Kees Jan Roodbergen,et al.  A survey of literature on automated storage and retrieval systems , 2009, Eur. J. Oper. Res..

[44]  Chul E. Kim,et al.  Approximation Algorithms for Some Routing Problems , 1978, SIAM J. Comput..

[45]  Jean-François Cordeau,et al.  An Additive Branch-and-Bound Algorithm for the Pickup and Delivery Traveling Salesman Problem with LIFO or FIFO Loading , 2007, INFOR Inf. Syst. Oper. Res..

[46]  Sven Oliver Krumke,et al.  Online Dial-a-Ride Problems: Minimizing the Completion Time , 2000, STACS.