A differential evolution with two mutation strategies and a selection based on an improved constraint-handling technique for bilevel programming problems

DOI10.1155/2014/820747zbMath1407.90361OpenAlexW2151268943WikidataQ59069612 ScholiaQ59069612MaRDI QIDQ1719209

Publication date: 8 February 2019

Published in: Mathematical Problems in Engineering (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1155/2014/820747

Mathematics Subject Classification ID

Nonlinear programming (90C30) Approximation methods and heuristics in mathematical programming (90C59)

Related Items (2)

An evolutionary-state-based selection strategy for enhancing differential evolution algorithm ⋮ An efficient solution strategy for bilevel multiobjective optimization problems using multiobjective evolutionary algorithm

Cites Work

A computational study of global algorithms for linear bilevel programming
Bilevel programming: a survey
Convex two-level optimization
Stackelberg-Nash equilibrium for multilevel programming with multiple followers using genetic algorithms
Solving a bilevel linear program when the inner decision maker control few variables
Practical bilevel optimization. Algorithms and applications
Descent approaches for quadratic bilevel programming
Bilevel and multilevel programming: A bibliography review
Differential evolution -- a simple and efficient heuristic for global optimization over continuous spaces
An efficient constraint handling method for genetic algorithms
The bilevel linear/linear fractional programming problem
Test problem construction for linear bilevel programming problems
Linear bilevel programming solution by genetic algorithm
A novel approach to bilevel nonlinear programming
A new approach for solving linear bilevel problems using genetic algorithms
A hybrid neural network approach to bilevel programming problems
New branch-and-Cut algorithm for bilevel linear programming
A trust-region method for nonlinear bilevel programming: algorithm and computational exper\-ience
A New Evolutionary Algorithm for a Class of Nonlinear Bilevel Programming Problems and Its Global Convergence
A solution method for the static constrained Stackelberg problem via penalty method
A Branch and Bound Algorithm for the Bilevel Programming Problem
New Branch-and-Bound Rules for Linear Bilevel Programming
Annotated Bibliography on Bilevel Programming and Mathematical Programs with Equilibrium Constraints
A solution method for the linear static Stackelberg problem using penalty functions

This page was built for publication: A differential evolution with two mutation strategies and a selection based on an improved constraint-handling technique for bilevel programming problems