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 flowshop scheduling problem is NP complete. To solve it by genetic algorithm, an efficient crossover operator is designed. Compared with another crossover operator, this one often finds a better solution within th...The flowshop scheduling problem is NP complete. To solve it by genetic algorithm, an efficient crossover operator is designed. Compared with another crossover operator, this one often finds a better solution within the same time.展开更多
Bilevel linear programming, which consists of the objective functions of the upper level and lower level, is a useful tool for modeling decentralized decision problems. Various methods are proposed for solving this pr...Bilevel linear programming, which consists of the objective functions of the upper level and lower level, is a useful tool for modeling decentralized decision problems. Various methods are proposed for solving this problem. Of all the algorithms, the ge- netic algorithm is an alternative to conventional approaches to find the solution of the bilevel linear programming. In this paper, we describe an adaptive genetic algorithm for solving the bilevel linear programming problem to overcome the difficulty of determining the probabilities of crossover and mutation. In addition, some techniques are adopted not only to deal with the difficulty that most of the chromosomes maybe infeasible in solving constrained optimization problem with genetic algorithm but also to improve the efficiency of the algorithm. The performance of this proposed algorithm is illustrated by the examples from references.展开更多
The genetic algorithms represent a family of algorithms using some of genetic principles being present in nature,in order to solve particular computational problems.These natural principles are:inheritance,crossover,m...The genetic algorithms represent a family of algorithms using some of genetic principles being present in nature,in order to solve particular computational problems.These natural principles are:inheritance,crossover,mutation,survival of the fittest,migrations and so on.The paper describes the most important aspects of a genetic algorithm as a stochastic method for solving various classes of optimization problems.It also describes the basic genetic operator selection,crossover and mutation,serving for a new generation of individuals to achieve an optimal or a good enough solution of an optimization problem being in question.展开更多
The growing global competition compels manufacturing organizations to engage themselves in all productivity improvement activities. In this direction, the consideration of mixed-model assembly line balancing problem a...The growing global competition compels manufacturing organizations to engage themselves in all productivity improvement activities. In this direction, the consideration of mixed-model assembly line balancing problem and implementing in industries plays a major role in improving organizational productivity. In this paper, the mixed model assembly line balancing problem with deterministic task times is considered. The authors made an attempt to develop a genetic algorithm for realistic design of the mixed-model assembly line balancing problem. The design is made using the originnal task times of the models, which is a realistic approach. Then, it is compared with the generally perceived design of the mixed-model assembly line balancing problem.展开更多
A neurocomputing model for Genetic Algorithm (GA) to break the speed bottleneck of GA was proposed. With all genetic operations parallel implemented by NN-based sub-modules, the model integrates both the strongpoint o...A neurocomputing model for Genetic Algorithm (GA) to break the speed bottleneck of GA was proposed. With all genetic operations parallel implemented by NN-based sub-modules, the model integrates both the strongpoint of parallel GA (PGA) and those of hardware GA (HGA). Moreover a new crossover operator named universe crossover was also proposed to suit the NN-based realization. This model was tested with a benchmark function set, and the experimental results validated the potential of the neurocomputing model. The significance of this model means that HGA and PGA can be integrated and the inherent parallelism of GA can be explicitly and farthest realized, as a result, the optimization speed of GA will be accelerated by one or two magnitudes compered to the serial implementation with same speed hardware, and GA will be turned from an algorithm into a machine.展开更多
Parameters identification of rockfill materials is a crucial issue for high rockfill dams. Because of the scale effect, random sampling and sample disturbance, it is difficult to obtain the actual mechanical propertie...Parameters identification of rockfill materials is a crucial issue for high rockfill dams. Because of the scale effect, random sampling and sample disturbance, it is difficult to obtain the actual mechanical properties of rockfill from laboratory tests. Parameters inversion based on in situ monitoring data has been proven to be an efficient method for identifying the exact parameters of the rockfill. In this paper, we propose a modified genetic algorithm to solve the high-dimension multimodal and nonlinear optimal parameters inversion problem. A novel crossover operator based on the sum of differences in gene fragments(So DX) is proposed, inspired by the cloning of superior genes in genetic engineering. The crossover points are selected according to the difference in the gene fragments, defining the adaptive length. The crossover operator increases the speed and accuracy of algorithm convergence by reducing the inbreeding and enhancing the global search capability of the genetic algorithm. This algorithm is compared with two existing crossover operators. The modified genetic algorithm is then used in combination with radial basis function neural networks(RBFNN) to perform the parameters back analysis of a high central earth core rockfill dam. The settlements simulated using the identified parameters show good agreement with the monitoring data, illustrating that the back analysis is reasonable and accurate. The proposed genetic algorithm has considerable superiority for nonlinear multimodal parameter identification problems.展开更多
A real valued genetic algorithm(RVGA) for the optimization problem with continuous variables is proposed. It is composed of a simple and general purpose dynamic scaled fitness and selection operator, crossover opera...A real valued genetic algorithm(RVGA) for the optimization problem with continuous variables is proposed. It is composed of a simple and general purpose dynamic scaled fitness and selection operator, crossover operator, mutation operators and adaptive probabilities for these operators. The algorithm is tested by two generally used functions and is used in training a neural network for image recognition. Experimental results show that the algorithm is an efficient global optimization algorithm.展开更多
This paper presents an efficient and reliable genetic algorithm (GA) based particle swarm optimization (PSO) tech- nique (hybrid GAPSO) for solving the economic dispatch (ED) problem in power systems. The non-linear c...This paper presents an efficient and reliable genetic algorithm (GA) based particle swarm optimization (PSO) tech- nique (hybrid GAPSO) for solving the economic dispatch (ED) problem in power systems. The non-linear characteristics of the generators, such as prohibited operating zones, ramp rate limits and non-smooth cost functions of the practical generator operation are considered. The proposed hybrid algorithm is demonstrated for three different systems and the performance is compared with the GA and PSO in terms of solution quality and computation efficiency. Comparison of results proved that the proposed algo- rithm can obtain higher quality solutions efficiently in ED problems. A comprehensive software package is developed using MATLAB.展开更多
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.展开更多
Designing an excellent original topology not only improves the accuracy of routing, but also improves the restoring rate of failure. In this paper, we propose a new heuristic topology generation algorithm—GA-PODCC (G...Designing an excellent original topology not only improves the accuracy of routing, but also improves the restoring rate of failure. In this paper, we propose a new heuristic topology generation algorithm—GA-PODCC (Genetic Algorithm based on the Pareoto Optimality of Delay, Configuration and Consumption), which utilizes a genetic algorithm to optimize the link delay and resource configuration/consumption. The novelty lies in designing the two stages of genetic operation: The first stage is to pick the best population by means of the crossover, mutation, and selection operation;The second stage is to select an excellent individual from the best population. The simulation results show that, using the same number of nodes, GA-PODCC algorithm improves the balance of all the three optimization objectives, maintaining a low level of distortion in topology aggregation.展开更多
基金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 flowshop scheduling problem is NP complete. To solve it by genetic algorithm, an efficient crossover operator is designed. Compared with another crossover operator, this one often finds a better solution within the same time.
基金the National Natural Science Foundation of China(Nos.60574071 and70771080)
文摘Bilevel linear programming, which consists of the objective functions of the upper level and lower level, is a useful tool for modeling decentralized decision problems. Various methods are proposed for solving this problem. Of all the algorithms, the ge- netic algorithm is an alternative to conventional approaches to find the solution of the bilevel linear programming. In this paper, we describe an adaptive genetic algorithm for solving the bilevel linear programming problem to overcome the difficulty of determining the probabilities of crossover and mutation. In addition, some techniques are adopted not only to deal with the difficulty that most of the chromosomes maybe infeasible in solving constrained optimization problem with genetic algorithm but also to improve the efficiency of the algorithm. The performance of this proposed algorithm is illustrated by the examples from references.
文摘The genetic algorithms represent a family of algorithms using some of genetic principles being present in nature,in order to solve particular computational problems.These natural principles are:inheritance,crossover,mutation,survival of the fittest,migrations and so on.The paper describes the most important aspects of a genetic algorithm as a stochastic method for solving various classes of optimization problems.It also describes the basic genetic operator selection,crossover and mutation,serving for a new generation of individuals to achieve an optimal or a good enough solution of an optimization problem being in question.
文摘The growing global competition compels manufacturing organizations to engage themselves in all productivity improvement activities. In this direction, the consideration of mixed-model assembly line balancing problem and implementing in industries plays a major role in improving organizational productivity. In this paper, the mixed model assembly line balancing problem with deterministic task times is considered. The authors made an attempt to develop a genetic algorithm for realistic design of the mixed-model assembly line balancing problem. The design is made using the originnal task times of the models, which is a realistic approach. Then, it is compared with the generally perceived design of the mixed-model assembly line balancing problem.
基金NationalNaturalScienceFoundationofChina (No .60 2 3 40 2 0 )
文摘A neurocomputing model for Genetic Algorithm (GA) to break the speed bottleneck of GA was proposed. With all genetic operations parallel implemented by NN-based sub-modules, the model integrates both the strongpoint of parallel GA (PGA) and those of hardware GA (HGA). Moreover a new crossover operator named universe crossover was also proposed to suit the NN-based realization. This model was tested with a benchmark function set, and the experimental results validated the potential of the neurocomputing model. The significance of this model means that HGA and PGA can be integrated and the inherent parallelism of GA can be explicitly and farthest realized, as a result, the optimization speed of GA will be accelerated by one or two magnitudes compered to the serial implementation with same speed hardware, and GA will be turned from an algorithm into a machine.
基金supported by the National Natural Science Foundation of China(Grant Nos.51379161&51509190)China Postdoctoral Science Foundation(Grant No.2015M572195)the Fundamental Research Funds for the Central Universities
文摘Parameters identification of rockfill materials is a crucial issue for high rockfill dams. Because of the scale effect, random sampling and sample disturbance, it is difficult to obtain the actual mechanical properties of rockfill from laboratory tests. Parameters inversion based on in situ monitoring data has been proven to be an efficient method for identifying the exact parameters of the rockfill. In this paper, we propose a modified genetic algorithm to solve the high-dimension multimodal and nonlinear optimal parameters inversion problem. A novel crossover operator based on the sum of differences in gene fragments(So DX) is proposed, inspired by the cloning of superior genes in genetic engineering. The crossover points are selected according to the difference in the gene fragments, defining the adaptive length. The crossover operator increases the speed and accuracy of algorithm convergence by reducing the inbreeding and enhancing the global search capability of the genetic algorithm. This algorithm is compared with two existing crossover operators. The modified genetic algorithm is then used in combination with radial basis function neural networks(RBFNN) to perform the parameters back analysis of a high central earth core rockfill dam. The settlements simulated using the identified parameters show good agreement with the monitoring data, illustrating that the back analysis is reasonable and accurate. The proposed genetic algorithm has considerable superiority for nonlinear multimodal parameter identification problems.
文摘A real valued genetic algorithm(RVGA) for the optimization problem with continuous variables is proposed. It is composed of a simple and general purpose dynamic scaled fitness and selection operator, crossover operator, mutation operators and adaptive probabilities for these operators. The algorithm is tested by two generally used functions and is used in training a neural network for image recognition. Experimental results show that the algorithm is an efficient global optimization algorithm.
文摘This paper presents an efficient and reliable genetic algorithm (GA) based particle swarm optimization (PSO) tech- nique (hybrid GAPSO) for solving the economic dispatch (ED) problem in power systems. The non-linear characteristics of the generators, such as prohibited operating zones, ramp rate limits and non-smooth cost functions of the practical generator operation are considered. The proposed hybrid algorithm is demonstrated for three different systems and the performance is compared with the GA and PSO in terms of solution quality and computation efficiency. Comparison of results proved that the proposed algo- rithm can obtain higher quality solutions efficiently in ED problems. A comprehensive software package is developed using MATLAB.
基金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.
文摘Designing an excellent original topology not only improves the accuracy of routing, but also improves the restoring rate of failure. In this paper, we propose a new heuristic topology generation algorithm—GA-PODCC (Genetic Algorithm based on the Pareoto Optimality of Delay, Configuration and Consumption), which utilizes a genetic algorithm to optimize the link delay and resource configuration/consumption. The novelty lies in designing the two stages of genetic operation: The first stage is to pick the best population by means of the crossover, mutation, and selection operation;The second stage is to select an excellent individual from the best population. The simulation results show that, using the same number of nodes, GA-PODCC algorithm improves the balance of all the three optimization objectives, maintaining a low level of distortion in topology aggregation.
