Energy-efficient dispatching solution in an automated air cargo terminal

Energy-efficient dispatching of rail-guided vehicles (RGVs) is demanded in an automated air cargo terminal. The problem aims to minimize total energy cost of operating RGVs for transporting the cargos subject to real time constraints. This work focuses on solving an optimal dispatching problem with a single RGV having multiple capacity. A mixed-integer linear programming (MILP) model is developed for the problem, which takes account of various constraints, including loading, deadlock avoidance, precedence, time window and capacity constraints. Difficulties of identifying and representing the constraints are revealed. Computational studies performed on randomly generated instances are used to validate the model and demonstrate challenges of solving the problem to a large scale.

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

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

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

[4]  J. A. Pacheco.  Heurístico para los problemas de rutas con carga y descarga en sistemas LIFO , 1997 .

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

[6]  Joaquín A. Pacheco Bonrostro.  Heurístico para los problemas de rutas con carga y descarga en sistemas LIFO , 1997 .

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

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

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

[10]  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.

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

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

[13]  Luca Quadrifoglio,et al.  Dispatch Problem of Automated Guided Vehicles for Serving Tandem Lift Quay Crane , 2012 .

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

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

[16]  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..

[17]  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.

[18]  Loo Hay Lee,et al.  Vehicle dispatching algorithms for container transshipment hubs , 2010, OR Spectr..

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

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

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

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