Heuristics procedures to solve the multi-commodity Pickup-and-Delivery Traveling Salesman Problem

@inproceedings{HernndezPrez2013HeuristicsPT,
  title={Heuristics procedures to solve the multi-commodity Pickup-and-Delivery Traveling Salesman Problem},
  author={Hip{\'o}lito Hern{\'a}ndez-P{\'e}rez and Juan-Jos{\'e} Salazar-Gonz{\'a}lez},
  year={2013}
}
The “multi-commodity Pickup-and-Delivery Traveling Salesman Problem” (m-PDTSP) is a generalization of the well-known “Traveling Salesman Problem” in which cities correspond to customers providing or requiring known amounts of m different products, and the vehicle has a known capacity. Each customer must be visited exactly once by the vehicle serving the demands of the different products while minimizing the total travel distance. It is assumed that a unit of a product collected from a customer… CONTINUE READING