Abstract
This paper describes a branch-and-cut algorithm to solve the Team Orienteering Problem (TOP). TOP is a variant of the Vehicle Routing Problem (VRP) in which the aim is to maximize the total amount of collected profits from visiting customers while not exceeding the predefined travel time limit of each vehicle. In contrast to the exact solving methods in the literature, our algorithm is based on a linear formulation with a polynomial number of binary variables. The algorithm features a new set of useful dominance properties and valid inequalities. The set includes symmetric breaking inequalities, boundaries on profits, generalized subtour eliminations and clique cuts from graphs of incompatibilities. Experiments conducted on the standard benchmark for TOP clearly show that our branch-and-cut is competitive with the other methods in the literature and allows us to close 29 open instances.
This work is partially supported by the Regional Council of Picardie and the European Regional Development Fund (ERDF), under PRIMA project.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Bouly, H., Moukrim, A., Chanteur, D., Simon, L.: Un algorithme de destruction/construction itératif pour la résolution d’un problème de tournées de véhicules spécifique. In: MOSIM 2008 (2008)
Boussier, S., Feillet, D., Gendreau, M.: An exact algorithm for team orienteering problems. 4OR 5(3), 211–230 (2007)
Butt, S.E., Ryan, D.M.: An optimal solution procedure for the multiple tour maximum collection problem using column generation. Computers & Operations Research 26, 427–441 (1999)
Chao, I.-M., Golden, B., Wasil, E.: The team orienteering problem. European Journal of Operational Research 88, 464–474 (1996)
Dang, D.-C., Moukrim, A.: Subgraph extraction and metaheuristics for the maximum clique problem. Journal of Heuristics 18, 767–794 (2012)
Dang, D.-C., Guibadj, R.-N., Moukrim, A.: A PSO-inspired algorithm for the team orienteering problem. European Journal of Operational Research (in press, accepted manuscript, available online March 2013)
Fischetti, M., Salazar González, J.J., Toth, P.: Solving the orienteering problem through branch-and-cut. INFORMS Journal on Computing 10, 133–148 (1998)
Poggi de Aragão, M., Viana, H., Uchoa, E.: The team orienteering problem: Formulations and branch-cut and price. In: ATMOS, pp. 142–155 (2010)
Tang, H., Miller-Hooks, E.: A tabu search heuristic for the team orienteering problem. Computer & Operations Research 32, 1379–1407 (2005)
Vansteenwegen, P., Souffriau, W., Vanden Berghe, G., Van Oudheusden, D.: Metaheuristics for tourist trip planning. In: Metaheuristics in the Service Industry. Lecture Notes in Economics and Mathematical Systems, vol. 624, pp. 15–31. Springer, Heidelberg (2009)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2013 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Dang, DC., El-Hajj, R., Moukrim, A. (2013). A Branch-and-Cut Algorithm for Solving the Team Orienteering Problem. In: Gomes, C., Sellmann, M. (eds) Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems. CPAIOR 2013. Lecture Notes in Computer Science, vol 7874. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-38171-3_23
Download citation
DOI: https://doi.org/10.1007/978-3-642-38171-3_23
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-38170-6
Online ISBN: 978-3-642-38171-3
eBook Packages: Computer ScienceComputer Science (R0)