Problem variant
Properties
| Acronym | CVTSP |
| Title | Carrier-Vehicle Traveling Salesman Problem |
| Criterion | MIN |
| Description | A set of target points has to be visited. Two vehicles, C and V, are located at a depot: C is slow and virtually infinitely autonomous, while V is fast but has a limited operative range. The aim of the problem is to make the vehicle V visit all target points while using the carrier C as a service base |