A memetic algorithm for the team orienteering problem
- 421 Downloads
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.
KeywordsSelective vehicle routing problem Memetic algorithm Optimal split Metaheuristic Destruction/construction
MSC classification (2000)90B06 90C27 90C59
Unable to display preview. Download preview PDF.
- Bellman R (1957) Dynamic Programming. Princeton University Press, PrincetonGoogle Scholar
- Bouly H, Dang D-C, Moukrim A (2008) A memetic algorithm for the team orienteering problem. In EvoWorkshopsGoogle Scholar
- Khemakhem M, Chabchoub H, Semet F (2007) Heuristique basée sur la mémoire adaptative pour le problème de tournées de véhicules sélectives. In Logistique & Transport, pp 31–37, Sousse, TunisieGoogle Scholar
- Moscato P (1999) New ideas in optimization. chapter Memetic Algorithms: a short introduction. McGraw-Hill, UK, pp 219–234Google Scholar