To link to full-text access for this article, visit this link: http://dx.doi.org/10.1016/j.ijpe.2008.12.017 Byline: Laia Ferrer, Rafael Pastor, Alberto Garcia-Villoria Keywords: OR application; Vehicle routing problem; Traveling salesman problem; Case study Abstract: In this paper, we present a procedure for designing the routes for the salespeople that work for the commercial network of a home video company. The commercial area is divided into different zones and each salesperson is assigned to one of them, working and having independent routes from the others. The company wanted to generate salespeople's routes for a commercial cycle, which is usually one month long. The commercial cycle has the following main features: each customer has to be visited a specific number of times (from 1 to 5); and two-day routes are possible when the customers are located far from the salesperson's residence. After the set of routes is generated, each salesperson assigns his/her own routes to each working day, taking into account local holidays, national meetings and other unforeseen events. The objective function is to minimize the weighted sum of the travel time plus overtime penalties. In less than one month, an ad hoc procedure was designed, coded and calibrated. The company has qualified the routes as very satisfactory and the tool is now used by the commercial network management to: reassign customers, assign new customers and vary the number of visits to the customers. Author Affiliation: IOC Research Institute, Technical University of Catalonia, Avenue Diagonal 647, p11, 08028 Barcelona, Spain Article History: Received 15 November 2006; Accepted 19 December 2008