Reducing the vulnerability of a platform,i.e.,the risk of being affected by hostile objects,is of paramount importance in the design process of vehicles,especially aircraft.A simple and effective way to decrease vulne...Reducing the vulnerability of a platform,i.e.,the risk of being affected by hostile objects,is of paramount importance in the design process of vehicles,especially aircraft.A simple and effective way to decrease vulnerability is to introduce protective structures to intercept and possibly stop threats.However,this type of solution can lead to a significant increase in weight,affecting the performance of the aircraft.For this reason,it is crucial to study possible solutions that allow reducing the vulnerability of the aircraft while containing the increase in structural weight.One possible strategy is to optimize the topology of protective solutions to find the optimal balance between vulnerability and the weight of the added structures.Among the many optimization techniques available in the literature for this purpose,multiobjective genetic algorithms stand out as promising tools.In this context,this work proposes the use of a in-house software for vulnerability calculation to guide the process of topology optimization through multi-objective genetic algorithms,aiming to simultaneously minimize the weight of protective structures and vulnerability.In addition to the use of the in-house software,which itself represents a novelty in the field of topology optimization of structures,the method incorporates a custom mutation function within the genetic algorithm,specifically developed using a graph-based approach to ensure the continuity of the generated structures.The tool developed for this work is capable of generating protections with optimized layouts considering two different types of impacting objects,namely bullets and fragments from detonating objects.The software outputs a set of non-dominated solutions describing different topologies that the user can choose from.展开更多
The belief rule-based(BRB)system has been popular in complexity system modeling due to its good interpretability.However,the current mainstream optimization methods of the BRB systems only focus on modeling accuracy b...The belief rule-based(BRB)system has been popular in complexity system modeling due to its good interpretability.However,the current mainstream optimization methods of the BRB systems only focus on modeling accuracy but ignore the interpretability.The single-objective optimization strategy has been applied in the interpretability-accuracy trade-off by inte-grating accuracy and interpretability into an optimization objec-tive.But the integration has a greater impact on optimization results with strong subjectivity.Thus,a multi-objective optimiza-tion framework in the modeling of BRB systems with inter-pretability-accuracy trade-off is proposed in this paper.Firstly,complexity and accuracy are taken as two independent opti-mization goals,and uniformity as a constraint to give the mathe-matical description.Secondly,a classical multi-objective opti-mization algorithm,nondominated sorting genetic algorithm II(NSGA-II),is utilized as an optimization tool to give a set of BRB systems with different accuracy and complexity.Finally,a pipeline leakage detection case is studied to verify the feasibility and effectiveness of the developed multi-objective optimization.The comparison illustrates that the proposed multi-objective optimization framework can effectively avoid the subjectivity of single-objective optimization,and has capability of joint optimiz-ing the structure and parameters of BRB systems with inter-pretability-accuracy trade-off.展开更多
By combing the properties of chaos optimization method and genetic algorithm,an adaptive mutative scale chaos genetic algorithm(AMSCGA) was proposed by using one-dimensional iterative chaotic self-map with infinite co...By combing the properties of chaos optimization method and genetic algorithm,an adaptive mutative scale chaos genetic algorithm(AMSCGA) was proposed by using one-dimensional iterative chaotic self-map with infinite collapses within the finite region of [-1,1].Some measures in the optimization algorithm,such as adjusting the searching space of optimized variables continuously by using adaptive mutative scale method and making the most circle time as its control guideline,were taken to ensure its speediness and veracity in seeking the optimization process.The calculation examples about three testing functions reveal that AMSCGA has both high searching speed and high precision.Furthermore,the average truncated generations,the distribution entropy of truncated generations and the ratio of average inertia generations were used to evaluate the optimization efficiency of AMSCGA quantificationally.It is shown that the optimization efficiency of AMSCGA is higher than that of genetic algorithm.展开更多
In order to prevent standard genetic algorithm (SGA) from being premature, chaos is introduced into GA, thus forming chaotic anneal genetic algorithm (CAGA). Chaos ergodicity is used to initialize the population, and ...In order to prevent standard genetic algorithm (SGA) from being premature, chaos is introduced into GA, thus forming chaotic anneal genetic algorithm (CAGA). Chaos ergodicity is used to initialize the population, and chaotic anneal mutation operator is used as the substitute for the mutation operator in SGA. CAGA is a unified framework of the existing chaotic mutation methods. To validate the proposed algorithm, three algorithms, i. e. Baum-Welch, SGA and CAGA, are compared on training hidden Markov model (HMM) to recognize the hand gestures. Experiments on twenty-six alphabetical gestures show the CAGA validity.展开更多
As the huge computation and easily trapped local optimum in remanufacturing closed-loop supply chain network (RCSCN) design considered, a genetic particle swarm optimization algorithm was proposed. The total cost of c...As the huge computation and easily trapped local optimum in remanufacturing closed-loop supply chain network (RCSCN) design considered, a genetic particle swarm optimization algorithm was proposed. The total cost of closed-loop supply chain was selected as fitness function, and a unique and tidy coding mode was adopted in the proposed algorithm. Then, some mutation and crossover operators were introduced to achieve discrete optimization of RCSCN structure. The simulation results show that the proposed algorithm can gain global optimal solution with good convergent performance and rapidity. The computing speed is only 22.16 s, which is shorter than those of the other optimization algorithms.展开更多
In a manufacturing industry, mixed model assembly line(MMAL) is preferred in order to meet the variety in product demand. MMAL balancing helps in assembling products with similar characteristics in a random fashion. T...In a manufacturing industry, mixed model assembly line(MMAL) is preferred in order to meet the variety in product demand. MMAL balancing helps in assembling products with similar characteristics in a random fashion. The objective of this work aims in reducing the number of workstations, work load index between stations and within each station. As manual contribution of workers in final assembly line is more, ergonomics is taken as an additional objective function. Ergonomic risk level of a workstation is evaluated using a parameter called accumulated risk posture(ARP), which is calculated using rapid upper limb assessment(RULA) check sheet. This work is based on the case study of an MMAL problem in Rane(Madras) Ltd.(India), in which a problem based genetic algorithm(GA) has been proposed to minimize the mentioned objectives. The working of the genetic operators such as selection, crossover and mutation has been modified with respect to the addressed MMAL problem. The results show that there is a significant impact over productivity and the process time of the final assembled product, i.e., the rate of production is increased by 39.5% and the assembly time for one particular model is reduced to 13 min from existing 18 min. Also, the space required using the proposed assembly line is only 200 m2 against existing 350 m2. Further, the algorithm helps in reducing workers fatigue(i.e., ergonomic friendly).展开更多
This study presents analysis, control and comparison of three hybrid approaches for the direct torque control (DTC) of the dual star induction motor (DSIM) drive. Its objective consists of combining three different he...This study presents analysis, control and comparison of three hybrid approaches for the direct torque control (DTC) of the dual star induction motor (DSIM) drive. Its objective consists of combining three different heuristic optimization techniques including PID-PSO, Fuzzy-PSO and GA-PSO to improve the DSIM speed controlled loop behavior. The GA and PSO algorithms are developed and implemented into MATLAB. As a result, fuzzy-PSO is the most appropriate scheme. The main performance of fuzzy-PSO is reducing high torque ripples, improving rise time and avoiding disturbances that affect the drive performance.展开更多
Aiming at the demand for optimization of hydrodynamic coefficients in submarine's motion equations,an adaptive weight immune genetic algorithm was proposed to optimize hydrodynamic coefficients in motion equations...Aiming at the demand for optimization of hydrodynamic coefficients in submarine's motion equations,an adaptive weight immune genetic algorithm was proposed to optimize hydrodynamic coefficients in motion equations.Some hydrodynamic coefficients of high sensitivity to control and maneuver were chosen as the optimization objects in the algorithm.By using adaptive weight method to determine the weight and target function,the multi-objective optimization could be translated into single-objective optimization.For a certain kind of submarine,three typical maneuvers were chosen to be the objects of study:overshoot maneuver in horizontal plane,overshoot maneuver in vertical plane and turning circle maneuver in horizontal plane.From the results of computer simulations using primal hydrodynamic coefficient and optimized hydrodynamic coefficient,the efficiency of proposed method is proved.展开更多
The vehicle model of the recirculating ball-type electric power steering (EPS) system for the pure electric bus was built. According to the features of constrained optimization for multi-variable function, a multi-obj...The vehicle model of the recirculating ball-type electric power steering (EPS) system for the pure electric bus was built. According to the features of constrained optimization for multi-variable function, a multi-objective genetic algorithm (GA) was designed. Based on the model of system, the quantitative formula of the road feel, sensitivity, and operation stability of the steering were induced. Considering the road feel and sensitivity of steering as optimization objectives, and the operation stability of steering as constraint, the multi-objective GA was proposed and the system parameters were optimized. The simulation results show that the system optimized by multi-objective genetic algorithm has better road feel, steering sensibility and steering stability. The energy of steering road feel after optimization is 1.44 times larger than the one before optimization, and the energy of portability after optimization is 0.4 times larger than the one before optimization. The ground test was conducted in order to verify the feasibility of simulation results, and it is shown that the pure electric bus equipped with the recirculating ball-type EPS system can provide better road feel and better steering portability for the drivers, thus the optimization methods can provide a theoretical basis for the design and optimization of the recirculating ball-type EPS system.展开更多
Considering premature convergence in the searching process of genetic algorithm, a chaotic migration-based pseudo parallel genetic algorithm (CMPPGA) is proposed, which applies the idea of isolated evolution and infor...Considering premature convergence in the searching process of genetic algorithm, a chaotic migration-based pseudo parallel genetic algorithm (CMPPGA) is proposed, which applies the idea of isolated evolution and information exchanging in distributed Parallel Genetic Algorithm by serial program structure to solve optimization problem of low real-time demand. In this algorithm, asynchronic migration of individuals during parallel evolution is guided by a chaotic migration sequence. Information exchanging among sub-populations is ensured to be efficient and sufficient due to that the sequence is ergodic and stochastic. Simulation study of CMPPGA shows its strong global search ability, superiority to standard genetic algorithm and high immunity against premature convergence. According to the practice of raw material supply, an inventory programming model is set up and solved by CMPPGA with satisfactory results returned.展开更多
A novel immune genetic algorithm with the elitist selection and elitist crossover was proposed, which is called the immune genetic algorithm with the elitism （IGAE）. In IGAE, the new methods for computing antibody s...A novel immune genetic algorithm with the elitist selection and elitist crossover was proposed, which is called the immune genetic algorithm with the elitism （IGAE）. In IGAE, the new methods for computing antibody similarity, expected reproduction probability, and clonal selection probability were given. IGAE has three features. The first is that the similarities of two antibodies in structure and quality are all defined in the form of percentage, which helps to describe the similarity of two antibodies more accurately and to reduce the computational burden effectively. The second is that with the elitist selection and elitist crossover strategy IGAE is able to find the globally optimal solution of a given problem. The third is that the formula of expected reproduction probability of antibody can be adjusted through a parameter r, which helps to balance the population diversity and the convergence speed of IGAE so that IGAE can find the globally optimal solution of a given problem more rapidly. Two different complex multi-modal functions were selected to test the validity of IGAE. The experimental results show that IGAE can find the globally maximum/minimum values of the two functions rapidly. The experimental results also confirm that IGAE is of better performance in convergence speed, solution variation behavior, and computational efficiency compared with the canonical genetic algorithm with the elitism and the immune genetic algorithm with the information entropy and elitism.展开更多
Enlightened by distribution of creatures in natural ecology environment, the distributionpopulation-based genetic algorithm (DPGA) is presented in this paper. The searching capability ofthe algorithm is improved by co...Enlightened by distribution of creatures in natural ecology environment, the distributionpopulation-based genetic algorithm (DPGA) is presented in this paper. The searching capability ofthe algorithm is improved by competition between distribution populations to reduce the search zone.This method is applied to design of optimal parameters of PID controllers with examples, and thesimulation results show that satisfactory performances are obtained.展开更多
An adaptive immune-genetic algorithm （AIGA） is proposed to avoid premature convergence and guarantee the diversity of the population. Rapid immune response （secondary response）, adaptive mutation and density opera...An adaptive immune-genetic algorithm （AIGA） is proposed to avoid premature convergence and guarantee the diversity of the population. Rapid immune response （secondary response）, adaptive mutation and density operators in the AIGA are emphatically designed to improve the searching ability, greatly increase the converging speed, and decrease locating the local maxima due to the premature convergence. The simulation results obtained from the global optimization to four multivariable and multi-extreme functions show that AIGA converges rapidly, guarantees the diversity, stability and good searching ability.展开更多
As a major mode choice of commuters for daily travel, bus transit plays an important role in many urban and metropolitan areas. This work proposes a mathematical model to optimize bus service by minimizing total cost ...As a major mode choice of commuters for daily travel, bus transit plays an important role in many urban and metropolitan areas. This work proposes a mathematical model to optimize bus service by minimizing total cost and considering a temporally and directionally variable demand. An integrated bus service, consisting of all-stop and stop-skipping services is proposed and optimized subject to directional frequency conservation, capacity and operable fleet size constraints. Since the research problem is a combinatorial optimization problem, a genetic algorithm is developed to search for the optimal result in a large solution space. The model was successfully implemented on a bus transit route in the City of Chengdu, China, and the optimal solution was proved to be better than the original operation in terms of total cost. The sensitivity of model parameters to some key attributes/variables is analyzed and discussed to explore further the potential of accruing additional benefits or avoiding some of the drawbacks of stop-skipping services.展开更多
It is significant to combine multiple tasks into an optimal work package in decision-making of aircraft maintenance to reduce cost,so a cost rate model of combinatorial maintenance is an urgent need.However,the optima...It is significant to combine multiple tasks into an optimal work package in decision-making of aircraft maintenance to reduce cost,so a cost rate model of combinatorial maintenance is an urgent need.However,the optimal combination under various constraints not only involves numerical calculations but also is an NP-hard combinatorial problem.To solve the problem,an adaptive genetic algorithm based on cluster search,which is divided into two phases,is put forward.In the first phase,according to the density,all individuals can be homogeneously scattered over the whole solution space through crossover and mutation and better individuals are collected as candidate cluster centres.In the second phase,the search is confined to the neighbourhood of some selected possible solutions to accurately solve with cluster radius decreasing slowly,meanwhile all clusters continuously move to better regions until all the peaks in the question space is searched.This algorithm can efficiently solve the combination problem.Taking the optimization on decision-making of aircraft maintenance by the algorithm for an example,maintenance which combines multiple parts or tasks can significantly enhance economic benefit when the halt cost is rather high.展开更多
A quality of service （QoS） or constraint-based routing selection needs to find a path subject to multiple constraints through a network. The problem of finding such a path is known as the multi-constrained path （MC...A quality of service （QoS） or constraint-based routing selection needs to find a path subject to multiple constraints through a network. The problem of finding such a path is known as the multi-constrained path （MCP） problem, and has been proven to be NP-complete that cannot be exactly solved in a polynomial time. The NPC problem is converted into a multiobjective optimization problem with constraints to be solved with a genetic algorithm. Based on the Pareto optimum, a constrained routing computation method is proposed to generate a set of nondominated optimal routes with the genetic algorithm mechanism. The convergence and time complexity of the novel algorithm is analyzed. Experimental results show that multiobjective evolution is highly responsive and competent for the Pareto optimum-based route selection. When this method is applied to a MPLS and metropolitan-area network, it will be capable of optimizing the transmission performance.展开更多
A new searching algorithm named the annealing-genetic algorithm(AGA) was proposed by skillfully merging GA with SAA. It draws on merits of both GA and SAA ,and offsets their shortcomings.The difference from GA is that...A new searching algorithm named the annealing-genetic algorithm(AGA) was proposed by skillfully merging GA with SAA. It draws on merits of both GA and SAA ,and offsets their shortcomings.The difference from GA is that AGA takes objective function as adaptability function directly,so it cuts down some unnecessary time expense because of float-point calculation of function conversion.The difference from SAA is that AGA need not execute a very long Markov chain iteration at each point of temperature, so it speeds up the convergence of solution and makes no assumption on the search space,so it is simple and easy to be implemented.It can be applied to a wide class of problems.The optimizing principle and the implementing steps of AGA were expounded. The example of the parameter optimization of a typical complex electromechanical system named temper mill shows that AGA is effective and superior to the conventional GA and SAA.The control system of temper mill optimized by AGA has the optimal performance in the adjustable ranges of its parameters.展开更多
The direct torque control of the dual star induction motor(DTC-DSIM) using conventional PI controllers is characterized by unsatisfactory performance, such as high ripples of torque and flux, and sensitivity to parame...The direct torque control of the dual star induction motor(DTC-DSIM) using conventional PI controllers is characterized by unsatisfactory performance, such as high ripples of torque and flux, and sensitivity to parametric variations. Among the most evoked control strategies adopted in this field to overcome these drawbacks presented in classical drive, it is worth mentioning the use of the second order sliding mode control(SOSMC) based on the super twisting algorithm(STA) combined with the fuzzy logic control(FSOSMC). In order to realize the optimal control performance, the FSOSMC parameters are adjusted using an optimization algorithm based on the genetic algorithm(GA). The performances of the envisaged control scheme, called G-FSOSMC, are investigated against G-SOSMC, G-PI and BBO-FSOSMC algorithms. The proposed controller scheme is efficient in reducing the torque and flux ripples, and successfully suppresses chattering. The effects of parametric uncertainties do not affect system performance.展开更多
In rough communication, because each agent has a different language and can not provide precise communication to each other, the concept translated among multi-agents will loss some information, and this results in a ...In rough communication, because each agent has a different language and can not provide precise communication to each other, the concept translated among multi-agents will loss some information, and this results in a less or rougher concept. With different translation sequences the amount of the missed knowledge is varied. The λ-optimal translation sequence of rough communication, which concerns both every agent and the last agent taking part in rough communication to get information as much as he （or she） can, is given. In order to get the λ-optimal translation sequence, a genetic algorithm is used. Analysis and simulation of the algorithm demonstrate the effectiveness of the approach.展开更多
Project construction and development are an impor-tant part of future army designs.In today’s world,intelligent war-fare and joint operations have become the dominant develop-ments in warfare,so the construction and ...Project construction and development are an impor-tant part of future army designs.In today’s world,intelligent war-fare and joint operations have become the dominant develop-ments in warfare,so the construction and development of the army need top-down,top-level design,and comprehensive plan-ning.The traditional project development model is no longer suf-ficient to meet the army’s complex capability requirements.Projects in various fields need to be developed and coordinated to form a joint force and improve the army’s combat effective-ness.At the same time,when a program consists of large-scale project data,the effectiveness of the traditional,precise mathe-matical planning method is greatly reduced because it is time-consuming,costly,and impractical.To solve above problems,this paper proposes a multi-stage program optimization model based on a heterogeneous network and hybrid genetic algo-rithm and verifies the effectiveness and feasibility of the model and algorithm through an example.The results show that the hybrid algorithm proposed in this paper is better than the exist-ing meta-heuristic algorithm.展开更多
文摘Reducing the vulnerability of a platform,i.e.,the risk of being affected by hostile objects,is of paramount importance in the design process of vehicles,especially aircraft.A simple and effective way to decrease vulnerability is to introduce protective structures to intercept and possibly stop threats.However,this type of solution can lead to a significant increase in weight,affecting the performance of the aircraft.For this reason,it is crucial to study possible solutions that allow reducing the vulnerability of the aircraft while containing the increase in structural weight.One possible strategy is to optimize the topology of protective solutions to find the optimal balance between vulnerability and the weight of the added structures.Among the many optimization techniques available in the literature for this purpose,multiobjective genetic algorithms stand out as promising tools.In this context,this work proposes the use of a in-house software for vulnerability calculation to guide the process of topology optimization through multi-objective genetic algorithms,aiming to simultaneously minimize the weight of protective structures and vulnerability.In addition to the use of the in-house software,which itself represents a novelty in the field of topology optimization of structures,the method incorporates a custom mutation function within the genetic algorithm,specifically developed using a graph-based approach to ensure the continuity of the generated structures.The tool developed for this work is capable of generating protections with optimized layouts considering two different types of impacting objects,namely bullets and fragments from detonating objects.The software outputs a set of non-dominated solutions describing different topologies that the user can choose from.
基金supported by the National Natural Science Foundation of China(71901212)the Science and Technology Innovation Program of Hunan Province(2020RC4046).
文摘The belief rule-based(BRB)system has been popular in complexity system modeling due to its good interpretability.However,the current mainstream optimization methods of the BRB systems only focus on modeling accuracy but ignore the interpretability.The single-objective optimization strategy has been applied in the interpretability-accuracy trade-off by inte-grating accuracy and interpretability into an optimization objec-tive.But the integration has a greater impact on optimization results with strong subjectivity.Thus,a multi-objective optimiza-tion framework in the modeling of BRB systems with inter-pretability-accuracy trade-off is proposed in this paper.Firstly,complexity and accuracy are taken as two independent opti-mization goals,and uniformity as a constraint to give the mathe-matical description.Secondly,a classical multi-objective opti-mization algorithm,nondominated sorting genetic algorithm II(NSGA-II),is utilized as an optimization tool to give a set of BRB systems with different accuracy and complexity.Finally,a pipeline leakage detection case is studied to verify the feasibility and effectiveness of the developed multi-objective optimization.The comparison illustrates that the proposed multi-objective optimization framework can effectively avoid the subjectivity of single-objective optimization,and has capability of joint optimiz-ing the structure and parameters of BRB systems with inter-pretability-accuracy trade-off.
基金Project(60874114) supported by the National Natural Science Foundation of China
文摘By combing the properties of chaos optimization method and genetic algorithm,an adaptive mutative scale chaos genetic algorithm(AMSCGA) was proposed by using one-dimensional iterative chaotic self-map with infinite collapses within the finite region of [-1,1].Some measures in the optimization algorithm,such as adjusting the searching space of optimized variables continuously by using adaptive mutative scale method and making the most circle time as its control guideline,were taken to ensure its speediness and veracity in seeking the optimization process.The calculation examples about three testing functions reveal that AMSCGA has both high searching speed and high precision.Furthermore,the average truncated generations,the distribution entropy of truncated generations and the ratio of average inertia generations were used to evaluate the optimization efficiency of AMSCGA quantificationally.It is shown that the optimization efficiency of AMSCGA is higher than that of genetic algorithm.
文摘In order to prevent standard genetic algorithm (SGA) from being premature, chaos is introduced into GA, thus forming chaotic anneal genetic algorithm (CAGA). Chaos ergodicity is used to initialize the population, and chaotic anneal mutation operator is used as the substitute for the mutation operator in SGA. CAGA is a unified framework of the existing chaotic mutation methods. To validate the proposed algorithm, three algorithms, i. e. Baum-Welch, SGA and CAGA, are compared on training hidden Markov model (HMM) to recognize the hand gestures. Experiments on twenty-six alphabetical gestures show the CAGA validity.
基金Project(2011ZK2030)supported by the Soft Science Research Plan of Hunan Province,ChinaProject(2010ZDB42)supported by the Social Science Foundation of Hunan Province,China+1 种基金Projects(09A048,11B070)supported by the Science Research Foundation of Education Bureau of Hunan Province,ChinaProjects(2010GK3036,2011FJ6049)supported by the Science and Technology Plan of Hunan Province,China
文摘As the huge computation and easily trapped local optimum in remanufacturing closed-loop supply chain network (RCSCN) design considered, a genetic particle swarm optimization algorithm was proposed. The total cost of closed-loop supply chain was selected as fitness function, and a unique and tidy coding mode was adopted in the proposed algorithm. Then, some mutation and crossover operators were introduced to achieve discrete optimization of RCSCN structure. The simulation results show that the proposed algorithm can gain global optimal solution with good convergent performance and rapidity. The computing speed is only 22.16 s, which is shorter than those of the other optimization algorithms.
基金support and help of many individuals in the SASTRA University
文摘In a manufacturing industry, mixed model assembly line(MMAL) is preferred in order to meet the variety in product demand. MMAL balancing helps in assembling products with similar characteristics in a random fashion. The objective of this work aims in reducing the number of workstations, work load index between stations and within each station. As manual contribution of workers in final assembly line is more, ergonomics is taken as an additional objective function. Ergonomic risk level of a workstation is evaluated using a parameter called accumulated risk posture(ARP), which is calculated using rapid upper limb assessment(RULA) check sheet. This work is based on the case study of an MMAL problem in Rane(Madras) Ltd.(India), in which a problem based genetic algorithm(GA) has been proposed to minimize the mentioned objectives. The working of the genetic operators such as selection, crossover and mutation has been modified with respect to the addressed MMAL problem. The results show that there is a significant impact over productivity and the process time of the final assembled product, i.e., the rate of production is increased by 39.5% and the assembly time for one particular model is reduced to 13 min from existing 18 min. Also, the space required using the proposed assembly line is only 200 m2 against existing 350 m2. Further, the algorithm helps in reducing workers fatigue(i.e., ergonomic friendly).
基金Project supported by Faculty of Technology,Department of Electrical Engineering,University of Batna,Algeria
文摘This study presents analysis, control and comparison of three hybrid approaches for the direct torque control (DTC) of the dual star induction motor (DSIM) drive. Its objective consists of combining three different heuristic optimization techniques including PID-PSO, Fuzzy-PSO and GA-PSO to improve the DSIM speed controlled loop behavior. The GA and PSO algorithms are developed and implemented into MATLAB. As a result, fuzzy-PSO is the most appropriate scheme. The main performance of fuzzy-PSO is reducing high torque ripples, improving rise time and avoiding disturbances that affect the drive performance.
文摘Aiming at the demand for optimization of hydrodynamic coefficients in submarine's motion equations,an adaptive weight immune genetic algorithm was proposed to optimize hydrodynamic coefficients in motion equations.Some hydrodynamic coefficients of high sensitivity to control and maneuver were chosen as the optimization objects in the algorithm.By using adaptive weight method to determine the weight and target function,the multi-objective optimization could be translated into single-objective optimization.For a certain kind of submarine,three typical maneuvers were chosen to be the objects of study:overshoot maneuver in horizontal plane,overshoot maneuver in vertical plane and turning circle maneuver in horizontal plane.From the results of computer simulations using primal hydrodynamic coefficient and optimized hydrodynamic coefficient,the efficiency of proposed method is proved.
基金Projects(51005115, 51005248) supported by the National Natural Science Foundation of ChinaProject(SKLMT-KFKT-201105)supported by the Visiting Scholar Foundation of State Key Laboratory of Mechanical Transmission in Chongqing University, ChinaProject(QC201101) supported by Visiting Scholar Foundation of the Automobile Engineering Key Laboratory of Jiangsu Province, China
文摘The vehicle model of the recirculating ball-type electric power steering (EPS) system for the pure electric bus was built. According to the features of constrained optimization for multi-variable function, a multi-objective genetic algorithm (GA) was designed. Based on the model of system, the quantitative formula of the road feel, sensitivity, and operation stability of the steering were induced. Considering the road feel and sensitivity of steering as optimization objectives, and the operation stability of steering as constraint, the multi-objective GA was proposed and the system parameters were optimized. The simulation results show that the system optimized by multi-objective genetic algorithm has better road feel, steering sensibility and steering stability. The energy of steering road feel after optimization is 1.44 times larger than the one before optimization, and the energy of portability after optimization is 0.4 times larger than the one before optimization. The ground test was conducted in order to verify the feasibility of simulation results, and it is shown that the pure electric bus equipped with the recirculating ball-type EPS system can provide better road feel and better steering portability for the drivers, thus the optimization methods can provide a theoretical basis for the design and optimization of the recirculating ball-type EPS system.
文摘Considering premature convergence in the searching process of genetic algorithm, a chaotic migration-based pseudo parallel genetic algorithm (CMPPGA) is proposed, which applies the idea of isolated evolution and information exchanging in distributed Parallel Genetic Algorithm by serial program structure to solve optimization problem of low real-time demand. In this algorithm, asynchronic migration of individuals during parallel evolution is guided by a chaotic migration sequence. Information exchanging among sub-populations is ensured to be efficient and sufficient due to that the sequence is ergodic and stochastic. Simulation study of CMPPGA shows its strong global search ability, superiority to standard genetic algorithm and high immunity against premature convergence. According to the practice of raw material supply, an inventory programming model is set up and solved by CMPPGA with satisfactory results returned.
基金Project(50275150) supported by the National Natural Science Foundation of ChinaProjects(20040533035, 20070533131) supported by the National Research Foundation for the Doctoral Program of Higher Education of China
文摘A novel immune genetic algorithm with the elitist selection and elitist crossover was proposed, which is called the immune genetic algorithm with the elitism （IGAE）. In IGAE, the new methods for computing antibody similarity, expected reproduction probability, and clonal selection probability were given. IGAE has three features. The first is that the similarities of two antibodies in structure and quality are all defined in the form of percentage, which helps to describe the similarity of two antibodies more accurately and to reduce the computational burden effectively. The second is that with the elitist selection and elitist crossover strategy IGAE is able to find the globally optimal solution of a given problem. The third is that the formula of expected reproduction probability of antibody can be adjusted through a parameter r, which helps to balance the population diversity and the convergence speed of IGAE so that IGAE can find the globally optimal solution of a given problem more rapidly. Two different complex multi-modal functions were selected to test the validity of IGAE. The experimental results show that IGAE can find the globally maximum/minimum values of the two functions rapidly. The experimental results also confirm that IGAE is of better performance in convergence speed, solution variation behavior, and computational efficiency compared with the canonical genetic algorithm with the elitism and the immune genetic algorithm with the information entropy and elitism.
文摘Enlightened by distribution of creatures in natural ecology environment, the distributionpopulation-based genetic algorithm (DPGA) is presented in this paper. The searching capability ofthe algorithm is improved by competition between distribution populations to reduce the search zone.This method is applied to design of optimal parameters of PID controllers with examples, and thesimulation results show that satisfactory performances are obtained.
基金the Research Fund for the Doctoral Program of Higher Education of China (20020008004).
文摘An adaptive immune-genetic algorithm （AIGA） is proposed to avoid premature convergence and guarantee the diversity of the population. Rapid immune response （secondary response）, adaptive mutation and density operators in the AIGA are emphatically designed to improve the searching ability, greatly increase the converging speed, and decrease locating the local maxima due to the premature convergence. The simulation results obtained from the global optimization to four multivariable and multi-extreme functions show that AIGA converges rapidly, guarantees the diversity, stability and good searching ability.
基金Project(B01B1203)supported by Sichuan Province Key Laboratory of Comprehensive Transportation,ChinaProject(SWJTU09BR141)supported by the Southwest Jiaotong University,China
文摘As a major mode choice of commuters for daily travel, bus transit plays an important role in many urban and metropolitan areas. This work proposes a mathematical model to optimize bus service by minimizing total cost and considering a temporally and directionally variable demand. An integrated bus service, consisting of all-stop and stop-skipping services is proposed and optimized subject to directional frequency conservation, capacity and operable fleet size constraints. Since the research problem is a combinatorial optimization problem, a genetic algorithm is developed to search for the optimal result in a large solution space. The model was successfully implemented on a bus transit route in the City of Chengdu, China, and the optimal solution was proved to be better than the original operation in terms of total cost. The sensitivity of model parameters to some key attributes/variables is analyzed and discussed to explore further the potential of accruing additional benefits or avoiding some of the drawbacks of stop-skipping services.
基金supported by the National Natural Science Foundation of China(6107901361079014+4 种基金61403198)the National Natural Science Funds and Civil Aviaiton Mutual Funds(U1533128U1233114)the Programs of Natural Science Foundation of China and China Civil Aviation Joint Fund(60939003)the Natural Science Foundation of Jiangsu Province in China(BK2011737)
文摘It is significant to combine multiple tasks into an optimal work package in decision-making of aircraft maintenance to reduce cost,so a cost rate model of combinatorial maintenance is an urgent need.However,the optimal combination under various constraints not only involves numerical calculations but also is an NP-hard combinatorial problem.To solve the problem,an adaptive genetic algorithm based on cluster search,which is divided into two phases,is put forward.In the first phase,according to the density,all individuals can be homogeneously scattered over the whole solution space through crossover and mutation and better individuals are collected as candidate cluster centres.In the second phase,the search is confined to the neighbourhood of some selected possible solutions to accurately solve with cluster radius decreasing slowly,meanwhile all clusters continuously move to better regions until all the peaks in the question space is searched.This algorithm can efficiently solve the combination problem.Taking the optimization on decision-making of aircraft maintenance by the algorithm for an example,maintenance which combines multiple parts or tasks can significantly enhance economic benefit when the halt cost is rather high.
基金the Natural Science Foundation of Anhui Province of China (050420212)the Excellent Youth Science and Technology Foundation of Anhui Province of China (04042069).
文摘A quality of service （QoS） or constraint-based routing selection needs to find a path subject to multiple constraints through a network. The problem of finding such a path is known as the multi-constrained path （MCP） problem, and has been proven to be NP-complete that cannot be exactly solved in a polynomial time. The NPC problem is converted into a multiobjective optimization problem with constraints to be solved with a genetic algorithm. Based on the Pareto optimum, a constrained routing computation method is proposed to generate a set of nondominated optimal routes with the genetic algorithm mechanism. The convergence and time complexity of the novel algorithm is analyzed. Experimental results show that multiobjective evolution is highly responsive and competent for the Pareto optimum-based route selection. When this method is applied to a MPLS and metropolitan-area network, it will be capable of optimizing the transmission performance.
文摘A new searching algorithm named the annealing-genetic algorithm(AGA) was proposed by skillfully merging GA with SAA. It draws on merits of both GA and SAA ,and offsets their shortcomings.The difference from GA is that AGA takes objective function as adaptability function directly,so it cuts down some unnecessary time expense because of float-point calculation of function conversion.The difference from SAA is that AGA need not execute a very long Markov chain iteration at each point of temperature, so it speeds up the convergence of solution and makes no assumption on the search space,so it is simple and easy to be implemented.It can be applied to a wide class of problems.The optimizing principle and the implementing steps of AGA were expounded. The example of the parameter optimization of a typical complex electromechanical system named temper mill shows that AGA is effective and superior to the conventional GA and SAA.The control system of temper mill optimized by AGA has the optimal performance in the adjustable ranges of its parameters.
基金Project supported by the LEB Research LaboratoryDepartment of Electrical Engineering,University of Batna 2, Algeria。
文摘The direct torque control of the dual star induction motor(DTC-DSIM) using conventional PI controllers is characterized by unsatisfactory performance, such as high ripples of torque and flux, and sensitivity to parametric variations. Among the most evoked control strategies adopted in this field to overcome these drawbacks presented in classical drive, it is worth mentioning the use of the second order sliding mode control(SOSMC) based on the super twisting algorithm(STA) combined with the fuzzy logic control(FSOSMC). In order to realize the optimal control performance, the FSOSMC parameters are adjusted using an optimization algorithm based on the genetic algorithm(GA). The performances of the envisaged control scheme, called G-FSOSMC, are investigated against G-SOSMC, G-PI and BBO-FSOSMC algorithms. The proposed controller scheme is efficient in reducing the torque and flux ripples, and successfully suppresses chattering. The effects of parametric uncertainties do not affect system performance.
基金supported by the National Natural Science Foundation of China(61070241)the Natural Science Foundation of Shandong Province(ZR2010FM035)+1 种基金the Science and Technology Foundation of University of Jinan(XKY1031XKY0808)
文摘In rough communication, because each agent has a different language and can not provide precise communication to each other, the concept translated among multi-agents will loss some information, and this results in a less or rougher concept. With different translation sequences the amount of the missed knowledge is varied. The λ-optimal translation sequence of rough communication, which concerns both every agent and the last agent taking part in rough communication to get information as much as he （or she） can, is given. In order to get the λ-optimal translation sequence, a genetic algorithm is used. Analysis and simulation of the algorithm demonstrate the effectiveness of the approach.
基金supported by the National Natural Science Foundation of China(724701189072431011).
文摘Project construction and development are an impor-tant part of future army designs.In today’s world,intelligent war-fare and joint operations have become the dominant develop-ments in warfare,so the construction and development of the army need top-down,top-level design,and comprehensive plan-ning.The traditional project development model is no longer suf-ficient to meet the army’s complex capability requirements.Projects in various fields need to be developed and coordinated to form a joint force and improve the army’s combat effective-ness.At the same time,when a program consists of large-scale project data,the effectiveness of the traditional,precise mathe-matical planning method is greatly reduced because it is time-consuming,costly,and impractical.To solve above problems,this paper proposes a multi-stage program optimization model based on a heterogeneous network and hybrid genetic algo-rithm and verifies the effectiveness and feasibility of the model and algorithm through an example.The results show that the hybrid algorithm proposed in this paper is better than the exist-ing meta-heuristic algorithm.
