A Tabu search approach for milk collection in western Norway using trucks and trailers

This paper considers a real world problem for a Norwegian dairy company collecting raw milk from farmers. The problem can be classified as a special type of the Truck and Trailer Routing Problem which is a variant of the traditional Vehicle Routing Problem. The company uses a fleet of heterogeneous trucks with tanks for the milk, and a truck can either drive the route by itself or carry a trailer with an additional tank. Most Norwegian farms are small and inaccessible for vehicles with trailers, so the routes that are served with a trailer have to be constructed so that the vehicles carry the trailer to a parking place and leave it there. The truck will then drive a subtour to the farmers and collect milk before it returns to the parked trailer. It can then fill the milk over from the truck tank to the trailer tank and start on a new subtour from the same spot, or it can drive the trailer to a new parking place, fill the milk over and start a subtour from there. The milk can be stored up to three days at the farms, and in this paper we will compare different frequencies of collection, different sizes of the vehicles and the benefit of using trailers compared to driving with single trucks. We will use the tabu search metaheuristic to construct the routes for the different strategies of milk collection.

[1]  Frédéric Semet,et al.  A two-phase algorithm for the partial accessibility constrained vehicle routing problem , 1995, Ann. Oper. Res..

[2]  Michel Gendreau,et al.  A guide to vehicle routing heuristics , 2002, J. Oper. Res. Soc..

[3]  Éric D. Taillard,et al.  Solving real-life vehicle routing problems efficiently using tabu search , 1993, Ann. Oper. Res..

[4]  Stephan Scheuerer,et al.  A tabu search heuristic for the truck and trailer routing problem , 2006, Comput. Oper. Res..

[5]  Marshall L. Fisher,et al.  A generalized assignment heuristic for vehicle routing , 1981, Networks.

[6]  Edward P. K. Tsang,et al.  Guided local search and its application to the traveling salesman problem , 1999, Eur. J. Oper. Res..

[7]  Jayaram K. Sankaran,et al.  Routing Tankers for Dairy Milk Pickup , 1994 .

[8]  Gilbert Laporte,et al.  Classical and modern heuristics for the vehicle routing problem , 2000 .

[9]  Fred W. Glover,et al.  Future paths for integer programming and links to artificial intelligence , 1986, Comput. Oper. Res..

[10]  A Assad,et al.  VEHICLE ROUTING WITH SITE DEPENDENCIES. VEHICLE ROUTING: METHODS AND STUDIES. STUDIES IN MANAGEMENT SCIENCE AND SYSTEMS - VOLUME 16 , 1988 .

[11]  Billy E. Gillett,et al.  A Heuristic Algorithm for the Vehicle-Dispatch Problem , 1974, Oper. Res..

[12]  Manuel Laguna,et al.  Tabu Search , 1997 .

[13]  Johanna C. Gerdessen,et al.  Vehicle routing problem with trailers , 1996 .

[14]  Shen Lin Computer solutions of the traveling salesman problem , 1965 .

[15]  Paolo Toth,et al.  The Granular Tabu Search and Its Application to the Vehicle-Routing Problem , 2003, INFORMS J. Comput..

[16]  Ibrahim H. Osman,et al.  Metastrategy simulated annealing and tabu search algorithms for the vehicle routing problem , 1993, Ann. Oper. Res..

[17]  Gilbert Laporte,et al.  A Tabu Search Heuristic for the Vehicle Routing Problem , 1991 .

[18]  I-Ming Chao,et al.  A tabu search method for the truck and trailer routing problem , 2002, Comput. Oper. Res..

[19]  Alberto Del Pia,et al.  A variable neighborhood descent algorithm for a real waste collection problem with mobile depots , 2006, Int. Trans. Oper. Res..

[20]  G. Laporte,et al.  A tabu search heuristic for periodic and multi-depot vehicle routing problems , 1997, Networks.

[21]  Kay Chen Tan,et al.  A hybrid multi-objective evolutionary algorithm for solving truck and trailer vehicle routing problems , 2006, Eur. J. Oper. Res..