Title: A path relinking approach for the team orienteering problem
Authors: Souffriau, Wouter ×
Vansteenwegen, Pieter
Vanden Berghe, Greet
Van Oudheusden, Dirk #
Issue Date: 2010
Series Title: Computers & operations research vol:37 issue:11 pages:1853-1859
Abstract: This paper introduces a Path Relinking metaheuristic approach for solving the Team Orienteering Problem (TOP), a particular routing problem in which a score is earned for visiting a location. The objective is to maximise the sum of the scores, while not exceeding a time budget Tmax for
travelling to the selected locations. In the case of the simple Orienteering Problem (OP), a single route connecting all selected locations should be followed; in TOP m routes are required and the length of each route is restricted to Tmax. A fast and a slow variant of the approach are tested
using a large set of test instances from the literature; they are compared to other state{of{the{art approaches. The fast variant achieves an average gap of 0.39% to the best known solutions in 5.0 seconds of calculation time, while the slow variant achieves a 0.04% gap within 272.8 seconds.
Moreover, next to achieving most of the best known solutions for many testproblems, the slow variant improved the best known results in five instances.
ISSN: 0305-0548
Publication status: published
KU Leuven publication type: IT
Appears in Collections:Centre for Industrial Management / Traffic & Infrastructure
Informatics Section
Computer Science Technology TC, Technology Campuses Ghent and Aalst
Technologiecluster Computerwetenschappen
× corresponding author
# (joint) last author

Files in This Item:
File Description Status SizeFormat
CAOR2405 - journal versie.pdfjournal version Published 291KbAdobe PDFView/Open Request a copy

These files are only available to some KU Leuven Association staff members


All items in Lirias are protected by copyright, with all rights reserved.

© Web of science