In a sense, the vehicle routing problem describes the simplest relevant route planning problem: a fleet of identical vehicles is located at a depot and is to deliver goods to various customers (or collect goods from them, whereby simultaneous delivery and collection is not considered in the standard problem). The quantity of goods can be described as a one-dimensional value indicating how many units of vehicle capacity are occupied by these goods. The aim is to assign the vehicles to the customers (clustering) and at the same time determine the order of visits (routing) in such a way that the distance travelled is minimised.
In some cases, a maximum distance per vehicle is also taken into account, or the objective function is formulated as minimising the number of vehicles used.