The pickup and delivery problem: Faces and branch-and-cut algorithm
This paper formulates the pickup and delivery problem, also known as the dial-a-ride problem, as an integer program. Its polyhedral structure is explored and four classes of valid inequalities developed. The results of a branch-and-cut algorithm based on these constraints are presented.
pickup and delivery problem branch-and-cut algorithm integer programming