Container Flows and Truck Routes in Inland Container Transportation

Abstract

In the inland container transportation problem, one trucking company operating a homogeneous fleet of trucks has to move 40-ft. containers. The recent extension to this problem is to introduce two different commodities, namely 20- and 40-ft. containers, instead of only 40-ft. containers. Our objective is to minimize the total travel distance of the trucks for the extended problem. A model is shown and implemented in C++ using IBM ILOG CPLEX solver. Fifteen test instances are created to obtain computational results using our implementation.