This chapter describes some of the most important models and algorithms for the classical vehicle routing problem and for several families of arc routing problems. Exact methods (mostly based on branch-and-cut) and heuristics (mostly based on tabu search) are described, and computational results are presented.