Application of particle swarm optimization based on CHKS smoothing function for solving nonlinear bilevel programming problem
Introduction
The bilevel programming problem (BLP) is a nested optimizations problem with two levels in a hierarchy, the upper and lower level decision-making. Both of them have their own objective functions and constraints. The upper level maker makes his decision firstly, followed by the lower decision make. The objective function and constraint of the upper level programming rely not only on their own decision variables but also on the optimum solution of the lower level programming. The decision maker at the lower level has to optimize its own objective function under the given parameters from decision maker at the upper level, who, in return, with complete information on the possible reactions of the lower, selects the parameters so as to optimize its own objective function. Unlike the multiple objective mathematical programming techniques, the bilevel mathematical programming emphasizes the non-cooperative character of the system. The application of this hierarchical model can be used widely in such areas as resource allocation, decentralized control, network design problem, etc. [1].
The successful application of this hierarchical model depends on how well it is solved in handling realistic complications. A significant amount of effort have been devoted to solving bilevel mathematical programming and many efficient algorithms have been proposed. To date a few algorithms exist to solve BLP, which can be classified into four types: approach of using the Karush–Kuhn–Tucker (K-K-T) condition [2], [3], [4], [5], [6], penalty function approach [7], [8], [9], [10], descent approach [11], [12] and evolutionary approach [13].
Recently, the evolutionary algorithms are widely used to solve different problems in optimal areas and become an alternative for solving bilevel programming for its good characteristics. In 1994, Mathieu etc. [14] firstly developed a genetic algorithm based bilevel programming algorithm. In 1998, Kemal etc. [15] proposed a dual temperature simulated annealing approach for solving bilevel programming problems. In this method, the lower level problem is stochastically relaxed with a parameter that can be used as a temperature scale in simulated annealing. Oduguwa etc. [16] proposed a bilevel genetic algorithm, which is an elitist optimization algorithm developed to encourage limited asymmetric cooperation between the two players, to solve different classes of the bilevel problems within a single framework. Wang etc. [17] proposed an evolutionary algorithm for solving nonlinear bilevel programming problem. A specific optimization problem is constructed with two objectives firstly, which then is solved by a new evolutionary algorithm. By solving the specific problem, they decrease the upper objective value, identify the quality of any feasible solution from infeasible solutions, force the infeasible solutions moving toward the feasible region and improve the feasible solutions gradually.
In modern science and technology, many optimization problems need to be solved in real time, while these classical methods cannot render real-time solutions to these optimization problems, especially large-scale problems. As a new metaheuristic, particle swarm optimization (PSO) [18], [19] has proved to be a competitive algorithm for optimization problems compared with other algorithms such as genetic algorithm (GA) and simulating algorithm (SA). It can converge to the optimal solution rapidly [20], [21], and this advantage has been attracting researchers to solve BLP problem using PSO approach. [22], [23] proposed a hierarchical particle swarm optimization for solving BLP problem.
In this paper, for a class of nolinear bilevel programming (NBLP) problem, replaced the lower level problem by its Kraush-Kuhn-Tucker optimality conditions, the NBLP problem is reduced into a regular nonlinear programming with complementary constraints. It is then smoothed by CHKS smoothing function. Finally, a particle swarm optimization approach is proposed to solve the smoothed nonlinear programming for getting the approximate optimal solution of the NBLP problem. This paper is organized as follows: Section 2 introduces the formulation and basic definitions of bilevel nonlinear programming, and also introduces the smoothing method for nonlinear complementarity problem. Section 3 introduces a particle swarm optimization for solving the smoothed programming problem. Numerical examples are reported in Section 4. And the conclusion is given in Section 5.
Section snippets
Nonlinear bilevel programming problem and smoothing method
We consider the nonlinear bilevel programming (NBLP) formulated as follows [24]:where are continuous differentiable functions. The term (UP) is called the upper-level problem and the term (LP) is called the lower-level problem and correspondingly the terms are the upper-level variable and the lower-level variable respectively.
The notations are defined as follow:
(a) Constraint
Overview of particle swarm optimization
PSO is a population-based heuristic algorithm that simulates the social behavior as birds flocking to a promising position to achieve precise objectives in a multidimensional space. In PSO, the population is referred as a swarm and individuals are called particles. Like other evolutionary algorithms, PSO performs searches using a population of individuals that are updated from iteration to iteration. To find the optimal or approximately optimal solution, each particle changes its searching
Numerical examples
In this section, 5 benchmark problems were used for simulations to test the feasibility and efficiency of the proposed algorithm. For notational simplicity, denote and in these test problems. The details of these problems are as follows:
(1) Reference [5]: Let and
(2) Reference [9]: Let and
Conclusions
Bilevel programming problem are intrinsically non-convex and it is difficult to solve for the global optimum solution. In this paper, we present a method based on particle swarm optimization to solve nonlinear bilevel programming problem. In this algorithm, KKT condition is used to the lower level problem to transform the NBLP into a single nonlinear programming problem with complementary constraints. And CHKS smoothing function is adopted to avoid the difficulty of dealing with the
Acknowledgements
This work was supported by the State Key Development Program for Basic Research of China (No. 2009CB421104) and the National Natural Science Foundation of China (Nos. 50809004 & 41071323).
References (34)
Coordination of a multidivisional organization through two levels of management
International Journal of Management Science
(1983)- et al.
An explicit solution to the multi-level programming problem
Computers & Operations Research
(1982) - et al.
A penalty function method based on KuhnCTucker condition for solving linear bilevel programming
Applied Mathematics and Computation
(2007) - et al.
The steepest descent direction for the nonlinear bilevel programming problem
Operations Research Letters
(1994) - et al.
A globally convergent algorithm for a class of bilevel nonlinear programming problem
Applied Mathematics and Computation
(2007) - et al.
An improved particle swarm optimization algorithm
Applied Mathematics and Computation
(2007) - et al.
Improved particle swarm algorithm for hydrological parameter optimization
Applied Mathematics and Computation
(2010) - et al.
Application of particle swarm optimization algorithm for solving bi-level linear programming problem
Computers and Mathmatics with Applications
(2009) - et al.
Regularization smoothing Newton method for solving nonlinear complementarity problem
Nonlinear Analysis: Real World Applications
(2009) An algorithm for solving the general bilevel programming problem
Mathematics of Operations Research
(1983)
Algorithm for nonlinear bilevel mathematical programs
IEEE Transactions on Systems, Men, and Cybernetics
A global optimization method for nonlinear bilevel programming problems
IEEE Transactions on Systems, Men, and Cybernetics
Solving quadratic convex bilevel programming problems using a smoothing method
Applied Mathematics and Computation
A new computational method for Stackelberg and min-max problems by use of a penalty method
IEEE Transactions on Automatic Control
A solution method for the static constrained Stackelberg problem via penalty method
IEEE Transactions on Automatic Control
Double penalty method for bilevel optimization problems
Annals of Operations Research
On bilevel programming
Part I: general nonlinear cases Mathematical Programming
Cited by (60)
Metaheuristics for bilevel optimization: A comprehensive review
2024, Computers and Operations ResearchStudy on the new implementation mode of cross-docking based on blockchain technology
2023, Computers and Industrial EngineeringWarranty and maintenance service contracts for repairable products
2022, Alexandria Engineering JournalCitation Excerpt :In this paper, the warranty policy considered is a one-dimensional warranty, then one can extend to a two-dimensional case (i.e., both warranty and MSC are characterized by two parameters – i.e., age and usage). Other interesting topics are (i) to examine a warranty and MSC for a fleet of equipment and (ii) to use a particle swarm optimization (PSO) to solve the bi-level decision models for the MSC options proposed as the PSO is claimed as the efficient algorithm for bilevel optimization problems (Kuo and Huang [45], Jiang et al. [46]) since GA can produce better global solutions but it is not an efficient method (Hejazi et al. [38]) (e.g., time required to run one set of data for this study is 23 h). The research of these topics is on the way.
Biomass supply chain coordination for remote communities: A game-theoretic modeling and analysis approach
2021, Sustainable Cities and SocietyCitation Excerpt :In BNLP problems, the outcome of any solution or decision taken by the upper level authority (leader) to optimize their goals is affected by the response of lower level entities (follower), which also tend to optimize their own outcomes (Nasiri & Zaccour, 2009). When the lower-level problem is convex, the conventional solving approach to the BNLP problems is to transform the original two-level problems into a single level one by replacing the lower level optimization problem with the set of equations that define its Karush–Kuhn–Tucker (KKT) conditions (Jiang, Li, Huang, & Wu, 2013). Using the KKT conditions, Kim and Ferris (2019) introduced an extended mathematical programming (EMP) to reformulate the bi-level problem to its equivalent Mathematical Program with Equilibrium Constraints (MPEC) framework solved with an MPEC solver in General Algebraic Modelling System (GAMS) (GAMS, 2020).
Using Karush-Kuhn-Tucker proximity measure for solving bilevel optimization problems
2019, Swarm and Evolutionary ComputationCitation Excerpt :A number of approaches utilize strict KKT conditions to solve bilevel optimization problems. However, it is well-known that KKT conditions are difficult to satisfy [28] because of a number of strict equality constraints. The violations in the KKT conditions need to be small for a point to be close to the optimum; however, the extent of violation of KKT conditions at points in the proximity of a KKT point is not smooth [21].
Linearly convergent bilevel optimization with single-step inner methods
2024, Computational Optimization and Applications