Key tactics of origin-based user equilibrium (OUE) algorithm was studied,which involved the algorithm procedure and several implementation issues.To speed up the convergence,update policies of flows,costs and bushes w...Key tactics of origin-based user equilibrium (OUE) algorithm was studied,which involved the algorithm procedure and several implementation issues.To speed up the convergence,update policies of flows,costs and bushes were proposed.The methods of step-size searching and bush construction are proved to be practical.The modified OUE algorithm procedure was also optimized to take the advantage of multi-thread process.Convergence performances were compared with those of other algorithms by different sizes of urban transportation networks.The result shows this modified OUE algorithm is more efficient and consumes less time to achieve the reasonable relative gap in practical applications.展开更多
The EAST (HT-7U) superconducting tokamak is a national project of China on fusion research, with a capability of long-pulse (- 1000 s) operation. In order to realize a long-duration steady-state operation of EAST, som...The EAST (HT-7U) superconducting tokamak is a national project of China on fusion research, with a capability of long-pulse (- 1000 s) operation. In order to realize a long-duration steady-state operation of EAST, some significant capability of real-time control is re-quired. It would be very crucial to obtain the current profile parameters and the plasma shapes in real time by a flexible control system. As those discharge parameters cannot be directly measured, so a current profile consistent with the magnetohydrodynamic equilibrium should be evaluated from external magnetic measurements, based on a linearized iterative least square method, which can meet the requirements of the measurements. The arithmetic that the EFIT (equilibrium fitting code) is used for reference will be given in this paper and the computational efforts are reduced by parametrizing the current profile linearly in terms of a number of physical parameters. In order to introduce this reconstruction algorithm clearly, the main hardware design will be listed also.展开更多
In the traffic equilibrium problem, we introduce capacity constraints of arcs, extend Beckmann’s formula to include these constraints, and give an algorithm for traffic equilibrium flows with capacity constraints on ...In the traffic equilibrium problem, we introduce capacity constraints of arcs, extend Beckmann’s formula to include these constraints, and give an algorithm for traffic equilibrium flows with capacity constraints on arcs. Using an example, we illustrate the application of the algorithm and show that Beckmann’s formula is a sufficient condition only, not a necessary condition, for traffic equilibrium with capacity constraints of arcs.展开更多
Based on the framework of method of successive averages(MSA), a modified stochastic user-equilibrium assignment algorithm was proposed, which can be used to calculate the passenger flow distribution of urban rail tran...Based on the framework of method of successive averages(MSA), a modified stochastic user-equilibrium assignment algorithm was proposed, which can be used to calculate the passenger flow distribution of urban rail transit(URT) under network operation. In order to describe the congestion's impact to passengers' route choices, a generalized cost function with in-vehicle congestion was set up. Building on the k-th shortest path algorithm, a method for generating choice set with time constraint was embedded, considering the characteristics of network operation. A simple but efficient route choice model, which was derived from travel surveys for URT passengers in China, was introduced to perform the stochastic network loading at each iteration in the algorithm. Initial tests on the URT network in Shanghai City show that the methodology, with rational calculation time, promises to compute more precisely the passenger flow distribution of URT under network operation, compared with those practical algorithms used in today's China.展开更多
In this paper, on the basis of von Karman large deflection equations and its double trigonometric series solution, we present a simple, fast and effective iteration algorithm for solving simply-supported rectangular p...In this paper, on the basis of von Karman large deflection equations and its double trigonometric series solution, we present a simple, fast and effective iteration algorithm for solving simply-supported rectangular plate subjected to biaxial compression.展开更多
Based on the extraction equilibrium and mass balances in countercurrent extraction systems, a novel method was studied for dealing with the extraction equilibrium and the mass distribution in a multi-component(gamma-c...Based on the extraction equilibrium and mass balances in countercurrent extraction systems, a novel method was studied for dealing with the extraction equilibrium and the mass distribution in a multi-component(gamma-component) system. The relationships of mass distribution (x(i), y(i), i = 1, ..., lambda) between two phases were expressed by 2 lambda dimensional simultaneous equations. These simultaneous equations can be converted to a one-dimension nonlinear equation, then it was solved by Newton-Raphson algorithm within a few number of iteration. Compared with the regular calculation method for the 2 lambda dimensional simultaneous equations, Newton-Raphson algorithm can decrease the number of iteration, increase the convergence of the equations and accelerate the speed of simulation. It was verified in many multi-component systems with satisfactory results. As an example, a five-component system is demonstrated in this paper.展开更多
Throughout this paper, we introduce a new hybrid iterative algorithm for finding a common element of the set of common fixed points of a finite family of uniformly asymptotically nonexpansive semigroups and the set of...Throughout this paper, we introduce a new hybrid iterative algorithm for finding a common element of the set of common fixed points of a finite family of uniformly asymptotically nonexpansive semigroups and the set of solutions of an equilibrium problem in the framework of Hilbert spaces. We then prove the strong convergence theorem with respect to the proposed iterative algorithm. Our results in this paper extend and improve some recent known results.展开更多
In this paper, relaxed iterative algorithms of Krasnoselskii-type and Halpern-type that approximate a solution of a system of a generalized mixed equilibrium problem anda common fixed point of a countable family of to...In this paper, relaxed iterative algorithms of Krasnoselskii-type and Halpern-type that approximate a solution of a system of a generalized mixed equilibrium problem anda common fixed point of a countable family of totally quasi-C-asymptotically nonexpansivemulti-valued maps are constructed. Strong convergence of the sequence generated by thesealgorithms is proved in uniformly smooth and strictly convex real Banach spaces with Kadec-Klee property. Furthermore, several applications of our theorems are also presented. Finally,our theorems are significant improvements on several important recent results for this classof nonlinear problems.展开更多
A new system of generalized mixed implicit equilibrium problems is introduced and studied in Banach spaces. First, the notion of the Yosida proximal mapping for generalized mixed implicit equilibrium problems is intro...A new system of generalized mixed implicit equilibrium problems is introduced and studied in Banach spaces. First, the notion of the Yosida proximal mapping for generalized mixed implicit equilibrium problems is introduced. By using the notion, a system of generalized equation problems is considered, and its equivalence with the system of generalized mixed implicit equilibrium problems is also proved. Next, by applying the system of generalized equation problems, we suggest and analyze an iterative algorithm to compute the approximate solutions of the system of generalized mixed implicit equilibrium problems. The strong convergence of the iterative sequences generated by the algorithm is proved under quite mild conditions. The results are new and unify and generalize some recent results in this field.展开更多
A new class of generalized mixed implicit quasi-equilibrium problems (GMIQEP) with four-functions is introduced and studied. The new class of equilibrium problems includes many known generalized equilibrium problems...A new class of generalized mixed implicit quasi-equilibrium problems (GMIQEP) with four-functions is introduced and studied. The new class of equilibrium problems includes many known generalized equilibrium problems and generalized mixed implicit quasi-variational inequality problems as many special cases. By employing the auxiliary principle technique, some predictor-corrector iterative algorithms for solving the GMIQEP are suggested and analyzed. The convergence of the suggested algorithm only requires the continuity and the partially relaxed implicit strong monotonicity of the mappings展开更多
聚类是一种典型且重要的数据挖掘方法,但现有聚类算法大多需要人为指定聚类的数量,并且聚类结果对参数敏感.针对上述不足,本文提出一种基于子博弈完美均衡的启发式聚类算法(Heuristic Clustering algorithm based on Sub-game Perfect E...聚类是一种典型且重要的数据挖掘方法,但现有聚类算法大多需要人为指定聚类的数量,并且聚类结果对参数敏感.针对上述不足,本文提出一种基于子博弈完美均衡的启发式聚类算法(Heuristic Clustering algorithm based on Sub-game Perfect Equilibrium,HCSPE).该算法充分挖掘数据点自身的分布特征信息,通过启发式方法得到自适应的参数值,从而使数据点局部密度属性值的得出具有客观性和普适性,降低了聚类结果对参数的敏感性.基于博弈的思想,综合局部密度和相对距离两个属性形成数据点的竞争力,依靠竞争机制完成聚类数量的自动计算以及聚类中心的确定.在多个规模和类型均不相同的数据集上的实验结果表明,本文所提出算法的性能指标整体优于其他算法,并且聚类结果更符合客观所需.展开更多
A new system of generalized mixed implicit equilibrium problems (SGMIEP) involving nonmonotone set-valued mappings is introduced and studied in real reflexive Banach spaces. First, an auxiliary mixed equilibrium pro...A new system of generalized mixed implicit equilibrium problems (SGMIEP) involving nonmonotone set-valued mappings is introduced and studied in real reflexive Banach spaces. First, an auxiliary mixed equilibrium problem (AMEP) is introduced. The existence and the uniqueness of the solutions to the AMEP are proved under quite mild assumptions without any coercive conditions. Next, by using the solution mapping of the AMEP, a system of generalized equation problems (SGEP) is considered, and its equivalence with the SGMIEP is shown. By using the SGEP, a new iterative algorithm for solving the SGMIEP is proposed and analyzed. The strong convergence of the iterative sequences generated by the algorithm is proved under suitable conditions. These results are new, which unify and generalize some recent results in this field.展开更多
基金Projects(70631002,70701027) supported by the National Natural Science Foundation of ChinaProject(NCET-08-0406) supported by the Program for New Century Excellent Talents in Chinese University
文摘Key tactics of origin-based user equilibrium (OUE) algorithm was studied,which involved the algorithm procedure and several implementation issues.To speed up the convergence,update policies of flows,costs and bushes were proposed.The methods of step-size searching and bush construction are proved to be practical.The modified OUE algorithm procedure was also optimized to take the advantage of multi-thread process.Convergence performances were compared with those of other algorithms by different sizes of urban transportation networks.The result shows this modified OUE algorithm is more efficient and consumes less time to achieve the reasonable relative gap in practical applications.
基金The project supported by the research on non-circular plasma controlthe Innovation Project of Magnetic Confinement Fusion Plasma Physics from Chinese Academy of Sciences(No.C03071025)
文摘The EAST (HT-7U) superconducting tokamak is a national project of China on fusion research, with a capability of long-pulse (- 1000 s) operation. In order to realize a long-duration steady-state operation of EAST, some significant capability of real-time control is re-quired. It would be very crucial to obtain the current profile parameters and the plasma shapes in real time by a flexible control system. As those discharge parameters cannot be directly measured, so a current profile consistent with the magnetohydrodynamic equilibrium should be evaluated from external magnetic measurements, based on a linearized iterative least square method, which can meet the requirements of the measurements. The arithmetic that the EFIT (equilibrium fitting code) is used for reference will be given in this paper and the computational efforts are reduced by parametrizing the current profile linearly in terms of a number of physical parameters. In order to introduce this reconstruction algorithm clearly, the main hardware design will be listed also.
文摘In the traffic equilibrium problem, we introduce capacity constraints of arcs, extend Beckmann’s formula to include these constraints, and give an algorithm for traffic equilibrium flows with capacity constraints on arcs. Using an example, we illustrate the application of the algorithm and show that Beckmann’s formula is a sufficient condition only, not a necessary condition, for traffic equilibrium with capacity constraints of arcs.
基金Project(2007AA11Z236) supported by the National High Technology Research and Development Program of ChinaProject(2012M5209O1) supported by China Postdoctoral Science Foundation
文摘Based on the framework of method of successive averages(MSA), a modified stochastic user-equilibrium assignment algorithm was proposed, which can be used to calculate the passenger flow distribution of urban rail transit(URT) under network operation. In order to describe the congestion's impact to passengers' route choices, a generalized cost function with in-vehicle congestion was set up. Building on the k-th shortest path algorithm, a method for generating choice set with time constraint was embedded, considering the characteristics of network operation. A simple but efficient route choice model, which was derived from travel surveys for URT passengers in China, was introduced to perform the stochastic network loading at each iteration in the algorithm. Initial tests on the URT network in Shanghai City show that the methodology, with rational calculation time, promises to compute more precisely the passenger flow distribution of URT under network operation, compared with those practical algorithms used in today's China.
文摘In this paper, on the basis of von Karman large deflection equations and its double trigonometric series solution, we present a simple, fast and effective iteration algorithm for solving simply-supported rectangular plate subjected to biaxial compression.
文摘Based on the extraction equilibrium and mass balances in countercurrent extraction systems, a novel method was studied for dealing with the extraction equilibrium and the mass distribution in a multi-component(gamma-component) system. The relationships of mass distribution (x(i), y(i), i = 1, ..., lambda) between two phases were expressed by 2 lambda dimensional simultaneous equations. These simultaneous equations can be converted to a one-dimension nonlinear equation, then it was solved by Newton-Raphson algorithm within a few number of iteration. Compared with the regular calculation method for the 2 lambda dimensional simultaneous equations, Newton-Raphson algorithm can decrease the number of iteration, increase the convergence of the equations and accelerate the speed of simulation. It was verified in many multi-component systems with satisfactory results. As an example, a five-component system is demonstrated in this paper.
文摘Throughout this paper, we introduce a new hybrid iterative algorithm for finding a common element of the set of common fixed points of a finite family of uniformly asymptotically nonexpansive semigroups and the set of solutions of an equilibrium problem in the framework of Hilbert spaces. We then prove the strong convergence theorem with respect to the proposed iterative algorithm. Our results in this paper extend and improve some recent known results.
文摘In this paper, relaxed iterative algorithms of Krasnoselskii-type and Halpern-type that approximate a solution of a system of a generalized mixed equilibrium problem anda common fixed point of a countable family of totally quasi-C-asymptotically nonexpansivemulti-valued maps are constructed. Strong convergence of the sequence generated by thesealgorithms is proved in uniformly smooth and strictly convex real Banach spaces with Kadec-Klee property. Furthermore, several applications of our theorems are also presented. Finally,our theorems are significant improvements on several important recent results for this classof nonlinear problems.
基金Project supported by the Scientific Research Fund of Sichuan Normal University(No.09ZDL04)the Sichuan Province Leading Academic Discipline Project(No.SZD0406)
文摘A new system of generalized mixed implicit equilibrium problems is introduced and studied in Banach spaces. First, the notion of the Yosida proximal mapping for generalized mixed implicit equilibrium problems is introduced. By using the notion, a system of generalized equation problems is considered, and its equivalence with the system of generalized mixed implicit equilibrium problems is also proved. Next, by applying the system of generalized equation problems, we suggest and analyze an iterative algorithm to compute the approximate solutions of the system of generalized mixed implicit equilibrium problems. The strong convergence of the iterative sequences generated by the algorithm is proved under quite mild conditions. The results are new and unify and generalize some recent results in this field.
基金Project supported by the Natural Science Foundation of Sichuan Educational Commission (No.2003A081)
文摘A new class of generalized mixed implicit quasi-equilibrium problems (GMIQEP) with four-functions is introduced and studied. The new class of equilibrium problems includes many known generalized equilibrium problems and generalized mixed implicit quasi-variational inequality problems as many special cases. By employing the auxiliary principle technique, some predictor-corrector iterative algorithms for solving the GMIQEP are suggested and analyzed. The convergence of the suggested algorithm only requires the continuity and the partially relaxed implicit strong monotonicity of the mappings
文摘聚类是一种典型且重要的数据挖掘方法,但现有聚类算法大多需要人为指定聚类的数量,并且聚类结果对参数敏感.针对上述不足,本文提出一种基于子博弈完美均衡的启发式聚类算法(Heuristic Clustering algorithm based on Sub-game Perfect Equilibrium,HCSPE).该算法充分挖掘数据点自身的分布特征信息,通过启发式方法得到自适应的参数值,从而使数据点局部密度属性值的得出具有客观性和普适性,降低了聚类结果对参数的敏感性.基于博弈的思想,综合局部密度和相对距离两个属性形成数据点的竞争力,依靠竞争机制完成聚类数量的自动计算以及聚类中心的确定.在多个规模和类型均不相同的数据集上的实验结果表明,本文所提出算法的性能指标整体优于其他算法,并且聚类结果更符合客观所需.
基金Project supported by the Sichuan Province Leading Academic Discipline Project(No.SZD0406)the Scientific Research Fund of Sichuan Normal University(No.11ZDL01)
文摘A new system of generalized mixed implicit equilibrium problems (SGMIEP) involving nonmonotone set-valued mappings is introduced and studied in real reflexive Banach spaces. First, an auxiliary mixed equilibrium problem (AMEP) is introduced. The existence and the uniqueness of the solutions to the AMEP are proved under quite mild assumptions without any coercive conditions. Next, by using the solution mapping of the AMEP, a system of generalized equation problems (SGEP) is considered, and its equivalence with the SGMIEP is shown. By using the SGEP, a new iterative algorithm for solving the SGMIEP is proposed and analyzed. The strong convergence of the iterative sequences generated by the algorithm is proved under suitable conditions. These results are new, which unify and generalize some recent results in this field.