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 customer) or demanding (delivery customer) a given amount of a single product. The objective is to design a minimum cost Hamiltonian route for a capacitated vehicle in order to transport the product from the pickup to the deliver...

We address in this paper the pickup and delivery multi-depot vehicle routing problem (PDMDVRP). In this problem, a single commodity type is collected from a set of pickup customers to be delivered to a set of delivery customers by vehicles dispatched from multiple depots. The proposed problem has many applications in practice such as distribution of money between the branches of a bank, and mov...

In this paper problems of planning in transportation systems based on Pickup and Delivery Problem with Time Windows (PDPTW) are discussed. The results of two variants of evolutionary algorithms illustrate the pros and cons of using different approaches, and their cooperation in hybrid island model indicates how they can help each other in achieving better solutions. This leads to the general id...

The split pickup split delivery crude oil tanker routing and scheduling problem is a difficult combinatorial optimization problem, both theoretically and practically. However, because of the large expenses in crude oil shipping it is attractive to make use of optimization that exploits as many degrees of freedom as possible to save transportation cost. We propose a nested column generation algo...

This article studies the double traveling salesman problem with two stacks. A number of requests have to be served where each request consists in the pickup and delivery of an item. All the pickup operations have to be performed before any delivery can take place. A single vehicle is available that starts from a depot, performs all the pickup operations and returns to the depot. Then, it perfor...

The vehicle routing problem with backhauls and time windows (VRPBTW) involves the pickup and delivery of goods at different customer locations, with earliest and latest time deadlines, and varying demands. The demands are serviced using capacitated vehicles with limited route time. Moreover, all deliveries (linehauls) must be done before the pick-ups (backhauls). The objective of the problem is...

This paper addresses the vehicle routing problem with simultaneous pickup and delivery (VRPSPD) which is the problem of optimally integrating goods deliver and pickup when there are no precedence restrictions on the order in which the operations must be performed. We review mixed integer programming formulations in the literature for VRPSPD and propose two new formulations, PM1 and PM2, for the...

In the dynamic Pickup and Delivery Problem with Transfers (dPDPT), a set of transportation requests that arrive at arbitrary times must be assigned to a fleet of vehicles. We use two cost metrics that capture both the company’s and the customer’s viewpoints regarding the quality of an assignment. In most related problems, the rule of thumb is to apply a two-phase local search algorithm to heuri...

This paper concentrates on a new framework for a post-market reassignment of requests in a Collaborative Carrier Network (CCN). While the framework was applied to a pickup and delivery scenario in [BB07] we now use it for the vehicle routing of a carrier network offering LTL pickup services leading to a set of interdependent capacitated traveling salesman tours.