Problem variant
Properties
| Acronym | VRPFT |
| Title | Vehicle Routing Problem with Floating Targets |
| Criterion | MIN |
| Description | A fleet of vehicles is available at a depot O at time 0. A number of targets are located at home locations and can move at a given speed later on. The targets need a vehicle to reach a common destination D. The aim of VRPFT is to determine minimum-time vehicle routes starting from O and ending in D so that all targets meet a vehicle in a convenient location. |