The Backpropagation Artificial Neural Network Based on Elite Particle Swam Optimization Algorithm for Stochastic Linear Bilevel Programming Problem

Zhang, Tao; Li, Xiaofei

doi:https://doi.org/10.1155/2018/1626182

Mathematical Problems in Engineering

On this page

Abstract Introduction Conclusion Data Availability Conflicts of Interest Acknowledgments References Copyright Related Articles

Research Article | Open Access

Volume 2018 | Article ID 1626182 | https://doi.org/10.1155/2018/1626182

The Backpropagation Artificial Neural Network Based on Elite Particle Swam Optimization Algorithm for Stochastic Linear Bilevel Programming Problem

Tao Zhang¹and Xiaofei Li¹

Academic Editor: Frederico R. B. Cruz

Received24 Jul 2018

Accepted08 Oct 2018

Published22 Oct 2018

Abstract

For a class of stochastic linear bilevel programming problem, we firstly transform it into a deterministic linear bilevel covariance programming problem. Then, the deterministic bilevel covariance programming problem is solved by backpropagation artificial neural network based on elite particle swam optimization algorithm (BPANN-PSO). Finally, we perform the simulation experiments and the results show that the computational efficiency of the proposed algorithm has a potential upside compared with the classical algorithm.

1. Introduction

The bilevel programming problem (BLP) is a nested optimizations problem in which the feasible region of the upper level problem is determined implicitly by the solution set of the lower level problem. As an optimization tool, the BLP has been widely used in variety practical problems, for example, in homeland security [1–3], model production processes [4], the optimal tax policies formulation [5–7], the strategic for deregulating markets [8], and the optimization of retail channel structures [9]. In addition, the optimization theory of the BLP has been integrated in many other disciplines, such as in management [10, 11], chemical engineering [12, 13], structural optimization [14, 15], optimal control problems [16, 17], facility location [10, 18, 19], and transportation [20–22].

Therefore, many researchers are devoted to develop the algorithms for BLP and propose many efficient algorithms. Traditional methods commonly used to handle BLP include Karus-Kuhn-Tucker approach [23–26], Branch-and-bound method [27], and penalty function approach [28–31]. Despite a significant progress made in traditional optimization towards solving BLPPs, the properties such as differentiation and continuity are necessary for these algorithms.

Due to the limitation of the traditional algorithms, the heuristics such as evolutionary algorithms are recognized as potent tools for solving BLPPs. Mathieu et al. [32] firstly developed the genetic algorithm (GA) for bilevel linear programming problem. Motivated by the same reason, other kinds of GAs for BLPPs were also presented in [33–36]. Owing to its high speed of convergence and relative simplicity, the particle swam optimization (PSO) algorithm has been employed for solving BLP problems recently [37–42].

However, it is worth noting that the papers mentioned above only focus on deterministic bilevel programming problem and the stochastic bilevel programming has seldom been studied so far. In 1999, Patriksson and Wynter [43] firstly proposed the stochastic mathematical programs with equilibrium constraints and introduced a framework for hierarchical decision-making problem under uncertainty. However, they did not give a numerical experiment. Gao, Liu, and Gen [44] presented a hybrid intelligent algorithm for a decentralized multilevel decision-making problem in stochastic environment in 2004. For the contracting arrangements of the long-term contracts and the spot markets transactions under uncertain electricity spot market, Wan et al. [45] proposed a stochastic bilevel programming model for the optimal bidding strategies between power seller and buyer. They solved the model by Monte Carlo approximation method. It is worth noting that the decision variable in both levels are one-dimensional variable. Soon after, Wan, Fan, and Wang [46] proposed an interactive fuzzy decision-making method for the model in [45]. In 2013, He and Feng [47] presented an approximation algorithm for the compensated stochastic bilevel programming problem. In addition, the stability analysis and convergence analysis for bilevel stochastic programming problem can be seen in [48–50]. Obviously, they only researched the simple stochastic bilevel model and few of them have studied the numerical performance of the algorithm.

In this paper, we consider the general stochastic linear bilevel programming problem in which the coefficient of objective functions and the coefficient of constraint functions are random variables. For the problem, we firstly transformed it into a deterministic linear bilevel covariance programming problem with expected constraints, and then the deterministic bilevel covariance programming model is solved by the BPANN-PSO algorithm. Finally, we perform the simulation experiments and the results suggest that the variance obtained by our algorithm is better than the results in reference when the means of the upper objective function value is same. Furthermore, the computational efficiency of our algorithm performs better with the dimension increasing.

The rest of this paper is organized as follows. Section 2 introduces the definitions and properties of stochastic linear bilevel programming problem. Section 3 proposes the BPANN-PSO algorithm for stochastic linear bilevel programming problem. We use three test problems from the reference to measure and evaluate the proposed algorithm in Section 4, while the conclusion is reached in Section 5.

2. Stochastic Linear Bilevel Programming

Let , , , , , we consider stochastic linear bilevel programming problem as follows: where and are the upper level and the lower level objective functions, respectively. The coefficient , are the random variable.

Let be a probability of the extent to which the constraint violation is admitted; means a probability measure. The constraint of problem (1) is interpreted as follows:

Inequality (2) means that the constraint may be violated, but at most proportion of the time. Let be the distribution function of random variables , then, inequality (2) is presented asAccording to (2) and (3), we can obtain inequality (4),

Let . Then, from the monotonicity of the distribution function , inequality (2) is rewritten asThat is, where . Based on (6), problem (1) is rewritten as the following problem with deterministic constraints:

To deal with the objective functions with random variables in both levels, the minimum covariance model [51] is applied in this paper. Then, problem (7) is rewritten as follows:where denotes the variance of objective function; and are the covariance matrices of and , respectively. In this paper, we assume that and are positive-definite.

Though problem (8) can guarantee uniform distribution of the objective function values of both levels with a small drop, the decision makers in both levels often have their own expectation. Let and denote the means of the objective function values for the leader and the follower, respectively. Then, problem (8) is rewritten as the follows:where and are the means of and , respectively. and are the means of and , respectively. For the fixed upper level decision variable , the rational reaction set can be solved by problem (10).Let , , . Then, problem (9) is formulated asFor problem (11), the basic notions of BLP are recalled as follows:(a)Constraint region of the BLP:(b)Feasible set for the lower level problem for each fixed :(c)Projection of onto the upper level maker’s decision space:(d)The lower level maker’s rational reaction set for each fixed :(e)Inducible region:

Definition 1. A point is feasible if .

Definition 2. A feasible point is an optimal solution if and , .

Definition 3. If is the optimistic solution for problem (11), is given by .

3. The Algorithm

For problem (11), it is noted that a solution is feasible for the upper level problem if and only if is an optimal solution for the lower level problem with . In practice, we often make the approximate optimal solutions of the lower level problem as the optimal response feedback to the upper level problem, and this point of view is accepted usually. Based on this fact, the BPANN-PSO algorithm may have a great potential for solving problem (11). In the following, the BPANN-PSO is presented for solving problem (11).

3.1. The Structure of BPANN

In this paper, the BPANN includes three layers: the input layer, the hidden layer, and the output layer. The number of nodes per layer is , , and (). The connectivity weight from the node of the input to the node of the hidden layer is . denotes the connectivity weight from the node of the hidden layer to the node of the output layer. Let the Sigmoid function . Figure 1 shows the diagram of the BPANN.

Let represent the input value of the sample. The output of the hidden layer is given by

For the output layer, the output is given by

denotes the node’s expected output of the output layer. The squared differences between the computed and desired outputs are given by (19) and the error sum of all training pairs is given by (20):

3.2. The BPANN-PSO Algorithm

In this algorithm, the position of the particle represents the connectivity weight of the BPANN and the particles in the elite set are the batch training samples. Based on this idea, the BPANN-PSO algorithm can be designed as follows.

Suppose , , , . The particle in can be presented as .

Algorithm 4.
Step 1. Initialize the population with particles and each particle can be presented as . Let the be the number of the particles in the elite set .
Step 2. Train the BPANN using the PSO.
Step 2.1. Calculate its fitness value according to (20).
Step 2.2. Determine its personal best particle and global best particle.
Step 2.3. Update particle’s position and velocity.
Step 3 (stopping criterion). If , stop. Otherwise, go to step 2.
In step 2.3, the inertia weight , the acceleration constants , and .

3.3. The Algorithm for BLP

We proposed the BPANN-PSO for problem (11) and we update the upper level decision variables using the method in [52]. However, the way to solve the lower level problems is completely different. In reference [52], for each updated upper level decision variable, we need to reexecute the lower level optimization problem by cooperative coevolution PSO (CCPSO). In other words, the historical optimal solutions do not contribute to the current optimal solution. In our algorithm, for the updated upper level decision variable, we can predict the corresponding lower level optimal solution directly by BPANN. From the above analysis, we can see that the computational efficiency of our proposed algorithm performs well than the method in the reference [52]. Furthermore, we also give the basic working framework for these two algorithms (see Figure 2)

Algorithm 5.
Step 1. Initialization scheme. Initialize a random population () of the upper level variable .
Step 2. For the fixed (), initialize a random population () of the lower level variable . Then, we perform a lower level optimization procedure to determine the corresponding lower level optimal solution using PSO.
Step 3. Evaluate the fitness value of the complete solutions () by the upper level function and constraints conditions. Copy all the members in an elite set .
Step 4. Update the upper level decision variables using the simulated binary crossover operator (SBX) and the polynomial variation method (PM).
Step 5. For the new upper level variable . Predict the lower level optimal solutions using Algorithm 4.
Step 6. Update the elite set . Copy all the offspring from the previous step to the elite set and choose the best members as the new members of .
Step 7. Perform a termination check. If the termination check is false, go to step 4.
In the Algorithm 5, the PSO parameters are set as follows: the inertia weight , acceleration coefficients , and , . At step 7, the termination criteria based on variance is described as follows. For each upper level variable , the variance at the generation is . Then, the stop metrics is computed asIn this paper, the value of is set as 10⁻⁴ for the upper level.

3.4. Algorithm Complexity Analysis

By the algorithm in [51], for the vector with dimension , each component of the vector has two states, zero or nonzero, therefore, the vector has a total of forms. We examine the case where the calculation is the most expensive here, that is, until the last combination satisfies the complementary relaxation condition, suppose the number of vertices is and let the time be for computing the , and the total time required to complete a check is as follows: .

In Algorithm 4 of our paper, the number of nodes of the input layer, the hidden layer, and the output layer are , , and (), respectively. The batch training sample is and the time for computing multiplication is ; for one training sample, the computing time is as follows: . The total computing time of all samples is as follows: . In Algorithm 5, suppose the number of iterations is , the computing time required to solve problem (11) is as follows: . and are almost the same when they have the same operating platform. Comparing and , our algorithm has obvious advantages when the dimension of the decision variable increases.

4. Numerical Experiment

In this section, we test the algorithm using three examples. All results presented in this paper have been obtained on a personal computer (CPU: AMD Phenon(tm)IIX6 1055T 2.80 GHz; RAM: 3.25 GB) using a C# implementation of the proposed algorithm.

Example 1. Let ; we consider the problem from [51]where . . All the right-hand side values are normal random variables. The mean, variance, and probability of are shown in Table 1.
According to the above conditions, problem (22) can be rewritten as follows:We solve problem (23) with constrain of means of the objective function values and we also solved problem (23) without this constrain. From Table 2, we can see that the variance obtained by our algorithm is better than the results in [51] when the means of the upper objective function value is the same. Moreover, the computational efficiency of our algorithm performs better.

Example 2. Let , , , , ; we consider problem from [51]where , , , , , , , , , , and . The expectation of random variable is shown in Table 3. The coefficient matrices of constraints are as follows:According to model (8), problem (24) can be rewritten as follows:For problem (26), we solve the problem with constrain of the means of the objective function values and we also solved it without this constrain. From Table 4, we can see that the variance obtained by our algorithm is better than the results in [51] when the mean of the upper objective function value is almost the same. Furthermore, the computational efficiency of our algorithm performs better with the number of dimension increasing.
Examples 1 and 2 are the general linear stochastic bilevel programming problem; that is to say, the coefficient of objective functions and the coefficient of constraint functions are random variables. Furthermore, the algorithm is also effective for the stochastic linear bilevel programming with chance constants. We consider the compensated stochastic linear bilevel programming as follows.

Example 3. Let , we consider the problem from [47]where , . In this paper, we set the 10 samples model and 30 samples model for problem (27), then, we obtained problem (28) and (29):
10 samples for model:30 samples for model:We solve problem (28) and problem (29) by our algorithm and the method in [47]. From Table 5, we can see that the computational efficiency of our algorithm performs better when they have almost the same optimal solutions.

5. Conclusion and Future Works

In this paper, we designed the BPANN-PSO algorithm to solve the general stochastic linear bilevel programming problem and three test problems from the reference are used to measure and evaluate the proposed algorithm. The results suggest that the variance obtained by our algorithm is better than the results in reference when the mean of the upper objective function value is almost the same. Furthermore, the computational efficiency of our algorithm performs better with the number of the dimensions increasing.

In the future works, we will further discuss how to efficiently use the infeasible solution with good performance near the optimal. This kind of discussion could improve the performance of our BPANN-PSO, particularly when the optimal front lies on the boundaries between the feasible and infeasible regions.

Data Availability

The data used to support the findings of this study are included within the article.

Conflicts of Interest

The authors declare that they have no conflicts of interest.

Acknowledgments

This work is supported by the National Natural Science Foundation of China (61673006) and China Scholarship Council (201708420111).

References

G. Brown, M. Carlyle, D. Diehl, J. Kline, and K. Wood, “A two-sided optimization for theater ballistic missile defense,” Operations Research, vol. 53, no. 5, pp. 745–763, 2005.
View at: Publisher Site | Google Scholar | MathSciNet
L. M. Wein, “Homeland security: From mathematical models to policy implementation: The 2008 Philip McCord Morse lecture,” Operations Research, vol. 57, no. 4, pp. 801–811, 2009.
View at: Publisher Site | Google Scholar
B. An, F. Ordóñez, M. Tambe et al., “A deployed quantal response-based patrol planning system for the u.s. coast guard,” Interfaces, vol. 43, no. 5, pp. 400–420, 2013.
View at: Publisher Site | Google Scholar
M. G. Nicholls, “Aluminum production modeling-a nonlinear bilevel programming approach,” Operations Research, vol. 43, no. 2, pp. 208–218, 1995.
View at: Publisher Site | Google Scholar
M. Labbé, P. Marcotte, and G. Savard, “A bilevel model of taxation and its application to optimal highway pricing,” Management Science, vol. 44, no. 12, pp. 1608–1622, 1998.
View at: Publisher Site | Google Scholar
A. Sinha, P. Malo, A. Frantsev, and K. Deb, “Multi-objective Stackelberg game between a regulating authority and a mining company: A case study in environmental economics,” in Proceedings of the IEEE Congress on Evolutionary Computation, CEC '13, pp. 478–485, Mexico, June 2013.
View at: Google Scholar
A. Sinha, P. Malo, and K. Deb, “Transportation policy formulation as a multi-objective bilevel optimization problem,” in Proceedings of the IEEE Congress on Evolutionary Computation, CEC '15, pp. 1651–1658, Japan, May 2015.
View at: Google Scholar
X. Hu and D. Ralph, “Using EPECs to model bilevel games in restructured electricity markets with locational prices,” Operations Research, vol. 55, no. 5, pp. 809–827, 2007.
View at: Publisher Site | Google Scholar | MathSciNet
N. Williams, P. K. Kannan, and S. Azarm, “Retail channel structure impact on strategic engineering product design,” Management Science, vol. 57, no. 5, pp. 897–914, 2011.
View at: Publisher Site | Google Scholar
H. Sun, Z. Gao, and J. Wu, “A bi-level programming model and solution algorithm for the location of logistics distribution centers,” Applied Mathematical Modelling, vol. 32, no. 4, pp. 610–616, 2008.
View at: Publisher Site | Google Scholar | MathSciNet
J. Bard, “Coordination of multi-divisional firm through two levels of management,” Omega, vol. 11, no. 5, pp. 457–465, 1983.
View at: Google Scholar
W. Smith and R. Missen, Chemical Reaction Equilibrium Analysis: Theory and Algorithms, John Wiley & Sons, New York, NY, USA, 1982.
P. A. Clark and A. W. Westerberg, “Bilevel programming for steady-state chemical process design-I. Fundamentals and algorithms,” Computers & Chemical Engineering, vol. 14, no. 1, pp. 87–97, 1990.
View at: Publisher Site | Google Scholar
M. P. Bendsoe, “Optimization of structural topology, shape, and material,” Technical report, 1995.
View at: Publisher Site | Google Scholar | MathSciNet
S. Christiansen, M. Patriksson, and L. Wynter, “Stochastic bilevel programming in structural optimization,” Structural and Multidisciplinary Optimization, vol. 21, no. 5, pp. 361–371, 2001.
View at: Publisher Site | Google Scholar
K. Mombaur, A. Truong, and J.-P. Laumond, “From human to humanoid locomotion-an inverse optimal control approach,” Autonomous Robots, vol. 28, no. 3, pp. 369–383, 2010.
View at: Publisher Site | Google Scholar
S. Albrecht, K. Ramírez-Amaro, F. Ruiz-Ugalde et al., “Imitating human reaching motions using physically inspired optimization principles,” in Proceedings of the 11th IEEE-RAS International Conference on Humanoid Robots, HUMANOIDS '11, pp. 602–607, Slovenia, October 2011.
View at: Google Scholar
Q. Jin and S. Feng, “Bi-level simulated annealing algorithm for facility location,” Systems Engineering, vol. 2, 2007.
View at: Google Scholar
T. Uno, H. Katagiri, and K. Kato, “An evolutionary multi-agent based search method for Stackelberg solutions of bilevel facility location problems,” International Journal of Innovative Computing, Information and Control, vol. 4, no. 5, pp. 1033–1042, 2008.
View at: Google Scholar
A. Migdalas, “Bilevel programming in traffic planning: models, methods and challenge,” Journal of Global Optimization, vol. 7, no. 4, pp. 381–405, 1995.
View at: Publisher Site | Google Scholar | MathSciNet
I. Constantin and M. Florian, “Optimizing frequencies in a transit network: a nonlinear bi-level programming approach,” International Transactions in Operational Research, vol. 2, no. 2, pp. 149–164, 1995.
View at: Publisher Site | Google Scholar
L. Brotcorne, M. Labbé, P. Marcotte, and G. Savard, “A bilevel model for toll optimization on a multicommodity transportation network,” Transportation Science, vol. 35, no. 4, pp. 345–358, 2001.
View at: Publisher Site | Google Scholar
J. F. Bard, “An algorithm for solving the general bilevel programming problem,” Mathematics of Operations Research, vol. 8, no. 2, pp. 260–272, 1983.
View at: Publisher Site | Google Scholar | MathSciNet
T. A. Edmunds and J. F. Bard, “Algorithms for nonlinear bilevel mathematical programs,” The Institute of Electrical and Electronics Engineers Systems, Man, and Cybernetics Society, vol. 21, no. 1, pp. 83–89, 1991.
View at: Publisher Site | Google Scholar | MathSciNet
M. A. Amouzegar, “A global optimization method for nonlinear bilevel programming problems,” IEEE Transactions on Systems, Man, and Cybernetics, Part B: Cybernetics, vol. 29, no. 6, pp. 771–777, 1999.
View at: Publisher Site | Google Scholar
J. B. Etoa Etoa, “Solving quadratic convex bilevel programming problems using a smoothing method,” Applied Mathematics and Computation, vol. 217, no. 15, pp. 6680–6690, 2011.
View at: Publisher Site | Google Scholar | MathSciNet
J. F. Bard and J. E. Falk, “An explicit solution to the multi-level programming problem,” Computers & Operations Research, vol. 9, no. 1, pp. 77–100, 1982.
View at: Publisher Site | Google Scholar
K. Shimizu and E. Aiyoshi, “A new computational method for Stackelberg and min-max problems by use of a penalty method,” Institute of Electrical and Electronics Engineers Transactions on Automatic Control, vol. 26, no. 2, pp. 460–466, 1981.
View at: Publisher Site | Google Scholar | MathSciNet
E. Aiyoshi and K. Shimizu, “A solution method for the static constrained Stackelberg problem via penalty method,” IEEE Transactions on Automatic Control, vol. 29, no. 12, pp. 1111–1114, 1984.
View at: Publisher Site | Google Scholar | MathSciNet
Y. Ishizuka and E. Aiyoshi, “Double penalty method for bilevel optimization problems,” Annals of Operations Research, vol. 34, no. 1–4, pp. 73–88, 1992.
View at: Publisher Site | Google Scholar | MathSciNet
Y. Lv, T. Hu, G. Wang, and Z. Wan, “A penalty function method based on Kuhn-Tucker condition for solving linear bilevel programming,” Applied Mathematics and Computation, vol. 188, no. 1, pp. 808–813, 2007.
View at: Publisher Site | Google Scholar | MathSciNet
R. Mathieu, L. Pittard, and G. Anandalingam, “Genetic algorithm based approach to bi-level linear programming,” Operations Research, vol. 28, no. 1, pp. 1–21, 1994.
View at: Publisher Site | Google Scholar | MathSciNet
S. R. Hejazi, A. Memariani, G. Jahanshahloo, and M. M. Sepehri, “Linear bilevel programming solution by genetic algorithm,” Computers & Operations Research, vol. 29, no. 13, pp. 1913–1925, 2002.
View at: Publisher Site | Google Scholar
Y.-P. Wang, Y.-C. Jiao, and H. Li, “An evolutionary algorithm for solving nonlinear bilevel programming based on a new constraint-handling scheme,” IEEE Transactions on Systems, Man, and Cybernetics, Part C: Applications and Reviews, vol. 35, no. 2, pp. 221–232, 2005.
View at: Publisher Site | Google Scholar
G.-M. Wang, X.-J. Wang, Z.-P. Wan, and S.-H. Jia, “An adaptive genetic algorithm for solving bilevel linear programming problem,” Applied Mathematics and Mechanics-English Edition, vol. 28, no. 12, pp. 1605–1612, 2007.
View at: Publisher Site | Google Scholar | MathSciNet
H. I. Calvete, C. Galé, and P. M. Mateo, “A new approach for solving linear bilevel problems using genetic algorithms,” European Journal of Operational Research, vol. 188, no. 1, pp. 14–28, 2008.
View at: Publisher Site | Google Scholar | MathSciNet
X. Li, P. Tian, and X. Min, “A hierarchical particle swarm optimization for solving bilevel programming problems,” Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics): Preface, vol. 4029, pp. 1169–1178, 2006.
View at: Publisher Site | Google Scholar
R. J. Kuo and C. C. Huang, “Application of particle swarm optimization algorithm for solving bi-level linear programming problem,” Computers & Mathematics with Applications. An International Journal, vol. 58, no. 4, pp. 678–685, 2009.
View at: Publisher Site | Google Scholar | MathSciNet
Y. Jiang, X. Li, C. Huang, and X. Wu, “Application of particle swarm optimization based on CHKS smoothing function for solving nonlinear bilevel programming problem,” Applied Mathematics and Computation, vol. 219, no. 9, pp. 4332–4339, 2013.
View at: Publisher Site | Google Scholar | MathSciNet
S. B. Yaakob and J. Watada, “A hybrid intelligent algorithm for solving the bilevel programming models,” Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics): Preface, vol. 6277, no. 2, pp. 485–494, 2010.
View at: Publisher Site | Google Scholar
R. J. Kuo and Y. S. Han, “A hybrid of genetic algorithm and particle swarm optimization for solving bi-level linear programming problem—a case study on supply chain model,” Applied Mathematical Modelling, vol. 35, no. 8, pp. 3905–3917, 2011.
View at: Publisher Site | Google Scholar | MathSciNet
Z. Wan, G. Wang, and B. Sun, “A hybrid intelligent algorithm by combining particle swarm optimization with chaos searching technique for solving nonlinear bilevel programming problems,” Swarm and Evolutionary Computation, vol. 8, pp. 26–32, 2013.
View at: Publisher Site | Google Scholar
M. Patriksson and L. Wynter, “Stochastic mathematical programs with equilibrium constraints,” Operations Research Letters, vol. 25, no. 4, pp. 159–167, 1999.
View at: Publisher Site | Google Scholar | MathSciNet
J. Gao, B. Liu, and M. Gen, “A Hybrid Intelligent Algorithm for Stochastic Multilevel Programming,” IEEJ Transactions on Electronics, Information and Systems, vol. 124, no. 10, pp. 1991–1998, 2004.
View at: Publisher Site | Google Scholar
Z. Wan, C. Xiao, X. Wang, K. Xiao, Y. Huang, and X. Peng, “Bilevel programming model of optimal bidding strategies under the uncertain electricity markets,” Dianli Xitong Zidonghua/Automation of Electric Power Systems, vol. 28, no. 19, pp. 12–16, 2004.
View at: Google Scholar
Z. P. Wan, H. Fan, G. M. Wang, and X. Y. Peng, “An interactive fuzzy bidding strategy based on stochastic bilevel programming under uncertain electricity markets,” Engineering Journal of Wuhan University, vol. 39, no. 5, pp. 85–90, 2006 (Chinese).
View at: Google Scholar
Y. He and C. Q. Feng, “An approximating algorithm for compensated bilevel stochastic programming,” Basic Sciences Journal of Textile Universities, vol. 26, no. 1, pp. 110–113, 2013.
View at: Google Scholar
W. N. Zhou and Y. L. Huo, “Analysis of the Stability for the Solution Set to Stochastic Programming Approximation of Bilevel,” Journal of Chongqing Technology Business University, vol. 30, no. 7, pp. 19–23, 2013.
View at: Google Scholar
W. N. Zhou, Y. L. Huo, and Z. Y. Hu, “The Hausdorff Covergence of the Optimal Solution Set of Approxiation for Bilevel Stochastic Programming,” Journal of Natural Science of Hunan Normal University. Hunan Shifan Daxue Ziran Kexue Xuebao, vol. 39, no. 3, pp. 80–83, 2016.
View at: Google Scholar | MathSciNet
Y. Liu, H. Wang, Y. S. Xu, and Y. Li, “Convergence of approximate solutions in bi-level stochastic programming,” Pure and Applied Mathematics. Chuncui Shuxue yu Yingyong Shuxue, vol. 24, no. 4, pp. 768–773, 2008.
View at: Google Scholar | MathSciNet
S. Masatoshi and N. Ichiro, Cooperative and Non-cooperative Multi-Level Programming, Springer Science, New York, NY, USA, 2009.
T. Zhang, Z. Chen, and J. Chen, “A cooperative coevolution PSO technique for complex bilevel programming problems and application to watershed water trading decision making problems,” Journal of Nonlinear Sciences and Applications. JNSA, vol. 10, no. 4, pp. 2115–2132, 2017.
View at: Publisher Site | Google Scholar | MathSciNet

Copyright

Copyright © 2018 Tao Zhang and Xiaofei Li. This is an open access article distributed under the Creative Commons Attribution License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.

PDF Download Citation

Download other formats

Order printed copies

Views

551

Downloads

888

Citations