An exact algorithm for team orienteering problems

4OR

Volumn 5, Issue 3, 2007, Pages 211-230

  Boussier, Sylvain ^a   Feillet, Dominique ^b   Gendreau, Michel ^c  

^a ECOLE DES MINES D ALÈS   (France)

^b UNIVERSITY OF AVIGNON   (France)

^c UNIVERSITÉ DE MONTRÉAL   (Canada)

Author keywords

Branch price; Column generation; Routing problems with profits; Selective vehicle routing problem with time windows; Team orienteering problem

Indexed keywords

EID: 34848923791     PISSN: 16194500     EISSN: 16142411     Source Type: Journal    
DOI: 10.1007/s10288-006-0009-1     Document Type: Article

References (15)

1. Archetti C, Hertz A, Speranza MG (2005) Metaheuristics for the team orienteering problem. Technical Report GERAD-2005-47, Groupes d'Etudes et de Recherche en Analyse des Dcisions
2. Butt SE, Ryan DM (1999) An optimal solution procedure for the multiple tour maximum collection problem using column generation. Comput Oper Res 26(4): 427-441
3. Chao I-M, Golden BL, Wasil EA (1996) The team orienteering problem. Eur J Oper Res 88(3): 464-474
4. Desaulniers G, Desrosiers J, Solomon MM (eds) (2005) Column generation. GERAD 25th Anniversary Series. Springer, Berlin Heidelberg New York
5. Desrochers M, Desrosiers J, Solomon MM (1992) A new optimization algorithm for the vehicle routing problem with time windows. Oper Res 40(2): 342-354
6. Feillet D, Dejax P, Gendreau M, Gueguen C (2004) An exact algorithm for the elementary shortest path problem with resource constraints: application to some vehicle routing problems. Networks 44 (3): 216-229
7. Feillet D, Dejax P, Gendreau M (2005a). Traveling salesman problems with profits. Transp Sci 39(2): 188-205
8. Feillet D, Gendreau M, Rousseau LM (2005b) New refinements for the solution of vehicle routing problems with branch and price. Technical Report CRT-2005-08, Centre de Recherche sur les Transports
9. Gueguen C (1999) Méthodes de résolution exacte pour les problèmes de tournées de véhicules. Thése de doctorat, école Centrale Paris
10. Gueguen C (2006) Private communication
11. Harvey W, Ginsberg M (1995) Limited discrepancy search. In: Proceedings of the 14th international joint conference on artificial intelligence (IJCAI-95), Morgan Kaufmann, Montréal, pp. 607-615
12. Hayari N, Manier M-A, Bloch C, El Moudni A (2003) Un algorithme évolutionniste pour le problème de tournées sélectives avec contraintes de fenêtre de temps. In 4ème Conférence Francophone de MOdélisation et SIMulation MOSIM'03, Toulouse
13. Irnich S, Desaulniers G (2005) Shortest path problems with resource constraints. In: Desaulniers G, Desrosiers J, Solomon MM, (eds) Column generation, GERAD 25th Anniversary Series, chap 2, pp. 33-65, Springer, Berlin Heidelberg New York
14. Laporte G, Martello S (1990) The selective traveling salesman problem. Discrete Appl Math 26:193-207
15. Tang H, Miller-Hooks E (2005) A tabu search heuristic for the team orienteering problem. Comput Oper Res 32(6): 1379-1407