Research Article Open Access

A Randomized Population Constructive Heuristic for the Team Orienteering Problem

Manal Zettam1
  • 1 Ibn Tofail University Kenitra, Morocco

Abstract

The NP-hard (complete) team orienteering problem is a particular vehicle routing problem with the aim of maximizing the profits gained from visiting control points without exceeding a travel cost limit. The team orienteering problem has a number of applications in several fields such as athlete recruiting, technician routing and tourist trip. Therefore, solving optimally the team orienteering problem would play a major role in logistic management. In this study, a novel randomized population constructive heuristic is introduced. This heuristic constructs a diversified initial population for population-based metaheuristics. The heuristics proved its efficiency. Indeed, experiments conducted on the well-known benchmarks of the team orienteering problem show that the initial population constructed by the presented heuristic wraps the best-known solution for 131 benchmarks and good solutions for a great number of benchmarks.

Journal of Computer Science
Volume 13 No. 9, 2017, 440-451

DOI: https://doi.org/10.3844/jcssp.2017.440.451

Submitted On: 18 December 2016 Published On: 17 June 2017

How to Cite: Zettam, M. (2017). A Randomized Population Constructive Heuristic for the Team Orienteering Problem. Journal of Computer Science, 13(9), 440-451. https://doi.org/10.3844/jcssp.2017.440.451

  • 3,423 Views
  • 1,819 Downloads
  • 0 Citations

Download

Keywords

  • Orienteering Problem
  • Team Orienteering Problem
  • Population-Based Meta-Heuristic