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

الملخص EN

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.