Abstract

Abstract This paper addresses the trailer routing problem at a maritime container terminal, where yard trailers are normally assigned to specific quay cranes until the work is finished. A more efficient trailer assignment method called “dynamic routing” is proposed. A heuristic was developed and a wide variety of computational experiments were conducted. The results of the experiments demonstrated that the dynamic routing reduces travel distance and generates substantial savings in the trailer fleet size and overall cost (15% reduction). The paper's contribution to the literature is the development of a new routing scheme achieving container handling cost savings for a terminal.

Full Text
Paper version not known

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 call

Disclaimer: 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.