An improved particle swarm optimization for solving bilevel multiobjective programming problem (Q442987): Difference between revisions
From MaRDI portal
Created a new Item |
ReferenceBot (talk | contribs) Changed an Item |
||
(5 intermediate revisions by 5 users not shown) | |||
Property / review text | |||
Summary: 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. | |||
Property / review text: Summary: 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. / rank | |||
Normal rank | |||
Property / Mathematics Subject Classification ID | |||
Property / Mathematics Subject Classification ID: 90C59 / rank | |||
Normal rank | |||
Property / Mathematics Subject Classification ID | |||
Property / Mathematics Subject Classification ID: 90C29 / rank | |||
Normal rank | |||
Property / zbMATH DE Number | |||
Property / zbMATH DE Number: 6063433 / rank | |||
Normal rank | |||
Property / Wikidata QID | |||
Property / Wikidata QID: Q58906260 / rank | |||
Normal rank | |||
Property / MaRDI profile type | |||
Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
Property / full work available at URL | |||
Property / full work available at URL: https://doi.org/10.1155/2012/626717 / rank | |||
Normal rank | |||
Property / OpenAlex ID | |||
Property / OpenAlex ID: W2018754467 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: An overview of bilevel optimization / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Bilevel and multilevel programming: A bibliography review / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Practical bilevel optimization. Algorithms and applications / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Foundations of bilevel programming / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Annotated Bibliography on Bilevel Programming and Mathematical Programs with Equilibrium Constraints / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q4332850 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Bilevel programming: a survey / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q3211108 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Genetic algorithm based approach to bi-level linear programming / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Interactive bilevel multi-objective decision making / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Model and interactive algorithm of bi-level multi-objective decision-making with multiple interconnected decision makers / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Interactive balance space approach for solving multi-level multi-objective programming problems / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Stackelberg solutions to multiobjective two-level linear programming problems / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Multiobjective bilevel optimization / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Application of particle swarm optimization algorithm for solving bi-level linear programming problem / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Particle swarm optimization for bi-level pricing problems in supply chains / rank | |||
Normal rank | |||
links / mardi / name | links / mardi / name | ||
Latest revision as of 13:16, 5 July 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | An improved particle swarm optimization for solving bilevel multiobjective programming problem |
scientific article |
Statements
An improved particle swarm optimization for solving bilevel multiobjective programming problem (English)
0 references
6 August 2012
0 references
Summary: 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.
0 references
0 references
0 references
0 references