Data not found

Selective discrete particle swarm optimization for the team orienteering problem with time windows and partial scores

Country : Singapore
Department : Singapore Management University
Project Title : Selective discrete particle swarm optimization for the team orienteering problem with time windows and partial scores
Researcher : YU, Vincent F. , REDI, Perwira A. A. N. , JEWPANYA, Parida , GUNAWAN, Aldy
Keyword : Team orienteering problem , Time window , Partial score , Discrete particle swarm optimization , Theory and Algorithms
Publisher : Institutional Knowledge at Singapore Management University
Year End : 2019
Identifier : https://ink.library.smu.edu.sg/sis_research/4469 , https://ink.library.smu.edu.sg/cgi/viewcontent.cgi?article=5472&context=sis_research
Source : Research Collection School Of Information Systems
Abstract / Description :

This paper introduces the Team Orienteering Problem with Time Windows and Partial Scores (TOPTW-PS),which is an extension of the Team Orienteering Problem with Time Windows (TOPTW). In the context of theTOPTW-PS, each node is associated with a set of scores with respect to a set of attributes. The objective ofTOPTW-PS is to find a set of routes that maximizes the total score collected from a subset of attributes whenvisiting the nodes subject to the time budget and the time window at each visited node. We develop a mathematical model and propose a discrete version of the Particle Swarm Optimization (PSO), namely, the SelectiveDiscrete PSO (S-DPSO), to solve TOPTW-PS. The proposed S-DPSO uses four different movement schemes tomove a particle from its current position. The best movement scheme is selected to determine the next position ofthe particle. To evaluate the performance of the proposed S-DPSO algorithm, we first test S-DPSO on two variants of Orienteering Problem, namely, Team Orienteering Problem (TOP) and TOPTW. Experimental resultsshow that S-DPSO performs well in solving benchmark instances of TOP and TOPTW. In general, S-DPSO iscomparable to the state-of-the-art algorithms for these problems. We also apply the S-DPSO to solve 168 newlygenerated TOPTW-PS instances and conclude that the proposed S-DPSO can produce high-quality TOPTW-PSsolutions.

References

YU, Vincent F. and others / et al. (2019). Selective discrete particle swarm optimization for the team orienteering problem with time windows and partial scores.  Singapore: Singapore Management University.
YU, Vincent F. and others / et al. 2019. "Selective discrete particle swarm optimization for the team orienteering problem with time windows and partial scores".  Singapore: Singapore Management University.
YU, Vincent F. and others / et al. "Selective discrete particle swarm optimization for the team orienteering problem with time windows and partial scores."  Singapore: Singapore Management University, 2019. Print.
YU, Vincent F. and others / et al. Selective discrete particle swarm optimization for the team orienteering problem with time windows and partial scores. Singapore: Singapore Management University; 2019.

Export

Share