The team orienteering problem |
| |
| Affiliation: | 1. Dipartimento di Economia e Management, Università di Brescia, Italy;2. Departamento de Estadística e Investigación Operativa, Universidad de Valencia, Spain;3. Departamento de Matemáticas para la Economía y la Empresa, Universidad de Valencia, Spain;4. Departamento de Matemática Aplicada, Universidad Politécnica de Valencia, Spain |
| |
| Abstract: | In the team orienteering problem, start and end points are specified along with other locations which have associated scores. Given a fixed amount of time for each of the M members of the team, the goal is to determine M paths from the start point to the end point through a subset of locations in order to maximize the total score. In this paper, a fast and effective heuristic is presented and tested on 353 problems ranging in size from 21 to 102 points. The computational results are presented in detail. |
| |
| Keywords: | |
| 本文献已被 ScienceDirect 等数据库收录！ |
|
