My research is based on routing problems with pickups and deliveries products. All my research work has been done with my advancer Juan-José Salazar-González. Indeed, he proposed to me this topic for my Phd Thesis which has been being written. These problems are inside Combinatorial Optimization research. Concretely, I have worked in the one-commodity Pickup and Delivery Traveling Salesman Problem (1-PDTSP). This problem is a generalization of the well-known Traveling Salesman Problem (TSP) in which cities correspond to customers providing or requiring known amounts of a product, and the vehicle has a given upper-limit capacity. Each customer must be visited exactly once by the vehicle serving the demands while minimizing the total travel distance. It is assumed that any unit of product collected from a pickup customer can be delivered to any delivery customer. We introduced this problem and proposed exact and heuristic algorithms. The exact algorithm is a branch-and-cut algorithm. Now, we are developing a ''good'' branch-and-cut algorithm for the m-commodity Pickups and Delivery Traveling Salesman Problem ( m-PDTSP), a generalization of the 1-PTDTSP with m commodities.
More information in the Pickup-and-Delivery Site.