Research on Grid Planning of Dual Power Distribution Network Based on Parallel Ant Colony Optimization Algorithm

A distribution network plays an extremely important role in the safe and efficient operation of a power grid.As the core part of a power grid’s operation,a distribution network will have a significant impact on the safety and reliability of residential electricity consumption.it is necessary to actively plan and modify the distribution network’s structure in the power grid,improve the quality of the distribution network,and optimize the planning of the distribution network,so that the network can be fully utilized to meet the needs of electricity consumption.In this paper,a distribution network grid planning algorithm based on the reliability of electricity consumption was completed using ant colony algorithm.For the distribution network structure planning of dual power sources,the parallel ant colony algorithm was used to prove that the premise of parallelism is the interactive process of ant colonies,and the dual power distribution network structure model is established based on the principle of the lowest cost.The artificial ants in the algorithm were compared with real ants in nature,and the basic steps and working principle of the ant colony optimization algorithm was studied with the help of the travelling salesman problem(TSP).Then,the limitations of the ant colony algorithm were analyzed,and an improvement strategy was proposed by using python for digital simulation.The results demonstrated the reliability of model-building and algorithm improvement.

Optimal Design of a 3-Leg 6-DOF Parallel Manipulator for a Specific Workspace

Researchers seldom study optimum design of a six-degree-of-freedom（DOF） parallel manipulator with three legs based upon the given workspace.An optimal design method of a novel three-leg six-DOF parallel manipulator（TLPM） is presented.The mechanical structure of this robot is introduced,with this structure the kinematic constrain equations is decoupled.Analytical solutions of the forward kinematics are worked out,one configuration of this robot,including position and orientation of the end-effector are graphically displayed.Then,on the basis of several extreme positions of the kinematic performances,the task workspace is given.An algorithm of optimal designing is introduced to find the smallest dimensional parameters of the proposed robot.Examples illustrate the design results,and a design stability index is introduced,which ensures that the robot remains a safe distance from the boundary of sits actual workspace.Finally,one prototype of the robot is developed based on this method.This method can easily find appropriate kinematic parameters that can size a robot having the smallest workspace enclosing a predefined task workspace.It improves the design efficiency,ensures that the robot has a small mechanical size possesses a large given workspace volume,and meets the lightweight design requirements.

Rule-based scheduling of multi-stage multi-product batch plants with parallel units

A novel rule-based model for multi-stage multi-product scheduling problem(MMSP)in batch plants with parallel units is proposed.The scheduling problem is decomposed into two sub-problems of order assignment and order sequencing.Firstly,hierarchical scheduling strategy is presented for solving the former sub-problem,where the multi-stage multi-product batch process is divided into multiple sequentially connected single process stages,and then the production of orders are arranged in each single stage by using forward order assignment strategy and backward order assignment strategy respectively according to the feature of scheduling objective.Line-up competition algorithm(LCA)is presented to find out optimal order sequence and order assignment rule,which can minimize total flow time or maximize total weighted process time.Computational results show that the proposed approach can obtain better solutions than those of the literature for all scheduling problems with more than 10 orders.Moreover,with the problem size increasing,the solutions obtained by the proposed approach are improved remarkably.The proposed approach has the potential to solve large size MMSP.

Parallel discrete lion swarm optimization algorithm for solving traveling salesman problem

As a typical representative of the NP-complete problem, the traveling salesman problem(TSP) is widely utilized in computer networks, logistics distribution, and other fields. In this paper, a discrete lion swarm optimization(DLSO) algorithm is proposed to solve the TSP. Firstly, we introduce discrete coding and order crossover operators in DLSO. Secondly, we use the complete 2-opt(C2-opt) algorithm to enhance the local search ability.Then in order to enhance the efficiency of the algorithm, a parallel discrete lion swarm optimization(PDLSO) algorithm is proposed.The PDLSO has multiple populations, and each sub-population independently runs the DLSO algorithm in parallel. We use the ring topology to transfer information between sub-populations. Experiments on some benchmarks TSP problems show that the DLSO algorithm has a better accuracy than other algorithms, and the PDLSO algorithm can effectively shorten the running time.

A novel hybrid estimation of distribution algorithm for solving hybrid flowshop scheduling problem with unrelated parallel machine

The hybrid flow shop scheduling problem with unrelated parallel machine is a typical NP-hard combinatorial optimization problem, and it exists widely in chemical, manufacturing and pharmaceutical industry. In this work, a novel mathematic model for the hybrid flow shop scheduling problem with unrelated parallel machine(HFSPUPM) was proposed. Additionally, an effective hybrid estimation of distribution algorithm was proposed to solve the HFSPUPM, taking advantage of the features in the mathematic model. In the optimization algorithm, a new individual representation method was adopted. The(EDA) structure was used for global search while the teaching learning based optimization(TLBO) strategy was used for local search. Based on the structure of the HFSPUPM, this work presents a series of discrete operations. Simulation results show the effectiveness of the proposed hybrid algorithm compared with other algorithms.

Application of Evolution Sequential Number Theoretic Optimization in Global Optimization

Synthesis of chemical processes is of non-convex and multi-modal. Deterministic strategies often fail to find global optimum within reasonable time scales. Stochastic methodologies generally approach global solution in probability. In recogniting the state of art status in the discipline, a new approach for global optimization of processes, based on sequential number theoretic optimization (SNTO), is proposed. In this approach, subspaces and feasible points are derived from uniformly scattered points, and iterations over passing the corner of local optimum are enhanced via parallel strategy. The efficiency of the approach proposed is verified by results obtained from various case studies.

Reconstruction method of irregular seismic data with adaptive thresholds based on different sparse transform bases

Oil and gas seismic exploration have to adopt irregular seismic acquisition due to the increasingly complex exploration conditions to adapt to complex geological conditions and environments.However,the irregular seismic acquisition is accompanied by the lack of acquisition data,which requires high-precision regularization.The sparse signal feature in the transform domain in compressed sensing theory is used in this paper to recover the missing signal,involving sparse transform base optimization and threshold modeling.First,this paper analyzes and compares the effects of six sparse transformation bases on the reconstruction accuracy and efficiency of irregular seismic data and establishes the quantitative relationship between sparse transformation and reconstruction accuracy and efficiency.Second,an adaptive threshold modeling method based on sparse coefficient is provided to improve the reconstruction accuracy.Test results show that the method has good adaptability to different seismic data and sparse transform bases.The f-x domain reconstruction method of effective frequency samples is studied to address the problem of low computational efficiency.The parallel computing strategy of curvelet transform combined with OpenMP is further proposed,which substantially improves the computational efficiency under the premise of ensuring the reconstruction accuracy.Finally,the actual acquisition data are used to verify the proposed method.The results indicate that the proposed method strategy can solve the regularization problem of irregular seismic data in production and improve the imaging quality of the target layer economically and efficiently.

Enhancing Design of Visual-Servo Delayed System

A robust adaptive predictor is proposed to solve the time-varying and delay control problem of an overhead crane system with a stereo-vision servo. The predictor is based on the use of a recurrent neural network(RNN) with tapped delays, and is used to supply the real-time signal of the swing angle. There are two types of discrete-time controllers under investigation, i.e., the proportional-integral-derivative(PID) controller and the sliding controller. Firstly, a design principle of the neural predictor is developed to guarantee the convergence of its swing angle estimation. Then, an improved version of the particle swarm optimization algorithm, the parallel particle swarm optimization(PPSO) method is used to optimize the control parameters of these two types of controllers. Finally, a homemade overhead crane system equipped with the Kinect sensor for the visual servo is used to verify the proposed scheme. Experimental results demonstrate the effectiveness of the approach, which also show the parameter convergence in the predictor.

Optimized design of parallel beam-splitting prism

A large lateral shearing distance of parallel beam-splitting prism is often needed in laser modulation and polarization interference. In this letter, we present an optimized design of parallel beam-splitting prism and list some different cases in detail. The optimized design widens the use range of parallel beam-splitting prism. At the wavelength of 632.8 nm, the law that the enlargement ratio changes with the refractive index and the apex angle is verified.

AERODYNAMIC OPTIMIZATION DESIGN OF LOW ASPECT RATIO TRANSONIC TURBINE STAGE

The advanced optimization method named as adaptive range differential evolution （ARDE） is developed. The optimization performance of ARDE is demonstrated using a typical mathematical test and compared with the standard genetic algorithm and differential evolution. Combined with parallel ARDE, surface modeling method and Navier-Stokes solution, a new automatic aerodynamic optimization method is presented. A low aspect ratio transonic turbine stage is optimized for the maximization of the isentropic efficiency with forty-one design variables in total. The coarse-grained parallel strategy is applied to accelerate the design process using 15 CPUs. The isentropic efficiency of the optimum design is 1.6% higher than that of the reference design. The aerodynamic performance of the optimal design is much better than that of the reference design.

Optimized Parallel Execution of Declarative Programs on Distributed Memory Multiprocessors

In this paper,we focus on the compiling implementation of parallel logic language PARLOG and functional language ML on distributed memory multiprocessors.Under the graph rewriting framework, a Heterogeneous Parallel Graph Rewriting Execution Model(HPGREM)is presented firstly.Then based on HPGREM,a parallel abstract machine PAM/TGR is described.Furthermore,several optimizing compilation schemes for executing declarative programs on transputer array are proposed. The performance statistics on a transputer array demonstrate the effectiveness of our model,parallel ab- stract machine,optimizing compilation strategies and compiler.

Data Analyses and Parallel Optimization of the Regional Marine Ecological Model

Under the joint influence of high-intensity human activities and cli-mate change,the coastal ecological environment is deteriorating,and the ecologi-cal environment security and the sustainable development of the marine economy are seriously threatened.Therefore,it is of great significance to establish a high-resolution ecological environment operational forecasting system.To meet the run time requirements of the ecological operational forecasting system,a vari-ety of parallel optimization methods were proposed to improve the operation efficiency of the model.First,based on the National Marine Environmental Fore-casting Center’s Lenovo cluster,the ROMS benchmark experiment was expanded to the 4000 Processes scale.A good speedup was obtained by the experiment.The ROMS model was analysed with strong scalability.Second,in the hydrodynamic-ecological simulation experiment of the Bohai Sea-Yellow Sea-East China Sea,by optimizing Vector,InfiniBand,and Parallel I/O,the performance of the model can be improved by 270%while maintaining the same computing resources.That computing resources were more reasonably used lay the foundation for the operational forecast.

Research on the Optimal Parallel Algorithms of Broadcast-Class Problems

Speedup is considered as the criterion of determining whether a parallel algorithm is optimal. But broadcast-class problems, existing only on parallel computer system, have no sequential algorithms at all. Speedup standard becomes invalid here. Through this research on broadcast algorithms under several typical parallel computation models,a model-independent evaluation standard min C2 is developed, which can be not only used to determine an optimal broadcasting algorithm, but also normalized to apply to any parallel algorithm. As a new idea, min C2 will lead to a new way in this field.

Hierarchical Bulk Synchronous Parallel Model and Performance Optimization

Based on the framework of BSP, a Hierarchical Bulk Synchronous Parallel (HBSP) performance model is introduced in this paper to capture the per formance optimization problem for various stages in parallel program development and to accurately predict the performance of a parallel program by considering fac tors causing variance at local computation and global communication. The related methodology has been applied to several real applications and the results show that HBSP is a suitable model for optimizing parallel programs.

EDISON-WMW: Exact Dynamic Programing Solution of the Wilcoxon–Mann–Whitney Test

In many research disciplines, hypothesis tests are applied to evaluate whether findings are statistically significant or could be explained by chance. The Wilcoxon-Mann-Whitney （WMW） test is among the most popular hypothesis tests in medicine and life science to analyze if two groups of samples are equally distributed. This nonparametric statistical homogeneity test is commonly applied in molecular diagnosis. Generally, the solution of the WMW test takes a high combinatorial effort for large sample cohorts containing a significant number of ties. Hence, P value is frequently approximated by a normal distribution. We developed EDISON-WMW, a new approach to calcu- late the exact permutation of the two-tailed unpaired WMW test without any corrections required and allowing for ties. The method relies on dynamic programing to solve the combinatorial problem of the WMW test efficiently. Beyond a straightforward implementation of the algorithm, we pre- sented different optimization strategies and developed a parallel solution. Using our program, the exact P value for large cohorts containing more than 1000 samples with ties can be calculated within minutes. We demonstrate the performance of this novel approach on randomly-generated data, benchmark it against 13 other commonly-applied approaches and moreover evaluate molec- ular biomarkers for lung carcinoma and chronic obstructive pulmonary disease （COPD）. We foundthat approximated P values were generally higher than the exact solution provided by EDISON- WMW. Importantly, the algorithm can also be applied to high-throughput omics datasets, where hundreds or thousands of features are included. To provide easy access to the multi-threaded version of EDISON-WMW, a web-based solution of our algorithm is freely available at http：// www.ccb.uni-saarland.de/software/wtest/.

The uncoupled microbial fed-batch fermentation optimization based on state-dependent switched system

In the actual microbial fermentation process,excessive or insufficient substrate can produce inhibitory effects on cells growth.The artificial substrate feeding rules by past experiences have great blindness to keep substrate concentration in a given appropriate range.This paper considers that alkali feed depends on pH value of the solution and glycerol feed depends on glycerol concentration of the solution in the uncoupled microbial fed-hatch fermentation process,and establishes a state-dependent switched system in which the flow rates of glycerol and alkali,the number of mode switches,the mode sequence and the switching times are prior unknown.To maximize the yield of target product 1,3-Propanediol(1,3-PD),we formulate a switching optimal control problem with the flow rates of glycerol and alkali,the number of mode switches,the mode sequence and the switching times as decision variables,which is a mixed-integer dynamic programming problem.For solving the mixed-integer dynamic programming problem,the control parametrization technique,the time scaling transformation and the embedded system technology are used to obtain an approximate parameter optimization problem.By using a parallel optimization algorithm,we obtain the optimal control strategies.Under the obtained optimal control strategies,the 1,3-PD yield at the terminal time is increased significantly compared with the previous results.