Container drayage problem with flexible orders and its near real-time solution strategies

• Published in: Transportation research. Part E, Logistics and transportation review Vol. 61; pp. 235 - 251
• Main Authors: Zhang, Ruiyou, Lu, Jye-Chyi, Wang, Dingwei
• Format: Journal Article
• Language: English
• Published: Exeter Elsevier India Pvt Ltd 01.01.2014; Elsevier Sequoia S.A
• Subjects: Container drayage; Containerization; Graph theory; Internet of Things (IoT); Logistics; Mathematical problems; Multiple traveling salesman problem (m-TSP); Nonlinear programming; Re-optimization; Real time; Studies; Transportation terminals; Container drayage; Internet of Things (IoT); Re-optimization; Logistics; Multiple traveling salesman problem (m-TSP)
• ISSN: 1366-5545; 1878-5794
• DOI: 10.1016/j.tre.2013.11.009

•Attributes requiring and releasing formulate various container drayage order types.•Four strategies including a window partition based (WPB) strategy are presented.•The WPB method could solve the drayage problem effectively and efficiently.•The WPB method is relatively robust considering the operating time biases.•This methodology can save operating cost in container logistics substantially. 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.