When compared to the travelling salesman problem with n nodes, vehicle routing problem with n nodes are:

L$$tfen birini se$$in:

a$.$ Computationally the same or harder, depending on the tour constraints

b$.$ Computationally harder, since you must determine both who is on which tour and how to build the tours

c$.$Computationally easier to solve, since each tour in the VRP has fewer nodes than the TSP

d$.$ None of them

e$.$ Computationally the same, since there is an equal number of a customer node