Pickup and Delivery Problem with Transfers

2018/03/11 by Santiago Hincapie-Potes, Hincapie-Potes, Santiago, Catalina Lesmes-Ramirez +1
Computer Science · Engineering · #FOS: Mathematics #Optimization and Control (math.OC) #Optimization and Search Problems #Transportation and Mobility Innovations #Vehicle Routing Optimization Methods

paper · pdf · doi:10.48550/arxiv.1803.03907

openalex publication_date 2018/03/11 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28

Abstract

In this article we will be talking about Pickup and Delivery Problems with Transfers (PDP-T), the main idea is to show first the Pickup and Delivery Problem (PDP), which is the problem from which the PDP-T derives from, later show a description of the problem and the mathematical formulation to get a clear view of what we are going to solve, which leads us to present different ways of solving this kind of problems.

Related

• Towards Asymptotically Optimal One-to-One PDP Algorithms for Capacity 2+\n Vehicles
• Pickup & Delivery with Time Windows and Transfers: combining decomposition with metaheuristics
• The pickup and delivery problem with time windows and scheduling on the edges
• Introduction to The Dynamic Pickup and Delivery Problem Benchmark -- ICAPS 2021 Competition
• The Pickup and Delivery Problem with Crossdock for Perishable Goods