Informatica

Crossover operators play a very important role by creation of genetic algorithms (GAs) which are applied in various areas of computer science, including combinatorial optimization. In this paper, fifteen genetic crossover procedures are designed and implemented using a modern C# programming language. The computational experiments have been conducted with these operators by solving the famous combinatorial optimization problem – the quadratic assignment problem (QAP). The results of the conducted experiments on the characteristic benchmark instances from the QAP instances library QAPLIB illustrate the relative performance of the examined crossover operations.

In the paper we propose a genetic algorithm based on insertion heuristics for the vehicle routing problem with constraints. A random insertion heuristic is used to construct initial solutions and to reconstruct the existing ones. The location where a randomly chosen node will be inserted is selected by calculating an objective function. The process of random insertion preserves stochastic characteristics of the genetic algorithm and preserves feasibility of generated individuals. The defined crossover and mutation operators incorporate random insertion heuristics, analyse individuals and select which parts should be reinserted. Additionally, the second population is used in the mutation process. The second population increases the probability that the solution, obtained in the mutation process, will survive in the first population and increase the probability to find the global optimum. The result comparison shows that the solutions, found by the proposed algorithm, are similar to the optimal solutions obtained by other genetic algorithms. However, in most cases the proposed algorithm finds the solution in a shorter time and it makes this algorithm competitive with others.

Recently, genetic algorithms (GAs) and their hybrids have achieved great success in solving difficult combinatorial optimization problems. In this paper, the issues related to the performance of the genetic search in the context of the grey pattern problem (GPP) are discussed. The main attention is paid to the investigation of the solution recombination, i.e., crossover operators which play an important role by developing robust genetic algorithms. We implemented seven crossover operators within the hybrid genetic algorithm (HGA) framework, and carried out the computational experiments in order to test the influence of the recombination operators to the genetic search process. We examined the one point crossover, the uniform like crossover, the cycle crossover, the swap path crossover, and others. A so-called multiple parent crossover based on a special type of recombination of several solutions was tried, too. The results obtained from the experiments on the GPP test instances demonstrate promising efficiency of the swap path and multiple parent crossovers.

This paper develops a representation of multi‐model based controllers by using artificial intelligence typical structures. These structures will be neural networks, genetic algorithms and fuzzy logic. The interpretation of multimodel controllers in an artificial intelligence frame will allow the application of each specific technique to the design of improved multimodel based controllers. The obtained artificial intelligence based multimodel controllers are compared with classical single model based ones. It is shown through simulation examples that a transient response improvement can be achieved by using multiestimation based techniques. Furthermore, a method for synthesizing multimodel based neural network controllers from already designed single model based ones is presented. The proposed methodology allows to extend the existing single model based neural controllers to multimodel based ones, extending the applicability of this kind of techniques to a more general type of controllers. Also, some applications of genetic algorithms and fuzzy logic to multimodel controller design are proposed. Thus, the mutation operation from genetic algorithms inspires a robustness test which consists of a random modification of the estimates which is used to select the estimates leading to the better identification performance towards parameterizing online the adaptive controller. Such a test is useful for plants operating in a noisy environment. The proposed robustness test improves the selection of the plant model used to parameterize the adaptive controller in comparison to classical multimodel schemes where the controller parameterization choice is basically taken based on the identification accuracy of each model. Moreover, the fuzzy logic approach suggests new ideas to the design of multiestimation structures which can be applied to a broad variety of adaptive controllers such as robotic manipulator controller design.

This paper analyses coupled control of a nonlinear, time‐varying plant. Uncoupled and coupled direct adaptive controllers, based on fuzzy logics, are synthesized to control the water level and the air pressure in a closed tank. The satisfactory efficiency of the controllers is experimentally demonstrated running the plant under the different working conditions. Coupled fuzzy controllers are compared with the uncoupled fuzzy controllers.