Informacja

Drogi użytkowniku, aplikacja do prawidłowego działania wymaga obsługi JavaScript. Proszę włącz obsługę JavaScript w Twojej przeglądarce.

Wyszukujesz frazę "genetic algorithms" wg kryterium: Wszystkie pola


Wyświetlanie 1-9 z 9
Tytuł:
Supplementary crossover operator for genetic algorithms based on the center-of-gravity paradigm
Autorzy:
Angelov, P.
Powiązania:
https://bibliotekanauki.pl/articles/205842.pdf
Data publikacji:
2001
Wydawca:
Polska Akademia Nauk. Instytut Badań Systemowych PAN
Tematy:
algorytm genetyczny
mutacja
środek bezwładności
center of gravity
crossover
genetic algorithms
mutation
selection operators
Opis:
A supplementary crossover operator for genetic algorithms (GA) is proposed in the paper. It performs specific breeding between the two fittest parental chromosomes. The new child chromosome is based on the center of gravity (CoG) paradigm, taking into account both the parental weights (measured by their fitness) and their actual value. It is designed to be used in combination with other crossover and mutation operators (it applies to the best fitted two parental chromosomes only) both in binary and real-valued (evolutionary) GA. Analytical proof of its ability to improve the result is provided for the simplest case of one variable and when the elitist selection strategy is used. The new operator is validated with a number of usually used numerical test functions as well as with a practical example of supply air temperature and flow rate scheduling in a hollow core ventilated slab thermal storage system. The tests indicate that it improves results (the speed of convergence as well as the final result) without a significant increase in computational expenses.
Źródło:
Control and Cybernetics; 2001, 30, 2; 159-176
0324-8569
Pojawia się w:
Control and Cybernetics
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Stability criteria for large-scale time-delay systems; the LMI approach and the Genetic Algorithms
Autorzy:
Chen, J.- D.
Powiązania:
https://bibliotekanauki.pl/articles/969948.pdf
Data publikacji:
2006
Wydawca:
Polska Akademia Nauk. Instytut Badań Systemowych PAN
Tematy:
algorytm genetyczny
delay-dependent criterion
large-scale systems
linear matrix inequality
genetic algorithms
Opis:
This paper addresses the asymptotic stability analysis problem for a class of linear large-scale systems with time delay in the state of each subsystem as well as in the interconnections. Based on the Lyapunov stability theory, a delay-dependent criterion for stability analysis of the systems is derived in terms of a linear matrix inequality (LMI). Finally, a numerical example is given to demonstrate the validity of the proposed result.
Źródło:
Control and Cybernetics; 2006, 35, 2; 291-301
0324-8569
Pojawia się w:
Control and Cybernetics
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
An efficient genetic algorithm for the uncapacitated multiple allocation p-hub median problem
Autorzy:
Stanimirovic, Z.
Powiązania:
https://bibliotekanauki.pl/articles/970612.pdf
Data publikacji:
2008
Wydawca:
Polska Akademia Nauk. Instytut Badań Systemowych PAN
Tematy:
p-hub problem
genetic algorithms
discrete location and assignment
Opis:
In this paper the Uncapacitated Multiple Allocation p-hub Median Problem (the UMApHMP) is considered. A new heuristic method based on a genetic algorithm approach (GA) for solving UMApHMP is proposed. The described GA uses binary representation of the solutions. Genetic operators which keep the feasibility of individuals in the population are designed and implemented. The mutation operator with frozen bits is used to increase the diversibility of the genetic material. The running time of the GA is improved by caching technique. Proposed GA approach is bench-marked on the well known CAB and AP data sets and compared with the existing methods for solving the UMApHMP. Computational results show that the GA quickly reaches all previously known optimal solutions, and also gives results on large scale AP instances (up to n=200, p=20) that were not considered in the literature so far.
Źródło:
Control and Cybernetics; 2008, 37, 3; 669-692
0324-8569
Pojawia się w:
Control and Cybernetics
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Grammars in genetic programming
Autorzy:
Wieczorek, W.
Czech, Z.
Powiązania:
https://bibliotekanauki.pl/articles/205856.pdf
Data publikacji:
2000
Wydawca:
Polska Akademia Nauk. Instytut Badań Systemowych PAN
Tematy:
algorytm genetyczny
gramatyka
genetic algorithms
grammars
strongly typed genetic programming
Opis:
The work consists of two parts. In the first part the idea of genetic programming is presented and the basic elements of a genetic programming system are described. In the second part, considering a selected example, we describe the results of investigations of the influence of program grammars on the efficiency of genetic programming.
Źródło:
Control and Cybernetics; 2000, 29, 4; 1019-1030
0324-8569
Pojawia się w:
Control and Cybernetics
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Biologically inspired methods for control of evolutionary algorithms
Autorzy:
Stańczak, J.
Powiązania:
https://bibliotekanauki.pl/articles/206262.pdf
Data publikacji:
2003
Wydawca:
Polska Akademia Nauk. Instytut Badań Systemowych PAN
Tematy:
algorytm genetyczny
adaptacja
adaptacyjny algorytm ewolucyjny
genetic algorithms
adaptation
adaptive ewolutionary algorithms
Opis:
In this paper two methods for evolutionary algorithm control are proposed. The first one is a new method of tuning tlie probabilities of genetic operators. It is assumed in the presented approach that every member of the optimized population conducts his own ranking of genetic operators' qualities. This ranking enables computing the probabilities of execution of genetic operators. This set of probabilities is a basis of experience of every individual and according to this basis the individual chooses the operator in every iteration of the algorithm. Due to this experience one can maximize the chances of his offspring to survive. The second part of the paper deals with a self-adapting method of selection of individuals to a subsequent generation. Methods of selection applied in the evolutionary algorithms are usually inspired by nature and prefer solutions where the main role is played by randomness, competition and struggle among individuals. In the case of evolutionary algorithms, where populations of individuals are usually small, this causes a premature convergence to local minima. In order to avoid this drawback I propose to apply an approach based rather on an agricultural technique. Two new methods of object selection are proposed: a histogram selection and a mixed selection. The methods described were tested using examples based on scheduling and TSP.
Źródło:
Control and Cybernetics; 2003, 32, 2; 411-433
0324-8569
Pojawia się w:
Control and Cybernetics
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Minimization of electric and magnetic losses in the speed control of induction motors
Autorzy:
Kawecki, L.
Powiązania:
https://bibliotekanauki.pl/articles/206296.pdf
Data publikacji:
2003
Wydawca:
Polska Akademia Nauk. Instytut Badań Systemowych PAN
Tematy:
sterowanie optymalne
silnik indukcyjny
algorytmy genetyczne
optimal control
induction motors
genetic algorithms
Opis:
The article presents a minimization method of electric energy losses in rotor and stator windings and in the magnetic core of the motor during the frequency speed control of induction motors which limits the amplitude of the stator current. To solve this problem, the hybrid algorithm of parametric optimization, the mathematical model of the induction motor and the Pontryagin maximum principle are used. In the mathematical model of the motor both electromagnetic transients and the motor magnetic material saturation are taken into consideration. The electric energy losses in the magnetic core and in the windings of the motor are also calculated. An application example of the method developed for the idle starting of an induction motor is given.
Źródło:
Control and Cybernetics; 2003, 32, 2; 329-349
0324-8569
Pojawia się w:
Control and Cybernetics
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
An optimized soft computing-based passage retrieval system
Autorzy:
Ortiz-Arroyo, D.
Christensen, H. U.
Powiązania:
https://bibliotekanauki.pl/articles/970939.pdf
Data publikacji:
2009
Wydawca:
Polska Akademia Nauk. Instytut Badań Systemowych PAN
Tematy:
information retrieval
question answering systems
passage retrieval
fuzzy logic
optimization
genetic algorithms
Opis:
In this paper we propose and evaluate a soft computing-based passage retrieval system for Question Answering Systems (QAS). Fuzzy PR, our base-line passage retrieval system, employs a similarity measure that attempts to model accurately the question reformulation intuition. The similarity measure includes fuzzy logic-based models that evaluate efficiently the proximity of question terms and detect term variations occurring within a passage. Our experimental results using FuzzyPR on the TREC and CLEF corpora show that our novel passage retrieval system achieves better performance compared to other similar systems. Finally, we describe the performance results of OptFuzzyPR, an optimized version of FuzzyPR, created by optimizing the values of FuzzyPR system parameters using genetic algorithms.
Źródło:
Control and Cybernetics; 2009, 38, 2; 457-479
0324-8569
Pojawia się w:
Control and Cybernetics
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Linear programming & metaheuristic approach for scheduling in the hybrid flowshop with resource constraints
Autorzy:
Figielska, E.
Powiązania:
https://bibliotekanauki.pl/articles/206283.pdf
Data publikacji:
2011
Wydawca:
Polska Akademia Nauk. Instytut Badań Systemowych PAN
Tematy:
flowshop
parallel machines
resource constraints
heuristics
linear programming
genetic algorithms
simulated annealing
tabu search
Opis:
This paper deals with the problem of preemptive scheduling in a two-stage flowshop with parallel unrelated machines and additional renewable resources. The objective is the minimization of makespan. The problem is NP-hard. Heuristic algorithms are proposed which join the linear programming based procedures with metaheuristic algorithms: genetic, simulated annealing and tabu search algorithm. The performance of the proposed algorithms is experimentally evaluated by comparing the solutions with a lower bound on the optimal makespan. Results of a computational experiment show that these algorithms are able to produce good solutions in short computation time and that the metaheuristics significantly improve the results for the most difficult problems.
Źródło:
Control and Cybernetics; 2011, 40, 4; 1209-1230
0324-8569
Pojawia się w:
Control and Cybernetics
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Fuzzy modelling of temperature difference in 200 MW power unit condenser using genetic fuzzy systems
Autorzy:
Pająk, M.
Powiązania:
https://bibliotekanauki.pl/articles/970605.pdf
Data publikacji:
2008
Wydawca:
Polska Akademia Nauk. Instytut Badań Systemowych PAN
Tematy:
learning
fuzzy models
genetic algorithms
fuzzy statistics and data analysis
large-scale systems
linguistic modelling
Opis:
Energy generation is one of the most complicated industrial processes. Because of its complexity, there is no accurate conventional model of a power unit. Fuzzy logic concepts might be effectively implemented in this field. In the paper a universal method of creating a fuzzy logic model is presented. To check the usefulness of the method in the case of real industrial issues, a fuzzy model of temperature difference in a condenser was automatically generated. The modelling experiment and the assessment of model quality are presented in the paper.
Źródło:
Control and Cybernetics; 2008, 37, 3; 565-583
0324-8569
Pojawia się w:
Control and Cybernetics
Dostawca treści:
Biblioteka Nauki
Artykuł
    Wyświetlanie 1-9 z 9

    Ta witryna wykorzystuje pliki cookies do przechowywania informacji na Twoim komputerze. Pliki cookies stosujemy w celu świadczenia usług na najwyższym poziomie, w tym w sposób dostosowany do indywidualnych potrzeb. Korzystanie z witryny bez zmiany ustawień dotyczących cookies oznacza, że będą one zamieszczane w Twoim komputerze. W każdym momencie możesz dokonać zmiany ustawień dotyczących cookies