A Compromise-Based Particle Swarm Optimization Algorithm for Solving Bi-Level Programming Problems with Fuzzy Parameters

Jialin Han, Yaoguang Hu, Guangquan Zhang, Jie Lu
{"title":"A Compromise-Based Particle Swarm Optimization Algorithm for Solving Bi-Level Programming Problems with Fuzzy Parameters","authors":"Jialin Han, Yaoguang Hu, Guangquan Zhang, Jie Lu","doi":"10.1109/ISKE.2015.21","DOIUrl":null,"url":null,"abstract":"Bi-level programming has arisen to handle decentralized decision-making problems that feature interactive decision entities distributed throughout a bi-level hierarchy. Fuzzy parameters often appear in such a problem in applications and this is called a fuzzy bi-level programming problem. Since the existing approaches lack universality in solving such problems, this study aims to develop a particle swarm optimization (PSO) algorithm to solve fuzzy bi-level programming problems in the linear and nonlinear versions. In this paper, we first present a general fuzzy bi-level programming problem and discuss related theoretical properties based on a fuzzy number ranking method commonly used. A PSO algorithm is then developed to solve the fuzzy bi-level programming problem based on different compromised selections by decision entities on the feasible degree for constraint conditions under fuzziness. Lastly, an illustrative numerical example and two benchmark examples are adopted to state the effectiveness of the compromise-based PSO algorithm.","PeriodicalId":312629,"journal":{"name":"2015 10th International Conference on Intelligent Systems and Knowledge Engineering (ISKE)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2015-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2015 10th International Conference on Intelligent Systems and Knowledge Engineering (ISKE)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ISKE.2015.21","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0

Abstract

Bi-level programming has arisen to handle decentralized decision-making problems that feature interactive decision entities distributed throughout a bi-level hierarchy. Fuzzy parameters often appear in such a problem in applications and this is called a fuzzy bi-level programming problem. Since the existing approaches lack universality in solving such problems, this study aims to develop a particle swarm optimization (PSO) algorithm to solve fuzzy bi-level programming problems in the linear and nonlinear versions. In this paper, we first present a general fuzzy bi-level programming problem and discuss related theoretical properties based on a fuzzy number ranking method commonly used. A PSO algorithm is then developed to solve the fuzzy bi-level programming problem based on different compromised selections by decision entities on the feasible degree for constraint conditions under fuzziness. Lastly, an illustrative numerical example and two benchmark examples are adopted to state the effectiveness of the compromise-based PSO algorithm.
基于妥协的粒子群优化算法求解模糊参数双层规划问题
双级规划的出现是为了处理分散的决策问题,这些问题以分布在双级层次结构中的交互式决策实体为特征。在实际应用中,模糊参数经常出现在这类问题中,这被称为模糊双层规划问题。由于现有方法在求解此类问题方面缺乏通用性,本研究旨在开发一种粒子群优化(PSO)算法来求解线性和非线性版本的模糊双层规划问题。本文首先给出了一类一般的模糊双层规划问题,并基于一种常用的模糊数排序方法讨论了相关的理论性质。在此基础上,提出了一种基于模糊约束条件可行度的决策实体折衷选择的粒子群算法来求解模糊双层规划问题。最后,通过一个说明性的数值算例和两个基准算例验证了基于折衷的粒子群算法的有效性。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
自引率
0.00%
发文量
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:604180095
Book学术官方微信