Communicating with the non-dominant hemisphere:Implications for neurological rehabilitation

Aphasic syndromes usually result from injuries to the dominant hemisphere of the brain. Despite the fact that localization of language functions shows little interindividual variability, several brain areas are simultaneously activated when language tasks are undertaken. Mechanisms of language recovery after brain injury to the dominant hemisphere seem to be relatively stereotyped, including activations of perilesional areas in the acute phase and of homologues of language areas in the non-dominant hemisphere in the subacute phase, later returning to dominant hemisphere activation in the chronic phase. Plasticity mechanisms reopen the critical period of language development, more specifically in what leads to disinhibition of the non-dominant hemisphere when brain lesions affect the dominant hemisphere. The non-dominant hemisphere plays an important role during recovery from aphasia, but currently available rehabilitation therapies have shown limited results for efficient language improvement. Large-scale randomized controlled trials that evaluate well-defined interventions in patients with aphasia are needed for stimulation of neuroplasticity mechanisms that enhance the role of the non-dominant hemisphere for language recovery. Ineffective treatment approaches should be replaced by more promising ones and the latter should be evaluated for proper application. The data generated by such studies could substantiate evidence-based rehabilitation strategies for patients with aphasia.

An Optimization Approach for Convolutional Neural Network Using Non-Dominated Sorted Genetic Algorithm-Ⅱ

In computer vision,convolutional neural networks have a wide range of uses.Images representmost of today’s data,so it’s important to know how to handle these large amounts of data efficiently.Convolutional neural networks have been shown to solve image processing problems effectively.However,when designing the network structure for a particular problem,you need to adjust the hyperparameters for higher accuracy.This technique is time consuming and requires a lot of work and domain knowledge.Designing a convolutional neural network architecture is a classic NP-hard optimization challenge.On the other hand,different datasets require different combinations of models or hyperparameters,which can be time consuming and inconvenient.Various approaches have been proposed to overcome this problem,such as grid search limited to low-dimensional space and queuing by random selection.To address this issue,we propose an evolutionary algorithm-based approach that dynamically enhances the structure of Convolution Neural Networks(CNNs)using optimized hyperparameters.This study proposes a method using Non-dominated sorted genetic algorithms(NSGA)to improve the hyperparameters of the CNN model.In addition,different types and parameter ranges of existing genetic algorithms are used.Acomparative study was conducted with various state-of-the-art methodologies and algorithms.Experiments have shown that our proposed approach is superior to previous methods in terms of classification accuracy,and the results are published in modern computing literature.

Strengthened Dominance Relation NSGA-Ⅲ Algorithm Based on Differential Evolution to Solve Job Shop Scheduling Problem

The job shop scheduling problem is a classical combinatorial optimization challenge frequently encountered in manufacturing systems.It involves determining the optimal execution sequences for a set of jobs on various machines to maximize production efficiency and meet multiple objectives.The Non-dominated Sorting Genetic Algorithm Ⅲ(NSGA-Ⅲ)is an effective approach for solving the multi-objective job shop scheduling problem.Nevertheless,it has some limitations in solving scheduling problems,including inadequate global search capability,susceptibility to premature convergence,and challenges in balancing convergence and diversity.To enhance its performance,this paper introduces a strengthened dominance relation NSGA-Ⅲ algorithm based on differential evolution(NSGA-Ⅲ-SD).By incorporating constrained differential evolution and simulated binary crossover genetic operators,this algorithm effectively improves NSGA-Ⅲ’s global search capability while mitigating pre-mature convergence issues.Furthermore,it introduces a reinforced dominance relation to address the trade-off between convergence and diversity in NSGA-Ⅲ.Additionally,effective encoding and decoding methods for discrete job shop scheduling are proposed,which can improve the overall performance of the algorithm without complex computation.To validate the algorithm’s effectiveness,NSGA-Ⅲ-SD is extensively compared with other advanced multi-objective optimization algorithms using 20 job shop scheduling test instances.The experimental results demonstrate that NSGA-Ⅲ-SD achieves better solution quality and diversity,proving its effectiveness in solving the multi-objective job shop scheduling problem.

Improved non-dominated sorting genetic algorithm (NSGA)-II in multi-objective optimization studies of wind turbine blades

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.

GREEDY NON-DOMINATED SORTING IN GENETIC ALGORITHM-ⅡFOR VEHICLE ROUTING PROBLEM IN DISTRIBUTION

Vehicle routing problem in distribution （VRPD） is a widely used type of vehicle routing problem （VRP）, which has been proved as NP-Hard, and it is usually modeled as single objective optimization problem when modeling. For multi-objective optimization model, most researches consider two objectives. A multi-objective mathematical model for VRP is proposed, which considers the number of vehicles used, the length of route and the time arrived at each client. Genetic algorithm is one of the most widely used algorithms to solve VRP. As a type of genetic algorithm （GA）, non-dominated sorting in genetic algorithm-Ⅱ （NSGA-Ⅱ） also suffers from premature convergence and enclosure competition. In order to avoid these kinds of shortage, a greedy NSGA-Ⅱ （GNSGA-Ⅱ） is proposed for VRP problem. Greedy algorithm is implemented in generating the initial population, cross-over and mutation. All these procedures ensure that NSGA-Ⅱ is prevented from premature convergence and refine the performance of NSGA-Ⅱ at each step. In the distribution problem of a distribution center in Michigan, US, the GNSGA-Ⅱ is compared with NSGA-Ⅱ. As a result, the GNSGA-Ⅱ is the most efficient one and can get the most optimized solution to VRP problem. Also, in GNSGA-Ⅱ, premature convergence is better avoided and search efficiency has been improved sharply.

Modeling and Optimization of Electrical Discharge Machining of SiC Parameters, Using Neural Network and Non-Dominating Sorting Genetic Algorithm (NSGA II)

Silicon Carbide (SiC) machining by traditional methods with regards to its high hardness is not possible. Electro Discharge Machining, among non-traditional machining methods, is used for machining of SiC. The present work is aimed to optimize the surface roughness and material removal rate of electro discharge machining of SiC parameters simultaneously. As the output parameters are conflicting in nature, so there is no single combination of machining parameters, which provides the best machining performance. Artificial neural network (ANN) with back propagation algorithm is used to model the process. A multi-objective optimization method, non-dominating sorting genetic algorithm-II is used to optimize the process. Affects of three important input parameters of process viz., discharge current, pulse on time (Ton), pulse off time (Toff) on electric discharge machining of SiC are considered. Experiments have been conducted over a wide range of considered input parameters for training and verification of the model. Testing results demonstrate that the model is suitable for predicting the response parameters. A pareto-optimal set has been predicted in this work.

考虑交货期的双资源柔性作业车间节能调度

为解决含有机器和工人双资源约束的柔性作业车间节能调度问题,在考虑交货期的基础上,建立了以总提前和拖期惩罚值及总能耗最小为目标的双资源柔性作业车间节能调度模型。提出了一种改进的非支配排序遗传算法(improved non-dominated sorting genetic algorithmⅡ,INSGA-Ⅱ)进行求解。针对所优化的目标,设计了一种三阶段解码方法以获得高质量的可行解;利用动态自适应交叉和变异算子以获得更多优良个体;改进拥挤距离以获得收敛性和分布性更优的种群。将INSGA-Ⅱ与多种多目标优化算法进行对比分析,实验结果表明所提算法可行且有效。

基于混合遗传蚁群算法的多目标FJSP问题研究

针对多目标柔性作业车间调度问题求解过程中未综合考虑解集多样性与求解效率的问题,提出了一种混合遗传蚁群算法来求解。首先,通过改进的NSGA-Ⅱ(non-dominated sorting genetic algorithmⅡ)获取问题的较优解,以此来确定蚁群算法的初始信息素分布;其次,根据提出的自适应伪随机比例规则和改进的信息素更新规则来优化蚂蚁的遍历过程;最后,通过邻域搜索,扩大蚂蚁的搜索空间,从而提高解集的多样性。通过Kacem和BRdata算例进行实验验证,证明混合遗传蚁群算法具有更高的求解效率和更好解集多样性。

Multi-objective optimization of the cathode catalyst layer micro-composition of polymer electrolyte membrane fuel cells using a multi-scale,two-phase fuel cell model and data-driven surrogates

Polymer electrolyte membrane fuel cells(PEMFCs)are considered a promising alternative to internal combustion engines in the automotive sector.Their commercialization is mainly hindered due to the cost and effectiveness of using platinum(Pt)in them.The cathode catalyst layer(CL)is considered a core component in PEMFCs,and its composition often considerably affects the cell performance(V_(cell))also PEMFC fabrication and production(C_(stack))costs.In this study,a data-driven multi-objective optimization analysis is conducted to effectively evaluate the effects of various cathode CL compositions on Vcelland Cstack.Four essential cathode CL parameters,i.e.,platinum loading(L_(Pt)),weight ratio of ionomer to carbon(wt_(I/C)),weight ratio of Pt to carbon(wt_(Pt/c)),and porosity of cathode CL(ε_(cCL)),are considered as the design variables.The simulation results of a three-dimensional,multi-scale,two-phase comprehensive PEMFC model are used to train and test two famous surrogates:multi-layer perceptron(MLP)and response surface analysis(RSA).Their accuracies are verified using root mean square error and adjusted R^(2).MLP which outperforms RSA in terms of prediction capability is then linked to a multi-objective non-dominated sorting genetic algorithmⅡ.Compared to a typical PEMFC stack,the results of the optimal study show that the single-cell voltage,Vcellis improved by 28 m V for the same stack price and the stack cost evaluated through the U.S department of energy cost model is reduced by$5.86/k W for the same stack performance.

Multiobjective Economic/Environmental Dispatch Using Harris Hawks Optimization Algorithm

The eminence of Economic Dispatch(ED)in power systems is signifi-cantly high as it involves in scheduling the available power from various power plants with less cost by compensating equality and inequality constrictions.The emission of toxic gases from power plants leads to environmental imbalance and so it is highly mandatory to rectify this issues for obtaining optimal perfor-mance in the power systems.In this present study,the Economic and Emission Dispatch(EED)problems are resolved as multi objective Economic Dispatch pro-blems by using Harris Hawk’s Optimization(HHO),which is capable enough to resolve the concerned issue in a wider range.In addition,the clustering approach is employed to maintain the size of the Pareto Optimal(PO)set during each itera-tion and fuzzy based approach is employed to extricate compromise solution from the Pareto front.To meet the equality constraint effectively,a new demand-based constraint handling mechanism is adopted.This paper also includes Wind energy conversion system(WECS)in EED problem.The conventional thermal generator cost is taken into account while considering the overall cost functions of wind energy like overestimated,underestimated and proportional costs.The quality of the non-dominated solution set is measured using quality metrics such as Set Spacing(SP)and Hyper-Volume(HV)and the solutions are compared with other conventional algorithms to prove its efficiency.The present study is validated with the outcomes of various literature papers.

Multi-objective optimization of process parameters for ultra-narrow gap welding based on Universal Kriging and NSGA Ⅱ

The successful confinement of the arc by the flux band depends on the welding process parameters for achieving single-pass,multi-layer, and ultra-narrow gap welding. The sidewall fusion depth, the width of the heat-affected zone, and the line energy are utilized as comprehensive indications of the quality of the welded joint. In order to achieve well fusion and reduce the heat input to the base metal.Three welding process characteristics were chosen as the primary determinants, including welding voltage, welding speed, and wire feeding speed. The metamodel of the welding quality index was built by the orthogonal experiments. The metamodel and NSGA-Ⅱ(Non-dominated sorting genetic algorithm Ⅱ) were combined to develop a multi-objective optimization model of ultra-narrow gap welding process parameters. The results showed that the optimized welding process parameters can increase the sidewall fusion depth, reduce the width of the heataffected zone and the line energy, and to some extent improve the overall quality of the ultra-narrow gap welding process.

An Optimization Capacity Design Method of Wind/Photovoltaic/Hydrogen Storage Power System Based on PSO-NSGA-II

The optimal allocation of integrated energy systemcapacity based on the heuristic algorithms can reduce economic costs and achieve maximum consumption of renewable energy,which has attracted many attentions.However,the optimization results of heuristic algorithms are usually influenced by the choice of hyperparameters.To solve the above problem,the particle swarm algorithm is introduced to find the optimal hyperparameters of the heuristic algorithms.Firstly,an integrated energy system consisting of the photovoltaic,wind turbine,electrolysis cell,hydrogen storage tank,and energy storage is established.Meanwhile,the minimum economic cost,the maximum wind and PV power consumption rate,and the minimum load shortage rate are considered to be the objective functions.Then,a hybrid method combined the particle swarm combined with non-dominated sorting genetic algorithms-II is proposed to solve the optimal allocation problem.According to the optimal result,the economic cost is 6.3 million RMB,and the load shortage rate is 9.83%.Finally,four comparative experiments are conducted to verify the superiority-seeking ability of the proposed method.The comparative results indicate that the proposed method possesses a strongermerit-seeking ability,resulting in a solution satisfaction rate of 87.37%,which is higher than that of the unimproved non-dominated sorting genetic algorithms-II.

Dynamic Allocation of Manufacturing Tasks and Resources in Shared Manufacturing

Shared manufacturing is recognized as a new point-to-point manufac-turing mode in the digital era.Shared manufacturing is referred to as a new man-ufacturing mode to realize the dynamic allocation of manufacturing tasks and resources.Compared with the traditional mode,shared manufacturing offers more abundant manufacturing resources and flexible configuration options.This paper proposes a model based on the description of the dynamic allocation of tasks and resources in the shared manufacturing environment,and the characteristics of shared manufacturing resource allocation.The execution of manufacturing tasks,in which candidate manufacturing resources enter or exit at various time nodes,enables the dynamic allocation of manufacturing tasks and resources.Then non-dominated sorting genetic algorithm(NSGA-II)and multi-objective particle swarm optimization(MOPSO)algorithms are designed to solve the model.The optimal parameter settings for the NSGA-II and MOPSO algorithms have been obtained according to the experiments with various population sizes and iteration numbers.In addition,the proposed model’s efficiency,which considers the entries and exits of manufacturing resources in the shared manufacturing environment,is further demonstrated by the overlap between the outputs of the NSGA-II and MOPSO algorithms for optimal resource allocation.

Multi-Objective Cold Chain Path Optimization Based on Customer Satisfaction

To improve customer satisfaction of cold chain logistics of fresh agricultural goods enterprises and reduce the comprehensive distribution cost composed of fixed cost, transportation cost, cargo damage cost, refrigeration cost, and time penalty cost, a multi-objective path optimization model of fresh agricultural products distribution considering client satisfaction is constructed. The model is solved using an enhanced Elitist Non-dominated Sorting Genetic Algorithm (NSGA-II), and differential evolution is incorporated to the evolution operator. The algorithm produced by the revised algorithm produces a better Pareto optimum solution set, efficiently balances the relationship between customer pleasure and cost, and serves as a reference for the long-term growth of organizations. .

Planning of DC Electric Spring with Particle Swarm Optimization and Elitist Non-dominated Sorting Genetic Algorithm

This paper addresses the planning problem of parallel DC electric springs (DCESs). DCES, a demand-side management method, realizes automatic matching of power consumption and power generation by adjusting non-critical load (NCL) and internal storage. It can offer higher power quality to critical load (CL), reduce power imbalance and relieve pressure on energy storage systems (RESs). In this paper, a planning method for parallel DCESs is proposed to maximize stability gain, economic benefits, and penetration of RESs. The planning model is a master optimization with sub-optimization to highlight the priority of objectives. Master optimization is used to improve stability of the network, and sub-optimization aims to improve economic benefit and allowable penetration of RESs. This issue is a multivariable nonlinear mixed integer problem, requiring huge calculations by using common solvers. Therefore, particle Swarm optimization (PSO) and Elitist non-dominated sorting genetic algorithm (NSGA-II) were used to solve this model. Considering uncertainty of RESs, this paper verifies effectiveness of the proposed planning method on IEEE 33-bus system based on deterministic scenarios obtained by scenario analysis.

Improved genetic algorithm for nonlinear programming problems

An improved genetic algorithm（IGA） based on a novel selection strategy to handle nonlinear programming problems is proposed.Each individual in selection process is represented as a three-dimensional feature vector which is composed of objective function value,the degree of constraints violations and the number of constraints violations.It is easy to distinguish excellent individuals from general individuals by using an individuals＇ feature vector.Additionally,a local search（LS） process is incorporated into selection operation so as to find feasible solutions located in the neighboring areas of some infeasible solutions.The combination of IGA and LS should offer the advantage of both the quality of solutions and diversity of solutions.Experimental results over a set of benchmark problems demonstrate that IGA has better performance than other algorithms.

Evolutionary Trajectory Planning for an Industrial Robot

This paper presents a novel general method for computing optimal motions of an industrial robot manipulator （AdeptOne XL robot） in the presence of fixed and oscillating obstacles. The optimization model considers the nonlinear manipulator dynamics, actuator constraints, joint limits, and obstacle avoidance. The problem has 6 objective functions, 88 variables, and 21 constraints. Two evolutionary algorithms, namely, elitist non-dominated sorting genetic algorithm （NSGA-II） and multi-objective differential evolution （MODE）, have been used for the optimization. Two methods （normalized weighting objective functions and average fitness factor） are used to select the best solution tradeoffs. Two multi-objective performance measures, namely solution spread measure and ratio of non-dominated individuals, are used to evaluate the Pareto optimal fronts. Two multi-objective performance measures, namely, optimizer overhead and algorithm effort, are used to find the computational effort of the optimization algorithm. The trajectories are defined by B-spline functions. The results obtained from NSGA-II and MODE are compared and analyzed.

Multiobjective optimization scheme for industrial synthesis gas sweetening plant in GTL process

In industrial amine plants the optimized operating conditions are obtained from the conclusion of occurred events and challenges that are normal in the working units. For the sake of reducing the costs, time consuming, and preventing unsuitable accidents, the optimization could be performed by a computer program. In this paper, simulation and parameter analysis of amine plant is performed at first. The optimization of this unit is studied using Non-Dominated Sorting Genetic Algorithm-II in order to produce sweet gas with CO 2 mole percentage less than 2.0% and H 2 S concentration less than 10 ppm for application in Fischer-Tropsch synthesis. The simulation of the plant in HYSYS v.3.1 software has been linked with MATLAB code for real-parameter NSGA-II to simulate and optimize the amine process. Three scenarios are selected to cover the effect of （DEA/MDEA） mass composition percent ratio at amine solution on objective functions. Results show that sour gas temperature and pressure of 33.98 ？ C and 14.96 bar, DEA/CO 2 molar flow ratio of 12.58, regeneration gas temperature and pressure of 94.92 ？ C and 3.0 bar, regenerator pressure of 1.53 bar, and ratio of DEA/MDEA = 20%/10% are the best values for minimizing plant energy consumption, amine circulation rate, and carbon dioxide recovery.

Robust design of natural laminar flow supercritical airfoil by multi-objective evolution method

Abstract A transonic, high Reynolds number natural laminar flow airfoil is designed and studied. The γ-θ transition model is combined with the shear stress transport （SST） k-w turbulence model to predict the transition region for a laminar-turbulent boundary layer. The non-uniform free-form deformation （NFFD） method based on the non-uniform rational B-spline （NURBS） basis function is introduced to the airfoil parameterization. The non-dominated sorting genetic algorithm-II （NSGA-II） is used as the search algo- rithm, and the surrogate model based on the Kriging models is introduced to improve the efficiency of the optimization system. The optimization system is set up based on the above technologies, and the robust design about the uncertainty of the Mach number is carried out for NASA0412 airfoil. The optimized airfoil is analyzed and compared with the original airfoil. The results show that natural laminar flow can be achieved on a supercritical airfoil to improve the aerodynamic characteristic of airfoils.

nalysis and design for missile of three-loop autopilot

The structure characteristic of the three-loop autopilot is analyzed and the pole placement analytic algorithm is given. In order to ensure that the system will meet the stability requirement when taking the dynamic characteristics of all the hardware devices into account, the frequency of the open-loop crossover should be constrained. Based on the pole placement algorithm, a non-linear equation with the non-dominant pole as a variable and the open-loop crossover frequency as a con- straint is constructed. Solving the equation and getting the corresponding value of the non-dominant pole, the design of autopilot can be completed. Finally, through an example, it is shown that the method is convenient and practicable for the design of a three-loop autopilot.