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

This paper proposes a tabu search algorithm for the two-echelon vehicle routing problem with time windows and simultaneous pickup delivery (2E-VRPTWSPD), which is new variant of problem. 2E-VRPTWSPD involves three stages routing: (1) first-echelon vehicles start from depot to deliver cargoes satellites; (2) second-echelon satellites serve customers within in simultaneously manner finally return...