Resource management in Underground Wireless Sensor Networks(UWSNs)is one of the pillars to extend the network lifetime.An intriguing design goal for such networks is to achieve balanced energy and spectral resource ut...Resource management in Underground Wireless Sensor Networks(UWSNs)is one of the pillars to extend the network lifetime.An intriguing design goal for such networks is to achieve balanced energy and spectral resource utilization.This paper focuses on optimizing the resource efficiency in UWSNs where underground relay nodes amplify and forward sensed data,received from the buried source nodes through a lossy soil medium,to the aboveground base station.A new algorithm called the Hybrid Chaotic Salp Swarm and Crossover(HCSSC)algorithm is proposed to obtain the optimal source and relay transmission powers to maximize the network resource efficiency.The proposed algorithm improves the standard Salp Swarm Algorithm(SSA)by considering a chaotic map to initialize the population along with performing the crossover technique in the position updates of salps.Through experimental results,the HCSSC algorithm proves its outstanding superiority to the standard SSA for resource efficiency optimization.Hence,the network’s lifetime is prolonged.Indeed,the proposed algorithm achieves an improvement performance of 23.6%and 20.4%for the resource efficiency and average remaining relay battery per transmission,respectively.Furthermore,simulation results demonstrate that the HCSSC algorithm proves its efficacy in the case of both equal and different node battery capacities.展开更多
The convergence of genetic algorithm is mainly determined by its core operation crossover operation. When the objective function is a multiple hump function, traditional genetic algorithms are easily trapped into loca...The convergence of genetic algorithm is mainly determined by its core operation crossover operation. When the objective function is a multiple hump function, traditional genetic algorithms are easily trapped into local optimum, which is called premature conver- gence. In this paper, we propose a new genetic algorithm with improved arithmetic crossover operation based on gradient method. This crossover operation can generate offspring along quasi-gradient direction which is the Steepest descent direction of the value of objective function. The selection operator is also simplified, every individual in the population is given an opportunity to get evolution to avoid complicated selection algorithm. The adaptive mutation operator and the elitist strategy are also applied in this algorithm. The case 4 indicates this algorithm can faster converge to the global optimum and is more stable than the conventional genetic algorithms.展开更多
Genetic algorithms have been extensively used as a global optimization tool. These algorithms, however, suffer from their generally slow convergence rates. This paper proposes two approaches to address this limitation...Genetic algorithms have been extensively used as a global optimization tool. These algorithms, however, suffer from their generally slow convergence rates. This paper proposes two approaches to address this limitation. First, a new crossover technique, the weighted average normally-distributed arithmetic crossover (NADX), is introduced to enhance the rate of convergence. Second, twinkling is incorporated within the crossover phase of the genetic algorithms. Twinkling is a controlled random deviation that allows only a subset of the design variables to undergo the decisions of an optimization algorithm while maintaining the remaining variable values. Two twinkling genetic algorithms are proposed. The proposed algorithmsare compared to simple genetic algorithms by using various mathematical and engineering design test problems. The results show that twinkling genetic algorithms have the ability to consistently reach known global minima, rather than nearby sub-optimal points, and are able to do this with competitive rates of convergence.展开更多
Genetic algorithms(GAs)are very good metaheuristic algorithms that are suitable for solving NP-hard combinatorial optimization problems.AsimpleGAbeginswith a set of solutions represented by a population of chromosomes...Genetic algorithms(GAs)are very good metaheuristic algorithms that are suitable for solving NP-hard combinatorial optimization problems.AsimpleGAbeginswith a set of solutions represented by a population of chromosomes and then uses the idea of survival of the fittest in the selection process to select some fitter chromosomes.It uses a crossover operator to create better offspring chromosomes and thus,converges the population.Also,it uses a mutation operator to explore the unexplored areas by the crossover operator,and thus,diversifies the GA search space.A combination of crossover and mutation operators makes the GA search strong enough to reach the optimal solution.However,appropriate selection and combination of crossover operator and mutation operator can lead to a very good GA for solving an optimization problem.In this present paper,we aim to study the benchmark traveling salesman problem(TSP).We developed several genetic algorithms using seven crossover operators and six mutation operators for the TSP and then compared them to some benchmark TSPLIB instances.The experimental studies show the effectiveness of the combination of a comprehensive sequential constructive crossover operator and insertion mutation operator for the problem.The GA using the comprehensive sequential constructive crossover with insertion mutation could find average solutions whose average percentage of excesses from the best-known solutions are between 0.22 and 14.94 for our experimented problem instances.展开更多
An iterated function system crossover (IFSX) operation for real-coded genetic algorithms (RCGAs) is presented in this paper. Iterated?function system (IFS) is one type of fractals that maintains a similarity character...An iterated function system crossover (IFSX) operation for real-coded genetic algorithms (RCGAs) is presented in this paper. Iterated?function system (IFS) is one type of fractals that maintains a similarity characteristic. By introducing the IFS into the crossover operation, the RCGA performs better searching solution with a faster convergence in a set of benchmark test functions.展开更多
The generalized travelling salesman problem(GTSP),a generalization of the well-known travelling salesman problem(TSP),is considered for our study.Since the GTSP is NP-hard and very complex,finding exact solutions is h...The generalized travelling salesman problem(GTSP),a generalization of the well-known travelling salesman problem(TSP),is considered for our study.Since the GTSP is NP-hard and very complex,finding exact solutions is highly expensive,we will develop genetic algorithms(GAs)to obtain heuristic solutions to the problem.In GAs,as the crossover is a very important process,the crossovermethods proposed for the traditional TSP could be adapted for the GTSP.The sequential constructive crossover(SCX)and three other operators are adapted to use in GAs to solve the GTSP.The effectiveness of GA using SCX is verified on some GTSP Library(GTSPLIB)instances first and then compared against GAs using the other crossover methods.The computational results show the success of the GA using SCX for this problem.Our proposed GA using SCX,and swap mutation could find average solutions whose average percentage of excesses fromthe best-known solutions is between 0.00 and 14.07 for our investigated instances.展开更多
Radio Cognitive (RC) is the new concept introduced to improve spectrum utilization in wireless communication and present important research field to resolve the spectrum scarcity problem. The powerful ability of CR to...Radio Cognitive (RC) is the new concept introduced to improve spectrum utilization in wireless communication and present important research field to resolve the spectrum scarcity problem. The powerful ability of CR to change and adapt its transmit parameters according to environmental sensed parameters, makes CR as the leading technology to manage spectrum allocation and respond to QoS provisioning. In this paper, we assume that the radio environment has been sensed and that the SU specifies QoS requirements of the wireless application. We use genetic algorithm (GA) and propose crossover method called Combined Single-Heuristic Crossover. The weighted sum multi-objective approach is used to combine performance objectives functions discussed in this paper and BER approximate formula is considered.展开更多
We study the capacitated vehicle routing problem(CVRP)which is a well-known NP-hard combinatorial optimization problem(COP).The aim of the problem is to serve different customers by a convoy of vehicles starting from ...We study the capacitated vehicle routing problem(CVRP)which is a well-known NP-hard combinatorial optimization problem(COP).The aim of the problem is to serve different customers by a convoy of vehicles starting from a depot so that sum of the routing costs under their capacity constraints is minimized.Since the problem is very complicated,solving the problem using exact methods is almost impossible.So,one has to go for the heuristic/metaheuristic methods and genetic algorithm(GA)is broadly applied metaheuristic method to obtain near optimal solution to such COPs.So,this paper studies GAs to find solution to the problem.Generally,to solve a COP,GAs start with a chromosome set named initial population,and then mainly three operators-selection,crossover andmutation,are applied.Among these three operators,crossover is very crucial in designing and implementing GAs,and hence,numerous crossover operators were developed and applied to different COPs.There are two major kinds of crossover operators-blind crossovers and distance-based crossovers.We intend to compare the performance of four blind crossover and four distance-based crossover operators to test the suitability of the operators to solve the CVRP.These operators were originally proposed for the standard travelling salesman problem(TSP).First,these eight crossovers are illustrated using same parent chromosomes for building offspring(s).Then eight GAs using these eight crossover operators without any mutation operator and another eight GAs using these eight crossover operators with a mutation operator are developed.These GAs are experimented on some benchmark asymmetric and symmetric instances of numerous sizes and various number of vehicles.Our study revealed that the distance-based crossovers are much superior to the blind crossovers.Further,we observed that the sequential constructive crossover with and without mutation operator is the best one for theCVRP.This estimation is validated by Student’s t-test at 95%confidence level.We further determined a comparative rank of the eight crossovers for the CVRP.展开更多
To improve performances of multi-objective optimization algorithms, such as convergence and diversity, a hybridization- encouraged mechanism is proposed and realized in elitist nondominated sorting genetic algorithm ...To improve performances of multi-objective optimization algorithms, such as convergence and diversity, a hybridization- encouraged mechanism is proposed and realized in elitist nondominated sorting genetic algorithm （NSGA-Ⅱ）. This mechanism uses the normalized distance to evaluate the difference among genes in a population. Three possible modes of crossover operators--＂Max Distance＂, ＂Min-Max Distance＂, and ＂Neighboring-Max＂--are suggested and analyzed. The mode of ＂Neighboring-Max＂, which not only takes advantage of hybridization but also improves the distribution of the population near Pareto optimal front, is chosen and used in NSGA-Ⅱ on the basis of hybridization-encouraged mechanism （short for HEM-based NSGA-Ⅱ）. To prove the HEM-based algorithm, several problems are studied by using standard NSGA-Ⅱ and the presented method. Different evaluation criteria are also used to judge these algorithms in terms of distribution of solutions, convergence, diversity, and quality of solutions. The numerical results indicate that the application of hybridization-encouraged mechanism could effectively improve the performances of genetic algorithm. Finally, as an example in engineering practices, the presented method is used to design a longitudinal flight control system, which demonstrates the obtainability of a reasonable and correct Pareto front.展开更多
As an optimization method that has experienced rapid development over the past 20 years, the genetic algorithm has been successfully applied in many fields, but it requires repeated searches based on the characteristi...As an optimization method that has experienced rapid development over the past 20 years, the genetic algorithm has been successfully applied in many fields, but it requires repeated searches based on the characteristics of high-speed computer calculation and conditions of the known relationship between the objective function and independent variables. There are several hundred generations of evolvement, but the functional relationship is unknown in pollution source searches. Therefore, the genetic algorithm cannot be used directly. Certain improvements need to be made based on the actual situation, so that the genetic algorithm can adapt to the actual conditions of environmental problems, and can be used in environmental monitoring and environmental quality assessment. Therefore, a series of methods are proposed for the improvement of the genetic algorithm： （1） the initial generation of individual groups should be artificially set and move from lightly polluted areas to heavily polluted areas; （2） intervention measures should be introduced in the competition between individuals; （3） guide individuals should be added; and （4） specific improvement programs should be put forward. Finally, the scientific rigor and rationality of the improved genetic algorithm are proven through an example.展开更多
In this paper, a hybrid genetic algorithm （GA） is proposed for the traveling salesman problem （TSP） with pickup and delivery （TSPPD）. In our algorithm, a novel pheromone-based crossover operator is advanced that...In this paper, a hybrid genetic algorithm （GA） is proposed for the traveling salesman problem （TSP） with pickup and delivery （TSPPD）. In our algorithm, a novel pheromone-based crossover operator is advanced that utilizes both local and global information to construct offspring. In addition, a local search procedure is integrated into the GA to accelerate convergence. The proposed GA has been tested on benchmark instances, and the computational results show that it gives better convergence than existing heuristics.展开更多
Data transmission among multicast trees is an efficient routing method in mobile ad hoc networks(MANETs). Genetic algorithms(GAs) have found widespread applications in designing multicast trees. This paper proposes a ...Data transmission among multicast trees is an efficient routing method in mobile ad hoc networks(MANETs). Genetic algorithms(GAs) have found widespread applications in designing multicast trees. This paper proposes a stable quality-of-service(QoS) multicast model for MANETs. The new model ensures the duration time of a link in a multicast tree is always longer than the delay time from the source node. A novel GA is designed to solve our QoS multicast model by introducing a new crossover mechanism called leaf crossover(LC), which outperforms the existing crossover mechanisms in requiring neither global network link information, additional encoding/decoding nor repair procedures. Experimental results confirm the effectiveness of the proposed model and the efficiency of the involved GA. Specifically, the simulation study indicates that our algorithm can obtain a better QoS route with a considerable reduction of execution time as compared with existing GAs.展开更多
There are defects such as the low convergence rate and premature phenomenon on the performance of simple genetic algorithms （SGA） as the values of crossover probability （Pc） and mutation probability （Pro） are fi...There are defects such as the low convergence rate and premature phenomenon on the performance of simple genetic algorithms （SGA） as the values of crossover probability （Pc） and mutation probability （Pro） are fixed. To solve the problems, the fuzzy control method and the genetic algorithms were systematically integrated to create a kind of improved fuzzy adaptive genetic algorithm （FAGA） based on the auto-regulating fuzzy rules （ARFR-FAGA）. By using the fuzzy control method, the values of Pc and Pm were adjusted according to the evolutional process, and the fuzzy rules were optimized by another genetic algorithm. Experimental results in solving the function optimization problems demonstrate that the convergence rate and solution quality of ARFR-FAGA exceed those of SGA, AGA and fuzzy adaptive genetic algorithm based on expertise （EFAGA） obviously in the global search.展开更多
A new genetic algorithm is proposed for the optimization problem of real-valued variable functions. A new robust and adaptive fitness scaling is presented by introducing the median of the population in exponential tra...A new genetic algorithm is proposed for the optimization problem of real-valued variable functions. A new robust and adaptive fitness scaling is presented by introducing the median of the population in exponential transformation. For float-point represented chromosomes, crossover and mutation operators are given. Convergence of the algorithm is proved. The performance is tested by two generally used functions. Hybrid algorithm which takes the BP algorithm as a mutation operator is used to train a neural network for image recognition. Experimental results show that the proposed algorithm is an efficient global optimization algorithm.展开更多
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.展开更多
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 ...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.展开更多
文摘Resource management in Underground Wireless Sensor Networks(UWSNs)is one of the pillars to extend the network lifetime.An intriguing design goal for such networks is to achieve balanced energy and spectral resource utilization.This paper focuses on optimizing the resource efficiency in UWSNs where underground relay nodes amplify and forward sensed data,received from the buried source nodes through a lossy soil medium,to the aboveground base station.A new algorithm called the Hybrid Chaotic Salp Swarm and Crossover(HCSSC)algorithm is proposed to obtain the optimal source and relay transmission powers to maximize the network resource efficiency.The proposed algorithm improves the standard Salp Swarm Algorithm(SSA)by considering a chaotic map to initialize the population along with performing the crossover technique in the position updates of salps.Through experimental results,the HCSSC algorithm proves its outstanding superiority to the standard SSA for resource efficiency optimization.Hence,the network’s lifetime is prolonged.Indeed,the proposed algorithm achieves an improvement performance of 23.6%and 20.4%for the resource efficiency and average remaining relay battery per transmission,respectively.Furthermore,simulation results demonstrate that the HCSSC algorithm proves its efficacy in the case of both equal and different node battery capacities.
文摘The convergence of genetic algorithm is mainly determined by its core operation crossover operation. When the objective function is a multiple hump function, traditional genetic algorithms are easily trapped into local optimum, which is called premature conver- gence. In this paper, we propose a new genetic algorithm with improved arithmetic crossover operation based on gradient method. This crossover operation can generate offspring along quasi-gradient direction which is the Steepest descent direction of the value of objective function. The selection operator is also simplified, every individual in the population is given an opportunity to get evolution to avoid complicated selection algorithm. The adaptive mutation operator and the elitist strategy are also applied in this algorithm. The case 4 indicates this algorithm can faster converge to the global optimum and is more stable than the conventional genetic algorithms.
文摘Genetic algorithms have been extensively used as a global optimization tool. These algorithms, however, suffer from their generally slow convergence rates. This paper proposes two approaches to address this limitation. First, a new crossover technique, the weighted average normally-distributed arithmetic crossover (NADX), is introduced to enhance the rate of convergence. Second, twinkling is incorporated within the crossover phase of the genetic algorithms. Twinkling is a controlled random deviation that allows only a subset of the design variables to undergo the decisions of an optimization algorithm while maintaining the remaining variable values. Two twinkling genetic algorithms are proposed. The proposed algorithmsare compared to simple genetic algorithms by using various mathematical and engineering design test problems. The results show that twinkling genetic algorithms have the ability to consistently reach known global minima, rather than nearby sub-optimal points, and are able to do this with competitive rates of convergence.
基金the Deanship of Scientific Research at Imam Mohammad Ibn Saud Islamic University(IMSIU)(Grant Number IMSIU-RP23030).
文摘Genetic algorithms(GAs)are very good metaheuristic algorithms that are suitable for solving NP-hard combinatorial optimization problems.AsimpleGAbeginswith a set of solutions represented by a population of chromosomes and then uses the idea of survival of the fittest in the selection process to select some fitter chromosomes.It uses a crossover operator to create better offspring chromosomes and thus,converges the population.Also,it uses a mutation operator to explore the unexplored areas by the crossover operator,and thus,diversifies the GA search space.A combination of crossover and mutation operators makes the GA search strong enough to reach the optimal solution.However,appropriate selection and combination of crossover operator and mutation operator can lead to a very good GA for solving an optimization problem.In this present paper,we aim to study the benchmark traveling salesman problem(TSP).We developed several genetic algorithms using seven crossover operators and six mutation operators for the TSP and then compared them to some benchmark TSPLIB instances.The experimental studies show the effectiveness of the combination of a comprehensive sequential constructive crossover operator and insertion mutation operator for the problem.The GA using the comprehensive sequential constructive crossover with insertion mutation could find average solutions whose average percentage of excesses from the best-known solutions are between 0.22 and 14.94 for our experimented problem instances.
文摘An iterated function system crossover (IFSX) operation for real-coded genetic algorithms (RCGAs) is presented in this paper. Iterated?function system (IFS) is one type of fractals that maintains a similarity characteristic. By introducing the IFS into the crossover operation, the RCGA performs better searching solution with a faster convergence in a set of benchmark test functions.
基金the Deanship of Scientific Research,Imam Mohammad Ibn Saud Islamic University(IMSIU),Saudi Arabia,for funding this research work through Grant No.(221412020).
文摘The generalized travelling salesman problem(GTSP),a generalization of the well-known travelling salesman problem(TSP),is considered for our study.Since the GTSP is NP-hard and very complex,finding exact solutions is highly expensive,we will develop genetic algorithms(GAs)to obtain heuristic solutions to the problem.In GAs,as the crossover is a very important process,the crossovermethods proposed for the traditional TSP could be adapted for the GTSP.The sequential constructive crossover(SCX)and three other operators are adapted to use in GAs to solve the GTSP.The effectiveness of GA using SCX is verified on some GTSP Library(GTSPLIB)instances first and then compared against GAs using the other crossover methods.The computational results show the success of the GA using SCX for this problem.Our proposed GA using SCX,and swap mutation could find average solutions whose average percentage of excesses fromthe best-known solutions is between 0.00 and 14.07 for our investigated instances.
文摘Radio Cognitive (RC) is the new concept introduced to improve spectrum utilization in wireless communication and present important research field to resolve the spectrum scarcity problem. The powerful ability of CR to change and adapt its transmit parameters according to environmental sensed parameters, makes CR as the leading technology to manage spectrum allocation and respond to QoS provisioning. In this paper, we assume that the radio environment has been sensed and that the SU specifies QoS requirements of the wireless application. We use genetic algorithm (GA) and propose crossover method called Combined Single-Heuristic Crossover. The weighted sum multi-objective approach is used to combine performance objectives functions discussed in this paper and BER approximate formula is considered.
基金the Deanship of Scientific Research at Imam Mohammad Ibn Saud Islamic University for funding thiswork through Research Group No.RG-21-09-17.
文摘We study the capacitated vehicle routing problem(CVRP)which is a well-known NP-hard combinatorial optimization problem(COP).The aim of the problem is to serve different customers by a convoy of vehicles starting from a depot so that sum of the routing costs under their capacity constraints is minimized.Since the problem is very complicated,solving the problem using exact methods is almost impossible.So,one has to go for the heuristic/metaheuristic methods and genetic algorithm(GA)is broadly applied metaheuristic method to obtain near optimal solution to such COPs.So,this paper studies GAs to find solution to the problem.Generally,to solve a COP,GAs start with a chromosome set named initial population,and then mainly three operators-selection,crossover andmutation,are applied.Among these three operators,crossover is very crucial in designing and implementing GAs,and hence,numerous crossover operators were developed and applied to different COPs.There are two major kinds of crossover operators-blind crossovers and distance-based crossovers.We intend to compare the performance of four blind crossover and four distance-based crossover operators to test the suitability of the operators to solve the CVRP.These operators were originally proposed for the standard travelling salesman problem(TSP).First,these eight crossovers are illustrated using same parent chromosomes for building offspring(s).Then eight GAs using these eight crossover operators without any mutation operator and another eight GAs using these eight crossover operators with a mutation operator are developed.These GAs are experimented on some benchmark asymmetric and symmetric instances of numerous sizes and various number of vehicles.Our study revealed that the distance-based crossovers are much superior to the blind crossovers.Further,we observed that the sequential constructive crossover with and without mutation operator is the best one for theCVRP.This estimation is validated by Student’s t-test at 95%confidence level.We further determined a comparative rank of the eight crossovers for the CVRP.
基金National Basic Research Program of China(5132004)
文摘To improve performances of multi-objective optimization algorithms, such as convergence and diversity, a hybridization- encouraged mechanism is proposed and realized in elitist nondominated sorting genetic algorithm （NSGA-Ⅱ）. This mechanism uses the normalized distance to evaluate the difference among genes in a population. Three possible modes of crossover operators--＂Max Distance＂, ＂Min-Max Distance＂, and ＂Neighboring-Max＂--are suggested and analyzed. The mode of ＂Neighboring-Max＂, which not only takes advantage of hybridization but also improves the distribution of the population near Pareto optimal front, is chosen and used in NSGA-Ⅱ on the basis of hybridization-encouraged mechanism （short for HEM-based NSGA-Ⅱ）. To prove the HEM-based algorithm, several problems are studied by using standard NSGA-Ⅱ and the presented method. Different evaluation criteria are also used to judge these algorithms in terms of distribution of solutions, convergence, diversity, and quality of solutions. The numerical results indicate that the application of hybridization-encouraged mechanism could effectively improve the performances of genetic algorithm. Finally, as an example in engineering practices, the presented method is used to design a longitudinal flight control system, which demonstrates the obtainability of a reasonable and correct Pareto front.
基金supported by the Science and Technology Support Program of Jiangsu Province(Grant No.BE2010738)Jiangsu Colleges and Universities Natural Science Foundation Funded Project(Grant No.08KJB620001)the Qing Lan Project of Jiangsu Province
文摘As an optimization method that has experienced rapid development over the past 20 years, the genetic algorithm has been successfully applied in many fields, but it requires repeated searches based on the characteristics of high-speed computer calculation and conditions of the known relationship between the objective function and independent variables. There are several hundred generations of evolvement, but the functional relationship is unknown in pollution source searches. Therefore, the genetic algorithm cannot be used directly. Certain improvements need to be made based on the actual situation, so that the genetic algorithm can adapt to the actual conditions of environmental problems, and can be used in environmental monitoring and environmental quality assessment. Therefore, a series of methods are proposed for the improvement of the genetic algorithm： （1） the initial generation of individual groups should be artificially set and move from lightly polluted areas to heavily polluted areas; （2） intervention measures should be introduced in the competition between individuals; （3） guide individuals should be added; and （4） specific improvement programs should be put forward. Finally, the scientific rigor and rationality of the improved genetic algorithm are proven through an example.
文摘In this paper, a hybrid genetic algorithm （GA） is proposed for the traveling salesman problem （TSP） with pickup and delivery （TSPPD）. In our algorithm, a novel pheromone-based crossover operator is advanced that utilizes both local and global information to construct offspring. In addition, a local search procedure is integrated into the GA to accelerate convergence. The proposed GA has been tested on benchmark instances, and the computational results show that it gives better convergence than existing heuristics.
基金supported in part by Supported by the National Natural Science Foundation of China (Grant No. 61370227)Research Foundation of Education Bureau of Hunan Province, China (Grant No. 17A070)
文摘Data transmission among multicast trees is an efficient routing method in mobile ad hoc networks(MANETs). Genetic algorithms(GAs) have found widespread applications in designing multicast trees. This paper proposes a stable quality-of-service(QoS) multicast model for MANETs. The new model ensures the duration time of a link in a multicast tree is always longer than the delay time from the source node. A novel GA is designed to solve our QoS multicast model by introducing a new crossover mechanism called leaf crossover(LC), which outperforms the existing crossover mechanisms in requiring neither global network link information, additional encoding/decoding nor repair procedures. Experimental results confirm the effectiveness of the proposed model and the efficiency of the involved GA. Specifically, the simulation study indicates that our algorithm can obtain a better QoS route with a considerable reduction of execution time as compared with existing GAs.
基金Project(60574030) supported by the National Natural Science Foundation of ChinaKey Project(60634020) supported by the National Natural Science Foundation of China
文摘There are defects such as the low convergence rate and premature phenomenon on the performance of simple genetic algorithms （SGA） as the values of crossover probability （Pc） and mutation probability （Pro） are fixed. To solve the problems, the fuzzy control method and the genetic algorithms were systematically integrated to create a kind of improved fuzzy adaptive genetic algorithm （FAGA） based on the auto-regulating fuzzy rules （ARFR-FAGA）. By using the fuzzy control method, the values of Pc and Pm were adjusted according to the evolutional process, and the fuzzy rules were optimized by another genetic algorithm. Experimental results in solving the function optimization problems demonstrate that the convergence rate and solution quality of ARFR-FAGA exceed those of SGA, AGA and fuzzy adaptive genetic algorithm based on expertise （EFAGA） obviously in the global search.
基金Supported by the National Natural Science Foundation
文摘A new genetic algorithm is proposed for the optimization problem of real-valued variable functions. A new robust and adaptive fitness scaling is presented by introducing the median of the population in exponential transformation. For float-point represented chromosomes, crossover and mutation operators are given. Convergence of the algorithm is proved. The performance is tested by two generally used functions. Hybrid algorithm which takes the BP algorithm as a mutation operator is used to train a neural network for image recognition. Experimental results show that the proposed algorithm is an efficient global optimization algorithm.
基金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.
基金in part supported by the Key Research and Development Project of Hubei Province(Nos.2020BAB1141,2023BAB094)the Key Project of Science and Technology Research ProgramofHubei Educational Committee(No.D20211402)+1 种基金the Teaching Research Project of Hubei University of Technology(No.XIAO2018001)the Project of Xiangyang Industrial Research Institute of Hubei University of Technology(No.XYYJ2022C04).
文摘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.
