The Prize-collecting Call Control Problem on Weighted Lines and Rings

Li, Weidong; Li, Jianping; Guan, Li; Shi, Yaomin

doi:10.1051/ro/2015010

Cited by 3 publications

(2 citation statements)

References 19 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Later, motivated by the research of prize-collecting Steiner tree problem [8], Li. et al [6] introduced the prize-collecting call control (PCCC) problem on lines, for which they designed a 1.58-approximation algorithm using a randomized rounding technique.…”

Section: Introductionmentioning

confidence: 99%

See 1 more Smart Citation

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

Cui¹,

Wu²,

Zhu³

2017

Proceedings of the 3rd International Conference on Wireless Communication and Sensor Networks (WCSN 2016)

View full text Add to dashboard Cite

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.

show abstract

Section: Introductionmentioning

confidence: 99%

“…et al [6], which is prize-collecting call control problem on lines, the description of this problem is as follows. Given [6] proved that the PCCC problem on lines is NP-hard.…”

Section: Introductionmentioning

confidence: 99%