The vehicle routing problem with simultaneous pickup and delivery (VRPSPD) is a well-known combinatorial optimization problem which addresses provided service to a set of customers using a homogeneous fleet of capacitated vehicles. The objective is to minimize the distance traveled. The VRPSPD is an NP-hard combinatorial optimization problem. Therefore, practical large-scale instances of VR...

The vehicle routing problem with simultaneous pickup and delivery (VRPSPD) is a well-known combinatorial optimization problem which addresses provided service to a set of customers using a homogeneous fleet of capacitated vehicles. The objective is to minimize the distance traveled. The VRPSPD is an NP-hard combinatorial optimization problem. Therefore, practical large-scale instances of VR...

This research addresses robust incident management techniques in distributed environments with autonomous actors. Focusing on applications in operational pickup and delivery transportation planning, the distributed environment consists of a transport network, vehicles controlled by operational agents and pickup and delivery tasks with time-windows. The two main challenges of this research are t...

This paper aims to study the split load vehicle routing problem in order to find a solution which would decrease logistics’ cost by implementing simultaneous delivery and pickup which is part of the multi-attribute vehicle routing problem. A model was established based on certain preconditions and assumptions considering some specific characteristics in this simultaneous delivery and pickup pro...

The Traveling Salesman Problem with Pickup and Delivery (TSPPD) is defined on a graph containing pickup and delivery vertices between which there exists a one-toone relationship. The problem consists of determining a minimum cost tour such that each pickup vertex is visited before its corresponding delivery vertex. In this paper, the TSPPD is modeled as an integer linear program and its polyhed...

The multi-depot pickup and delivery problem with heterogeneous fleet and soft time windows (MDPDPHSTW) requires to find a minimum cost routing for a fleet vehicles with different capacities and based at different depots, satisfying a given set of customers. A customer request is associated with two locations: a source where a certain demand must be picked up and a destination where this demand ...

This paper 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 performs...

Nowadays, logistic companies are dealing with the pressure of a highly competitive environment and trying to reduce operational costs. At same time, customers requiring not wait so long get their delivery pickup demands satisfied. In this study, these two factors considered a-static-periodic solution strategy. The problem is modelled as Dynamic Vehicle Routing Problem Simultaneous Pickup Delive...