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

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

Authors
Qian-Na Cui, Xing Wu, Qiao-Yan Zhu
Corresponding Author
Qian-Na Cui
Available Online December 2016.
DOI
https://doi.org/10.2991/icwcsn-16.2017.96How to use a DOI?
Keywords
DPSO algorithm; prize-collecting; call control; lines
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.
Open Access
This is an open access article distributed under the CC BY-NC license.

Download article (PDF)

Proceedings
Part of series
Advances in Computer Science Research
Publication Date
December 2016
ISBN
978-94-6252-302-9
ISSN
2352-538X
DOI
https://doi.org/10.2991/icwcsn-16.2017.96How to use a DOI?
Open Access
This is an open access article distributed under the CC BY-NC license.

Cite this article

TY  - CONF
AU  - Qian-Na Cui
AU  - Xing Wu
AU  - Qiao-Yan Zhu
PY  - 2016/12
DA  - 2016/12
TI  - Discrete Particle Swarm Optimization Algorithms for the Prize-Collecting Call Control Problem on Lines
PB  - Atlantis Press
SP  - 464
EP  - 469
SN  - 2352-538X
UR  - https://doi.org/10.2991/icwcsn-16.2017.96
DO  - https://doi.org/10.2991/icwcsn-16.2017.96
ID  - Cui2016/12
ER  -