Abstract
This article studies a container drayage problem with flexible orders defined by using requiring and releasing attributes as a unified formulation of various order types. A determined-activities-on-vertex (DAOV) graph introduces a temporary vertex set to formulate different truck statuses. The problem is formulated as a mixed-integer nonlinear programming model based on the DAOV graph. Four strategies including a window partition based (WPB) strategy are presented and evaluated extensively to solve the problem. Results indicate that the WPB method could solve the problem effectively and efficiently. Furthermore, this method is robust considering the operating time biases compared to other algorithms.
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 callMore From: Transportation Research Part E: Logistics and Transportation Review
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.
