@article {10.3844/jcssp.2017.440.451,
article_type = {journal},
title = {A Randomized Population Constructive Heuristic for the Team Orienteering Problem},
author = {Zettam, Manal},
volume = {13},
number = {9},
year = {2017},
month = {Jun},
pages = {440-451},
doi = {10.3844/jcssp.2017.440.451},
url = {https://thescipub.com/abstract/jcssp.2017.440.451},
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 = {Journal of Computer Science},
publisher = {Science Publications}
}