Strategic Behavior of Customers and Optimal Control for Batch Service Polling Systems with Priorities

Algorithm 2

Solve the optimization problem by PSO.

	Input: {}
	Out:
	Set the number of particles , the range of , and maximum number of iterations.
	Generate the number of particles randomly, denoted by , where .
	while the number of iterations < the maximum number of iterations do
	Calculate the fitness value (the profit of service provider) of each particle.
	Update the coordinates of the local optimal value {Pbest1, Pbest2, ... Pbestn} and the coordinates of the global optimal value Gbest.
	Update the coordinates of each particle by the following formulas:
	where stands for th iteration, represents th particle, and are acceleration constants, and $rand$ is a random variable in the range of [0, 1].