Yilmaz, NurahKaraoglan, Ismail2024-10-102024-10-1020249783031716478978303171645497830317164471868-42381868-422Xhttps://doi.org/10.1007/978-3-031-71645-4_20Vehicle Routing Problem (VRP), one of the most important problems in the logistics industry, aims to find the most suitable route for vehicles that meet the demands of customers. VRP is examined under various variants, and one of these variants, the Pickup and Delivery Problem, deals with the pickup demands as well as the delivery demands of the customers. This problem is divided into three main categories according to 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, there are goods at the depot to be delivered to customers as well as goods at customers to be carried back to the depot. In many-to-many problems, one node can be the origin or destination point for a good, and multiple nodes can be the origin or destination point for each good, while in one-to-one problems, there is a single origin and a single destination point for each unique demand. Within the scope of this study, a general case of one-to-one problems is introduced, in which multiple vehicles are allowed to leave the depot with goods and return to the depot with undeliverable goods, and a customer can be both a pickup and delivery node at the same time. A mathematical model is developed for the problem to obtain the optimal solution for the test instances. The model is tested on 45 randomly generated test instances. The results show that 40 out of 45 instances were solved using a commercial solver within one-hour computation time limit.eninfo:eu-repo/semantics/closedAccessVehicle Routing ProblemOne-to-one Pickup and DeliveryLogistic and Supply Chain ManagementConference Object10.1007/978-3-031-71645-4_202-s2.0-85204543919