Branch-and-Price Algorithm for the Pickup and Delivery Problem with Time Windows

摘要

In pickup and delivery problems vehicles have to transport loads from origins todestinations without transshipment at intermediate locations. In this paper, we describe an algorithm to solve such problems. The algorithm is based on a set partitioning formulation of the problem and uses new column generation and branching schemes.