Table 1 Some studies related to the mothership concept.
From: Multi-depot routing problem with van-based driverless vehicles
References | Vans:drones/driverless vehicles | Demands | Transportation network | Approach | Object | Vans/trucks delivery goods | Drones/driverless vehicles capacity | Van-van joint distribution | Customers around depots |
|---|---|---|---|---|---|---|---|---|---|
1:M | Static | Static | Heuristic | Min late customer numbers | No | 1-customer | No | No | |
1:M | Static | Static | Heuristic | Min cost | No | M-customers | No | No | |
1:M | Static | Static | Branch and price | Min cost | Yes | M-customers | Yes | No | |
1:M | Static | Static | Continuous approximation | Min cost | No | 1-customer | No | No | |
1:1 | Static | Static | Branch and bound | Min completion time | Yes | 1-customer | No | No | |
1:M | Static | Static | Branch and price | Min completion time | Yes | 1-customer | No | No | |
1:1 | Static | Static | Heuristic | Min completion time | Yes | 1-customer | No | Yes | |
1:1 | Static | Static | Solver | Min completion time | Yes | 1-customer | No | No | |
1:M | Static | Static | Heuristic | Min completion time | Yes | 1-customer | No | Yes | |
1:1 | Static | Static | Heuristic | Min completion time | No | M-customers | No | Yes | |
1:1 | Static | Static | Heuristic | Min completion time | No | 1-customer | No | No | |
1:M | Static | Static | Heuristic | Min completion time | No | M-customers | No | Yes | |
1:1 | Stochastic | Static | Decomposition algorithm | Min cost | No | M-customers | No | No | |
1:M | Stochastic | Static | Heuristic | Min completion time | No | M-customers | No | No | |
This paper | 1:M | Static | Static | Heuristic | Min cost | No | M-customers | Yes | Yes |
