Efficient Stochastic Simulation Algorithm for Chemically Reacting Systems Based on Support Vector Regression

The stochastic simulation algorithm （SSA） accurately depicts spatially homogeneous wellstirred chemically reacting systems with small populations of chemical species and properly represents noise, but it is often abandoned when modeling larger systems because of its computational complexity. In this work, a twin support vector regression based stochastic simulations algorithm （TS^3A） is proposed by combining the twin support vector regression and SSA, the former is a well-known robust regression method in machine learning. Numerical results indicate that this proposed algorithm can be applied to a wide range of chemically reacting systems and obtain significant improvements on efficiency and accuracy with fewer simulating runs over the existing methods.

A Modified Inhomogeneous Stochastic Simulation Algorithm to Model Reactive Boundary Conditions

The present study proposes a stochastic simulation scheme to model reactive boundaries through a position jump process which can be readily implemented into the Inhomogeneous Stochastic Simulation Algorithm by modifying the propensity of the diffusive jump over the reactive boundary. As compared to the literature, the present approach does not require any correction factors for the propensity. Also, the current expression relaxes the constraint on the compartment size allowing the problem to be solved with a coarser grid and therefore saves considerable computational cost. The modified algorithm is then applied to simulate three reaction-diffusion systems with reactive boundaries.

NUMERICAL SIMULATION ALGORITHM FOR RELIABILITY ANALYSIS OF COMPLEX STRUCTURAL SYSTEM BASED ON INTELLIGENT OPTIMIZATION

An efficient importance sampling algorithm is presented to analyze reliability of complex structural system with multiple failure modes and fuzzy-random uncertainties in basic variables and failure modes. In order to improve the sampling efficiency, the simulated annealing algorithm is adopted to optimize the density center of the importance sampling for each failure mode, and results that the more significant contribution the points make to fuzzy failure probability, the higher occurrence possibility the points are sampled. For the system with multiple fuzzy failure modes, a weighted and mixed importance sampling function is constructed. The contribution of each fuzzy failure mode to the system failure probability is represented by the appropriate factors, and the efficiency of sampling is improved furthermore. The variances and the coefficients of variation are derived for the failure probability estimations. Two examples are introduced to illustrate the rationality of the present method. Comparing with the direct Monte-Carlo method, the improved efficiency and the precision of the method are verified by the examples.

Distribution System Optimization Planning Based on Plant Growth Simulation Algorithm

An approach for the integrated optimization of the construction/expansion capacity of high-voltage/ medium-voltage (HV/MV) substations and the configuration of MV radial distribution network was presented using plant growth simulation algorithm (PGSA). In the optimization process, fixed costs correspondent to the investment in lines and substations and the variable costs associated to the operation of the system were considered under the constraints of branch capacity, substation capacity and bus voltage. The optimization variables considerably reduce the dimension of variables and speed up the process of optimizing. The effectiveness of the proposed approach was tested by a distribution system planning.

A Class of Fast Algorithms in Real-Time Simulation

A class of hybrid algorithms of real-time simulation based on evaluation of non-integerstep right-hand side function are presented in this paper. And some results of the convergence and stability of the algorithms are given. Using the class of algorithms, evaluation for the right-hand side function is needed once in every integration-step. Moreover, comparing with the other methods with the same amount of work, their numerical stability regions are larger and the method errors are smaller, and the numerical experiments show that the algorithms are very effective.

Parallel Critical Path Tracing——A Fault Simulation Algorithm for Combinational Circuits

Critical path tracing,a fault simulation method for gate-level combinational circuits,is extended to theparallel critical path tracing for functional block-level combinational circuits.If the word length of the hostcomputer is m,then the parallel critical path tracing will be approximately m times faster than the originalone.

Strong Convergence and Speed up of Nested Stochastic Simulation Algorithm

In this paper,we revisit the Nested Stochastic Simulation Algorithm(NSSA)for stochastic chemical reacting networks by first proving its strong convergence.We then study a speed up of the algorithm by using the explicit Tau-Leaping method as the Inner solver to approximate invariant measures of fast processes,for which strong error estimates can also be obtained.Numerical experiments are presented to demonstrate the validity of our analysis.

An Adaptive Simulation Algorithm Based on Fuzzy Stiffness Recognition and Its Application to Power Station Simulation

The adaptive simulation algorithm (ASA) based on stiffness recognition is an effective and applicable simulation method. In this paper, a principle of the said method is briefly introduced and more importance is stressed in studying the value of its application by realizing it in MMS.

Neural Network Based Algorithm and Simulation of Information Fusion in the Coal Mine

The concepts of information fusion and the basic principles of neural networks are introduced. Neural net-works were introduced as a way of building an information fusion model in a coal mine monitoring system. This assures the accurate transmission of the multi-sensor information that comes from the coal mine monitoring systems. The in-formation fusion mode was analyzed. An algorithm was designed based on this analysis and some simulation results were given. Finally,conclusions that could provide auxiliary decision making information to the coal mine dispatching officers were presented.

Simultaneous Perturbation Stochastic Approximation Algorithm Combined with Neural Network and Fuzzy Simulation

In order to solve three kinds of fuzzy programm model, fuzzy chance-constrained programming mode ng models, i.e. fuzzy expected value and fuzzy dependent-chance programming model, a simultaneous perturbation stochastic approximation algorithm is proposed by integrating neural network with fuzzy simulation. At first, fuzzy simulation is used to generate a set of input-output data. Then a neural network is trained according to the set. Finally, the trained neural network is embedded in simultaneous perturbation stochastic approximation algorithm. Simultaneous perturbation stochastic approximation algorithm is used to search the optimal solution. Two numerical examples are presented to illustrate the effectiveness of the proposed algorithm.

Application of DSAPSO Algorithm in Distribution Network Reconfiguration with Distributed Generation

With the current integration of distributed energy resources into the grid,the structure of distribution networks is becoming more complex.This complexity significantly expands the solution space in the optimization process for network reconstruction using intelligent algorithms.Consequently,traditional intelligent algorithms frequently encounter insufficient search accuracy and become trapped in local optima.To tackle this issue,a more advanced particle swarm optimization algorithm is proposed.To address the varying emphases at different stages of the optimization process,a dynamic strategy is implemented to regulate the social and self-learning factors.The Metropolis criterion is introduced into the simulated annealing algorithm to occasionally accept suboptimal solutions,thereby mitigating premature convergence in the population optimization process.The inertia weight is adjusted using the logistic mapping technique to maintain a balance between the algorithm’s global and local search abilities.The incorporation of the Pareto principle involves the consideration of network losses and voltage deviations as objective functions.A fuzzy membership function is employed for selecting the results.Simulation analysis is carried out on the restructuring of the distribution network,using the IEEE-33 node system and the IEEE-69 node system as examples,in conjunction with the integration of distributed energy resources.The findings demonstrate that,in comparison to other intelligent optimization algorithms,the proposed enhanced algorithm demonstrates a shorter convergence time and effectively reduces active power losses within the network.Furthermore,it enhances the amplitude of node voltages,thereby improving the stability of distribution network operations and power supply quality.Additionally,the algorithm exhibits a high level of generality and applicability.

Integrated optimal method for cell formation and layout problems based on hybrid SA algorithm with fuzzy simulation

To adapt to the complex and changeable market environment,the cell formation problems(CFPs) and the cell layout problems(CLPs) with fuzzy demands were optimized simultaneously. Firstly,CFPs and CLPs were described formally. To deal with the uncertainty fuzzy parameters brought,a chance constraint was introduced. A mathematical model was established with an objective function of minimizing intra-cell and inter-cell material handling cost. As the chance constraint of this problem could not be converted into its crisp equivalent,a hybrid simulated annealing(HSA) based on fuzzy simulation was put forward. Finally,simulation experiments were conducted under different confidence levels. Results indicated that the proposed hybrid algorithm was feasible and effective.

Scheduling on tractor and trailer transportation considering the influence of disrupted events based on the contract net and simulated annealing algorithm

To provide a much more resilient transport scheme for tractor and trailer transportation systems,this paper explores the generation method of tractor and trailer transport schemes considering the influence of disrupted events.Three states of tractors including towing loaded trailers,towing empty trailers,and idle driving are taken into account.Based on the disruption management theory,a scheduling model is constructed to minimize the total deviation cost including transportation time,transportation path,and number of used vehicles under the three states of tractors.A heuristics based on the contract net and simulated annealing algorithm is designed to solve the proposed model.Through comparative analysis of examples with different numbers of newly added transportation tasks and different types of road networks,the performance of the contract net algorithm in terms of deviations in idle driving paths,empty trailer paths,loaded trailer paths,time,number of used vehicles,and total deviation cost are analyzed.The results demonstrate the effectiveness of the model and algorithm,highlighting the superiority of the disruption management model and the contract net annealing algorithm.The study provides a reference for handling unexpected events in the tractor and trailer transportation industry.

SOI MOSFET Model Parameter Extraction via a Compound Genetic Algorithm

We improve the genetic algorithm by combining it with a simulated annealing algorithm. The improved algorithm is used to extract model parameters of SOI MOSFETs, which are fabricated with standard 1.2μm CMOS/SOI technology developed by the Institute of Microelectronics of the Chinese Academy of Sciences. The simulation results using this model are in excellent agreement with experimental results. The precision is improved noticeably compared to commercial software. This method requires neither a deeper understanding of SOl MOSFETs model nor more complex computations than conventional algorithms used by commercial software. Comprehensive verification shows that this model is applicable to a very large range of device sizes.

L-leap:accelerating the stochastic simulation of chemically reacting systems

Presented here is an L-leap method for accelerating stochastic simulation of well-stirred chemically reacting systems, in which the number of reactions occurring in a reaction channel with the largest propensity function is calculated from the leap condition and the number of reactions occurring in the other reaction channels are generated by using binomial random variables during a leap. The L-leap method can better satisfy the leap condition. Numerical simulation results indicate that the L-leap method can obtain better performance than established methods.

“Final all possible steps”approach for accelerating stochastic simulation of coupled chemical reactions

In this paper, we develop a modified accelerated stochastic simulation method for chemically reacting systems, called the ＂final all possible steps＂ （FAPS） method, which obtains the reliable statistics of all species in any time during the time course with fewer simulation times. Moreover, the FAPS method can be incorporated into the leap methods, which makes the simulation of larger systems more efficient. Numerical results indicate that the proposed methods can be applied to a wide range of chemically reacting systems with a high-precision level and obtain a significant improvement on efficiency over the existing methods.

Parallel Digital Simulation for the Control Problem in Differential Algebraic System

In this paper, a parallel simulation algorithm for the control problem in differential algebraic system is presented. The error of the algorithm is estimated. The stability analysis is made for a model problem and the stability region is given. The numerical example demonstrates that the method is efficient.

Novel hybrid optimal algorithm for broad-band Raman amplifier

A hybrid optimal algorithm, named the SAA-PA in brief, based on the simulated annealing algorithm （SAA） and the Powell algorithm （PA） is proposed. The proposed algorithm puts the random search strategy of the SAA into the PA, which can prevent optimizing courses from trapping in local optima. The SAA-PA can effectively solve multimodal optimization in the distributed multi-pump Raman amplifier （DMRA）. Optimal results show that, under the conditions of the on-off gain of 10 dB, the gain bandwidth of larger than 80 nm and the fiber length of 80 km, the gain ripple of less than 1.25 dB can be designed from the DMRA with only four backward pumps after the optimization of the proposed SAA-PA. Compared with the pure SAA, the SAA-PA can attain a lower gain ripple with the same number of pumps. Also, the relationship between the optimal signal bandwidth and the number of pumps can be simulated numerically with the SAA-PA.

Multicast Routing Based on Hybrid Genetic Algorithm

A new multicast routing algorithm based on the hybrid genetic algorithm (HGA) is proposed. The coding pattern based on the number of routing paths is used. A fitness function that is computed easily and makes algorithm quickly convergent is proposed. A new approach that defines the HGA's parameters is provided. The simulation shows that the approach can increase largely the convergent ratio, and the fitting values of the parameters of this algorithm are different from that of the original algorithms. The optimal mutation probability of HGA equals 0.50 in HGA in the experiment, but that equals 0.07 in SGA. It has been concluded that the population size has a significant influence on the HGA's convergent ratio when it's mutation probability is bigger. The algorithm with a small population size has a high average convergent rate. The population size has little influence on HGA with the lower mutation probability.