Abstract
This paper proposes an effective Particle Swarm Optimization (PSO)-based Memetic Algorithm (PSOMA) for the Team Orienteering Problem (TOP). TOP is a particular vehicle routing problem whose aim is to maximize the profit gained from visiting clients while not exceeding a travel cost/time limit. Our PSOMA features optimal splitting techniques and genetic crossover operators. Furthermore, the memetic characteristic of our PSOMA is strengthened by an intensive use of local search techniques and also by a low value of 0.07 for inertia. In our experiments with the standard benchmark for TOP, PSOMA attained a gap of only 0.016%, as compared to 0.041%, the best known gap in the literature.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Archetti, C., Hertz, A., Speranza, M.: Metaheuristics for the team orienteering problem. Journal of Heuristics 13(1) (February 2006)
Banks, A., Vincent, J., Anyakoha, C.: A review of particle swarm optimization. part I: background and development. Natural Computing 6(4), 467–484 (2007)
Banks, A., Vincent, J., Anyakoha, C.: A review of particle swarm optimization. part II: hybridisation, combinatorial, multicriteria and constrained optimization, and indicative applications. Natural Computing 7(1), 109–124 (2008)
Bouly, H., Dang, D.C., Moukrim, A.: A memetic algorithm for the team orienteering problem. 4OR 8(1), 49–70 (2010)
Bouly, H., Moukrim, A., Chanteur, D., Simon, L.: Un algorithme de destruction/construction itératif pour la résolution d’un problème de tournées de véhicules spécifique. In: MOSIM 2008 (2008)
Boussier, S., Feillet, D., Gendreau, M.: An exact algorithm for team orienteering problems. 4OR 5(3), 211–230 (2007)
Butt, S., Cavalier, T.: A heuristic for the multiple tour maximum collection problem. Computers and Operations Research 21, 101–111 (1994)
Butt, S.E., Ryan, D.M.: An optimal solution procedure for the multiple tour maximum collection problem using column generation. Computers and Operations Research 26, 427–441 (1999)
Chao, I.M., Golden, B., Wasil, E.: The team orienteering problem. European Journal of Operational Research 88 (1996)
Golden, B., Levy, L., Vohra, R.: The orienteering problem. Naval Research Logistics 34, 307–318 (1987)
Kameyama, K.: Particle swarm optimization - a survey. IEICE Transactions 92-D(7), 1354–1361 (2009)
Ke, L., Archetti, C., Feng, Z.: Ants can solve the team orienteering problem. Computers and Industrial Engineering 54(3), 648–665 (2008)
Kennedy, J., Eberhart, R.C.: Particle swarm optimization. In: Proceedings of IEEE International Conference on Neural Networks, pp. 1942–1948 (1995)
Montemanni, R., Gambardella, L.: Ant colony system for team orienteering problems with time windows. Foundations of Computing and Decision Sciences 34, 287–306 (2009)
Moscato, P.: Memetic Algorithms: a short introduction. In: New Ideas in Optimization, pp. 219–234. McGraw-Hill, New York (1999)
Schilde, M., Doerner, K.F., Hartl, R.F., Kiechle, G.: Metaheuristics for the bi-objective orienteering problem. Swarm Intelligence 3(3), 179–201 (2009)
Sha, D.Y., Hsu, C.Y.: A hybird particle swarm optimization for job shop scheduling problem. Computers and Industrial Engineering 51(4), 791–808 (2006)
Shi, Y., Eberhart, R.C.: Parameter selection in particle swarm optimization. In: Evolutionary Programming, pp. 591–600 (1998)
Souffriau, W., Vansteenwegen, P., Van den Berghe, G., Van Oudheusden, D.: A path relinking approach for the team orienteering problem. Computers & Operations Research 37(11), 1853–1859 (2010)
Tang, H., Miller-Hooks, E.: A tabu search heuristic for the team orienteering problem. Computer & Operations Research 32, 1379–1407 (2005)
Tricoire, F., Romauch, M., Doerner, K.F., Hartl, R.F.: Heuristics for the multi-period orienteering problem with multiple time windows. Computers & Operations Research 37, 351–367 (2010)
Vansteenwegen, P., Souffriau, W., Van den Berghe, G., Van Oudheusden, D.: Metaheuristics for tourist trip planning. In: Metaheuristics in the Service Industry. LNEMS, vol. 624, pp. 15–31. Springer, Heidelberg (2009)
Vansteenwegen, P., Souffriau, W., Van Oudheusden, D.: The orienteering problem: A survey. European Journal of Operational Research 209(1), 1–10 (2011)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2011 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Dang, DC., Guibadj, R.N., Moukrim, A. (2011). A PSO-Based Memetic Algorithm for the Team Orienteering Problem. In: Di Chio, C., et al. Applications of Evolutionary Computation. EvoApplications 2011. Lecture Notes in Computer Science, vol 6625. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-20520-0_48
Download citation
DOI: https://doi.org/10.1007/978-3-642-20520-0_48
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-20519-4
Online ISBN: 978-3-642-20520-0
eBook Packages: Computer ScienceComputer Science (R0)