Some applications of the generalized vehicle routing problem

Journal of the Operational Research Society

Volumn 61, Issue 7, 2010, Pages 1072-1077

  Baldacci, R ^a   Bartolini, E ^b   Laporte, G ^c  

^a UNIVERSITY OF BOLOGNA   (Italy)

^b UNIVERSITY OF BOLOGNA   (Italy)

^c HEC MONTRÉAL   (Canada)

Author keywords

Applications; Generalized Vehicle Routing Problem; Models

Indexed keywords

APPLICATIONS; AUTOMATIC GUIDED VEHICLES; MODELS; TRAVELING SALESMAN PROBLEM;

AUTOMATED GUIDED VEHICLES; GENERALIZED VEHICLE ROUTING PROBLEMS; MODELLING FRAMEWORK; ROUTING PROBLEMS; TANDEM CONFIGURATION; TRAVELLING SALESMAN; VEHICLE ROUTING PROBLEM; VERTEX SET;

VEHICLE ROUTING;

EID: 77953679815     PISSN: 01605682     EISSN: 14769360     Source Type: Journal    
DOI: 10.1057/jors.2009.51     Document Type: Article

References (42)

1. Asef-Vaziri A and Laporte G (2005). Loop based facility planning and material handling. Eur J Opl Res 164: 1-11.
2. Balas E (1989). The prize collecting traveling salesman problem. Networks 19: 621-636.
3. Beltrami EJ and Bodin LD (1974). Networks and vehicle routing for municipal waste collection. Networks 4: 65-94.
4. Benavent E, Carrotta A, Corbeŕan A, Sanchis JM and Vigo D (2007). Lower bounds and heuristics for the windy rural postman problem. Eur J Opl Res 176: 855-869.
5. Clossey J, Laporte G and Soriano P (2001). Solving arc routing problems with turn penalties. J Opl Res Soc 52: 433-439.
6. Cordeau J-F, Gendreau M and Laporte G (1997). A tabu search heuristic for periodic and multi-depot vehicle routing problems. Networks 30: 105-119. (Pubitemid 127360996)
7. Deif I and Bodin L (1984). Extension of the Clarke and Wright algorithm for solving the vehicle routing problem with backhauling. In: Kidder A (ed). Proceedings of the Babson Conference on Software Uses in Transportation and Logistic Management. Babson College: Babson Park, MA, pp 75-96.
8. Drummond LMA, Ochi LS and Vianna DS (2001). An asynchronous parallel metaheuristic for the period vehicle routing problem. Future Gener Comp Sy 17: 379-386.
9. Dunn IS (1992). Scheduling underway replenishment as a generalized orienteering problem. Unpublished Master's Thesis, Naval Postgraduate School, Monterey, CA.
10. Eiselt HA, Gendreau M and Laporte G (1995a). Arc routing problems, Part I: The Chinese postman problem. Opns Res 43: 231-242.
11. Eiselt HA, Gendreau M and Laporte G (1995b). Arc routing problems, Part II: The rural postman problem. Opns Res 43: 399-414.
12. Feillet D, Dejax P and Gendreau M (2005). Traveling salesman problems with profits. Transport Sci 39: 188-205.
13. Francis PM, Smilowitz KR and Tzur M (2008). The period vehicle routing problem and its extensions. In: Golden BL, Raghavan S and Wasil EA (eds). The Vehicle Routing Problem: Latest Advances and New Challenges. Springer: Boston, pp 73-102.
14. Gendreau M, Laporte G and Semet F (1997). The covering tour problem. Opns Res 45: 568-576.
15. Gensch DH (1978). An industrial application of the traveling salesman subtour problem. AIIE T 10: 362-370.
16. Ghiani G and Improta G (2000). An efficient transformation of the generalized vehicle routing problem. Eur J Opl Res 122: 11-17.
17. Golden BL and Wasil EA (1987). Computerized vehicle routing in the soft drink industry. Opns Res 35: 6-17.
18. Golden BL, Levy L and Vohra R (1987). The orienteering problem. Nav Res Log 34: 307-318.
19. Göthe-Lundgren M, Jörnsten K and Värbrand P (1996). On the nucleolus of the basic vehicle routing game. Math Program 72: 83-100.
20. Göthe-Lundgren M, Maffioli F and Värbrand P (1995). A Lagrangian decomposition approach for a prize collecting traveling salesman type problem. Technical Report LiTH-MATH-R1995-10. Linköping Institute of Technology, Linköping, Sweden.
21. Gribkovskaia I, Laporte G and Shyshou A (2008). The single vehicle routing problem with deliveries and selective pickups. Comput Opns Res 35: 2908-2924.
22. Hodgson MJ, Laporte G and Semet F (1998). A covering tour model for planning mobile health care facilities in Suhum District, Ghana. J Region Sci 38: 621-638.
23. Labb́e M and Laporte G (1986). Maximizing user convenience and postal efficiency in post box location. Belgian J Opns Res Stat Comput Sci 26: 21-35.
24. Laporte G (1988). Location-routing problems. In: Golden BL and Assad AA (eds). Vehicle Routing: Methods and Studies. North-Holland: Amsterdam pp 163-197.
25. Laporte G (1997). Modeling and solving several classes of arc routing problems as traveling salesman problems. Comput Opns Res 24: 1057-1061.
26. Laporte G and Martello S (1990). The selective travelling salesman problem. Discrete Appl Math 26: 193-207.
27. Laporte G, Asef-Vaziri A and Sriskandarajah C (1996). Some applications of the generalized traveling salesman problem. J Opl Res Soc 47: 1461-1467. (Pubitemid 126604601)
28. Minieka E (1979). The Chinese postman problem for mixed networks. Mngt Sci 25: 643-648.
29. Moser HD Jr (1990). Scheduling and routing tactical aerial reconnaissance vehicles. Master's Thesis, Naval Postgraduate School, Monterey, CA.
30. Nagy G and Salhi S (2007). Location-routing: Issues, models and methods. Eur J Opl Res 177: 649-672.
31. Nocito JB (1993). Heuristic solutions to the two-player orienteering problem. Master's Thesis, University of Maryland, College Park, MD.
32. Noon CE and Bean JC (1993). An efficient transformation of the generalized travelling salesman problem. INFOR 31: 39-44.
33. Oppong JR and Hodgson MJ (1994). Spacial accessibility to health care facilities in Suhum District, Ghana. Prof Geogr 46: 199-209.
34. Orloff CS (1974). A fundamental problem in vehicle routing. Networks 4: 35-64.
35. Pekny JF, Miller DL and McRae GJ (1990). An exact parallel algorithm for scheduling when production costs depend on consecutive system states. Comput Chem Eng 14: 1009-1023.
36. Priv́e J, Renaud J, Boctor FF and Laporte G (2006). Solving a vehicle routing problem arising in soft drink distribution. J Opl Res Soc 57: 1045-1052.
37. Ramesh R and Brown KM (1991). An efficient four-phase heuristic for the generalized orienteering problem. Comput Opns Res 18: 151-165.
38. Ropke S and Pisinger D (2006). A unified heuristic for a large class of vehicle routing problems with backhauls. Eur J Opl Res 171: 750-775.
39. Russel RA and Igo W (1979). An assignment routing problem. Networks 9: 1-17.
40. Tang H and Miller-Hooks E (2005). A TABU search heuristic for the team orienteering problem. Comput Opns Res 32: 1379-1407.
41. Tsiligirides T (1984). Heuristic methods applied to orienteering. J Opl Res Soc 35: 797-809.
42. Wu T (1992). Optimization models for underway replenishment of a dispersed carrier battlegroup. Master's Thesis, Naval Postgraduate School, Monterey, CA.