4OR

, Volume 8, Issue 1, pp 49–70

A memetic algorithm for the team orienteering problem

Research Paper

DOI: 10.1007/s10288-008-0094-4

Cite this article as:
Bouly, H., Dang, DC. & Moukrim, A. 4OR-Q J Oper Res (2010) 8: 49. doi:10.1007/s10288-008-0094-4

Abstract

The team orienteering problem (TOP) is a generalization of the orienteering problem. 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 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 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 5 instances.

Keywords

Selective vehicle routing problem Memetic algorithm Optimal split Metaheuristic Destruction/construction 

MSC classification (2000)

90B06 90C27 90C59 

Copyright information

© Springer-Verlag 2009

Authors and Affiliations

  1. 1.Université de Technologie de Compiègne Heudiasyc, CNRS UMR 6599CompiègneFrance
  2. 2.VEOLIA Environnement, Direction de la RechercheParisFrance