Some applications of the generalized vehicle routing problem

AbstractThe Generalized Vehicle Routing Problem (GVRP) is an extension of the classical Vehicle Routing Problem (VRP) in which the vertex set is partitioned into clusters and vehicles must visit exactly one (or at least one) vertex per cluster. The GVRP provides a useful modelling framework for a wide variety of applications. The purpose of this paper is to provide such examples of applications and models. These include the Travelling Salesman with Profits, several VRP extensions, the Windy Routing Problem, and the design of tandem configurations for automated guided vehicles.

[1]  Michel Gendreau,et al.  A tabu search heuristic for periodic and multi-depot vehicle routing problems , 1997, Networks.

[2]  Gilbert Laporte,et al.  Loop based facility planning and material handling , 2002, Eur. J. Oper. Res..

[3]  Gilbert Laporte,et al.  Location routing problems , 1987 .

[4]  Michal Tzur,et al.  The Period Vehicle Routing Problem and its Extensions , 2008 .

[5]  Gilbert Laporte,et al.  Some Applications of the Generalized Travelling Salesman Problem , 1996 .

[6]  Gilbert Laporte,et al.  Solving a vehicle-routing problem arising in soft-drink distribution , 2006, J. Oper. Res. Soc..

[7]  Michel Gendreau,et al.  Traveling Salesman Problems with Profits , 2005, Transp. Sci..

[8]  Saïd Salhi,et al.  Location-routing: Issues, models and methods , 2007, Eur. J. Oper. Res..

[9]  Ram Ramesh,et al.  An efficient four-phase heuristic for the generalized orienteering problem , 1991, Comput. Oper. Res..

[10]  Huey D. Moser.  Scheduling and Routing Tactical Aerial Reconnaissance Vehicles , 1990 .

[11]  Dennis H. Gensch,et al.  An Industrial application of the traveling salesman's subtour problem , 1978 .

[12]  E. Minieka.  The Chinese Postman Problem for Mixed Networks , 1979 .

[13]  Michel Gendreau,et al.  Arc Routing Problems, Part II: The Rural Postman Problem , 1995, Oper. Res..

[14]  T. Tsiligirides,et al.  Heuristic Methods Applied to Orienteering , 1984 .

[15]  G. Laporte,et al.  Maximizing user convenience and postal service efficiency in post box location , 1986 .

[16]  Gilbert Laporte,et al.  The selective travelling salesman problem , 1990, Discret. Appl. Math..

[17]  Joseph F. Pekny,et al.  An exact parallel algorithm for scheduling when production costs depend on consecutive system states , 1990 .

[18]  Lawrence Bodin,et al.  Networks and vehicle routing for municipal waste collection , 1974, Networks.

[19]  C. S. Orloff.  A fundamental problem in vehicle routing , 1974, Networks.

[20]  Peter Värbrand,et al.  On the nucleolus of the basic vehicle routing game , 1996, Math. Program..

[21]  G Laporte,et al.  Solving arc routing problems with turn penalties , 2000, J. Oper. Res. Soc..

[22]  Egon Balas,et al.  The prize collecting traveling salesman problem , 1989, Networks.

[23]  Bruce L. Golden,et al.  OR Practice - Computerized Vehicle Routing in the Soft Drink Industry , 1987, Oper. Res..

[24]  Tzu-li Wu.  Optimization Models for Underway Replenishment of a Dispersed Carrier Battle Group , 1992 .

[25]  Jeffrey Scott Dunn.  Scheduling Underway Replenishment as a Generalized Orienteering Problem , 1992 .

[26]  Gilbert Laporte,et al.  A Covering Tour Model for Planning Mobile Health Care Facilities in SuhumDistrict, Ghama , 1998 .

[27]  Gilbert Laporte,et al.  The single vehicle routing problem with deliveries and selective pickups , 2008, Comput. Oper. Res..

[28]  R. Vohra,et al.  The Orienteering Problem , 1987 .

[29]  Gilbert Laporte,et al.  CONTROLLING TURN PENALTIES IN ARC ROUTING PROBLEMS , 1999 .

[30]  Daniele Vigo,et al.  Lower bounds and heuristics for the Windy Rural Postman Problem , 2007, Eur. J. Oper. Res..

[31]  Gianpaolo Ghiani,et al.  An efficient transformation of the generalized vehicle routing problem , 2000, Eur. J. Oper. Res..

[32]  M. J. Hodgson,et al.  Spatial Accessibility to Health Care Facilities in Suhum District, Ghana , 1994 .

[33]  Gilbert Laporte,et al.  Modeling and solving several classes of arc routing problems as traveling salesman problems , 1997, Comput. Oper. Res..

[34]  R. Russell,et al.  An assignment routing problem , 1979, Networks.

[35]  Michel Gendreau,et al.  The Covering Tour Problem , 1997, Oper. Res..

[36]  J. C. Bean,et al.  An efficient transformation of the generalized traveling salesman problem , 1993 .

[37]  Gilbert Laporte,et al.  Arc Routing Problems, Part I: The Chinese Postman Problem , 1995, Oper. Res..

[38]  Elise Miller-Hooks,et al.  A TABU search heuristic for the team orienteering problem , 2005, Comput. Oper. Res..

[39]  David Pisinger,et al.  A unified heuristic for a large class of Vehicle Routing Problems with Backhauls , 2006, Eur. J. Oper. Res..

[40]  Dalessandro Soares Vianna,et al.  An asynchronous parallel metaheuristic for the period vehicle routing problem , 2001, Future Gener. Comput. Syst..