An Improved Particle Swarm Optimization for Solving Bilevel Multiobjective Programming Problem

An improved particle swarm optimization (PSO) algorithm is proposed for solving bilevel multiobjective programming problem (BLMPP). For such problems, the proposed algorithm directly simulates the decision process of bilevel programming, which is different from most traditional algorithms designed f...

Celý popis

Uloženo v:
Podrobná bibliografie
Vydáno v:Journal of Applied Mathematics Ročník 2012; číslo 2012; s. 1441 - 1453-491
Hlavní autoři: Guo, Xuning, Zheng, Yue, Hu, Tiesong, Zhang, Tao
Médium: Journal Article
Jazyk:angličtina
Vydáno: Cairo, Egypt Hindawi Limiteds 01.01.2012
Hindawi Publishing Corporation
John Wiley & Sons, Inc
Wiley
Témata:
Algorithms
Approximation
Heuristic
Linear programming
Mathematical models
Optimization
Pareto optimality
Pareto optimum
Programming
Strategy
Studies
ISSN:1110-757X, 1687-0042
On-line přístup:Získat plný text
Tagy: Přidat tag
Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!
Popis
Shrnutí:An improved particle swarm optimization (PSO) algorithm is proposed for solving bilevel multiobjective programming problem (BLMPP). For such problems, the proposed algorithm directly simulates the decision process of bilevel programming, which is different from most traditional algorithms designed for specific versions or based on specific assumptions. The BLMPP is transformed to solve multiobjective optimization problems in the upper level and the lower level interactively by an improved PSO. And a set of approximate Pareto optimal solutions for BLMPP is obtained using the elite strategy. This interactive procedure is repeated until the accurate Pareto optimal solutions of the original problem are found. Finally, some numerical examples are given to illustrate the feasibility of the proposed algorithm.
Bibliografie:ObjectType-Article-1
SourceType-Scholarly Journals-1
ObjectType-Feature-2
content type line 14
ObjectType-Article-2
ObjectType-Feature-1
content type line 23
ISSN:1110-757X
1687-0042
DOI:10.1155/2012/626717