Local truckload pickup and delivery with hard time window constraints

摘要

This paper describes a solution method for a multiple traveling salesman problem with time window constraints(m-TSTW). The method was developed for local truckload pickup and delivery problems such as those supporting rail or maritime intermodal operations but is suitable for application in other problems in which the number of tasks assigned to each server at any time is relatively small. We present a model and describe an iterative solution technique in which explicit time constraints are replaced by binary flow variables. At each iteration two versions of the problem, one over-constrained and the other under-con- strained are solved.