Roulette wheel selection to encourage discrete Particle Swarm Optimization solving toll-keeper scheduling problem

Abstract

Particle Swarm Optimization (PSO) has been proven to solve various applications by most applications using the real problem-space. In some specific problem, the discrete problem-space is selected on PSO that getting the solution result slowly by cause of sticky on local solution, and also the researcher cannot modify or difficult to understand how to improve the performance finding solution. The researcher many be tried to adjust velocity value by giving a new c1, c2 and weight to be a smaller or a larger value. This research proposed how to apply roulette wheel select to improve PSO on the discrete problem-space. Experiment tested the idea by a toll-keeper scheduling and a numerical function. Both problems created parameters inform discrete problem-space. The experiment result showed that PSO with roulette wheel selection taking the solution quickly.