An exact algorithm for the full truckload pick-up and delivery problem with time windows: concept and implementation details

Abstract

Intermodal goods transport is characterised by a main transport by rail, barge or seaborne vessel, preceded and followed by short in time but expensive road transport. Many times trucks pick–up or deliver a single container which leads to a full truckload vehicle routing problem in terms of economically efficient transport services. Time windows induced by the customer or due to external situations increase the complexity of an efficient planning by a logistics provider. An exact algorithm for this type of pick–up and delivery problem is developed and the details of its implementation are explained. A set partitioning problem is automatically generated, which may be solved to optimality by an optimising software.