Abstract
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.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
