期刊文献+
共找到30,921篇文章
< 1 2 250 >
每页显示 20 50 100
Approach for uncertain multi-objective programming problems with correlated objective functions under C_(EV) criterion 被引量:2
1
作者 MENG Xiangfei WANG Ying +2 位作者 LI Chao WANG Xiaoyang LYU Maolong 《Journal of Systems Engineering and Electronics》 SCIE EI CSCD 2018年第6期1197-1208,共12页
An uncertain multi-objective programming problem is a special type of mathematical multi-objective programming involving uncertain variables. This type of problem is important because there are several uncertain varia... An uncertain multi-objective programming problem is a special type of mathematical multi-objective programming involving uncertain variables. This type of problem is important because there are several uncertain variables in real-world problems.Therefore, research on the uncertain multi-objective programming problem is highly relevant, particularly those problems whose objective functions are correlated. In this paper, an approach that solves an uncertain multi-objective programming problem under the expected-variance value criterion is proposed. First, we define the basic framework of the approach and review concepts such as a Pareto efficient solution and expected-variance value criterion using an order relation between various uncertain variables.Second, the uncertain multi-objective problem is converted into an uncertain single-objective programming problem via a linear weighted method or ideal point method. Then the problem is transformed into a deterministic single objective programming problem under the expected-variance value criterion. Third, four lemmas and two theorems are proved to illustrate that the optimal solution of the deterministic single-objective programming problem is an efficient solution to the original uncertainty problem. Finally, two numerical examples are presented to validate the effectiveness of the proposed approach. 展开更多
关键词 uncertainty theory uncertain multi-objective programming expected-variance value criterion
在线阅读 下载PDF
New approach for uncertain random multi-objective programming problems based on C_(ESD) criterion 被引量:1
2
作者 SUN Yun WANG Ying +2 位作者 MENG Xiangfei FU Chaoqi LUO Chengkun 《Journal of Systems Engineering and Electronics》 SCIE EI CSCD 2021年第3期619-630,共12页
To overcome the defects that the traditional ap-proach for multi-objective programming under uncertain ran-dom environment(URMOP)neglects the randomness and uncer-tainty of the problem and the volatility of the result... To overcome the defects that the traditional ap-proach for multi-objective programming under uncertain ran-dom environment(URMOP)neglects the randomness and uncer-tainty of the problem and the volatility of the results,a new ap-proach is proposed based on expected value-standard devi-ation value criterion(C_(ESD) criterion).Firstly,the effective solution to the URMOP problem is defined;then,by applying sequence relationship between the uncertain random variables,the UR-MOP problem is transformed into a single-objective program-ming(SOP)under uncertain random environment(URSOP),which are transformed into a deterministic counterpart based on the C_(ESD) criterion.Then the validity of the new approach is proved that the optimal solution to the SOP problem is also effi-cient for the URMOP problem;finally,a numerical example and a case application are presented to show the effectiveness of the new approach. 展开更多
关键词 chance theory independent-uncertain random multi-objective programming expected value-standard derivation value criterion(C_(ESD)criterion)
在线阅读 下载PDF
Intelligent prediction model of tunnelling-induced building deformation based on genetic programming and its application
3
作者 XU Jing-min WANG Chen-cheng +3 位作者 CHENG Zhi-liang XU Tao ZHANG Ding-wen LI Zi-li 《Journal of Central South University》 CSCD 2024年第11期3885-3899,共15页
This paper aims to explore the ability of genetic programming(GP)to achieve the intelligent prediction of tunnelling-induced building deformation considering the multifactor impact.A total of 1099 groups of data obtai... This paper aims to explore the ability of genetic programming(GP)to achieve the intelligent prediction of tunnelling-induced building deformation considering the multifactor impact.A total of 1099 groups of data obtained from 22 geotechnical centrifuge tests are used for model development and analysis using GP.Tunnel volume loss,building eccentricity,soil density,building transverse width,building shear stiffness and building load are selected as the inputs,and shear distortion is selected as the output.Results suggest that the proposed intelligent prediction model is capable of providing a reasonable and accurate prediction of framed building shear distortion due to tunnel construction with realistic conditions,highlighting the important roles of shear stiffness of framed buildings and the pressure beneath the foundation on structural deformation.It has been proven that the proposed model is efficient and feasible to analyze relevant engineering problems by parametric analysis and comparative analysis.The findings demonstrate the great potential of GP approaches in predicting building distortion caused by tunnelling.The proposed equation can be used for the quick and intelligent prediction of tunnelling induced building deformation,providing valuable guidance for the practical design and risk assessment of urban tunnel construction projects. 展开更多
关键词 building deformation genetic programming tunnel construction modification factor
在线阅读 下载PDF
Multi-objective optimization of top-level arrangement for flight test
4
作者 WANG Yunong BI Wenhao +2 位作者 FAN Qiucen XU Shuangfei ZHANG An 《Journal of Systems Engineering and Electronics》 2025年第3期714-724,共11页
The lack of systematic and scientific top-level arrangement in the field of civil aircraft flight test leads to the problems of long duration and high cost.Based on the flight test activity,mathematical models of flig... The lack of systematic and scientific top-level arrangement in the field of civil aircraft flight test leads to the problems of long duration and high cost.Based on the flight test activity,mathematical models of flight test duration and cost are established to set up the framework of flight test process.The top-level arrangement for flight test is optimized by multi-objective algorithm to reduce the duration and cost of flight test.In order to verify the necessity and validity of the mathematical models and the optimization algorithm of top-level arrangement,real flight test data is used to make an example calculation.Results show that the multi-objective optimization results of the top-level flight arrangement are better than the initial arrangement data,which can shorten the duration,reduce the cost,and improve the efficiency of flight test. 展开更多
关键词 flight test top-level arrangement flight test optimization multi-objective optimization
在线阅读 下载PDF
Multi-objective optimization framework in the modeling of belief rule-based systems with interpretability-accuracy trade-off
5
作者 YOU Yaqian SUN Jianbin +1 位作者 TAN Yuejin JIANG Jiang 《Journal of Systems Engineering and Electronics》 2025年第2期423-435,共13页
The belief rule-based(BRB)system has been popular in complexity system modeling due to its good interpretability.However,the current mainstream optimization methods of the BRB systems only focus on modeling accuracy b... The belief rule-based(BRB)system has been popular in complexity system modeling due to its good interpretability.However,the current mainstream optimization methods of the BRB systems only focus on modeling accuracy but ignore the interpretability.The single-objective optimization strategy has been applied in the interpretability-accuracy trade-off by inte-grating accuracy and interpretability into an optimization objec-tive.But the integration has a greater impact on optimization results with strong subjectivity.Thus,a multi-objective optimiza-tion framework in the modeling of BRB systems with inter-pretability-accuracy trade-off is proposed in this paper.Firstly,complexity and accuracy are taken as two independent opti-mization goals,and uniformity as a constraint to give the mathe-matical description.Secondly,a classical multi-objective opti-mization algorithm,nondominated sorting genetic algorithm II(NSGA-II),is utilized as an optimization tool to give a set of BRB systems with different accuracy and complexity.Finally,a pipeline leakage detection case is studied to verify the feasibility and effectiveness of the developed multi-objective optimization.The comparison illustrates that the proposed multi-objective optimization framework can effectively avoid the subjectivity of single-objective optimization,and has capability of joint optimiz-ing the structure and parameters of BRB systems with inter-pretability-accuracy trade-off. 展开更多
关键词 belief rule-based(BRB)systems INTERPRETABILITY multi-objective optimization nondominated sorting genetic algo-rithm II(NSGA-II) pipeline leakage detection.
在线阅读 下载PDF
基于Return-Oriented Programming的程序攻击与防护 被引量:6
6
作者 黄志军 郑滔 《计算机科学》 CSCD 北大核心 2012年第B06期1-5,23,共6页
随着W⊕X等技术的引入,传统的代码注入攻击几乎被消除,return-to-lib攻击受到很大程度的抑制。在此背景下,Hovav Shacham提出了Return-Oriented Programming(ROP)的思想,该思想基于栈溢出的原理,通过使用程序库中有效的以ret指令结尾的... 随着W⊕X等技术的引入,传统的代码注入攻击几乎被消除,return-to-lib攻击受到很大程度的抑制。在此背景下,Hovav Shacham提出了Return-Oriented Programming(ROP)的思想,该思想基于栈溢出的原理,通过使用程序库中有效的以ret指令结尾的短指令序列构建gadget集合,使之具有图灵完备特性,来完成计算和攻击。讲述ROP思想自提出以来的一些研究成果和其实际的攻击能力,阐述ROP自动化的当前成果与未来可能的发展方向,进而分析和预测ROP自动化的下一步的研究方向。同时,也将从ROP的几个特征分析消除这种攻击的策略和方法,并介绍目前已有的防护思想和成果,论述这些方法的优缺点和改进方向。综合阐述ROP攻击与ROP防护这一矛与盾的问题,力争使读者理解ROP的思想,知悉当前的发展状态,并在此基础上能够进一步推进ROP攻击及其防范的研究。 展开更多
关键词 ROP 程序自动化 地址随机化 栈溢出 程序控制流 程序安全
在线阅读 下载PDF
Agent Oriented Programming进展
7
作者 王一川 石纯一 《计算机科学》 CSCD 北大核心 2002年第12期120-122,97,共4页
Agent-oriented programming (AOP) is a framework to develop agents, and it aims to link the gap betweentheory and practical in agent research. The core of an AOP framework is its language and semantics. In this paper,w... Agent-oriented programming (AOP) is a framework to develop agents, and it aims to link the gap betweentheory and practical in agent research. The core of an AOP framework is its language and semantics. In this paper,we propose the necessary properties which agents should have, and then give a summary and analysis about differentAOP languages based on these properties. 展开更多
关键词 人工智能 自治实体 多AGENT系统 AgentOrientedprogramming
在线阅读 下载PDF
Hybrid particle swarm optimization with chaotic search for solving integer and mixed integer programming problems 被引量:21
8
作者 谭跃 谭冠政 邓曙光 《Journal of Central South University》 SCIE EI CAS 2014年第7期2731-2742,共12页
A novel chaotic search method is proposed,and a hybrid algorithm combining particle swarm optimization(PSO) with this new method,called CLSPSO,is put forward to solve 14 integer and mixed integer programming problems.... A novel chaotic search method is proposed,and a hybrid algorithm combining particle swarm optimization(PSO) with this new method,called CLSPSO,is put forward to solve 14 integer and mixed integer programming problems.The performances of CLSPSO are compared with those of other five hybrid algorithms combining PSO with chaotic search methods.Experimental results indicate that in terms of robustness and final convergence speed,CLSPSO is better than other five algorithms in solving many of these problems.Furthermore,CLSPSO exhibits good performance in solving two high-dimensional problems,and it finds better solutions than the known ones.A performance index(PI) is introduced to fairly compare the above six algorithms,and the obtained values of(PI) in three cases demonstrate that CLSPSO is superior to all the other five algorithms under the same conditions. 展开更多
关键词 particle swarm optimization chaotic search integer programming problem mixed integer programming problem
在线阅读 下载PDF
Solution for integer linear bilevel programming problems using orthogonal genetic algorithm 被引量:10
9
作者 Hong Li Li Zhang Yongchang Jiao 《Journal of Systems Engineering and Electronics》 SCIE EI CSCD 2014年第3期443-451,共9页
An integer linear bilevel programming problem is firstly transformed into a binary linear bilevel programming problem, and then converted into a single-level binary implicit programming. An orthogonal genetic algorith... An integer linear bilevel programming problem is firstly transformed into a binary linear bilevel programming problem, and then converted into a single-level binary implicit programming. An orthogonal genetic algorithm is developed for solving the binary linear implicit programming problem based on the orthogonal design. The orthogonal design with the factor analysis, an experimental design method is applied to the genetic algorithm to make the algorithm more robust, statistical y sound and quickly convergent. A crossover operator formed by the orthogonal array and the factor analysis is presented. First, this crossover operator can generate a smal but representative sample of points as offspring. After al of the better genes of these offspring are selected, a best combination among these offspring is then generated. The simulation results show the effectiveness of the proposed algorithm. 展开更多
关键词 integer linear bilevel programming problem integer optimization genetic algorithm orthogonal experiment design
在线阅读 下载PDF
Improved genetic algorithm for nonlinear programming problems 被引量:8
10
作者 Kezong Tang Jingyu Yang +1 位作者 Haiyan Chen Shang Gao 《Journal of Systems Engineering and Electronics》 SCIE EI CSCD 2011年第3期540-546,共7页
An improved genetic algorithm(IGA) based on a novel selection strategy to handle nonlinear programming problems is proposed.Each individual in selection process is represented as a three-dimensional feature vector w... An improved genetic algorithm(IGA) based on a novel selection strategy to handle nonlinear programming problems is proposed.Each individual in selection process is represented as a three-dimensional feature vector which is composed of objective function value,the degree of constraints violations and the number of constraints violations.It is easy to distinguish excellent individuals from general individuals by using an individuals' feature vector.Additionally,a local search(LS) process is incorporated into selection operation so as to find feasible solutions located in the neighboring areas of some infeasible solutions.The combination of IGA and LS should offer the advantage of both the quality of solutions and diversity of solutions.Experimental results over a set of benchmark problems demonstrate that IGA has better performance than other algorithms. 展开更多
关键词 genetic algorithm(GA) nonlinear programming problem constraint handling non-dominated solution optimization problem.
在线阅读 下载PDF
Using approximate dynamic programming for multi-ESM scheduling to track ground moving targets 被引量:5
11
作者 WAN Kaifang GAO Xiaoguang +1 位作者 LI Bo LI Fei 《Journal of Systems Engineering and Electronics》 SCIE EI CSCD 2018年第1期74-85,共12页
This paper researches the adaptive scheduling problem of multiple electronic support measures(multi-ESM) in a ground moving radar targets tracking application. It is a sequential decision-making problem in uncertain e... This paper researches the adaptive scheduling problem of multiple electronic support measures(multi-ESM) in a ground moving radar targets tracking application. It is a sequential decision-making problem in uncertain environment. For adaptive selection of appropriate ESMs, we generalize an approximate dynamic programming(ADP) framework to the dynamic case. We define the environment model and agent model, respectively. To handle the partially observable challenge, we apply the unsented Kalman filter(UKF) algorithm for belief state estimation. To reduce the computational burden, a simulation-based approach rollout with a redesigned base policy is proposed to approximate the long-term cumulative reward. Meanwhile, Monte Carlo sampling is combined into the rollout to estimate the expectation of the rewards. The experiments indicate that our method outperforms other strategies due to its better performance in larger-scale problems. 展开更多
关键词 sensor scheduling target tracking approximate dynamic programming non-myopic rollout belief state
在线阅读 下载PDF
Exponential distribution-based genetic algorithm for solving mixed-integer bilevel programming problems 被引量:4
12
作者 Li Hecheng Wang Yuping 《Journal of Systems Engineering and Electronics》 SCIE EI CSCD 2008年第6期1157-1164,共8页
Two classes of mixed-integer nonlinear bilevel programming problems are discussed. One is that the follower's functions are separable with respect to the follower's variables, and the other is that the follower's f... Two classes of mixed-integer nonlinear bilevel programming problems are discussed. One is that the follower's functions are separable with respect to the follower's variables, and the other is that the follower's functions are convex if the follower's variables are not restricted to integers. A genetic algorithm based on an exponential distribution is proposed for the aforementioned problems. First, for each fixed leader's variable x, it is proved that the optimal solution y of the follower's mixed-integer programming can be obtained by solving associated relaxed problems, and according to the convexity of the functions involved, a simplified branch and bound approach is given to solve the follower's programming for the second class of problems. Furthermore, based on an exponential distribution with a parameter λ, a new crossover operator is designed in which the best individuals are used to generate better offspring of crossover. The simulation results illustrate that the proposed algorithm is efficient and robust. 展开更多
关键词 mixed-integer nonlinear bilevel programming genetic algorithm exponential distribution optimalsolutions
在线阅读 下载PDF
NONLINEAR PROGRAMMING VIA AN EXACT PENALTY FUNCTION:CONVERGENCE RATE ANALYSIS 被引量:2
13
作者 Li Xuequan Li Songren Han Xuili(Department of Applied Mathematics and Applied Software, Central SouthUniversity of Technology, Changsha 410083, China) 《Journal of Central South University》 SCIE EI CAS 1996年第2期102-106,共5页
The algorithm proposed by T. F. Colemen and A. R. Conn is improved in this paper, and the improved algorithm can solve nonlinear programming problem with quality constraints. It is shown that the improved algorithm po... The algorithm proposed by T. F. Colemen and A. R. Conn is improved in this paper, and the improved algorithm can solve nonlinear programming problem with quality constraints. It is shown that the improved algorithm possesses global convergence, and under some conditions, it possesses locally supperlinear convergence. 展开更多
关键词 NONLINEAR programming EXACT PENALTY FUNCTION algorithm
在线阅读 下载PDF
Dependent-Chance Goal Programming and an Application 被引量:4
14
作者 Baoding, Liu Jifa, Gu 《Journal of Systems Engineering and Electronics》 SCIE EI CSCD 1993年第2期40-47,共8页
This paper presents a dependent-chance goal programming (DCGP) and gives a successive factoring method to solve DCGP. We also discuss the application of DCGP in Qinhuangdao region for water supply and allocation.
关键词 Computer systems programming MANAGEMENT Water resources Water supply
在线阅读 下载PDF
UAV flight strategy algorithm based on dynamic programming 被引量:5
15
作者 ZHANG Zixuan WU Qinhao +2 位作者 ZHANG Bo YI Xiaodong TANG Yuhua 《Journal of Systems Engineering and Electronics》 SCIE EI CSCD 2018年第6期1293-1299,共7页
Unmanned aerial vehicles(UAVs) may play an important role in data collection and offloading in vast areas deploying wireless sensor networks, and the UAV’s action strategy has a vital influence on achieving applicabi... Unmanned aerial vehicles(UAVs) may play an important role in data collection and offloading in vast areas deploying wireless sensor networks, and the UAV’s action strategy has a vital influence on achieving applicability and computational complexity. Dynamic programming(DP) has a good application in the path planning of UAV, but there are problems in the applicability of special terrain environment and the complexity of the algorithm.Based on the analysis of DP, this paper proposes a hierarchical directional DP(DDP) algorithm based on direction determination and hierarchical model. We compare our methods with Q-learning and DP algorithm by experiments, and the results show that our method can improve the terrain applicability, meanwhile greatly reduce the computational complexity. 展开更多
关键词 motion state space map stratification computational complexity dynamic programming(DP) envirommental adaptability
在线阅读 下载PDF
New partial cooperation model for bilevel programming problems 被引量:4
16
作者 Shihui Jia Zhongping Wan +1 位作者 Yuqiang Feng Guangmin Wang 《Journal of Systems Engineering and Electronics》 SCIE EI CSCD 2011年第2期263-266,共4页
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... 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. 展开更多
关键词 bilevel programming reaction set optimistic model pessimistic model partial cooperation model cooperation level.
在线阅读 下载PDF
Orthogonal genetic algorithm for solving quadratic bilevel programming problems 被引量:4
17
作者 Hong Li Yongchang Jiao Li Zhang 《Journal of Systems Engineering and Electronics》 SCIE EI CSCD 2010年第5期763-770,共8页
A quadratic bilevel programming problem is transformed into a single level complementarity slackness problem by applying Karush-Kuhn-Tucker(KKT) conditions.To cope with the complementarity constraints,a binary encod... A quadratic bilevel programming problem is transformed into a single level complementarity slackness problem by applying Karush-Kuhn-Tucker(KKT) conditions.To cope with the complementarity constraints,a binary encoding scheme is adopted for KKT multipliers,and then the complementarity slackness problem is simplified to successive quadratic programming problems,which can be solved by many algorithms available.Based on 0-1 binary encoding,an orthogonal genetic algorithm,in which the orthogonal experimental design with both two-level orthogonal array and factor analysis is used as crossover operator,is proposed.Numerical experiments on 10 benchmark examples show that the orthogonal genetic algorithm can find global optimal solutions of quadratic bilevel programming problems with high accuracy in a small number of iterations. 展开更多
关键词 orthogonal genetic algorithm quadratic bilevel programming problem Karush-Kuhn-Tucker conditions orthogonal experimental design global optimal solution.
在线阅读 下载PDF
A Partial Parallel Airport Gate Assignment Supported by a Knowledge-based System Combined with Mathematical Programming 被引量:2
18
作者 Cheng Yu(Center for Transportation Studies, School of Civil and Structural EngineeringNanyang Technological University, Singapore, 2263) 《Journal of Systems Engineering and Electronics》 SCIE EI CSCD 1996年第3期43-61,共19页
The gate assignment at an airport is one of the major activities in airport operations.With the increase of passenger traffic volumes and the number of flights, the complexity of this task and the factors to be consid... The gate assignment at an airport is one of the major activities in airport operations.With the increase of passenger traffic volumes and the number of flights, the complexity of this task and the factors to be considered have increased significantly, and an efficient gate utilizationhas received considerable attention. For overcoming the shortcomings of previous gate assignmentapproaches, this paper presents a partial parallel gate assignment approach, by which more factorsconcerning aircraft and gates can be collsidered at the same time. This paper also presents themethod of using a knowledge-based system combined with a mathematical programming method forgetting an optimized feasible assignment solution. By this way, it is more easily to get the solutionthat satisfies both the static and dynamic situations,and thus it may adapt well to meet the needsof actual use to rea-time operations. An experimental prototype has been implemented, and a casestudy is presented at the end of the paper. 展开更多
关键词 Airport operations Gate assignment Knowledge-based system Mathematical programming.
在线阅读 下载PDF
Adaptive broadband beamformer for nonuniform linear array based on second order cone programming 被引量:4
19
作者 Chen Peng Hou Chaohuan +3 位作者 Ma Xiaochuan Cao Zhiqian Liang Yicong Yan Sheng 《Journal of Systems Engineering and Electronics》 SCIE EI CSCD 2009年第2期278-282,共5页
Adaptive broadband beamforraing is a key issue in array applications. The adaptive broadband beamformer with tapped delay line (TDL) structure for nonuniform linear array (NLA) is designed according to the rule of... Adaptive broadband beamforraing is a key issue in array applications. The adaptive broadband beamformer with tapped delay line (TDL) structure for nonuniform linear array (NLA) is designed according to the rule of minimizing the beamformer's output power while keeping the distortionless response (DR) in the direction of desired signal and keeping the constant beamwidth (CB) with the prescribed sidelobe level over the whole operating band. This kind of beamforming problem can be solved with the interior-point method after being converted to the form of standard second order cone programming (SOCP). The computer simulations are presented which illustrate the effectiveness of our beamformer. 展开更多
关键词 information processing technique adaptive broadband beamformer tapped delay line nonuniformlinear array constant beamwidth second order cone programming
在线阅读 下载PDF
Global convergent algorithm for the bilevel linear fractional-linear programming based on modified convex simplex method 被引量:2
20
作者 Guangmin Wang Bing Jiang +1 位作者 Kejun Zhu Zhongping Wan 《Journal of Systems Engineering and Electronics》 SCIE EI CSCD 2010年第2期239-243,共5页
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 equ... 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 sin- gle level programming problem, which can be transformed into a series of linear fractional programming problem. Thus, the modi- fied 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. 展开更多
关键词 bilevel linear fractional-linear programming convex simplex method dual problem.
在线阅读 下载PDF
上一页 1 2 250 下一页 到第
使用帮助 返回顶部