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...

In this presentation, we consider the Split Delivery Vehicle Routing Problem with Time Windows (SDVRPTW) in which the delivery to a customer can be split between any number of vehicles. This problem has not been extensively studied in the literature. The main contribution of this paper is a Branch and Price approach for solving the SDVRPTW without imposing restrictions on the split delivery opt...

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...

In pickup and delivery problems vehicles have to transport loads from origins to destinations without transshipment at intermediate locations. In this paper, we describe an algorithm to solve such problems. The algorithm is based on a set partitioning formulation of the problem and uses new column generation and branching schemes.

A considerable amount of research has been concerned with the domain of automatic planning and scheduling, but many real world scheduling problems such as The Pick up and Delivery Problem With Time Windows (PDPTW) are still not easily tackled. The PDPTW problem demands solving the schedule for each vehicle of a transportation fleet where pick up and delivery of customer orders are distributed a...

Multi-agent Pickup and Delivery (MAPD) is a challenging industrial problem where team of robots tasked with transporting set tasks, each from an initial location to specified target location. Appearing in the context automated warehouse logistics mail sortation, MAPD requires first deciding which robot assigned what task (i.e., Task Assignment or TA) followed by subsequent coordination must be ...