JOURNAL BROWSE
Search
Advanced SearchSearch Tips
Solving the Team Orienteering Problem with Particle Swarm Optimization
facebook(new window)  Pirnt(new window) E-mail(new window) Excel Download
 Title & Authors
Solving the Team Orienteering Problem with Particle Swarm Optimization
Ai, The Jin; Pribadi, Jeffry Setyawan; Ariyono, Vincensius;
  PDF(new window)
 Abstract
The team orienteering problem (TOP) or the multiple tour maximum collection problem can be considered as a generic model that can be applied to a number of challenging applications in logistics, tourism, and other fields. This problem is generally defined as the problem of determining P paths, in which the traveling time of each path is limited by that maximizes the total collected score. In the TOP, a set of N vertices i is given, each with a score . The starting point (vertex 1) and the end point (vertex N) of all paths are fixed. The time needed to travel from vertex i to j is known for all vertices. Some exact and heuristics approaches had been proposed in the past for solving the TOP. This paper proposes a new solution methodology for solving the TOP using the particle swarm optimization, especially by proposing a solution representation and its decoding method. The performance of the proposed algorithm is then evaluated using several benchmark datasets for the TOP. The computational results show that the proposed algorithm using specific settings is capable of finding good solution for the corresponding TOP instance.
 Keywords
Team Orienteering Problem;Particle Swarm Optimization;Solution Representation;Algorithm;Computational Method;Metaheuristics;
 Language
English
 Cited by
 References
1.
Ai, T. J. and Kachitvichyanukul, V. (2009), A particle swarm optimization for the vehicle routing problem with simultaneous pickup and delivery, Computers & Operations Research, 36(5), 1693-1702. crossref(new window)

2.
Archetti, C., Hertz, A., and Speranza, M. (2007), Metaheuristic for the team orienteering problem, Journal of Heuristics, 13(1), 49-76. crossref(new window)

3.
Butt, S. E. and Cavalier, T. M. (1994), A heuristic for the multiple tour maximum collection problem, Computers & Operations Research, 21(1), 101-111. crossref(new window)

4.
Chang, B. C. H., Ratnaweera, A., Halgamuge, S. K., and Watson, H. C. (2004), Particle swarm optimisation for protein motif discovery, Genetic Programming and Evolvable Machines, 5(2), 203-214. crossref(new window)

5.
Chao, I., Golden, B. L., and Wasil, E. A. (1996a), The team orienteering problem, European Journal of Operational Research, 88(3), 464-474. crossref(new window)

6.
Chao, I., Golden, B. L., and Wasil, E. A. (1996b), A fast and effective heuristic for the orienteering problem, European Journal of Operational Research, 88(3), 475-489. crossref(new window)

7.
Clerc, M. (2004), Discrete particle swarm optimization, illustrated by the traveling salesman problem. In: New Optimization Techniques in Engineering, Springer, Berlin, Germany, 219-239.

8.
Hu, X. (2006), Particle swarm optimization, cited 2013 Sep 1, Available from: http://www.swarmintelligence.org.

9.
Ke, L., Archetti, C., and Feng, Z. (2008), Ants can solve the team orienteering problem, Computers & Industrial Engineering, 54(3), 648-665. crossref(new window)

10.
Muthuswamy, S. and Lam, S. S. (2011), Discrete particle swarm optimization for the team orienteering problem, Memetic Computing, 3(4), 287-303. crossref(new window)

11.
Nguyen, S., Ai, T. J., and Kachitvichyanukul, V. (2010), Object Library for Evolutionary Techniques ET-Lib: User's Guide, High Performance Computing Group, Asian Institute of Technology, Thailand.

12.
Souffriau, W., Vansteenwegen, P., Berghe, G. V., and Van Oudheusden, D. (2010), A path relinking approach for the team orienteering problem, Computers & Operations Research, 37(11), 1853-1859. crossref(new window)

13.
Souffriau, W., Vansteenwegen, P., Vertommen, J., Berghe, G. V., and Van Oudheusden, D. (2008), A personalized tourist trip design algorithm for mobile tourist guides, Applied Artificial Intelligence, 22(10), 964-985. crossref(new window)

14.
Tang, H. and Miller-Hooks, E. (2005), A tabu search heuristic for the team orienteering problem, Computers &Operations Research, 32(6), 1379-1407. crossref(new window)

15.
Tsiligirides, T. (1984), Heuristic methods applied to orienteering, Journal of the Operational Research Society, 35(9), 797-809. crossref(new window)

16.
Vansteenwegen, P., Souffriau, W., Berghe, G. V., and Van Oudheusden, D. (2009a), A guided local search metaheuristic for the team orienteering problem, European Journal of Operational Research, 196(1), 118-127. crossref(new window)

17.
Vansteenwegen, P., Souffriau, W., Berghe, G. V., and Van Oudheusden, D. (2009b), Metaheuristics for tourist trip planning. In: Metaheuristics in the Service Industry, Springer, Berlin, Germany, 15-31.

18.
Vansteenwegen, P., Souffriau, W., and Van Oudheusden, D. (2011), The orienteering problem: a survey, European Journal of Operational Research, 209(1), 1-10. crossref(new window)