Yilmaz Erdeş N.Karaoğlan İ.2026-03-102026-03-10202697830321701941865-0929https://doi.org/10.1007/978-3-032-17020-0_16https://hdl.handle.net/20.500.13091/13081Generating appropriate routes for vehicles that meets customer demands is the goal of the Vehicle Routing Problem (VRP), which is a crucial kind of problem in the transportation sector. VRP is studied under different versions, one of which is the Pickup and Delivery Vehicle Routing Problem (PDVRP) where demands of customers for both pickup and delivery are considered. There are three categories of this problem, based on demand type and route structure: one-to-many-to-one problems, many-to-many problems, and one-to-one problems. In one-to-many-to-one problems, products at the depot must be delivered to the customers and products from the customers must be transported back to the depot. In many-to-many problems, a node can be origin or destination for several products, but in one-to-one problems, there is a single origin and destination for each product. This paper introduces a general version of one-to-one problems where a customer can be both a pickup and delivery node, and multiple vehicles are allowed to depart the depot with products and return with undelivered products. Since PDVRP is a variant of VRP which is an NP-hard problem, a heuristic method is developed based on Local Search algorithm to find optimal or near-optimal solutions to the problem in a short time. Solutions found with heuristic method are compared to the results of a mathematical model from the recent literature. Computational experiments indicate that in 15 out of 45 test instances, our heuristic method found optimal solutions in less than one second and competitive solutions in rest of the instances. © The Author(s), under exclusive license to Springer Nature Switzerland AG 2026.eninfo:eu-repo/semantics/closedAccessHeuristicLocal SearchLogistic and Supply Chain ManagementOne-to-One Pickup and DeliveryTransportationVehicle Routing ProblemConference Object10.1007/978-3-032-17020-0_162-s2.0-105030332062