Chapter 2 Truck Scheduling Problem
The chapter at hand addresses a truck scheduling problem as considered in Nossack and Pesch (2012b). This problem arises in the pre- and end-haulage of intermodal freight transportation where containers need to be transported between customers (shippers or receivers) and container terminals (rail or maritime) and vice versa. The transportation requests are handled by a trucking company which operates several depots and a ﬂeet of homogeneous trucks that must be routed and scheduled to minimize the total truck operat- ing time under hard time window constraints imposed by the customers and terminals. Empty containers are considered as transportation resources and are provided by the trucking company for freight transportation. We for- mulate this truck scheduling problem as full-truckload pickup-and-delivery problem with time windows (FTPDPTW) and solve it by a 2-stage heuristic solution approach. Computational results are presented for randomly gener- ated instances. 2.1 Problem Description The trucking company that we consider in this setting, operates a ﬂeet of homogeneous trucks to handle a number of transportation requests. The re- quests that are fundamental in the pre- and end-haulage of intermodal freight transportation imply the movements of fully-loaded containers between cus- tomer places and terminals and vice versa. The containers that are used for 12 Chapter 2. Truck Scheduling Problem ! ! Fig. 2.1: Types of Transportation Requests freight transportation are owned by the trucking company and are provided to the customers. This supply of empty containers results in the need of empty container repositioning which is partly achieved by considering addi- tional...
You are not authenticated to view the full text of this chapter or article.
This site requires a subscription or purchase to access the full text of books or journals.
Do you have any questions? Contact us.Or login to access all content.