A memetic algorithm for the team orienteering problem

Authors:
Hermann Bouly;Duc-Cuong Dang;Aziz Moukrim
Affiliations:
Université de Technologie de Compiégne, Heudiasyc, CNRS, UMR, Compiégne, France and VEOLIA Environnement, Direction de la Recherche, Paris, France;Université de Technologie de Compiégne, Heudiasyc, CNRS, UMR, Compiégne, France;Université de Technologie de Compiégne, Heudiasyc, CNRS, UMR, Compiégne, France
Venue:
Evo'08 Proceedings of the 2008 conference on Applications of evolutionary computing
Year:
2008

Citing 6
Cited 1

Algorithms for the vehicle routing and scheduling problems with time window constraints

Operations Research
A heuristic for the multiple tour maximum collection problem

Computers and Operations Research
Memetic algorithms: a short introduction

New ideas in optimization
Traveling Salesman Problems with Profits

Transportation Science
Metaheuristics for the team orienteering problem

Journal of Heuristics
A TABU search heuristic for the team orienteering problem

Computers and Operations Research

Time-dependent personal tour planning and scheduling in metropolises

Expert Systems with Applications: An International Journal

Quantified Score

Hi-index	0.00

Visualization

Abstract

The Team Orienteering Problem (TOP) is a generalization of the Orienteering Problem (OP). A limited number of vehicles is available to visit customers from a potential set. Each vehicle has a predefined running-time limit, and each customer has a fixed associated profit. The aim of the TOP is to maximize the total collected profit. In this paper we propose a simple hybrid Genetic Algorithm (GA) using new algorithms dedicated to the specific scope of the TOP: an Optimal Split procedure for chromosome evaluation and Local Search techniques for mutation. We have called this hybrid method a Memetic Algorithm (MA) for the TOP. Computational experiments conducted on standard benchmark instances clearly show our method to be highly competitive with existing ones, yielding new improved solutions in at least 11 instances.