An extended crowding genetic algorithm (ECGA) is introduced for solvingoptimal pump configuration problem, which was presented by T. Westerlund in 1994. This problem hasbeen found to be non-convex, and the objective f...An extended crowding genetic algorithm (ECGA) is introduced for solvingoptimal pump configuration problem, which was presented by T. Westerlund in 1994. This problem hasbeen found to be non-convex, and the objective function contained several local optima and globaloptimality could not be ensured by all the traditional MINLP optimization method. The concepts ofspecies conserving and composite encoding are introduced to crowding genetic algorithm (CGA) formaintain the diversity of population more effectively and coping with the continuous and/or discretevariables in MINLP problem. The solution of three-levels pump configuration got from DICOPT++software (OA algorithm) is also given. By comparing with the solutions obtained from DICOPT++, ECPmethod, and MIN-MIN method, the ECGA algorithm proved to be very effective in finding the globaloptimal solution of multi-levels pump configuration via using the problem-specific information.展开更多
The uncertain duration of each job in each machine in flow shop problem was regarded as an independent random variable and was described by mathematical expectation.And then,an immune based partheno-genetic algorithm ...The uncertain duration of each job in each machine in flow shop problem was regarded as an independent random variable and was described by mathematical expectation.And then,an immune based partheno-genetic algorithm was proposed by making use of concepts and principles introduced from immune system and genetic system in nature.In this method,processing se- quence of products could be expressed by the character encoding and each antibody represents a feasible schedule.Affinity was used to measure the matching degree between antibody and antigen.Then several antibodies producing operators,such as swopping,mov- ing,inverting,etc,were worked out.This algorithm was combined with evolution function of the genetic algorithm and density mechanism in organisms immune system.Promotion and inhibition of antibodies were realized by expected propagation ratio of an- tibodies,and in this way,premature convergence was improved.The simulation proved that this algorithm is effective.展开更多
A new genetic algorithm for community detection in complex networks was proposed. It adopts matrix encoding that enables traditional crossover between individuals. Initial populations are generated using nodes similar...A new genetic algorithm for community detection in complex networks was proposed. It adopts matrix encoding that enables traditional crossover between individuals. Initial populations are generated using nodes similarity, which enhances the diversity of initial individuals while retaining an acceptable level of accuracy, and improves the efficiency of optimal solution search. Individual crossover is based on the quality of individuals' genes; all nodes unassigned to any community are grouped into a new community, while ambiguously placed nodes are assigned to the community to which most of their neighbors belong. Individual mutation, which splits a gene into two new genes or randomly fuses it into other genes, is non-uniform. The simplicity and effectiveness of the algorithm are revealed in experimental tests using artificial random networks and real networks. The accuracy of the algorithm is superior to that of some classic algorithms, and is comparable to that of some recent high-precision algorithms.展开更多
Aiming at the disadvantages of BP model in artificial neural networks applied to intelligent fault diagnosis, neural network fault diagnosis optimization method with rough sets and genetic algorithms are presented. Th...Aiming at the disadvantages of BP model in artificial neural networks applied to intelligent fault diagnosis, neural network fault diagnosis optimization method with rough sets and genetic algorithms are presented. The neural network nodes of the input layer can be calculated and simplified through rough sets theory; The neural network nodes of the middle layer are designed through genetic algorithms training; the neural network bottom-up weights and bias are obtained finally through the combination of genetic algorithms and BP algorithms. The analysis in this paper illustrates that the optimization method can improve the performance of the neural network fault diagnosis method greatly.展开更多
Pilot plays an essential role in a duplex communication system.Several methods have been proposed for pilot assignment over specific scenarios.With the help of permutation encoding,we implemented a genetic algorithm f...Pilot plays an essential role in a duplex communication system.Several methods have been proposed for pilot assignment over specific scenarios.With the help of permutation encoding,we implemented a genetic algorithm for optimizing pilot assignment in a multi-user massive multiple input multiple output(MIMO)system.Results show improvement on existing results especially in the case of strong user estimation rates.展开更多
In order to share multimedia transmissions in mesh networks and optimize the utilization of network resources, this paper presents a Two-stage Evolutionary Algorithm (TEA), i.e., unicast routing evolution and multicas...In order to share multimedia transmissions in mesh networks and optimize the utilization of network resources, this paper presents a Two-stage Evolutionary Algorithm (TEA), i.e., unicast routing evolution and multicast path composition, for dynamic multicast routing. The TEA uses a novel link-duplicate-degree encoding, which can encode a multicast path in the link-duplicate-degree and decode the path as a link vector easily. A dynamic algorithm for adding nodes to or removing nodes from a multicast group and a repairing algorithm are also covered in this paper. As the TEA is based on global evaluation, the quality of the multicast path remains stabilized without degradation when multicast members change over time. Therefore, it is not necessary to rearrange the multicast path during the life cycle of the multicast sessions. Simulation results show that the TEA is efficient and convergent.展开更多
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 effectivenes...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.展开更多
Unit commitment(UC), as a typical optimization problem in electric power system, faces new challenges as energy saving and emission reduction get more and more important in the way to a more environmentally friendly s...Unit commitment(UC), as a typical optimization problem in electric power system, faces new challenges as energy saving and emission reduction get more and more important in the way to a more environmentally friendly society. To meet these challenges, we propose a UC model considering energy saving and emission reduction. By using real-number coding method, swap-window and hill-climbing operators, we present an improved real-coded genetic algorithm(IRGA) for UC. Compared with other algorithms approach to the proposed UC problem, the IRGA solution shows an improvement in effectiveness and computational time.展开更多
基金This project is supported by Provincial Science Foundation of Hebei (No.01213553).
文摘An extended crowding genetic algorithm (ECGA) is introduced for solvingoptimal pump configuration problem, which was presented by T. Westerlund in 1994. This problem hasbeen found to be non-convex, and the objective function contained several local optima and globaloptimality could not be ensured by all the traditional MINLP optimization method. The concepts ofspecies conserving and composite encoding are introduced to crowding genetic algorithm (CGA) formaintain the diversity of population more effectively and coping with the continuous and/or discretevariables in MINLP problem. The solution of three-levels pump configuration got from DICOPT++software (OA algorithm) is also given. By comparing with the solutions obtained from DICOPT++, ECPmethod, and MIN-MIN method, the ECGA algorithm proved to be very effective in finding the globaloptimal solution of multi-levels pump configuration via using the problem-specific information.
文摘The uncertain duration of each job in each machine in flow shop problem was regarded as an independent random variable and was described by mathematical expectation.And then,an immune based partheno-genetic algorithm was proposed by making use of concepts and principles introduced from immune system and genetic system in nature.In this method,processing se- quence of products could be expressed by the character encoding and each antibody represents a feasible schedule.Affinity was used to measure the matching degree between antibody and antigen.Then several antibodies producing operators,such as swopping,mov- ing,inverting,etc,were worked out.This algorithm was combined with evolution function of the genetic algorithm and density mechanism in organisms immune system.Promotion and inhibition of antibodies were realized by expected propagation ratio of an- tibodies,and in this way,premature convergence was improved.The simulation proved that this algorithm is effective.
文摘A new genetic algorithm for community detection in complex networks was proposed. It adopts matrix encoding that enables traditional crossover between individuals. Initial populations are generated using nodes similarity, which enhances the diversity of initial individuals while retaining an acceptable level of accuracy, and improves the efficiency of optimal solution search. Individual crossover is based on the quality of individuals' genes; all nodes unassigned to any community are grouped into a new community, while ambiguously placed nodes are assigned to the community to which most of their neighbors belong. Individual mutation, which splits a gene into two new genes or randomly fuses it into other genes, is non-uniform. The simplicity and effectiveness of the algorithm are revealed in experimental tests using artificial random networks and real networks. The accuracy of the algorithm is superior to that of some classic algorithms, and is comparable to that of some recent high-precision algorithms.
文摘Aiming at the disadvantages of BP model in artificial neural networks applied to intelligent fault diagnosis, neural network fault diagnosis optimization method with rough sets and genetic algorithms are presented. The neural network nodes of the input layer can be calculated and simplified through rough sets theory; The neural network nodes of the middle layer are designed through genetic algorithms training; the neural network bottom-up weights and bias are obtained finally through the combination of genetic algorithms and BP algorithms. The analysis in this paper illustrates that the optimization method can improve the performance of the neural network fault diagnosis method greatly.
文摘Pilot plays an essential role in a duplex communication system.Several methods have been proposed for pilot assignment over specific scenarios.With the help of permutation encoding,we implemented a genetic algorithm for optimizing pilot assignment in a multi-user massive multiple input multiple output(MIMO)system.Results show improvement on existing results especially in the case of strong user estimation rates.
文摘In order to share multimedia transmissions in mesh networks and optimize the utilization of network resources, this paper presents a Two-stage Evolutionary Algorithm (TEA), i.e., unicast routing evolution and multicast path composition, for dynamic multicast routing. The TEA uses a novel link-duplicate-degree encoding, which can encode a multicast path in the link-duplicate-degree and decode the path as a link vector easily. A dynamic algorithm for adding nodes to or removing nodes from a multicast group and a repairing algorithm are also covered in this paper. As the TEA is based on global evaluation, the quality of the multicast path remains stabilized without degradation when multicast members change over time. Therefore, it is not necessary to rearrange the multicast path during the life cycle of the multicast sessions. Simulation results show that the TEA is efficient and convergent.
基金supported by the Technology Innovation Program of the Korea Evaluation Institute of Industrial Technology (KEIT)under the Ministry of Trade,Industry and Energy (MOTIE)of Republic of Korea (20012121)by the National Research Foundation of Korea (NRF)grant funded by the Korea government (MSIT) (2022M3J7A106294)。
文摘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.
基金the National Natural Science Foundation of China(Nos.61004088 and 61374160)
文摘Unit commitment(UC), as a typical optimization problem in electric power system, faces new challenges as energy saving and emission reduction get more and more important in the way to a more environmentally friendly society. To meet these challenges, we propose a UC model considering energy saving and emission reduction. By using real-number coding method, swap-window and hill-climbing operators, we present an improved real-coded genetic algorithm(IRGA) for UC. Compared with other algorithms approach to the proposed UC problem, the IRGA solution shows an improvement in effectiveness and computational time.
