|
|
|
题名
|
作者
|
年代
|
出处
|
被引量
|
| 1 | New partial cooperation model for bilevel programming problems显示文摘Partial cooperation models are studied for many years to solve the bilevel programming problems where the follower’s optimal reaction is not unique. However, in these existed models, the follower’s cooperation level does not depend on the leader’s decision. A new model is proposed to solve this deficiency. It is proved the feasibility of the new model when the reaction set of the lower level is lower semicontinuous. And the numerical results show that the new model has optimal solutions when the reaction set of the lower level is discrete, lower semi-continuous and non-lower semi-continuous. | Shihui Jia Zhongping Wan Yuqiang Feng Guangmin Wang | 2011 | Journal of Systems Engineering and Electronics2011，22，2： | 4 |
| 2 | Hybrid Krill Herd Algorithm with Vortex Search for Global Numerical Optimization显示文摘In order to solve the problem that the krill herd(KH)algorithm is premature due to the decrease of population diversity,a new hybrid vortex search KH(VSKH)algorithm has been developed to deal with the global optimization problem.The improvement is that a new hybrid vortex search(HVS)operator is added into the updating process of the krill for the purpose of dealing with optimization problems more efficiently.Using 20 benchmark functions for comparison experiments,the results show that the VSKH algorithm has higher accuracy. | YANG Jian WAN Zhongping PENG Zhenhua | 2020 | Wuhan University Journal of Natural Sciences2020，25，2： | 2 |
| 3 | Global convergent algorithm for the bilevel linear fractional-linear programming based on modified convex simplex method显示文摘A global convergent algorithm is proposed to solve bilevel linear fractional-linear programming,which is a special class of bilevel programming.In our algorithm,replacing the lower level problem by its dual gap equaling to zero,the bilevel linear fractional-linear programming is transformed into a traditional single level programming problem,which can be transformed into a series of linear fractional programming problem.Thus,the modified convex simplex method is used to solve the infinite linear fractional programming to obtain the global convergent solution of the original bilevel linear fractional-linear programming.Finally,an example demonstrates the feasibility of the proposed algorithm. | Guangmin Wang Bing Jiang Kejun Zhu Zhongping Wan | 2010 | Journal of Systems Engineering and Electronics2010，21，2： | 2 |
| 4 | A PENALTY FUNCTION METHOD FOR SOLVING ILL-POSED BILEVEL PROGRAMMING PROBLEM VIA WEIGHTED SUMMATION显示文摘For ill-posed bilevel programming problem,the optimistic solution is always the best decision for the upper level but it is not always the best choice for both levels if the authors consider the model's satisfactory degree in application.To acquire a more satisfying solution than the optimistic one to realize the two levels' most profits,this paper considers both levels' satisfactory degree and constructs a minimization problem of the two objective functions by weighted summation.Then,using the duality gap of the lower level as the penalty function,the authors transfer these two levels problem to a single one and propose a corresponding algorithm.Finally,the authors give an example to show a more satisfying solution than the optimistic solution can be achieved by this algorithm. | JIA Shihui WAN Zhongping | 2013 | Journal of Systems Science & Complexity2013，26，6： | 2 |
| 5 | ASYMPTOTIC SURROGATE CONSTRAINT METHOD AND ITS CONVERGENCE FOR A CLASS OF SEMI-INFINITE PROGRAMMING显示文摘A class of constrained semi\|infinite minimax problem is transformed into a simple constrained problem, by means of discretization decomposition and maximum entropy method, making use of surrogate constraint. The paper deals with the convergence of this asymptotic approach method. | Wan Zhongping\ Wu Guoming | 1999 | Applied Mathematics(A Journal of Chinese Universities)1999，14，4： | 2 |
| 6 | An Improved Cuckoo Search Algorithm for Multi-Objective Optimization显示文摘The recently proposed Cuckoo search algorithm is an evolutionary algorithm based on probability. It surpasses other algorithms in solving the multi-modal discontinuous and nonlinear problems. Searches made by it are very efficient because it adopts Levy flight to carry out random walks. This paper proposes an improved version of cuckoo search for multi-objective problems(IMOCS). Combined with nondominated sorting, crowding distance and Levy flights, elitism strategy is applied to improve the algorithm. Then numerical studies are conducted to compare the algorithm with DEMO and NSGA-II against some benchmark test functions. Result shows that our improved cuckoo search algorithm convergences rapidly and performs efficienly. | TIAN Mingzheng HOU Kuolin WANG Zhaowei WAN Zhongping | 2017 | Wuhan University Journal of Natural Sciences2017，22，4： | 2 |
| 7 | An Interactive Intuitionistic Fuzzy Method for Multilevel Linear Programming Problems显示文摘In this paper, we propose an interactive method for solving the multilevel linear programming problems based on the intuitionistic fuzzy set theory. Firstly, the membership function and the non-membership function are introduced to describe the uncertainty of the decision makers. Secondly, a satisfactory solution is derived by updating the minimum satisfactory degrees with considerations of the overall satisfactory balance among all levels. In addition, the steps of the proposed method are given in this paper. Finally, numerical examples illustrate the feasibility of this method. | HUANG Chan FANG Debin WAN Zhongping | 2015 | Wuhan University Journal of Natural Sciences2015，20，2： | 1 |
| 8 | A Novel Hybrid Vortex Search and Artificial Bee Colony Algorithm for Numerical Optimization Problems显示文摘Though vortex search(VS) algorithm has good performance in solving global numerical optimization problems, it cannot fully search the whole space occasionally. Combining the vortex search algorithm and the artificial bee colony algorithm(ABC) which has good performance in exploration, we present a HVS(hybrid vortex search) algorithm to solve the numerical optimization problems. We first use the employed bees and onlooker bees of ABC algorithm to find a solution, and then adopt the VS algorithm to find the best solution. In the meantime, we cannot treat the best solution so far as the center of the algorithm all the time. The algorithm is tested by 50 benchmark functions. The numerical results show the HVS algorithm has superior performance over the ABC and the VS algorithms. | WANG Zhaowei WU Guomin WAN Zhongping | 2017 | Wuhan University Journal of Natural Sciences2017，22，4： | 1 |
| 9 | A penalty function method for solving inverse optimal value prob- lem显示文摘 | Yibing Lv Tiesong Hu Zhongping Wan | 2008 | Journal of Computational and Applied Mathe- matics2008，220，1： | 1 |
| 10 | New partial cooperation model for ill-posed bilevel programming problem via satisfactory degree显示文摘Partial cooperation formulation is a more viable option than optimistic's and pessimistic's to solve an ill-posed bilevel programming problem.Aboussoror's partial cooperation model uses a constant as a cooperation index to describe the degree of follower's cooperation.The constant only indicates the leader's expectation coefficient for the follower's action,not the follower's own willingness.To solve this situation,a new model is proposed by using the follower's satisfactory degree as the cooperation degree.Then,because this new cooperation degree is a function which is dependent on the leader's choice and decided by the follower's satisfactory degree,this paper proves such proposed model not only leads an optimal value between the optimistic value and pessimistic's,but also leads a more satisfactory solution than Aboussoror's.Finally,a numerical experiment is given to demonstrate the feasibility of this new model. | Shihui Jia Zhongping Wan Xuhui Xia | 2016 | Journal of Systems Engineering and Electronics2016，27，1： | 1 |
| 11 | Ripples Analysis of High Voltage Generator of Three-phase Transformer Electron Accelerator显示文摘 | Cao Shuchun Li Zhongping Zhang Ziming Su Yalong Wan Ming | 2007 | 近代物理研究所和兰州重离子加速器实验室年报:英文版2007，，1： | 1 |
| 12 | Genetic Algorithm for Solving Quadratic Bilevel Programming Problem显示文摘By applying Kuhn-Tucker condition the quadratic bilevel programming,a class of bilevel programming,is transformed into a single level programming problem,which can be simplified by some rule. So we can search the optimal solution in the feasible region,hence reduce greatly the searching space. Numerical experiments on several literature problems show that the new algorithm is both feasible and effective in practice. | WANG Guangmin WAN Zhongping WANG Xianjiai FANG Debin | 2007 | Wuhan University Journal of Natural Sciences2007，12，3： | 1 |
| 13 | A Novel Improved Bird Swarm Algorithm for Solving Bound Constrained Optimization Problems显示文摘Bird swarm algorithm(BSA), a novel bio-inspired algorithm, has good performance in solving numerical optimization problems. In this paper, a new improved bird swarm algorithm is conducted to solve unconstrained optimization problems. To enhance the performance of BSA, handling boundary constraints are applied to fix the candidate solutions that are out of boundary or on the boundary in iterations, which can boost the diversity of the swarm to avoid the premature problem. On the other hand, we accelerate the foraging behavior by adjusting the cognitive and social components the sin cosine coefficients. Simulation results and comparison based on sixty benchmark functions demonstrate that the improved BSA has superior performance over the BSA in terms of almost all functions. | WANG Yuhe WAN Zhongping PENG Zhenhua | 2019 | Wuhan University Journal of Natural Sciences2019，24，4： | 1 |
| 14 | Bilevel newsvendor models considering retailer with CVaR objective显示文摘 | Cheng Lu Wan Zhongping Wang Guangmin | 2009 | Computers & Industrial Engineering2009，57，1： | 1 |
| 15 | A penalty function method for solving weak pricecontrol problem显示文摘 | Lü Yibing Hu Tiesong Wan Zhongping | 2007 | Applied Mathematics and Computation2007，186，： | 1 |
| 16 | A penalty function method for solving weak price control problem显示文摘 | Lv Yibin Hu Tiesong Wan Zhongping | 2007 | Applied Mathematics and Computation2007，186，2： | 1 |
| 17 | A note on the definition of linear bilevel programming solutin显示文摘 | Wan Zhongping Lü YiBing Wang Guangmin | 2006 | Journal of Computational Mathematics and optimization2006，2，2： | 1 |
| 18 | An Analysis on the Heat Resistance of Rice Germplasm Resources during Flowering Period显示文摘56 Chinese rice core germplasm resources,18 foreign rice germplasm resources and 6 restorer lines are subjected to high temperature stress during flowering period. Based on relative spikelet fertility rate,rice heat resistance is evaluated. The results show that different resistance to high temperature exists in different varieties,and 6 new rice varieties present high heat resistance. | Zhongping ZHA Desuo YIN Bingliang WAN Chunhai JIAO | 2016 | Asian Agricultural Research2016，8，6： | 0 |
| 19 | On Bilevel Variational Inequalities显示文摘A class of bilevel variational inequalities(shortly(BVI))with hierarchical nesting structure is firstly introduced and investigated.The relationship between(BVI)and some existing bilevel problems are presented.Subsequently,the existence of solution and the behavior of solution sets to(BVI)and the lower level variational inequality are discussed without coercivity.By using the penalty method,we transform(BVI)into one-level variational inequality,and establish the equivalence between(BVI)and the one-level variational inequality.A new iterative algorithm to compute the approximate solutions of(BVI)is also suggested and analyzed.The convergence of the iterative sequence generated by the proposed algorithm is derived under some mild conditions.Finally,some relationships among(BVI),system of variational inequalities and vector variational inequalities are also given. | Zhongping Wan Jia-wei Chen | 2013 | Journal of the Operations Research Society of China2013，1，4： | 0 |
您所在的机构暂未开通此部分的功能，请联系管理员