We address in this paper the one-commodity pickup-and-delivery traveling salesman
problem, which is characterized by a set of customers, each of them supplying (pickup …

This paper addresses an extension of the Traveling Salesman Problem where a vehicle with
a limited capacity must transport commodities. Each commodity has a weight, and exactly …

We address in this article the multi-commodity pickup-and-delivery traveling salesman
problem, which is a routing problem for a capacitated vehicle that has to serve a set of …

This article addresses the problem of designing routes of minimum cost for a capacitated
vehicle moving a commodity between a set of customers, allowing two characteristics …

This paper deals with a generalisation of the well-known traveling salesman problem (TSP)
in which cities correspond to customers providing or requiring known amounts of a product …

We present a variable neighborhood search approach for solving the one-commodity pickup-
and-delivery travelling salesman problem. It is characterized by a set of customers such that …

This article deals with a new generalization of the well-known “Travelling Salesman
Problem”(TSP) in which cities correspond to customers providing or requiring known …

We consider the Traveling Salesman Problem with Pickup and Delivery (TSPPD), an
extension of the well-known Traveling Salesman Problem where each customer to be …

This article concerns the “One‐commodity Pickup‐and‐Delivery Traveling Salesman
Problem”(1‐PDTSP), in which a single vehicle of fixed capacity must either pick up or deliver …

This paper introduces the pickup and delivery traveling salesman problem with handling
costs (PDTSPH). In the PDTSPH, a single vehicle has to transport loads from origins to …