Solving a type of biobjective bilevel programming problem using NSGA-II

DOI10.1016/j.camwa.2009.10.022zbMath1189.90142OpenAlexW2082164330MaRDI QIDQ980261

Dan Lin, Minqiang Li, Shou-Yang Wang

Publication date: 28 June 2010

Published in: Computers \& Mathematics with Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.camwa.2009.10.022

zbMATH Keywords

bargainingbilevel programmingdecision-makingtwo-level optimizationmultiobjective evolutionary algorithms

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Multi-objective and goal programming (90C29)

Related Items (4)

Optimal versioning strategy for information products with behavior-based utility function of heterogeneous customers ⋮ Metaheuristics for bilevel optimization: a comprehensive review ⋮ Military system of systems architecting with individual system contracts ⋮ Bilevel Optimization: Theory, Algorithms, Applications and a Bibliography

Uses Software

• PISA
• Genocop
• NBI

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• A simulation-based multi-objective genetic algorithm (SMOGA) procedure for BOT network design problem
• Multicriteria approach to bilevel optimization
• Stackelberg-Nash equilibrium for multilevel programming with multiple followers using genetic algorithms
• Efficient solutions for the linear bilevel programming problem
• Practical bilevel optimization. Algorithms and applications
• Foundations of bilevel programming
• A note on efficient solutions for the linear bilevel programming problem
• Linear bilevel programming solution by genetic algorithm
• Fuzzy multilevel programming with a hybrid intelligent algorithm
• A new approach for solving linear bilevel problems using genetic algorithms
• Genetic algorithm based approach to bi-level linear programming

This page was built for publication: Solving a type of biobjective bilevel programming problem using NSGA-II