The blockchain trilemma—balancing decentralization,security,and scalability—remains a critical challenge in distributed ledger technology.Despite significant advancements,achieving all three attributes simultaneousl...The blockchain trilemma—balancing decentralization,security,and scalability—remains a critical challenge in distributed ledger technology.Despite significant advancements,achieving all three attributes simultaneously continues to elude most blockchain systems,often forcing trade-offs that limit their real-world applicability.This review paper synthesizes current research efforts aimed at resolving the trilemma,focusing on innovative consensus mechanisms,sharding techniques,layer-2 protocols,and hybrid architectural models.We critically analyze recent breakthroughs,including Directed Acyclic Graph(DAG)-based structures,cross-chain interoperability frameworks,and zero-knowledge proof(ZKP)enhancements,which aimto reconcile scalability with robust security and decentralization.Furthermore,we evaluate the trade-offs inherent in these approaches,highlighting their practical implications for enterprise adoption,decentralized finance(DeFi),and Web3 ecosystems.By mapping the evolving landscape of solutions,this review identifies gaps in currentmethodologies and proposes future research directions,such as adaptive consensus algorithms and artificial intelligence-driven(AI-driven)governance models.Our analysis underscores that while no universal solution exists,interdisciplinary innovations are progressively narrowing the trilemma’s constraints,paving the way for next-generation blockchain infrastructures.展开更多
The non-dominated sorting genetic algorithm （NSGA） is improved with the controlled elitism and dynamic crowding distance. A novel multi-objective optimization algorithm is obtained for wind turbine blades. As an exa...The non-dominated sorting genetic algorithm （NSGA） is improved with the controlled elitism and dynamic crowding distance. A novel multi-objective optimization algorithm is obtained for wind turbine blades. As an example, a 5 MW wind turbine blade design is presented by taking the maximum power coefficient and the minimum blade mass as the optimization objectives. The optimal results show that this algorithm has good performance in handling the multi-objective optimization of wind turbines, and it gives a Pareto-optimal solution set rather than the optimum solutions to the conventional multi objective optimization problems. The wind turbine blade optimization method presented in this paper provides a new and general algorithm for the multi-objective optimization of wind turbines.展开更多
The feasibility of copper smelter slag processing by ammonia solution treatment was investigated. The central composite rotatable design(CCRD) and approximation method were used to determine the optimum conditions of ...The feasibility of copper smelter slag processing by ammonia solution treatment was investigated. The central composite rotatable design(CCRD) and approximation method were used to determine the optimum conditions of zinc and copper recovery to a solution. The experimental design was done at five levels of the four operating parameters which were the initial concentration of NH–3, the initial Cl ions concentration, leaching time and solid/liquid ratio. Two mathematical models describing dependence of metal recovery on the operating parameters were obtained. The models are successful in predicting the responses. It was found that optimal parameters for zinc and copper recovery are as follows(values for copper are given in brackets): initial CNH3 17.1%(19.9%), initial CCl– 160 g/L(160 g/L), leaching process duration 4.56 h(4.13 h), solid/liquid ratio 0.39(0.53). The maximum Zn and Cu recoveries to solution, obtained experimentally under the conditions, are 81.16% and 56.48%, respectively.展开更多
The authors of this article are interested in characterization of efficient solutions for special classes of problems. These classes consider semi-strong E-convexity of involved functions. Sufficient and necessary con...The authors of this article are interested in characterization of efficient solutions for special classes of problems. These classes consider semi-strong E-convexity of involved functions. Sufficient and necessary conditions for a feasible solution to be an efficient or properly efficient solution are obtained.展开更多
This paper studies the global existence and large-time behaviors of weak solutions to the kinetic particle model coupled with the incompressible Navier-Stokes equations in IR3.First,we obtain the global weak solution ...This paper studies the global existence and large-time behaviors of weak solutions to the kinetic particle model coupled with the incompressible Navier-Stokes equations in IR3.First,we obtain the global weak solution using the characteristic and energy methods.Then,under the small assumption of the mass of the particle,we show that the solutions decay at the algebraic time-decay rate.Finally,it is also proved that the above rate is optimal.It should be remarked that if the particle in the coupled system vanishes(i.e.f=O),our works coincide with the classical results by Schonbek[32](J Amer Math Soc,1991,4:423-449),which can be regarded as a generalization from a single fuid model to the two-phase fluid one.展开更多
In order to solve discrete multi-objective optimization problems, a non-dominated sorting quantum particle swarm optimization (NSQPSO) based on non-dominated sorting and quantum particle swarm optimization is proposed...In order to solve discrete multi-objective optimization problems, a non-dominated sorting quantum particle swarm optimization (NSQPSO) based on non-dominated sorting and quantum particle swarm optimization is proposed, and the performance of the NSQPSO is evaluated through five classical benchmark functions. The quantum particle swarm optimization (QPSO) applies the quantum computing theory to particle swarm optimization, and thus has the advantages of both quantum computing theory and particle swarm optimization, so it has a faster convergence rate and a more accurate convergence value. Therefore, QPSO is used as the evolutionary method of the proposed NSQPSO. Also NSQPSO is used to solve cognitive radio spectrum allocation problem. The methods to complete spectrum allocation in previous literature only consider one objective, i.e. network utilization or fairness, but the proposed NSQPSO method, can consider both network utilization and fairness simultaneously through obtaining Pareto front solutions. Cognitive radio systems can select one solution from the Pareto front solutions according to the weight of network reward and fairness. If one weight is unit and the other is zero, then it becomes single objective optimization, so the proposed NSQPSO method has a much wider application range. The experimental research results show that the NSQPS can obtain the same non-dominated solutions as exhaustive search but takes much less time in small dimensions; while in large dimensions, where the problem cannot be solved by exhaustive search, the NSQPSO can still solve the problem, which proves the effectiveness of NSQPSO.展开更多
The optimization problem is considered in which the objective function is pseudolinear（both pseudoconvex and pseudoconcave） and the constraints are linear. The general expression for the optimal solutions to the pro...The optimization problem is considered in which the objective function is pseudolinear（both pseudoconvex and pseudoconcave） and the constraints are linear. The general expression for the optimal solutions to the problem is derived with the representation theorem of polyhedral sets, and the uniqueness condition of the optimal solution and the computational procedures to determine all optimal solutions （if the uniqueness condition is not satisfied ） are provided. Finally, an illustrative example is also given.展开更多
In locally convex Hausdorff topological vector spaces,ε-strongly efficient solutions for vector optimization with set-valued maps are discussed.Firstly,ε-strongly efficient point of set is introduced.Secondly,under ...In locally convex Hausdorff topological vector spaces,ε-strongly efficient solutions for vector optimization with set-valued maps are discussed.Firstly,ε-strongly efficient point of set is introduced.Secondly,under the nearly cone-subconvexlike set-valued maps,the theorem of scalarization for vector optimization is obtained.Finally,optimality conditions of ε-strongly efficient solutions for vector optimization with generalized inequality constraints and equality constraints are obtained.展开更多
Through the transformation of hydraulic constraints into the objective functions associated with a water supply network rehabilitation problem, a non-dominated sorting Genetic Algorithm-II (NSGA-II) can be used to sol...Through the transformation of hydraulic constraints into the objective functions associated with a water supply network rehabilitation problem, a non-dominated sorting Genetic Algorithm-II (NSGA-II) can be used to solve the altered multi-objective optimization model. The introduction of NSGA-II into water supply network optimal rehabilitation problem solves the conflict between one fitness value of standard genetic algorithm (SGA) and multi-objectives of rehabilitation problem. And the uncertainties brought by using weight coefficients or punish functions in conventional methods are controlled. And also by in-troduction of artificial inducement mutation (AIM) operation, the convergence speed of population is accelerated;this operation not only improves the convergence speed, but also improves the rationality and feasibility of solutions.展开更多
The radar radiation source signals hold extremely high reconnaissance value.Accurately positioning these signals constitutes one of the key technologies in safeguarding the security of the electromagnetic space.The po...The radar radiation source signals hold extremely high reconnaissance value.Accurately positioning these signals constitutes one of the key technologies in safeguarding the security of the electromagnetic space.The positioning error in multi-station scenarios is influenced not only by the accuracy of positioning parameter estimation but also by the geometric configuration of the positioning platform.This paper focuses on the direction of arrival(DOA),frequency difference of arrival(FDOA),and time difference of arrival(TDOA)methods,analyzing the optimal configuration,optimal detection area,and optimal position dilution of precision in both elevation-known and elevation-unknown scenarios.Specifically,the paper constructs a signal receiving model,establishes the corresponding positioning equations,and performs dimensional normalization on these equations to derive measurement values in meters.Through differential processing,the position dilution of precision is obtained,which is then used as the optimization function to determine the optimal configuration,optimal detection area,and optimal position dilution of precision.Simulation results validate the accuracy of the proposed formulas.展开更多
A multi-objective optimal operation model of water-sedimentation-power in reservoir is established with power-generation, sedimentation and water storage taken into account. Moreover, the inertia weight self-adjusting...A multi-objective optimal operation model of water-sedimentation-power in reservoir is established with power-generation, sedimentation and water storage taken into account. Moreover, the inertia weight self-adjusting mechanism and Pareto-optimal archive are introduced into the particle swarm optimization and an improved multi-objective particle swarm optimization （IMOPSO） is proposed. The IMOPSO is employed to solve the optimal model and obtain the Pareto-optimal front. The multi-objective optimal operation of Wanjiazhai Reservoir during the spring breakup was investigated with three typical flood hydrographs. The results show that the former method is able to obtain the Pareto-optimal front with a uniform distribution property. Different regions （A, B, C） of the Pareto-optimal front correspond to the optimized schemes in terms of the objectives of sediment deposition, sediment deposition and power generation, and power generation, respectively. The level hydrographs and outflow hydrographs show the operation of the reservoir in details. Compared with the non-dominated sorting genetic algorithm-Ⅱ （NSGA-Ⅱ）, IMOPSO has close global optimization capability and is suitable for multi-objective optimization problems.展开更多
An approach of simultaneous strategies with two novel techniques is proposed to improve the solution accuracy of chemical dynamic optimization problems. The first technique is to handle constraints on control vari- ab...An approach of simultaneous strategies with two novel techniques is proposed to improve the solution accuracy of chemical dynamic optimization problems. The first technique is to handle constraints on control vari- ables based on the finite-element collocation so as to control the approximation error for discrete optimal problems, where a set of control constraints at dement knots are integrated with the procedure for optimization leading to a significant gain in the accuracy of the simultaneous strategies. The second technique is to make the mesh refine- ment more feasible and reliable by introducing length constraints and guideline in designing appropriate element length boundaries, so that the proposed approach becomes more efficient in adjusting dements to track optimal control profile breakpoints and ensure accurate state and centrol profiles. Four classic benchmarks of dynamic op- timization problems are used as illustrations, and the proposed approach is compared with literature reports. The research results reveal that the proposed approach is preferz,ble in improving the solution accuracy of chemical dy- namic optimization problem.展开更多
Near-infrared (NIR) spectroscopy was applied to reagent-free quantitative analysis of polysaccharide of a brand product of proprietary Chinese medicine (PCM) oral solution samples. A novel method, called absorbance up...Near-infrared (NIR) spectroscopy was applied to reagent-free quantitative analysis of polysaccharide of a brand product of proprietary Chinese medicine (PCM) oral solution samples. A novel method, called absorbance upper optimization partial least squares (AUO-PLS), was proposed and successfully applied to the wavelength selection. Based on varied partitioning of the calibration and prediction sample sets, the parameter optimization was performed to achieve stability. On the basis of the AUO-PLS method, the selected upper bound of appropriate absorbance was 1.53 and the corresponding wavebands combination was 400 - 1880 & 2088 - 2346 nm. With the use of random validation samples excluded from the modeling process, the root-mean-square error and correlation coefficient of prediction for polysaccharide were 27.09 mg·L<sup>-</sup><sup>1</sup> and 0.888, respectively. The results indicate that the NIR prediction values are close to those of the measured values. NIR spectroscopy combined with AUO-PLS method provided a promising tool for quantification of the polysaccharide for PCM oral solution and this technique is rapid and simple when compared with conventional methods.展开更多
With the continuous increase of rapid urbanization and population growth,sustainable urban land-use planning is becoming a more complex and challenging task for urban planners and decision-makers.Multi-objective land-...With the continuous increase of rapid urbanization and population growth,sustainable urban land-use planning is becoming a more complex and challenging task for urban planners and decision-makers.Multi-objective land-use allocation can be regarded as a complex spatial optimization problem that aims to achieve the possible trade-offs among multiple and conflicting objectives.This paper proposes an improved Non-dominated Sorting Biogeography-Based Optimization(NSBBO)algorithm for solving the multi-objective land-use allocation problem,in which maximum accessibility,maximum compactness,and maximum spatial integration were formulated as spatial objectives;and space syntax analysis was used to analyze the potential movement patterns in the new urban planning area of the city of Kigali,Rwanda.Efficient Non-dominated Sorting(ENS)algorithm and crossover operator were integrated into classical NSBBO to improve the quality of non-dominated solutions,and local search ability,and to accelerate the convergence speed of the algorithm.The results showed that the proposed NSBBO exhibited good optimal solutions with a high hypervolume index compared to the classical NSBBO.Furthermore,the proposed algorithm could generate optimal land use scenarios according to the preferred objectives,thus having the potential to support the decision-making of urban planners and stockholders in revising and updating the existing detailed master plan of land use.展开更多
A method for determining symbolic and all numerical solutions in design optimization based on monotonicity analysis and solving polynomial systems is presented in this paper. Groebner Bases of the algebraic system equ...A method for determining symbolic and all numerical solutions in design optimization based on monotonicity analysis and solving polynomial systems is presented in this paper. Groebner Bases of the algebraic system equivalent to the subproblem of the design optimization is taken as the symbolic (analytical) expression of the optimum solution for the symbolic optimization, i.e. the problem with symbolic coefficients. A method based on substituting and eliminating for determining Groebner Bases is also proposed, and method for finding all numerical optimum solutions is discussed. Finally an example is given, demonstrating the strategy and efficiency of the method.展开更多
The effects of the concentration of Lix 984N,phase ratio,initial pH value of aqueous phase and extraction time on the extraction of copper and iron under the condition of low Cu2+ /Fe3+ ratio in dump bioleaching solut...The effects of the concentration of Lix 984N,phase ratio,initial pH value of aqueous phase and extraction time on the extraction of copper and iron under the condition of low Cu2+ /Fe3+ ratio in dump bioleaching solution of Dexing Copper Mine were explored.The optimal conditions of extraction are as follows: the concentration of Lix 984N 10%; the phase ratio (O/A) 1:1; the initial pH value of aqueous phase 1.5 and the mixing time 2 min.The stripping experiments show that H2SO4 solution could efficiently recover copper from the organic phase under the optimal conditions.展开更多
This paper proposes an efficient method for optimal power flow solution （OPF） using particle swarm optimization （PSO） technique. The objective of the proposed method is to find the steady state operation point in ...This paper proposes an efficient method for optimal power flow solution （OPF） using particle swarm optimization （PSO） technique. The objective of the proposed method is to find the steady state operation point in a power system which minimizes the fuel cost, while maintaining an acceptable system performance in terms of limits on generator power, line flow limits and voltage limits. In order to improvise the performance of the conventional PSO （cPSO）, the fine tuning parameters- the inertia weight and acceleration coefficients are formulated in terms of global-local best values of the objective function. These global-local best inertia weight （GLBestlW） and global-local best acceleration coefficient （GLBestAC） are incorporated into PSO in order to compute the optimal power flow solution. The proposed method has been tested on the standard IEEE 30 bus test system to prove its efficacy. The results are compared with those obtained through cPSO. It is observed that the proposed algorithm is computationally faster, in terms of the number of load flows executed and provides better results than the conventional heuristic techniques.展开更多
We develop a new evolutionary method of generating epsilon-efficient solutions of a continuous multiobjective programming problem. This is achieved by discretizing the problem and then using a genetic algorithm with s...We develop a new evolutionary method of generating epsilon-efficient solutions of a continuous multiobjective programming problem. This is achieved by discretizing the problem and then using a genetic algorithm with some derived probabilistic stopping criteria to obtain all minimal solutions for the discretized problem. We prove that these minimal solutions are the epsilon-optimal solutions to the original problem. We also present some computational examples illustrating the efficiency of our method.展开更多
This paper uses the Butterfly Optimization Algorithm(BOA)with dominated sorting and crowding distance mechanisms to solve multi-objective optimization problems.There is also an improvement to the original version of B...This paper uses the Butterfly Optimization Algorithm(BOA)with dominated sorting and crowding distance mechanisms to solve multi-objective optimization problems.There is also an improvement to the original version of BOA to alleviate its drawbacks before extending it into a multi-objective version.Due to better coverage and a well-distributed Pareto front,non-dominant rankings are applied to the modified BOA using the crowding distance strategy.Seven benchmark functions and eight real-world problems have been used to test the performance of multi-objective non-dominated advanced BOA(MONSBOA),including unconstrained,constrained,and real-world design multiple-objective,highly nonlinear constraint problems.Various performance metrics,such as Generational Distance(GD),Inverted Generational Distance(IGD),Maximum Spread(MS),and Spacing(S),have been used for performance comparison.It is demonstrated that the new MONSBOA algorithm is better than the compared algorithms in more than 80%occasions in solving problems with a variety of linear,nonlinear,continuous,and discrete characteristics based on the Pareto front when compared quantitatively.From all the analysis,it may be concluded that the suggested MONSBOA is capable of producing high-quality Pareto fronts with very competitive results with rapid convergence.展开更多
This paper deals with higher-order optimality conditions for Henig effcient solutions of set-valued optimization problems.By virtue of the higher-order tangent sets, necessary and suffcient conditions are obtained for...This paper deals with higher-order optimality conditions for Henig effcient solutions of set-valued optimization problems.By virtue of the higher-order tangent sets, necessary and suffcient conditions are obtained for Henig effcient solutions of set-valued optimization problems whose constraint condition is determined by a fixed set.展开更多
文摘The blockchain trilemma—balancing decentralization,security,and scalability—remains a critical challenge in distributed ledger technology.Despite significant advancements,achieving all three attributes simultaneously continues to elude most blockchain systems,often forcing trade-offs that limit their real-world applicability.This review paper synthesizes current research efforts aimed at resolving the trilemma,focusing on innovative consensus mechanisms,sharding techniques,layer-2 protocols,and hybrid architectural models.We critically analyze recent breakthroughs,including Directed Acyclic Graph(DAG)-based structures,cross-chain interoperability frameworks,and zero-knowledge proof(ZKP)enhancements,which aimto reconcile scalability with robust security and decentralization.Furthermore,we evaluate the trade-offs inherent in these approaches,highlighting their practical implications for enterprise adoption,decentralized finance(DeFi),and Web3 ecosystems.By mapping the evolving landscape of solutions,this review identifies gaps in currentmethodologies and proposes future research directions,such as adaptive consensus algorithms and artificial intelligence-driven(AI-driven)governance models.Our analysis underscores that while no universal solution exists,interdisciplinary innovations are progressively narrowing the trilemma’s constraints,paving the way for next-generation blockchain infrastructures.
基金Project supported by the National Basic Research Program of China (973 Program) (No. 2007CB714600)
文摘The non-dominated sorting genetic algorithm （NSGA） is improved with the controlled elitism and dynamic crowding distance. A novel multi-objective optimization algorithm is obtained for wind turbine blades. As an example, a 5 MW wind turbine blade design is presented by taking the maximum power coefficient and the minimum blade mass as the optimization objectives. The optimal results show that this algorithm has good performance in handling the multi-objective optimization of wind turbines, and it gives a Pareto-optimal solution set rather than the optimum solutions to the conventional multi objective optimization problems. The wind turbine blade optimization method presented in this paper provides a new and general algorithm for the multi-objective optimization of wind turbines.
文摘The feasibility of copper smelter slag processing by ammonia solution treatment was investigated. The central composite rotatable design(CCRD) and approximation method were used to determine the optimum conditions of zinc and copper recovery to a solution. The experimental design was done at five levels of the four operating parameters which were the initial concentration of NH–3, the initial Cl ions concentration, leaching time and solid/liquid ratio. Two mathematical models describing dependence of metal recovery on the operating parameters were obtained. The models are successful in predicting the responses. It was found that optimal parameters for zinc and copper recovery are as follows(values for copper are given in brackets): initial CNH3 17.1%(19.9%), initial CCl– 160 g/L(160 g/L), leaching process duration 4.56 h(4.13 h), solid/liquid ratio 0.39(0.53). The maximum Zn and Cu recoveries to solution, obtained experimentally under the conditions, are 81.16% and 56.48%, respectively.
文摘The authors of this article are interested in characterization of efficient solutions for special classes of problems. These classes consider semi-strong E-convexity of involved functions. Sufficient and necessary conditions for a feasible solution to be an efficient or properly efficient solution are obtained.
基金supported by the Anhui Provincial Natural Science Foundation(2408085QA031)the third author's work was supported by the National Natural Science Foundation of China(12001033).
文摘This paper studies the global existence and large-time behaviors of weak solutions to the kinetic particle model coupled with the incompressible Navier-Stokes equations in IR3.First,we obtain the global weak solution using the characteristic and energy methods.Then,under the small assumption of the mass of the particle,we show that the solutions decay at the algebraic time-decay rate.Finally,it is also proved that the above rate is optimal.It should be remarked that if the particle in the coupled system vanishes(i.e.f=O),our works coincide with the classical results by Schonbek[32](J Amer Math Soc,1991,4:423-449),which can be regarded as a generalization from a single fuid model to the two-phase fluid one.
基金Foundation item： Projects（61102106, 61102105） supported by the National Natural Science Foundation of China Project（2013M530148） supported by China Postdoctoral Science Foundation Project（HEUCF120806） supported by the Fundamental Research Funds for the Central Universities of China
文摘In order to solve discrete multi-objective optimization problems, a non-dominated sorting quantum particle swarm optimization (NSQPSO) based on non-dominated sorting and quantum particle swarm optimization is proposed, and the performance of the NSQPSO is evaluated through five classical benchmark functions. The quantum particle swarm optimization (QPSO) applies the quantum computing theory to particle swarm optimization, and thus has the advantages of both quantum computing theory and particle swarm optimization, so it has a faster convergence rate and a more accurate convergence value. Therefore, QPSO is used as the evolutionary method of the proposed NSQPSO. Also NSQPSO is used to solve cognitive radio spectrum allocation problem. The methods to complete spectrum allocation in previous literature only consider one objective, i.e. network utilization or fairness, but the proposed NSQPSO method, can consider both network utilization and fairness simultaneously through obtaining Pareto front solutions. Cognitive radio systems can select one solution from the Pareto front solutions according to the weight of network reward and fairness. If one weight is unit and the other is zero, then it becomes single objective optimization, so the proposed NSQPSO method has a much wider application range. The experimental research results show that the NSQPS can obtain the same non-dominated solutions as exhaustive search but takes much less time in small dimensions; while in large dimensions, where the problem cannot be solved by exhaustive search, the NSQPSO can still solve the problem, which proves the effectiveness of NSQPSO.
文摘The optimization problem is considered in which the objective function is pseudolinear（both pseudoconvex and pseudoconcave） and the constraints are linear. The general expression for the optimal solutions to the problem is derived with the representation theorem of polyhedral sets, and the uniqueness condition of the optimal solution and the computational procedures to determine all optimal solutions （if the uniqueness condition is not satisfied ） are provided. Finally, an illustrative example is also given.
基金Foundation item： Supported by the Natural Science Foundation of China（10871216） Supported by the Natural Science Foundation Project of CQ CSTC（2008BB0346, 2007BB0441） Supported by the Excellent Young Teachers Program of Chongqing Jiaotong University（EYT08-016） Acknowledgement The author would like to thank the anonymous referee for the valuable remarks that helped considerably to correct and to improve the presentation.
文摘In locally convex Hausdorff topological vector spaces,ε-strongly efficient solutions for vector optimization with set-valued maps are discussed.Firstly,ε-strongly efficient point of set is introduced.Secondly,under the nearly cone-subconvexlike set-valued maps,the theorem of scalarization for vector optimization is obtained.Finally,optimality conditions of ε-strongly efficient solutions for vector optimization with generalized inequality constraints and equality constraints are obtained.
基金the Natural Science Key Foundation of Heilongjiang Province of China (No. ZJG0503) China-UK Sci-ence Network from Royal Society UK
文摘Through the transformation of hydraulic constraints into the objective functions associated with a water supply network rehabilitation problem, a non-dominated sorting Genetic Algorithm-II (NSGA-II) can be used to solve the altered multi-objective optimization model. The introduction of NSGA-II into water supply network optimal rehabilitation problem solves the conflict between one fitness value of standard genetic algorithm (SGA) and multi-objectives of rehabilitation problem. And the uncertainties brought by using weight coefficients or punish functions in conventional methods are controlled. And also by in-troduction of artificial inducement mutation (AIM) operation, the convergence speed of population is accelerated;this operation not only improves the convergence speed, but also improves the rationality and feasibility of solutions.
基金supported by the National Natural Science Foundation of China(Nos.62027801,62301035).
文摘The radar radiation source signals hold extremely high reconnaissance value.Accurately positioning these signals constitutes one of the key technologies in safeguarding the security of the electromagnetic space.The positioning error in multi-station scenarios is influenced not only by the accuracy of positioning parameter estimation but also by the geometric configuration of the positioning platform.This paper focuses on the direction of arrival(DOA),frequency difference of arrival(FDOA),and time difference of arrival(TDOA)methods,analyzing the optimal configuration,optimal detection area,and optimal position dilution of precision in both elevation-known and elevation-unknown scenarios.Specifically,the paper constructs a signal receiving model,establishes the corresponding positioning equations,and performs dimensional normalization on these equations to derive measurement values in meters.Through differential processing,the position dilution of precision is obtained,which is then used as the optimization function to determine the optimal configuration,optimal detection area,and optimal position dilution of precision.Simulation results validate the accuracy of the proposed formulas.
基金National Science Fund for Distinguished Young Scholars (No.50725929)National Natural Science Foundation ofChina (No.50539060,50679052)
文摘A multi-objective optimal operation model of water-sedimentation-power in reservoir is established with power-generation, sedimentation and water storage taken into account. Moreover, the inertia weight self-adjusting mechanism and Pareto-optimal archive are introduced into the particle swarm optimization and an improved multi-objective particle swarm optimization （IMOPSO） is proposed. The IMOPSO is employed to solve the optimal model and obtain the Pareto-optimal front. The multi-objective optimal operation of Wanjiazhai Reservoir during the spring breakup was investigated with three typical flood hydrographs. The results show that the former method is able to obtain the Pareto-optimal front with a uniform distribution property. Different regions （A, B, C） of the Pareto-optimal front correspond to the optimized schemes in terms of the objectives of sediment deposition, sediment deposition and power generation, and power generation, respectively. The level hydrographs and outflow hydrographs show the operation of the reservoir in details. Compared with the non-dominated sorting genetic algorithm-Ⅱ （NSGA-Ⅱ）, IMOPSO has close global optimization capability and is suitable for multi-objective optimization problems.
基金Supported by the Joint Funds of NSFC-CNPC of China(U1162130)the International Cooperation and Exchange Project of Science and Technology Department of Zhejiang Province(2009C34008)+1 种基金the National High Technology Research and Development Program of China(2006AA05Z226)the Zhejiang Provincial Natural Science Foundation for Distinguished Young Scientists(R4100133)
文摘An approach of simultaneous strategies with two novel techniques is proposed to improve the solution accuracy of chemical dynamic optimization problems. The first technique is to handle constraints on control vari- ables based on the finite-element collocation so as to control the approximation error for discrete optimal problems, where a set of control constraints at dement knots are integrated with the procedure for optimization leading to a significant gain in the accuracy of the simultaneous strategies. The second technique is to make the mesh refine- ment more feasible and reliable by introducing length constraints and guideline in designing appropriate element length boundaries, so that the proposed approach becomes more efficient in adjusting dements to track optimal control profile breakpoints and ensure accurate state and centrol profiles. Four classic benchmarks of dynamic op- timization problems are used as illustrations, and the proposed approach is compared with literature reports. The research results reveal that the proposed approach is preferz,ble in improving the solution accuracy of chemical dy- namic optimization problem.
文摘Near-infrared (NIR) spectroscopy was applied to reagent-free quantitative analysis of polysaccharide of a brand product of proprietary Chinese medicine (PCM) oral solution samples. A novel method, called absorbance upper optimization partial least squares (AUO-PLS), was proposed and successfully applied to the wavelength selection. Based on varied partitioning of the calibration and prediction sample sets, the parameter optimization was performed to achieve stability. On the basis of the AUO-PLS method, the selected upper bound of appropriate absorbance was 1.53 and the corresponding wavebands combination was 400 - 1880 & 2088 - 2346 nm. With the use of random validation samples excluded from the modeling process, the root-mean-square error and correlation coefficient of prediction for polysaccharide were 27.09 mg·L<sup>-</sup><sup>1</sup> and 0.888, respectively. The results indicate that the NIR prediction values are close to those of the measured values. NIR spectroscopy combined with AUO-PLS method provided a promising tool for quantification of the polysaccharide for PCM oral solution and this technique is rapid and simple when compared with conventional methods.
基金supported by the Styrelsen för Internationellt Utvecklingssamarbete.
文摘With the continuous increase of rapid urbanization and population growth,sustainable urban land-use planning is becoming a more complex and challenging task for urban planners and decision-makers.Multi-objective land-use allocation can be regarded as a complex spatial optimization problem that aims to achieve the possible trade-offs among multiple and conflicting objectives.This paper proposes an improved Non-dominated Sorting Biogeography-Based Optimization(NSBBO)algorithm for solving the multi-objective land-use allocation problem,in which maximum accessibility,maximum compactness,and maximum spatial integration were formulated as spatial objectives;and space syntax analysis was used to analyze the potential movement patterns in the new urban planning area of the city of Kigali,Rwanda.Efficient Non-dominated Sorting(ENS)algorithm and crossover operator were integrated into classical NSBBO to improve the quality of non-dominated solutions,and local search ability,and to accelerate the convergence speed of the algorithm.The results showed that the proposed NSBBO exhibited good optimal solutions with a high hypervolume index compared to the classical NSBBO.Furthermore,the proposed algorithm could generate optimal land use scenarios according to the preferred objectives,thus having the potential to support the decision-making of urban planners and stockholders in revising and updating the existing detailed master plan of land use.
文摘A method for determining symbolic and all numerical solutions in design optimization based on monotonicity analysis and solving polynomial systems is presented in this paper. Groebner Bases of the algebraic system equivalent to the subproblem of the design optimization is taken as the symbolic (analytical) expression of the optimum solution for the symbolic optimization, i.e. the problem with symbolic coefficients. A method based on substituting and eliminating for determining Groebner Bases is also proposed, and method for finding all numerical optimum solutions is discussed. Finally an example is given, demonstrating the strategy and efficiency of the method.
基金Project (2004CB619200) supported by the National Basic Research Program of China
文摘The effects of the concentration of Lix 984N,phase ratio,initial pH value of aqueous phase and extraction time on the extraction of copper and iron under the condition of low Cu2+ /Fe3+ ratio in dump bioleaching solution of Dexing Copper Mine were explored.The optimal conditions of extraction are as follows: the concentration of Lix 984N 10%; the phase ratio (O/A) 1:1; the initial pH value of aqueous phase 1.5 and the mixing time 2 min.The stripping experiments show that H2SO4 solution could efficiently recover copper from the organic phase under the optimal conditions.
文摘This paper proposes an efficient method for optimal power flow solution （OPF） using particle swarm optimization （PSO） technique. The objective of the proposed method is to find the steady state operation point in a power system which minimizes the fuel cost, while maintaining an acceptable system performance in terms of limits on generator power, line flow limits and voltage limits. In order to improvise the performance of the conventional PSO （cPSO）, the fine tuning parameters- the inertia weight and acceleration coefficients are formulated in terms of global-local best values of the objective function. These global-local best inertia weight （GLBestlW） and global-local best acceleration coefficient （GLBestAC） are incorporated into PSO in order to compute the optimal power flow solution. The proposed method has been tested on the standard IEEE 30 bus test system to prove its efficacy. The results are compared with those obtained through cPSO. It is observed that the proposed algorithm is computationally faster, in terms of the number of load flows executed and provides better results than the conventional heuristic techniques.
文摘We develop a new evolutionary method of generating epsilon-efficient solutions of a continuous multiobjective programming problem. This is achieved by discretizing the problem and then using a genetic algorithm with some derived probabilistic stopping criteria to obtain all minimal solutions for the discretized problem. We prove that these minimal solutions are the epsilon-optimal solutions to the original problem. We also present some computational examples illustrating the efficiency of our method.
文摘This paper uses the Butterfly Optimization Algorithm(BOA)with dominated sorting and crowding distance mechanisms to solve multi-objective optimization problems.There is also an improvement to the original version of BOA to alleviate its drawbacks before extending it into a multi-objective version.Due to better coverage and a well-distributed Pareto front,non-dominant rankings are applied to the modified BOA using the crowding distance strategy.Seven benchmark functions and eight real-world problems have been used to test the performance of multi-objective non-dominated advanced BOA(MONSBOA),including unconstrained,constrained,and real-world design multiple-objective,highly nonlinear constraint problems.Various performance metrics,such as Generational Distance(GD),Inverted Generational Distance(IGD),Maximum Spread(MS),and Spacing(S),have been used for performance comparison.It is demonstrated that the new MONSBOA algorithm is better than the compared algorithms in more than 80%occasions in solving problems with a variety of linear,nonlinear,continuous,and discrete characteristics based on the Pareto front when compared quantitatively.From all the analysis,it may be concluded that the suggested MONSBOA is capable of producing high-quality Pareto fronts with very competitive results with rapid convergence.
基金Supported by the National Natural Science Foundation of China（10871216） Supported by the Science and Technology Research Project of Chongqing Municipal Education Commission（KJ100419） Supported by the Natural Science Foundation Project of CQ CSTC（cstcjjA00019）
文摘This paper deals with higher-order optimality conditions for Henig effcient solutions of set-valued optimization problems.By virtue of the higher-order tangent sets, necessary and suffcient conditions are obtained for Henig effcient solutions of set-valued optimization problems whose constraint condition is determined by a fixed set.
