Solving the Team Orienteering Problem: Developing a Solution Tool Using a Genetic Algorithm Approach

  • João Ferreira
  • Artur Quintas
  • José A. Oliveira
  • Guilherme A. B. Pereira
  • Luis Dias
Conference paper
Part of the Advances in Intelligent Systems and Computing book series (AISC, volume 223)


Nowadays, the collection of separated solid waste for recycling is still an expensive process, specially when performed in large-scale. One main problem resides in fleet-management, since the currently applied strategies usually have low efficiency. The waste collection process can be modelled as a vehicle routing problem, in particular as a Team Orienteering Problem (TOP). In the TOP, a vehicle fleet is assigned to visit a set of customers, while executing optimized routes that maximize total profit and minimize resources needed. The objective of this work is to optimize the waste collection process while addressing the specific issues around fleet-management. This should be achieved by developing a software tool that implements a genetic algorithm to solve the TOP. We were able to accomplish the proposed task, as our computational tests have produced some challenging results in comparison to previous work around this subject of study. Specifically, our results attained 60% of the best known scores in a selection of 24 TOP benchmark instances, with an average error of 18.7 in the remaining instances. The usage of a genetic algorithm to solve the TOP proved to be an efficient method by outputting good results in an acceptable time.


Routing problems Team orienteering problem Optimization Metaheuristics Genetic algorithm 



This study was partially supported by the project GATOP - Genetic Algorithms for Team Orienteering Problem (Ref PTDC/EME-GIN/ 120761/2010), financed by national funds by FCT / MCTES, and co-funded by the European Social Development Fund (FEDER) through the COMPETE Programa Operacional Fatores de Competitividade (POFC) Ref FCOMP-01-0124-FEDER-020609.


  1. 1.
    Butt, S.E., Cavalier, T.M.: A heuristic for the multiple tour maximum collection problem. Comput. Oper. Res. 21, 101–111 (1994)CrossRefzbMATHGoogle Scholar
  2. 2.
    Chao, I.M., Golden, B., Wasil, E.A.: Theory and methodology—the team orienteering problem. Eur. J. Oper. Res. 88, 464–474 (1996)CrossRefzbMATHGoogle Scholar
  3. 3.
    Archetti, C., Hertz, A., Speranza, M.G.: Metaheuristics for the team orienteering problem. J. Heuristics 13, 49–76 (2006)CrossRefGoogle Scholar
  4. 4.
    Ke, L., Archetti, C., Feng, Z.: Ants can solve the team orienteering problem. Comput. Ind. Eng. 54, 648–665 (2008)CrossRefGoogle Scholar
  5. 5.
    Vansteewegen, P., Souffriau, W., Van Oudheusden, D.: A guided local search metaheuristic for the team orienteering problem. Eur. J. Oper. Res. 196(1), 118–127 (2009)CrossRefGoogle Scholar
  6. 6.
    Souffriau, W., Vansteenwegen, P., Vanden Berghe, G., Van Oudheusden, D.: A path relinking approach for the team orienteering problem. Comput. Oper. Res. (Metaheuristics for Logistics and Vehicle Routing) 37, 1853–1859 (2010)Google Scholar
  7. 7.
    Tasgetiren, M.F.: A genetic algorithm with an adaptive penalty function for the orienteering problem. J. Econ. Soc. Res. 4(2), 1–26 (2002)Google Scholar
  8. 8.
    Tang, H., Miller-Hooks, E.: A tabu search heuristic for the team orienteering problem. Comput. Oper. Res. 32, 1379–1407 (2005)CrossRefGoogle Scholar

Copyright information

© Springer International Publishing Switzerland 2014

Authors and Affiliations

  • João Ferreira
    • 1
  • Artur Quintas
    • 2
  • José A. Oliveira
    • 1
  • Guilherme A. B. Pereira
    • 1
  • Luis Dias
    • 1
  1. 1.Centre AlgoritmiUniversidade do MinhoBragaPortugal
  2. 2.Graduation in Informatics EngineeringUniversidade do MinhoBragaPortugal

Personalised recommendations