Classical Vehicle Routing Case Study

The PVRP develops the classical Vehicle Routing Problem (VRP) to a planning horizon of several days. Each customer requires a certain number of visits within this time horizon while there is some flexibility on the exact days of the visits. The PVRP is a problem which occurs in companies that have to accomplish periodic repair and maintenance activities or that collect/deliver goods periodically. ¬Early formulations of the PVRP were developed by Beltrami and Bodin (1974) [13]. Christofides and Beasley (1984)[14] first, formulated mathematically the problem and then presented a two phase heuristic algorithm. Coene et al. [15] and Blakeley et al [16] study a case for elevators periodic maintenance at several customer locations. Beltrami and bodin [13]and Eglese and Murdock [17] investigate More case studies involving problems such as waste collection. Claassen and Hendriks [18] present a milk collection problem in which it is crucial to collect the goods when they are fresh. Other products like raw materials for an auto parts manufacturer, in opposition, have a very long …show more content…
Common examples are stochastic demands and stochastic travel times. Sometimes, the set of customers to be visited is not known. Applications of the SVRP occur in a variety of fields, for example, Lambert et al. [23]design routes for vehicles to gather deposits from bank branches and deliver them to a central office. Jaillet [24, 25] considers a probabilistic traveling salesman problem (TSP) with random demand. a priori tour is built that comprises all potential customers, and after observing the subset that demands service, the other customers are passed over. The goal is finding a tour with minimum expected length. Bertsimas and Howell [26] investigate this problem, and Bertsimas [27] develops it to a capacitated single-vehicle routing problem with random