We describe industrial routing problems for the design and revision of carrier routes in the newspaper and media product industry. The goal is to optimize on several criteria that are partly in conflict: number of routes, delivery costs, route balancing, route compactness, and route segregation. We discuss how these aspects may be modeled and solved. Results from computational experiments are presented. A web-based routing tool is briefly described.