Problem variant
Properties
| Acronym | SBVRP |
| Title | Swap-body Vehicle Routing Problem |
| Criterion | MIN |
| Description | A set of customers need to be served by a fleet of vehicles. Vehicles can pull up to two swap-bodies. Each swap-body has a fixed capacity. Not all customers can be accessed by vehicles pulling two swap-bodies. Swap-locations are particular network location that swap-bodies to be parked. The objective is to minimize the routing cost as the sum of fixed costs for using vehicles and costs proportional to the travel distance and time. |
Links
| Datasets | |
| References |