![Sample our Engineering & Technology journals, sign in here to start your access, latest two full volumes FREE to you for 14 days]({"type":"image" , "src" : "/sda/5933/TOC-Subject-Sample-2021-Engineering-Tech.jpg"})
This paper introduces an application of a Multi-Resource Routing Problem (MRRP) in drayage operations. Drayage involves the movement of loaded and empty equipment between rail yards, shippers, consignees, and equipment yards. The problem of routing and scheduling drayage movements is modeled as an MRRP with flexible tasks, since the origins and destinations of some movements can be chosen from a set of possible nodes. The complexities added by routing choice are studied, along with the impact of these complexities on problem formulation. The solution approach developed to solve this problem includes column generation embedded in a branch-and-bound framework. Using this approach, efficient operating plans are designed to coordinate independent drayage operations in the Chicago region.
Acknowledgements
The author would like to thank the Associate Editor and the anonymous reviewers for their valuable comments and Peter Francis and Guangming Zhang for help with the computational work. This research has been supported by grant DMI-0348622 from the National Science Foundation.
