IEICE TRANSACTIONS on Information
An Improved PSO Algorithm for Interval Multi-Objective Optimization Systems
Summary :
Considering an uncertain multi-objective optimization system with interval coefficients, this letter proposes an interval multi-objective particle swarm optimization algorithm. In order to improve its performance, a crowding distance measure based on the distance and the overlap degree of intervals, and a method of updating the archive based on the acceptance coefficient of decision-maker, are employed. Finally, results show that our algorithm is capable of generating excellent approximation of the true Pareto front.
- Publication
- IEICE TRANSACTIONS on Information Vol.E99-D No.9 pp.2381-2384
- Publication Date
- 2016/09/01
- Publicized
- 2016/06/01
- Online ISSN
- 1745-1361
- DOI
- 10.1587/transinf.2016EDL8052
- Type of Manuscript
- LETTER
- Category
- Fundamentals of Information Systems
Authors
Yong ZHANG
China University of Mining and Technology
Wanqiu ZHANG
China University of Mining and Technology
Dunwei GONG
China University of Mining and Technology
Yinan GUO
China University of Mining and Technology
Leida LI
China University of Mining and Technology
Keyword
Latest Issue
Copyrights notice of machine-translated contents
The copyright of the original papers published on this site belongs to IEICE. Unauthorized use of the original or translated papers is prohibited. See IEICE Provisions on Copyright for details.
Cite this
Copy
Yong ZHANG, Wanqiu ZHANG, Dunwei GONG, Yinan GUO, Leida LI, "An Improved PSO Algorithm for Interval Multi-Objective Optimization Systems" in IEICE TRANSACTIONS on Information,
vol. E99-D, no. 9, pp. 2381-2384, September 2016, doi: 10.1587/transinf.2016EDL8052.
Abstract: Considering an uncertain multi-objective optimization system with interval coefficients, this letter proposes an interval multi-objective particle swarm optimization algorithm. In order to improve its performance, a crowding distance measure based on the distance and the overlap degree of intervals, and a method of updating the archive based on the acceptance coefficient of decision-maker, are employed. Finally, results show that our algorithm is capable of generating excellent approximation of the true Pareto front.
URL: https://global.ieice.org/en_transactions/information/10.1587/transinf.2016EDL8052/_p
Copy
@ARTICLE{e99-d_9_2381,
author={Yong ZHANG, Wanqiu ZHANG, Dunwei GONG, Yinan GUO, Leida LI, },
journal={IEICE TRANSACTIONS on Information},
title={An Improved PSO Algorithm for Interval Multi-Objective Optimization Systems},
year={2016},
volume={E99-D},
number={9},
pages={2381-2384},
abstract={Considering an uncertain multi-objective optimization system with interval coefficients, this letter proposes an interval multi-objective particle swarm optimization algorithm. In order to improve its performance, a crowding distance measure based on the distance and the overlap degree of intervals, and a method of updating the archive based on the acceptance coefficient of decision-maker, are employed. Finally, results show that our algorithm is capable of generating excellent approximation of the true Pareto front.},
keywords={},
doi={10.1587/transinf.2016EDL8052},
ISSN={1745-1361},
month={September},}
Copy
TY - JOUR
TI - An Improved PSO Algorithm for Interval Multi-Objective Optimization Systems
T2 - IEICE TRANSACTIONS on Information
SP - 2381
EP - 2384
AU - Yong ZHANG
AU - Wanqiu ZHANG
AU - Dunwei GONG
AU - Yinan GUO
AU - Leida LI
PY - 2016
DO - 10.1587/transinf.2016EDL8052
JO - IEICE TRANSACTIONS on Information
SN - 1745-1361
VL - E99-D
IS - 9
JA - IEICE TRANSACTIONS on Information
Y1 - September 2016
AB - Considering an uncertain multi-objective optimization system with interval coefficients, this letter proposes an interval multi-objective particle swarm optimization algorithm. In order to improve its performance, a crowding distance measure based on the distance and the overlap degree of intervals, and a method of updating the archive based on the acceptance coefficient of decision-maker, are employed. Finally, results show that our algorithm is capable of generating excellent approximation of the true Pareto front.
ER -
English
