Efficient Partitioning and Routing of Shipments in a Time-Schedule Network

The paper addresses the problem of partitioning and transporting a shipment of known size from a single source node to a single destination node using an n node time schedule network. In a time-schedule network every node in the network has a list of pre-specified departure times and departure from a node may take place only at one of these departure times. The objective of this paper is to develop heuristics to minimize the total transportation cost subject to a total time constraint.