Abstract
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.
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.
