The demand weighted vehicle routing problem.

•We consider demand-weighted distance criterion to evaluate routing solutions.•We present a formulation based on a pseudo-polynomial time dynamic program.•We employ a column generation method and develop a new class of cuts.•We test our model with actual student demand data from the University of Cincinnati.