Discrete Particle Swarm Optimization Algorithms for the Prize-Collecting Call Control Problem on Lines

Abstract

Abstract-In this paper,we propose two discrete particle swarm optimization algorithms to solve a prize-collecting call control problem on lines based on the classical particle swarm optimization algorithm. The two algorithms combine simulated annealing and genetical methods with particle swarm optimization respectively. Then, we do lots of experiments to compare the two discrete particle swarm optimization algorithms we addressed, in which we compare the results and iteration time and the convergence of two algorithms under some given variables. Finally, computational results show that the proposed discrete particle swarm optimization with genetic algorithm is very efficient and can be quickly obtained good results.