Table of Contents Author Guidelines Submit a Manuscript
Mathematical Problems in Engineering
Volume 2015, Article ID 134763, 7 pages
Research Article

A Combinatorial Benders’ Cuts Algorithm for the Local Container Drayage Problem

1Department of Transportation Engineering, College of Civil Engineering, Shenzhen University, Shenzhen 518060, China
2Research Center for Modern Logistics, Graduate School at Shenzhen, Tsinghua University, Shenzhen 518055, China
3Shenzhen Logistics Engineering & Simulation Laboratory, Graduate School at Shenzhen, Tsinghua University, Shenzhen 518055, China

Received 6 November 2014; Accepted 15 February 2015

Academic Editor: Jun-Juh Yan

Copyright © 2015 Zhaojie Xue et al. This is an open access article distributed under the Creative Commons Attribution License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.


This paper examines the local container drayage problem under a special operation mode in which tractors and trailers can be separated; that is, tractors can be assigned to a new task at another location while trailers with containers are waiting for packing or unpacking. Meanwhile, the strategy of sharing empty containers between different customers is also considered to improve the efficiency and lower the operation cost. The problem is formulated as a vehicle routing and scheduling problem with temporal constraints. We adopt combinatorial benders’ cuts algorithm to solve this problem. Numerical experiments are performed on a group of randomly generated instances to test the performance of the proposed algorithm.