Decision Diagrams for Solving Traveling Salesman Problems with Pickup and Delivery in Real Time

The Traveling Salesman Problem with Pickup and Delivery seeks a minimum cost path with pickups preceding deliveries. It is important in on-demand last-mile logistics, such as ride sharing and meal delivery. We examine the use of low-width Decision Diagrams in a branch-and-bound with and without Assignment Problem inference duals as a primal heuristic for finding good solutions within strict time budgets. We show these diagrams can be more effective than similarly structured hybrid Constraint Programming techniques for real-time decision making.

Article

Download

View Decision Diagrams for Solving Traveling Salesman Problems with Pickup and Delivery in Real Time