Abstract: In order to solve the vehicle routing problem with pickup and delivery (VRPPD), this paper proposed an improved quantum genetic algorithm based on different constraint conditions. Firstly, a mathematical model was established aiming at minimizing the dispatching time and the total cost. Secondly, the paper proposes the improved quantum genetic algorithm and non dominated sorting strat...

In this paper, we study a variant of the well-known single-vehicle pickup and delivery problem where the demands can be unloaded/reloaded at any node. By proving new complexity results, we give the minimum information which is necessary to represent feasible solutions. Using this, we present integer linear programs for both the unitary and the general versions. We then show that the associated ...

In this paper, we consider a variant of the pickup and delivery problem where any demand may be dropped off elsewhere than at its destination, picked up later by the same or another vehicle, and so on until it has reached its destination. We discuss the complexity of this problem and present two mixed-integer linear programming formulations based on a space-time graph. We describe some valid in...

The Vehicle Routing Problem with Simultaneous Pickup-Delivery and Time Windows (VRPSPDTW) has attracted much research interest in the last decade, due to its wide application modern logistics. Since VRPSPDTW is NP-hard exact methods are only applicable small-scale instances, heuristics meta-heuristics commonly adopted. In this paper we propose a novel Memetic Algorithm efficienT local search Ex...

The multi-agent path-finding (MAPF) problem has recently received a lot of attention. However, it does not capture important characteristics of many real-world domains, such as automated warehouses, where agents are constantly engaged with new tasks. In this paper, we therefore study a lifelong version of the MAPF problem, called the multiagent pickup and delivery (MAPD) problem. In the MAPD pr...

This paper presents the pessimistic time complexity analysis of the parallel algorithm for minimizing the fleet size in the pickup and delivery problem with time windows. We show how to estimate the pessimistic complexity step by step—this approach can be easily adopted to other parallel algorithms for solving complex transportation problems.

Pickup and Delivery Traveling Salesman Problem with LIFO or FIFO Loading Francesco Carrabs and Raffaele Cerulli Dipartimento di Matematica ed Informatica, Università di Salerno, 84084 Fisciano (SA), Italy [email protected], [email protected] Jean-François Cordeau Canada Research Chair in Logistics and Transportation and CIRRELT HEC Montréal, 3000 chemin de la Côte-Sainte-Catherine, Montréal, Ca...

The development of effective decision support tools that can be adopted in the transportation industry is vital in the world we live in today, since it can lead to substantial cost reduction and efficient resource consumption. Solving the Vehicle Routing Problem (VRP) and its related variants is at the heart of scientific research for optimizing logistic planning. One important variant of the V...