Application of Particle Swarm Optimization for the Capacitated Team Orienteering Problem

Alberzeth, Gustav and Ai, The Jin (2014) Application of Particle Swarm Optimization for the Capacitated Team Orienteering Problem. In: Asia Pacific Industrial Engineering and Management System Conference 2014, October 12 - 15, 2014, Ramada Plaza Jeju Hotel, Jeju, Korea.

Preview	Text Paper 31 APIEMS 2014 PSO for CTOP.pdf Download (2MB) | Preview
Preview	Text Paper 31 Peer Review.pdf Download (570kB) | Preview
	Text Turnitin 31.pdf Download (2MB)

Abstract

The capacitated team orienteering problem (CTOP) is one of important transportation problem that can be faced by any organization. In this problem, there are several location or being called vertex. Each vertex has specific score, which will be collected if the vertex is visited by any transportation vehicle. The transportation time between two vertices are defined. There are time and capacity constraints of transportation vehicles, indicates by T and Q, respectively. The CTOP objective is to find the path of several transportation vehicles visiting some selected vertices in order to maximize total collected score within the constraint of T and Q. Various algorithms, such as branch and price, variable neighborhood search, and bi-level filter and fan, have been proposed for solving the CTOP. While the particle swarm optimization (PSO) has been applied to solve similar problems of CTOP such as team orienteering problem (TOP) and team orienteering problem with time windows (TOPTW). This paper tries to apply the PSO for solving the CTOP. The computational results show that the proposed PSO algorithm is able to obtain 47 best known solutions of 130 benchmark problems.

Actions (login required)

View Item