Informacja

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

English (EN)·Polski (PL)·Yкраїнський (UK)
Przejdź do strony domowej biblioteki Centralna Biblioteka Wojskowa Link otwiera się w nowym oknie Logo biblioteki Prolib Integro - strona głównaCentralna Biblioteka Wojskowa

Wyszukujesz frazę "Genetic Algorithm" wg kryterium: Temat

  Lista filtrów

Dostawca treści

Wyrównaj
Wyświetlanie 1-100 z 375
Tytuł:
Some Aspects of the Application of Genetic Algorithm for Solving the Assignment Problem of Tasks to Resources in a Transport Company
Autorzy:
Izdebski, Mariusz
Jacyna, Marianna
Powiązania:
https://bibliotekanauki.pl/articles/504281.pdf
Data publikacji:
2014
Wydawca:
Międzynarodowa Wyższa Szkoła Logistyki i Transportu
Tematy:
assignment problem
genetic algorithm
optimization
Opis:
The article defines the assignment problem of tasks to resources in a transport company. The paper describes mathematical model of a transport system taking into account the assignment of vehicles to the tasks. It also provides stages of creation of the genetic algorithm for solving the assignment problem in the transport company.
Źródło:
Logistics and Transport; 2014, 21, 1; 13-20
1734-2015
Pojawia się w:
Logistics and Transport
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Genetic algorithm as optimizing tool in line balancing process
Autorzy:
Hnat, J.
Gregor, M.
Powiązania:
https://bibliotekanauki.pl/articles/117771.pdf
Data publikacji:
2007
Wydawca:
Polskie Towarzystwo Promocji Wiedzy
Tematy:
balancing
assembly line
genetic algorithm
Opis:
This article deals with assembly line balancing problem and with possibility of using genetic algorithm as an optimizing tool in balancing process. There is briefly described line balancing problem and the main goals of balancing. Also it is shown here how genetic algorithm work and what are the advantages of this tool.
Źródło:
Applied Computer Science; 2007, 3, 2; 18-33
1895-3735
Pojawia się w:
Applied Computer Science
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Computer simulation of the genetic controller for the EB flue gas treatment process
Autorzy:
Moroz, Z.
Boużyk, J.
Sowiński, M.
Chmielewski, A.
Powiązania:
https://bibliotekanauki.pl/articles/147569.pdf
Data publikacji:
2001
Wydawca:
Instytut Chemii i Techniki Jądrowej
Tematy:
genetic algorithm controller
flue gas
Opis:
The use of the computer genetic algorithm (GA) for driving a controller device for the industrial flue gas purification systems employing the electron beam irradiation, has been studied. As the mathematical model of the installation the properly trained artificial neural net (ANN) was used. Various cost functions and optimising strategies of the genetic code were tested. These computer simulations proved, that ANN + GA controller can be sufficiently precise and fast to be applied in real installations.
Źródło:
Nukleonika; 2001, 46, 3; 107-115
0029-5922
1508-5791
Pojawia się w:
Nukleonika
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Optimization of the pulse transformer using circuit-field model
Autorzy:
Łyskawiński, W.
Knypiński, Ł.
Nowak, L.
Jędryczka, C.
Powiązania:
https://bibliotekanauki.pl/articles/1395761.pdf
Data publikacji:
2013
Wydawca:
Politechnika Poznańska. Wydawnictwo Politechniki Poznańskiej
Tematy:
pulse transformer
optimization
genetic algorithm
Opis:
The paper presents the new strategy of the optimization of pulse transformer (PT). In order to reduce calculation time the optimization problem has been decomposed into two stages. In the first stage, to determine functional parameters of PT the circuit model is used. The goal of circuit calculations is to limit the space of design variables that meets formulated requirements. The genetic algorithm has been applied for this task. In order to include constraints, the penalty function has been engaged. The transformer dimensions obtained in the first stage of calculations are used as initial values in the second stage of design process. In the second stage the field model of PT is employed. Obtained results prove that presented approach allows for fast optimization of the PT design.
Źródło:
Computer Applications in Electrical Engineering; 2013, 11; 159-167
1508-4248
Pojawia się w:
Computer Applications in Electrical Engineering
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Multi-variable optimization of an ytterbium-doped fiber laser using genetic algorithm
Autorzy:
Hashemi, S. S.
Ghavami, S. S.
Khorsandi, A
Powiązania:
https://bibliotekanauki.pl/articles/175086.pdf
Data publikacji:
2015
Wydawca:
Politechnika Wrocławska. Oficyna Wydawnicza Politechniki Wrocławskiej
Tematy:
fiber laser
optimization
genetic algorithm
Opis:
We introduce the genetic algorithm for the optimization of an Yb3+-doped double-clad fiber laser based on a multi-variable scheme. The output characteristic of the laser is numerically simulated using real practical values. This is performed through solving the associated steady-state rate equation and investigating the effects of input variables such as pump and signal wavelengths and length of the fiber on the laser output. It is found that pumping of the medium around 975 nm is conducted to attain the maximum output power of ~34.8 W, while the stability of the outcoupled power is significantly improved when pumping at 920 nm, confirming good agreement with the reported experimental results. We have also found that by using genetic algorithm base multi-variable optimization, the output power can be significantly increased by about three orders of magnitude and reaches to ~28.5 W with optimum and shorter fiber length of ~57.5 m. Obtained results show that based on the genetic algorithm multi-variable discipline, fiber characteristics can be optimized according to the gaining of maximum output power.
Źródło:
Optica Applicata; 2015, 45, 3; 355-367
0078-5466
1899-7015
Pojawia się w:
Optica Applicata
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
On Some Aspects of Genetic and Evolutionary Methods for Optimization Purposes
Autorzy:
Woźniak, M.
Połap, D.
Powiązania:
https://bibliotekanauki.pl/articles/227353.pdf
Data publikacji:
2015
Wydawca:
Polska Akademia Nauk. Czytelnia Czasopism PAN
Tematy:
computational intelligence
genetic algorithm
heuristic algorithm
optimization
Opis:
In this paper, the idea of applying some hybrid genetic algorithms with gradient local search and evolutionary optimization techniques is formulated. For two different test functions the proposed versions of the algorithms have been examined. Research results are presented and discussed to show potential efficiency in optimization purposes.
Źródło:
International Journal of Electronics and Telecommunications; 2015, 61, 1; 7-16
2300-1933
Pojawia się w:
International Journal of Electronics and Telecommunications
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Learning from heterogeneously distributed data sets using artificial neural networks and genetic algorithms
Autorzy:
Peteiro-Barral, D.
Guijarro-Berdiñas, B.
Pérez-Sánchez, B.
Powiązania:
https://bibliotekanauki.pl/articles/91888.pdf
Data publikacji:
2012
Wydawca:
Społeczna Akademia Nauk w Łodzi. Polskie Towarzystwo Sieci Neuronowych
Tematy:
artificial neural networks
genetic algorithm
Devonet algorithm
Opis:
It is a fact that traditional algorithms cannot look at a very large data set and plausibly find a good solution with reasonable requirements of computation (memory, time and communications). In this situation, distributed learning seems to be a promising line of research. It represents a natural manner for scaling up algorithms inasmuch as an increase of the amount of data can be compensated by an increase of the number of distributed locations in which the data is processed. Our contribution in this field is the algorithm Devonet, based on neural networks and genetic algorithms. It achieves fairly good performance but several limitations were reported in connection with its degradation in accuracy when working with heterogeneous data, i.e. the distribution of data is different among the locations. In this paper, we take into account this heterogeneity in order to propose several improvements of the algorithm, based on distributing the computation of the genetic algorithm. Results show a significative improvement of the performance of Devonet in terms of accuracy.
Źródło:
Journal of Artificial Intelligence and Soft Computing Research; 2012, 2, 1; 5-20
2083-2567
2449-6499
Pojawia się w:
Journal of Artificial Intelligence and Soft Computing Research
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Genetic-based approach to the functional-modular structure design of packaging machines
Autorzy:
Varanitskyi, T
Palchevskyi, B
Powiązania:
https://bibliotekanauki.pl/articles/117989.pdf
Data publikacji:
2013
Wydawca:
Polskie Towarzystwo Promocji Wiedzy
Tematy:
packaging
machine
design
genetic algorithm
structure
Opis:
The paper presents a method for decomposition of packaging machine structure in order to provide the designer with choices for feasible assemblies. The aim is at providing a systematic approach to explore a large number of decompositions prior to the detailed component design phase. The structure is transformed to a graph with equivalent topology by a genetic algorithm.
Źródło:
Applied Computer Science; 2013, 9, 1; 54-68
1895-3735
Pojawia się w:
Applied Computer Science
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
The Application of genetic algorithms for the selection of WSE companies in Warsaw for the investment portfolio
Autorzy:
Basiura, Beata
Motyczyńska, Joanna
Powiązania:
https://bibliotekanauki.pl/articles/1818470.pdf
Data publikacji:
2020
Wydawca:
Akademia Górniczo-Hutnicza im. Stanisława Staszica w Krakowie. Wydawnictwo AGH
Tematy:
Markowitz model
investment portfolio
genetic algorithm
Opis:
Portfolio analysis is a tool particularly intended for investors. Risk assessment and risk specification make the investor able to properly diversify and offset the portfolio. Broadly speaking, there are multiple tools destined for building up an efficient set of portfolios. One of them is Markowitz’s model theory postulating building up a portfolio determined on the basis of equilibrium between expected profit level as well as accepted level of risk assessment. In the context of this paper, the objective is to shed some light on creating investment portfolios based on either Markowitz's portfolio theory or evolutionary algorithm. The simulation based methods for building up a portfolio of approximately 40-50 companies listed out in the primary marketof the Warsaw Stock Exchange using the selection function proposed in the BA thesis were presented. Portfolio profit values have been evaluated in a dynamically shifted time window. The conducted analysis showed shifts in the economy at certain periods of time. The implemented genetic algorithms smoothly handled the optimization with a relatively short processing time of the task result.
Źródło:
Decision Making in Manufacturing and Services; 2020, 14, 1; 91--126
1896-8325
2300-7087
Pojawia się w:
Decision Making in Manufacturing and Services
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
An evolutionary algorithm determining a defuzzyfication functional
Autorzy:
Kosiński, W.
Markowska-Kaczmar, U.
Powiązania:
https://bibliotekanauki.pl/articles/1943273.pdf
Data publikacji:
2007
Wydawca:
Politechnika Gdańska
Tematy:
ordered fuzzy numbers
defuzzyfication
genetic algorithm
Opis:
Order fuzzy numbers are defined that make it possible to deal with fuzzy inputs quantitatively, exactly in the same way as with real numbers, together with four algebraic operations. An approximation formula is given for a defuzzyfication functional that plays the main role when dealing with fuzzy controllers and fuzzy inference systems. A dedicated evolutionary algorithm is presented in order to determine the form of a functional when a training set is given. The form of a genotype composed of three types of chromosomes and the fitness function are given and Genetic operators are proposed.
Źródło:
TASK Quarterly. Scientific Bulletin of Academic Computer Centre in Gdansk; 2007, 11, 1-2; 47-58
1428-6394
Pojawia się w:
TASK Quarterly. Scientific Bulletin of Academic Computer Centre in Gdansk
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Optimization of fractal compression of 3d images using a genetic algorithm
Autorzy:
Khanmirza, Z
Ramezani, F
Motameni, H
Powiązania:
https://bibliotekanauki.pl/articles/102068.pdf
Data publikacji:
2015
Wydawca:
Stowarzyszenie Inżynierów i Techników Mechaników Polskich
Tematy:
stereo system
fractal compression
genetic algorithm
Opis:
3D image technologies are widely recognized as the next generation of visual presentation considering the achievement of more natural experiences. To produce such images, two cameras are placed in a bit different position. When we seek to compress such images, we need a procedure to compress two images synchronously. In this paper, a procedure is presented for a suitable compression based on fractal compression which shows that we obtain high compression rate with an appropriate image quality; however, since the proposed procedure has a low search speed, we used genetic algorithm to remove the case.
Źródło:
Advances in Science and Technology. Research Journal; 2015, 9, 26; 124-128
2299-8624
Pojawia się w:
Advances in Science and Technology. Research Journal
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Solving the problem of vehicle routing by evolutionary algorithm
Autorzy:
Iwańkowicz, R. R.
Sekulski, Z.
Powiązania:
https://bibliotekanauki.pl/articles/102797.pdf
Data publikacji:
2016
Wydawca:
Stowarzyszenie Inżynierów i Techników Mechaników Polskich
Tematy:
vehicle routing
travelling salesman
genetic algorithm
Opis:
In the presented work the vehicle routing problem is formulated, which concerns planning the collection of wastes by one garbage truck from a certain number of collection points. The garbage truck begins its route in the base point, collects the load in subsequent collection points, then drives the wastes to the disposal site (landfill or sorting plant) and returns to the another visited collection points. The filled garbage truck each time goes to the disposal site. It returns to the base after driving wastes from all collection points. Optimization model is based on genetic algorithm where individual is the whole garbage collection plan. Permutation is proposed as the code of the individual.
Źródło:
Advances in Science and Technology. Research Journal; 2016, 10, 29; 97-108
2299-8624
Pojawia się w:
Advances in Science and Technology. Research Journal
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
The use of simulation and genetic algorithm with different genetic operators to optimize manufacturing system
Autorzy:
Wiśniewski, T.
Rymaszewski, S.
Powiązania:
https://bibliotekanauki.pl/articles/118181.pdf
Data publikacji:
2013
Wydawca:
Polskie Towarzystwo Promocji Wiedzy
Tematy:
genetic algorithm
simulation modeling
manufacturing system
Opis:
The article depicts an evolutionary approach to simulation based optimization of a typical manufacturing system. Genetic algorithm with four different variants of genetic operators (crossover operator and type of selection) is compared to find the best optimization method. A comprehensive discussion of the genetic algorithm results obtained from the simulation model was also presented.
Źródło:
Applied Computer Science; 2013, 9, 1; 34-45
1895-3735
Pojawia się w:
Applied Computer Science
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Optimization of dental implant using genetic algorithm
Optymalizacja wszczepu stomatologicznego z wykorzystaniem algorytmu genetycznego
Autorzy:
Łodygowski, T.
Szajek, K.
Wierszycki, M.
Powiązania:
https://bibliotekanauki.pl/articles/279418.pdf
Data publikacji:
2009
Wydawca:
Polskie Towarzystwo Mechaniki Teoretycznej i Stosowanej
Tematy:
design optimization
genetic algorithm
dental implant
Opis:
The subject of the present work is optimization of the modern implant system Osteoplant, which was created and is still developed by Foundation of University of Medical Sciences in Poznań. Clinical observations point to the occurrence of both early and late complications in the case of all two-component implant systems. In many cases, these problems are caused by mechanical fractures of the implants themselves. The obtained results of the previous studies focused on necessary changes of the implant mechanical behavior, which helped to achieve the required long-term strength. However, modifications of the present dental implant system are not obvious. In this paper, an optimization of the Osteoplant dental implant system, with the use of FEA and genetic algorithms is discussed.
Przedmiotem prezentowanej pracy jest problem optymalizacji systemu implantologicznego Osteoplant, który został opracowany i wciąż jest ulepszany przez Fundację Uniwersytetu Medycznego w Poznaniu. Obserwacje kliniczne potwierdzają występowanie powikłań zarówno we wczesnej, jak i późnej fazie użytkowania implantu. Dotychczas otrzymane wyniki wskazują, że wydłużenie bezawaryjnego okresu użytkowania implantu wymaga wprowadzenia zmian w jego pracy mechanicznej. Jednakże, ustalenie szczegłów modyfikacji nie jest oczywiste. W artykule została opisana procedura optymalizacji systemu implantologicznego Osteoplant z użyciem analizy metodą elementów skończonych oraz algorytmu genetycznego.
Źródło:
Journal of Theoretical and Applied Mechanics; 2009, 47, 3; 573-598
1429-2955
Pojawia się w:
Journal of Theoretical and Applied Mechanics
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Automated Tablet Quality Assurance and Identification for Hospital Pharmacies
Autorzy:
Chaczko, Z.
Kale, A.
Powiązania:
https://bibliotekanauki.pl/articles/226463.pdf
Data publikacji:
2011
Wydawca:
Polska Akademia Nauk. Czytelnia Czasopism PAN
Tematy:
hospital pharmacy
content error
genetic algorithm
Opis:
The tablet quality checking and identification in hospital pharmacies is done manually and does not use any automated solution. Manual sorting and handling makes this activity laborious and error-prone. This paper describes a low cost solution that is characterised by a small size of the infrastructure involved. Discussed are design and implementation details of Tablet Inspection System based on Machine Vision. The described process uses a dedicated sequence of operation to perform dispensing, scanning and sorting using mini factory setup. Machine Vision System uses a novel Genetic Evolution algorithm. The algorithm provides robust and scalable output. Due to its versatile nature and easy shape recognition ability the approach can be easily adapted to a large variety of medical tablets. The proposed solution attempts to follow the concept of single objective with multiple optima in GA that is designed to scan multiple number of tablets in one cycle of operation.
Źródło:
International Journal of Electronics and Telecommunications; 2011, 57, 2; 153-158
2300-1933
Pojawia się w:
International Journal of Electronics and Telecommunications
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
A Genetic Algorithm to Minimize the Total Tardiness for M-Machine Permutation Flowshop Problems
Autorzy:
Chung, Chia-Shin
Flynn, James
Rom, Walter
Staliński, Piotr
Powiązania:
https://bibliotekanauki.pl/articles/475000.pdf
Data publikacji:
2012
Wydawca:
Fundacja Upowszechniająca Wiedzę i Naukę Cognitione
Tematy:
genetic algorithm
scheduling
permutation flowshop
tardiness
Opis:
The m-machine, n-job, permutation flowshop problem with the total tardiness objective is a common scheduling problem, known to be NP-hard. Branch and bound, the usual approach to finding an optimal solution, experiences difficulty when n exceeds 20. Here, we develop a genetic algorithm, GA, which can handle problems with larger n. We also undertake a numerical study comparing GA with an optimal branch and bound algorithm, and various heuristic algorithms including the well known NEH algorithm and a local search heuristic LH. Extensive computational experiments indicate that LH is an effective heuristic and GA can produce noticeable improvements over LH.
Źródło:
Journal of Entrepreneurship, Management and Innovation; 2012, 8, 2; 26-43
2299-7075
2299-7326
Pojawia się w:
Journal of Entrepreneurship, Management and Innovation
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Minig rules of concept drift using genetic algorithm
Autorzy:
Vivekanandan, P.
Nedunchezhian, R.
Powiązania:
https://bibliotekanauki.pl/articles/91705.pdf
Data publikacji:
2011
Wydawca:
Społeczna Akademia Nauk w Łodzi. Polskie Towarzystwo Sieci Neuronowych
Tematy:
genetic algorithm
CDR-tree algorithm
rules
data mining
Opis:
In a database the data concepts changes over time and this phenomenon is called as concept drift. Rules of concept drift describe how the concept changes and sometimes they are interesting and mining those rules becomes more important. CDR tree algorithm is currently used to identify the rules of concept drift. Building a CDR tree becomes a complex process when the domain values of the attributes get increased. Genetic Algorithms are traditionally used for data mining tasks. In this paper, a Genetic Algorithm based approach is proposed for mining the rules of concept drift, which makes the mining task simpler and accurate when compared with the CDR-tree algorithm.
Źródło:
Journal of Artificial Intelligence and Soft Computing Research; 2011, 1, 2; 135-145
2083-2567
2449-6499
Pojawia się w:
Journal of Artificial Intelligence and Soft Computing Research
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Efficiency improvement of switched reluctance generator using optimization techniques
Autorzy:
Reis, M. R. C.
Araújo, W. R. H.
Calixto, W. P.
Powiązania:
https://bibliotekanauki.pl/articles/136169.pdf
Data publikacji:
2017
Wydawca:
EEEIC International Barbara Leonowicz Szabłowska
Tematy:
switched reluctance generator
optimization
control
genetic algorithm
Opis:
This article introduces the switched reluctance machine operating as a generator. This kind of electrical machine delivers CC power at the output and the energy generated can be controlled through several variables. In this work, the switching angles of the machine's power converter are optimized using deterministic and heuristic techniques so that the output power is kept constant via PI controller while guaranteeing maximum value for machine performance, even for different excitation values and mechanical power on the shaft.
Źródło:
Transactions on Environment and Electrical Engineering; 2017, 2, 1; 74-80
2450-5730
Pojawia się w:
Transactions on Environment and Electrical Engineering
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Finding optimal of the Egyptian second nuclear reactor core patterns using genetic algorithm
Autorzy:
El-Sayed Wahed, M.
Ibrahim, W. Z.
Powiązania:
https://bibliotekanauki.pl/articles/148570.pdf
Data publikacji:
2010
Wydawca:
Instytut Chemii i Techniki Jądrowej
Tematy:
reloading fuel management
nuclear reactor
genetic algorithm
Opis:
The second Egyptian research reactor ETRR-2 went critical on the 27th of November 1997. The National Center of Nuclear Safety and Radiation Control (NCNSRC) has the responsibility of the evaluation and the assessment of the safety of this reactor. Fuel management reloads for Egypt’s second research reactor have been carried out according to the fuel management scheme suggested by the reactor designer (INVAP). The start up core consists of three different fuel types, while the equilibrium core has only one fuel type called standard fuel. The fuel management scheme consists in considering the core as being partitioned into eight zones. Each zone will correspond to a chain of fuel movements. In each fuel cycle two of these chains will be involved, in which eight fuel elements will be moved, from them two spent fuel elements will be extracted and two fresh fuel elements will be inserted in the core. In this paper we solve a model as a one big nonlinear multi objective discrete optimization problem using genetic algorithm. Results are compared with INVAP values.
Źródło:
Nukleonika; 2010, 55, 3; 331-338
0029-5922
1508-5791
Pojawia się w:
Nukleonika
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Method of availability control of the transport means
Autorzy:
Woropay, M.
Migawa, K.
Neubauer, A.
Powiązania:
https://bibliotekanauki.pl/articles/247367.pdf
Data publikacji:
2013
Wydawca:
Instytut Techniczny Wojsk Lotniczych
Tematy:
semi-Markov processes
control decisions
genetic algorithm
Opis:
The problems presented in this article deal with operation and maintenance process control in complex systems of technical object operation and maintenance. The article presents the description of the method concerning the control availability for technical objects (means of transport) on the basis of the mathematical model of the operation and maintenance process with the implementation of the decisive processes by semi-Markov. The presented method means focused on the preparing the decisive for the operation and maintenance process for technical objects (semi-Markov model) and after that specifying the best control strategy (optimal strategy) from among possible decisive variants in accordance with the approved criterion (criteria) of the activity evaluation of the system of technical objects operation and maintenance. In the presented method specifying the optimal strategy for control availability in the technical objects means a choice of a sequence of control decisions made in individual states of modelled operation and maintenance process for which the function being a criterion of evaluation reaches the extreme value. In order to choose the optimal control strategy the implementation of the genetic algorithm was chosen. Depending on one’s needs, the genetic algorithm including the obtained model of operation and maintenance process may be implemented for mathematic formulation and solution of a wide array of problems connected with control of complex systems of technical object operation and maintenance. It pertains mostly to the economic analysis, safety management and controlling availability and reliability of complex systems. The opinions were presented on the example of the operation and maintenance process of the means of transport implemented in the real system of the bus municipal transport.
Źródło:
Journal of KONES; 2013, 20, 4; 485-492
1231-4005
2354-0133
Pojawia się w:
Journal of KONES
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Hybrid genetic algorithm for bi-criteria objectives in scheduling process
Autorzy:
Raghavendra, B. V.
Powiązania:
https://bibliotekanauki.pl/articles/407393.pdf
Data publikacji:
2020
Wydawca:
Polska Akademia Nauk. Czytelnia Czasopism PAN
Tematy:
multi-criteria decision
genetic algorithm
Pareto method
Opis:
Scheduling of multiobjective problems has gained the interest of the researchers. Past many decades, various classical techniques have been developed to address the multiobjective problems, but evolutionary optimizations such as genetic algorithm, particle swarm, tabu search method and many more are being successfully used. Researchers have reported that hybrid of these algorithms has increased the efficiency and effectiveness of the solution. Genetic algorithms in conjunction with Pareto optimization are used to find the best solution for bi-criteria objectives. Numbers of applications involve many objective functions, and application of the Pareto front method may have a large number of potential solutions. Selecting a feasible solution from such a large set is difficult to arrive the right solution for the decision maker. In this paper Pareto front ranking method is proposed to select the best parents for producing offspring’s necessary to generate the new populations sets in genetic algorithms. The bi-criteria objectives minimizing the machine idleness and penalty cost for scheduling process is solved using genetic algorithm based Pareto front ranking method. The algorithm is coded in Matlab, and simulations were carried out for the crossover probability of 0.6, 0.7, 0.8, and 0.9. The results obtained from the simulations are encouraging and consistent for a crossover probability of 0.6.
Źródło:
Management and Production Engineering Review; 2020, 11, 2; 107-112
2080-8208
2082-1344
Pojawia się w:
Management and Production Engineering Review
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Location allocation planning of logistics depots using genetic algorithm
Autorzy:
Ren, Y.
Awasthi, A.
Powiązania:
https://bibliotekanauki.pl/articles/409437.pdf
Data publikacji:
2012
Wydawca:
Politechnika Poznańska. Wydawnictwo Politechniki Poznańskiej
Tematy:
genetic algorithm
location-allocation problem
logistics planning
Opis:
Location planning of logistics depots and customer allocation are important decisions in supply chain network design. A carefully planned network design positively impacts the economics of business organizations and their competitivity in national and international markets. In this paper, we present a genetic algorithm based approach for solving location allocation planning problem of logistics depots. The problem is solved considering multiple criteria such as minimal distance, travel cost, travel time etc. A numerical application is provided to demonstrate the proposed approach.
Źródło:
Research in Logistics & Production; 2012, 2, 3; 247-257
2083-4942
2083-4950
Pojawia się w:
Research in Logistics & Production
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Genetic algorithm for clustering, finding the number of clusters
Autorzy:
Śmigielski, Piotr
Powiązania:
https://bibliotekanauki.pl/articles/1373528.pdf
Data publikacji:
2011
Wydawca:
Uniwersytet Jagielloński. Wydawnictwo Uniwersytetu Jagiellońskiego
Tematy:
genetic algorithm
clustering
variable length chromosome
cube
Opis:
In this paper a genetic algorithm for clustering is proposed. The algorithm is based on the variable length chromosomes and the notion of local points density in the clustered set. Its role is to identify the number of clusters in the clustered set and to partition this set into particular clusters. The tests were conducted for two different sets of two dimensional data. The algorithm performed well in both cases. The tests presented the ability of the algorithm to partition the subsets combined with the thin dense area into separate clusters.
Źródło:
Schedae Informaticae; 2011, 20; 101-113
0860-0295
2083-8476
Pojawia się w:
Schedae Informaticae
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Specialized genetic algorithm based simulation tool designed for malware evolution forecasting
Autorzy:
Juzonis, V.
Goranin, N.
Cenys, A.
Olifer, D.
Powiązania:
https://bibliotekanauki.pl/articles/106146.pdf
Data publikacji:
2012
Wydawca:
Uniwersytet Marii Curie-Skłodowskiej. Wydawnictwo Uniwersytetu Marii Curie-Skłodowskiej
Tematy:
genetic algorithm
malware
mobile malware
information security
Opis:
From the security point of view malware evolution forecasting is very important, since it provides an opportunity to predict malware epidemic outbreaks, develop effective countermeasure techniques and evaluate information security level. Genetic algorithm approach for mobile malware evolution forecasting already proved its effectiveness. There exists a number of simulation tools based on the Genetic algorithms, that could be used for malware forecasting, but their main disadvantages from the user’s point of view is that they are too complicated and can not fully represent the security entity parameter set. In this article we describe the specialized evolution forecasting simulation tool developed for security entities, such as different types of malware, which is capable of providing intuitive graphical interface for users and ensure high calculation performance. Tool applicability for the evolution forecasting tasks is proved by providing mobile malware evolution forecasting results and comparing them with the results we obtained in 2010 by means of MATLAB.
Źródło:
Annales Universitatis Mariae Curie-Skłodowska. Sectio AI, Informatica; 2012, 12, 4; 23-37
1732-1360
2083-3628
Pojawia się w:
Annales Universitatis Mariae Curie-Skłodowska. Sectio AI, Informatica
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Recognition of the atmospheric contamination source localization with the Genetic Algorithm
Autorzy:
Wawrzynczak, A.
Jaroszynski, M.
Borysiewicz, M.
Powiązania:
https://bibliotekanauki.pl/articles/92891.pdf
Data publikacji:
2015
Wydawca:
Uniwersytet Przyrodniczo-Humanistyczny w Siedlcach
Tematy:
genetic algorithm
source characterization
atmospheric dispersion model
Opis:
We have applied the Genetic Algorithm (GA) to the problem of the atmospheric contaminant source localization. The algorithm input data are concentrations of given substance registered by sensor network. To achieve rapid-response event reconstruction,the fast-running Gaussian plume dispersion model is adopted as the forward model. The proposed GA scans 5-dimensional parameters space searching for the contaminant source coordinates (x,y), release strength (Q) and the atmospheric transport dispersion coefficients. Based on the synthetic experiment data the GA parameters like population size, number of generations and the genetic operators best suitable for the algorithm performance are identified. We demonstrate that proposed GA configuration can successfully point out the parameters of abrupt contamination source. Results indicate the probability of a source to occur at a particular location with a particular release rate. The shapes of the probability distribution function of searched parameters values reflect the uncertainty in observed data.
Źródło:
Studia Informatica : systems and information technology; 2015, 1-2(19); 27-42
1731-2264
Pojawia się w:
Studia Informatica : systems and information technology
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Ship Trajectory Control Optimization in Anti-collision Maneuvering
Autorzy:
Zhang, J. F.
Yang, X. D.
Zhang, D.
Haugen, S.
Powiązania:
https://bibliotekanauki.pl/articles/116373.pdf
Data publikacji:
2013
Wydawca:
Uniwersytet Morski w Gdyni. Wydział Nawigacyjny
Tematy:
anticollision
ship trajectory
genetic algorithm
route optimization
Opis:
A lot of attention is being paid to ship’s intelligent anti‐collision by researchers. Several solutions have been introduced to find an optimum trajectory for ship, such as Game Theory, Genetic or Evolutionary Algorithms and so on. However, ship’s maneuverability should be taken into consideration before their real applications. Ship’s trajectory control in anti‐collision maneuvering is studied in this paper. At first, a simple linear ship maneuverability model is introduced to simulate its movement under different speed and rudder angle. After that, ship’s trajectory control is studied by considering the duration of rudder, operation distance to turning points, and maximum angular velocity. The details for algorithm design are also introduced. By giving some restrictions according to the requirements from COLREGs, the intervals for rudder angle in different circumstances can be determined based on the curves. The results can give very meaningful guidance for seafarers when making decisions.
Źródło:
TransNav : International Journal on Marine Navigation and Safety of Sea Transportation; 2013, 7, 1; 89-93
2083-6473
2083-6481
Pojawia się w:
TransNav : International Journal on Marine Navigation and Safety of Sea Transportation
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Selection of working database for the genetic algorithm processing data of exchange quotations
Autorzy:
Wojarnik, G.
Powiązania:
https://bibliotekanauki.pl/articles/95141.pdf
Data publikacji:
2016
Wydawca:
Szkoła Główna Gospodarstwa Wiejskiego w Warszawie. Wydawnictwo Szkoły Głównej Gospodarstwa Wiejskiego w Warszawie
Tematy:
databases
genetic algorithm
database performance
stock exchange
Opis:
The aim of this article is to carry out a comparative analysis of the performance of databases: SQLite, MS SQL Server 2014, Firebird 2.5 Server and Firebird 2.5 Embedded with the use of the object-relational mapping library ServiceStack.Ormlite and IDBCommand interface in Visual Studio with the use of C# programming language within the framework of .Net Framework 4.5 platform. The selected database will serve in the future as a data store for the operation of a genetic algorithm, which role will be processing of stock market data. Test data is daily data of stock quotations of the stock exchange downloaded from bossa.pl on 6.06.2015.
Źródło:
Information Systems in Management; 2016, 5, 2; 294-304
2084-5537
2544-1728
Pojawia się w:
Information Systems in Management
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Passive loop coordinates optimization for mitigation of magnetic field value in the proximity of a power line
Autorzy:
Książkiewicz, M.
Powiązania:
https://bibliotekanauki.pl/articles/97704.pdf
Data publikacji:
2015
Wydawca:
Politechnika Poznańska. Wydawnictwo Politechniki Poznańskiej
Tematy:
power line
magnetic field
optimization
genetic algorithm
Opis:
The paper relates to the distribution of the magnetic field generated by the overhead power line, and it’s reduction in the area of interest using a conductive loop placed in the space near the line. The paper presents results obtained from an original program written in C ++, which implements the procedure for calculating the magnetic field generated by overhead line and a genetic algorithm used to optimize the location and loop compensation factor. Examples of the program are presented for horizontal single-track line and three different shielding loop configurations. The first relates to a single loop (4 to 5 parameters to optimize - 4 position coordinates (y, z) and the compensation factor), the second case involves two loops with one common conductor (6 to 8 parameters - 6 coordinates (y, z) and 0 to 2 compensation factors), the third case concerns two independent loops (8 to 10 parameters - 8 coordinates (y, z) and 0 to 2 of the compensation factors). In addition similar calculations are performed for single-track line with two earth wires.
Źródło:
Computer Applications in Electrical Engineering; 2015, 13; 77-87
1508-4248
Pojawia się w:
Computer Applications in Electrical Engineering
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Sustainable coal supply chain management using exergy analysis and genetic algorithm
Autorzy:
Naderi, Reihaneh
Shafiei-Nikabadi, Mohsen
Alem-Tabriz, Akbar
Pishvaee, Mir Saman
Powiązania:
https://bibliotekanauki.pl/articles/1537782.pdf
Data publikacji:
2021
Wydawca:
STE GROUP
Tematy:
coal supply chain
exergy
genetic algorithm
sustainability
Opis:
Environmental threats of coal usage in the electricity production combined with the consumption of renewable and non-renewable resources had led to worldwide energy challenges. The cost of coal mining and economical and environmentally sustainable usage of mined coal could be optimized by efficient management of coal supply chain. This paper provides a mathematical model for improving coal supply chain sustainability including the cost of exergy destruction (entropy). In the proposed method, exergy analysis is used to formulate the model considering not only economic costs but also destructed exergy cost, while genetic algorithm is applied to efficiently solve the proposed model. In order to validate the proposed methodology, some numerical examples of coal supply chains are presented and discussed to show the usability of the proposed exergetic coal supply chain model and claim its benefits over the existing models. According to the results, the proposed method provides 17.6% saving in the consumed exergy by accepting 2.7% more economic costs. The presented model can be used to improve the sustainability of coal supply chain for either designing new projects or upgrading existing processes.
Źródło:
Management Systems in Production Engineering; 2021, 1 (29); 44-53
2299-0461
Pojawia się w:
Management Systems in Production Engineering
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Optimization the dynamical parameters of three phase induction motor using genetic algorithm
Autorzy:
Mohammed, M.H.
Powiązania:
https://bibliotekanauki.pl/articles/376222.pdf
Data publikacji:
2012
Wydawca:
Politechnika Poznańska. Wydawnictwo Politechniki Poznańskiej
Tematy:
induction motor
genetic algorithm
differential evolution
DE
Opis:
This paper deals with the optimization of the induction motor design with respect to torque as a dynamical parameter. Most studies on the design of an induction motor using optimization techniques are concerned with the minimization of the motor cost and describe the optimization technique that was employed, giving the results of a single (or several) optimal design(s).Procedure includes the relationship between torque of motor and other effects as they occur in an optimal design. The optimization method that was used in this paper is Differential Evolution as genetic algorithm. Optimal results are in picture as curves or in tabula.
Źródło:
Poznan University of Technology Academic Journals. Electrical Engineering; 2012, 72; 123-128
1897-0737
Pojawia się w:
Poznan University of Technology Academic Journals. Electrical Engineering
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Optimizing the number of docks at transhipment terminals using genetic algorithm
Autorzy:
Izdebski, M.
Jacyna-Gołda, I.
Powiązania:
https://bibliotekanauki.pl/articles/242009.pdf
Data publikacji:
2017
Wydawca:
Instytut Techniczny Wojsk Lotniczych
Tematy:
transhipment terminal
genetic algorithm
optimization
cross docking
Opis:
This article presents the issue of designating the number of docks at the transhipment terminals using genetic algorithm. Transhipment terminals refer to cross-docking terminals. The main factor that influences on the number of these docks is the stream of cargo flowing into the given terminal. In order to determine this flow of cargo the mathematical model of the distribution of this flow was developed. This model takes into account constraints like those that e.g. processing capacity at the transhipment terminal cannot be exceeded or demand of recipients must be met. The criterion function in this model determines the minimum cost of the flow of cargo between all objects in the transport network. To designate the optimal stream of cargo flowing into the transport network the genetic algorithm was developed. In this article, the stages of construction of this algorithm were presented. The structure processed by the algorithm, the process of crossover and mutation were described. In the article in order to solve the problem of designating the number of docks at the transhipment terminals the genetic algorithm was developed.
Źródło:
Journal of KONES; 2017, 24, 4; 369-376
1231-4005
2354-0133
Pojawia się w:
Journal of KONES
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
An Assessment of High-Order-Mode Analysis and Shape Optimization of Expansion Chamber Mufflers
Autorzy:
Chiu, M. C.
Chang, Y. C.
Powiązania:
https://bibliotekanauki.pl/articles/178079.pdf
Data publikacji:
2014
Wydawca:
Polska Akademia Nauk. Czytelnia Czasopism PAN
Tematy:
higher order wave
eigenfunction
optimization
genetic algorithm
Opis:
A substantial quantity of research on muffler design has been restricted to a low frequency range using the plane wave theory. Based on this theory, which is a one-dimensional wave, no higher order wave has been considered. This has resulted in underestimating acoustical performances at higher frequencies when doing muffler analysis via the plane wave model. To overcome the above drawbacks, researchers have assessed a three-dimensional wave propagating for a simple expansion chamber muffler. Therefore, the acoustic effect of a higher order wave (a high frequency wave) is considered here. Unfortunately, there has been scant research on expansion chamber mufflers equipped with baffle plates that enhance noise elimination using a higher-order-mode analysis. Also, space-constrained conditions of industrial muffler designs have never been properly addressed. So, in order to improve the acoustical performance of an expansion chamber muffler within a constrained space, the optimization of an expansion chamber muffler hybridized with multiple baffle plates will be assessed. In this paper, the acoustical model of the expansion chamber muffler will be established by assuming that it is a rigid rectangular tube driven by a piston along the tube wall. Using an eigenfunction (higher- order-mode analysis), a four-pole system matrix for evaluating acoustic performance (STL) is derived. To improve the acoustic performance of the expansion chamber muffler, three kinds of expansion chamber mufflers (KA-KC) with different acoustic mechanisms are introduced and optimized for a targeted tone using a genetic algorithm (GA). Before the optimization process is performed, the higher-order-mode mathematical models of three expansion chamber mufflers (A-C) with various allocations of inlets/outlets and various chambers are also confirmed for accuracy. Results reveal that the STL of the expansion chamber mufflers at the targeted tone has been largely improved and the acoustic performance of a reverse expansion chamber muffler is more efficient than that of a straight expansion chamber muffler. Moreover, the STL of the expansion chamber mufflers will increase as the number of the chambers that separate with baffles increases.
Źródło:
Archives of Acoustics; 2014, 39, 4; 489-499
0137-5075
Pojawia się w:
Archives of Acoustics
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Beam Pattern Optimization Via Unequal Ascending Clusters
Autorzy:
Abdulqader, Ahmed Jameel
Mohammed, Jafar Ramadhan
Ali, Yessar E. Mohammad
Powiązania:
https://bibliotekanauki.pl/articles/2200966.pdf
Data publikacji:
2023
Wydawca:
Instytut Łączności - Państwowy Instytut Badawczy
Tematy:
beam pattern
clustered array
genetic algorithm
sidelobes
Opis:
In this paper, two different architectures based on completely and sectionally clustered arrays are proposed to improve the array patterns. In the wholly clustered arrays, all elements of the ordinary array are divided into multiple unequal ascending clusters. In the sectionally clustered arrays, two types of architectures are proposed by dividing a part of the array into clusters based on the position of specific elements. In the first architecture of sectionally clustered arrays, only those elements that are located on the sides of the array are grouped into unequal ascending clusters, and other elements located in the center are left as individual and unoptimized items (i.e. uniform excitation). In the second architecture, only some of the elements close the center are grouped into unequal ascending clusters, and the side elements were left individually and without optimization. The research proves that the sectionally clustered architecture has many advantages compared to the completely clustered structure, in terms of the complexity of the solution. Simulation results show that PSLL in the side clustered array can be reduced to more than −28 dB for an array of 40 elements. The PSLL was −17 dB in the case of a centrally clustered array, whereas the complexity percentage in the wholly clustered array method was 12 .5 %, while the same parameter for the partially clustered array method equaled 10%.
Źródło:
Journal of Telecommunications and Information Technology; 2023, 1; 1--7
1509-4553
1899-8852
Pojawia się w:
Journal of Telecommunications and Information Technology
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
A generative approach to hull design for a small watercraft
Autorzy:
Karczewski, Artur
Kozak, Janusz
Powiązania:
https://bibliotekanauki.pl/articles/32917891.pdf
Data publikacji:
2023
Wydawca:
Politechnika Gdańska. Wydział Inżynierii Mechanicznej i Okrętownictwa
Tematy:
method
generative design
yacht
optimisation
genetic algorithm
Opis:
In the field of ocean engineering, the task of spatial hull modelling is one of the most complicated problems in ship design. This study presents a procedure applied as a generative approach to the design problems for the hull geometry of small vessels using elements of concurrent design with multi-criteria optimisation processes. Based upon widely available commercial software, an algorithm for the mathematical formulation of the boundary conditions, the data flow during processing and formulae for the optimisation processes are developed. As an example of the application of this novel approach, the results for the hull design of a sailing yacht are presented.
Źródło:
Polish Maritime Research; 2023, 1; 4-12
1233-2585
Pojawia się w:
Polish Maritime Research
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Embryonic Architecture with Built-in Self-test and GA Evolved Configuration Data
Autorzy:
Malhotra, Gayatri
Duraiswamy, Punithavathi
Kishore, J.K.
Powiązania:
https://bibliotekanauki.pl/articles/27311869.pdf
Data publikacji:
2023
Wydawca:
Polska Akademia Nauk. Czasopisma i Monografie PAN
Tematy:
embryonic
BIST
Self-test
Genetic Algorithm
Cartesian Genetic Programming
Opis:
The embryonic architecture, which draws inspiration from the biological process of ontogeny, has built-in mechanisms for self-repair. The entire genome is stored in the embryonic cells, allowing the data to be replicated in healthy cells in the event of a single cell failure in the embryonic fabric. A specially designed genetic algorithm (GA) is used to evolve the configuration information for embryonic cells. Any failed embryonic cell must be indicated via the proposed Built-in Selftest (BIST) the module of the embryonic fabric. This paper recommends an effective centralized BIST design for a novel embryonic fabric. Every embryonic cell is scanned by the proposed BIST in case the self-test mode is activated. The centralized BIST design uses less hardware than if it were integrated into each embryonic cell. To reduce the size of the data, the genome or configuration data of each embryonic cell is decoded using Cartesian Genetic Programming (CGP). The GA is tested for the 1-bit adder and 2-bit comparator circuits that are implemented in the embryonic cell. Fault detection is possible at every function of the cell due to the BIST module’s design. The CGP format can also offer gate-level fault detection. Customized GA and BIST are combined with the novel embryonic architecture. In the embryonic cell, self-repair is accomplished via data scrubbing for transient errors.
Źródło:
International Journal of Electronics and Telecommunications; 2023, 69, 2; 211--217
2300-1933
Pojawia się w:
International Journal of Electronics and Telecommunications
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Implementing evolutionary algorithm into training single-layer artificial neural network in classification task
Autorzy:
Płaczek, S.
Powiązania:
https://bibliotekanauki.pl/articles/95001.pdf
Data publikacji:
2016
Wydawca:
Szkoła Główna Gospodarstwa Wiejskiego w Warszawie. Wydawnictwo Szkoły Głównej Gospodarstwa Wiejskiego w Warszawie
Tematy:
genetic algorithm
evolutionary algorithm
selection process
mutation
recombination
replacement
Opis:
The article proposes implementing a modified version of genetic algorithm in a neural network, what in literature is known as “evolutionary algorithm” or “evolutionary programming”. An Evolutionary Algorithm is a probabilistic algorithm that works in a set of weight variability of neurons and seeks the optimal value solution within a population of individuals, avoiding the local maximum. For chromosomes the real value variables and matrix structure are proposed to a single-layer neural network. Particular emphasis is put on mutation and crossover algorithms. What is also important in both genetic and evolutionary algorithms is the selection process. In the calculation example, the implementation of theoretical considerations to a classification task is demonstrated.
Źródło:
Information Systems in Management; 2016, 5, 3; 377-388
2084-5537
2544-1728
Pojawia się w:
Information Systems in Management
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Optimization of a modular neural network for pattern recognition using parallel genetic algorithm
Autorzy:
Cárdenas, M.
Melin, P.
Cruz, L.
Powiązania:
https://bibliotekanauki.pl/articles/384887.pdf
Data publikacji:
2011
Wydawca:
Sieć Badawcza Łukasiewicz - Przemysłowy Instytut Automatyki i Pomiarów
Tematy:
modular neural networks
parallel genetic algorithm
multi-core
Opis:
In this paper, the implementation of a Parallel Genetic Algorithm (PGA) for the training stage, and the optimi zation of a monolithic and modular neural network, for pattern recognition are presented. The optimization con sists in obtaining the best architecture in layers, and neu rons per layer achieving the less training error in a shor ter time. The implementation was performed in a multicore architecture, using parallel programming techniques to exploit its resources. We present the results obtained in terms of performance by comparing results of the training stage for sequential and parallel implementations.
Źródło:
Journal of Automation Mobile Robotics and Intelligent Systems; 2011, 5, 1; 77-84
1897-8649
2080-2145
Pojawia się w:
Journal of Automation Mobile Robotics and Intelligent Systems
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
The genetic fuzzy based proactive maintenance of a technical object
Autorzy:
Smoczek, J.
Szpytko, J.
Powiązania:
https://bibliotekanauki.pl/articles/246817.pdf
Data publikacji:
2012
Wydawca:
Instytut Techniczny Wojsk Lotniczych
Tematy:
proactive maintenance
failure prediction
fuzzy logic
genetic algorithm
Opis:
The proactive maintenance is an effective approach to enhance the system availability through real time monitoring the current state of a system. The key part of this method is forecasting the nonoperational states for advanced warning of the failure possibility that can bring the attention of machines operators and maintenance personnel to impending danger facilitate planning preventive and corrective operations, and resources managing as well. The paper presents the HMI/SCADA-type application used to support decision-making process. The proposed approach to proactive maintenance is based on forecasting the remaining useful life of device equipment and delivering the user-defined maintenance strategy developed during system operation. The HMI/SCADA application is used to collect data in form of failures history, changes of operational conditions and performances of a monitored process between failures, as well as heuristic knowledge about process created by experienced user. The data history is used to design the predictive fuzzy models of time between failures of system equipment. The fuzzy predictive models are designed using the genetic algorithm applied to optimize the fuzzy partitions covering the training data examples, as well as to identify fuzzy predictive patterns represented by a set of rules in the knowledge base. The evolutionary learning strategy, which has been proposed in this paper, provides the effective reproduction techniques for searching the solution space with respect to optimization of knowledge base and membership functions according to the fitness function expressed as a ratio of compatibility of fuzzy partitions with data examples to root mean squares error. The proposed application was created and tested on the laboratory stand for monitoring the availability of the overhead travelling crane.
Źródło:
Journal of KONES; 2012, 19, 3; 399-405
1231-4005
2354-0133
Pojawia się w:
Journal of KONES
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Genetic algorithm for solving celestial navigation fix problems
Autorzy:
Tsou, Ming-Cheng
Powiązania:
https://bibliotekanauki.pl/articles/963415.pdf
Data publikacji:
2012
Wydawca:
Politechnika Gdańska. Wydział Inżynierii Mechanicznej i Okrętownictwa
Tematy:
genetic algorithm
celestial navigation
intercept method
celestial fix
Opis:
As we enter the 21st century and advance further into the information age, traditional methods for computing a celestial navigation fix can no longer meet the requirements of modern vessels in terms of calculation speed and precision. Study of precise, rapid, and convenient celestial navigation computational methods and the application of information technology to modern celestial navigation is especially meaningful, considering the current push for e-Navigation. In this work, we employ a genetic algorithm, from the field of artificial intelligence, due to its superior search ability that mimics the natural process of biological evolution. Unique encodings and genetic operators designed in this study, in combination with the fix principle of celestial circles of equal altitude in celestial navigation, allow the rapid and direct attainment of accurate optimum vessel position. Test results indicate that this method has more flexibility, and avoids tedious and complicated computation and graphical procedures.
Źródło:
Polish Maritime Research; 2012, 3; 53-59
1233-2585
Pojawia się w:
Polish Maritime Research
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Planning and management of aircraft maintenance using a genetic algorithm
Autorzy:
Kowalski, Mirosław
Izdebski, Mariusz
Żak, Jolanta
Gołda, Paweł
Manerowski, Jerzy
Powiązania:
https://bibliotekanauki.pl/articles/1841824.pdf
Data publikacji:
2021
Wydawca:
Polska Akademia Nauk. Polskie Naukowo-Techniczne Towarzystwo Eksploatacyjne PAN
Tematy:
aircraft operation
maintenance
multi-criteria optimization
genetic algorithm
Opis:
The aim of the article was to develop a tool to support the process of planning and managing aircraft (ac) maintenance. Aircraft maintenance management has been presented for scheduled technical inspections resulting from manufacturers’ technical documentation for ac. The authors defined the problem under investigation in the form of a four-phase decisionmaking process taking into account assignment of aircraft to airports and maintenance stations, assignment of crew to maintenance points, setting the schedules, i.e. working days on which aircraft are directed to maintenance facilities. This approach to the planning and management of aircraft maintenance is a new approach, unprecedented in the literature. The authors have developed a mathematical model for aircraft maintenance planning and management in a multi-criteria approach and an optimisation tool based on the operation of a genetic algorithm. To solve the problem, a genetic algorithm was proposed. The individual steps of the algorithm construction were discussed and its effectiveness was verified using real data.
Źródło:
Eksploatacja i Niezawodność; 2021, 23, 1; 143-153
1507-2711
Pojawia się w:
Eksploatacja i Niezawodność
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Recognizing Sets in Evolutionary Multiobjective Optimization
Autorzy:
Gajda-Zagórska, E.
Powiązania:
https://bibliotekanauki.pl/articles/308467.pdf
Data publikacji:
2012
Wydawca:
Instytut Łączności - Państwowy Instytut Badawczy
Tematy:
basin of attraction
clustering
genetic algorithm
multiobjective optimization
Opis:
Among Evolutionary Multiobjective Optimization Algorithms (EMOA) there are many which find only Paretooptimal solutions. These may not be enough in case of multimodal problems and non-connected Pareto fronts, where more information about the shape of the landscape is required. We propose a Multiobjective Clustered Evolutionary Strategy (MCES) which combines a hierarchic genetic algorithm consisting of multiple populations with EMOA rank selection. In the next stage, the genetic sample is clustered to recognize regions with high density of individuals. These regions are occupied by solutions from the neighborhood of the Pareto set. We discuss genetic algorithms with heuristic and the concept of well-tuning which allows for theoretical verification of the presented strategy. Numerical results begin with one example of clustering in a single-objective benchmark problem. Afterwards, we give an illustration of the EMOA rank selection in a simple two-criteria minimization problem and provide results of the simulation of MCES for multimodal, multi-connected example. The strategy copes with multimodal problems without losing local solutions and gives better insight into the shape of the evolutionary landscape. What is more, the stability of solutions in MCES may be analyzed analytically.
Źródło:
Journal of Telecommunications and Information Technology; 2012, 1; 74-82
1509-4553
1899-8852
Pojawia się w:
Journal of Telecommunications and Information Technology
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Nash-lambda algorithm with applications in safety and reliability
Autorzy:
Cui, Y.
Guo, R.
Powiązania:
https://bibliotekanauki.pl/articles/2069567.pdf
Data publikacji:
2011
Wydawca:
Uniwersytet Morski w Gdyni. Polskie Towarzystwo Bezpieczeństwa i Niezawodności
Tematy:
lambda algorithm
Nash equilibrium
genetic algorithm
safety
reliability
terrorist threa
Opis:
In this paper, a new algorithm, named as Nash-lambda algorithm by merging Nash equilibrium solution and the lambda algorithm, is proposed. The lambda algorithm, a new global optimization algorithm, is created by imitating ancient Chinese human body system model, which has already demonstrated its simplicity in searching scheme, codes and efficiency in computation comparing to the genetic algorithm. The noncorporative game environments determine the optimization problems which are different from those of the traditional safety and reliability optimizations because of the engagement of the Nash equilibrium for seeking the best strategy. The lambda algorithm serves the searching the Nash equilibrium solution efficiently. In other worlds, the Nash-lambda algorithm is just developed to address the optimization problems of the multiple objective functions representing non-corporative players’ interests.
Źródło:
Journal of Polish Safety and Reliability Association; 2011, 2, 1; 51--58
2084-5316
Pojawia się w:
Journal of Polish Safety and Reliability Association
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Lambda algorithm and maximum likelihood estimation
Autorzy:
Cui, Y.
Guo, R.
Guo, D.
Powiązania:
https://bibliotekanauki.pl/articles/2069616.pdf
Data publikacji:
2011
Wydawca:
Uniwersytet Morski w Gdyni. Polskie Towarzystwo Bezpieczeństwa i Niezawodności
Tematy:
lambda algorithm
genetic algorithm
reliability
repairable system
likelihood-lambda procedure
Opis:
In this paper, a new global optimization algorithm by imitating ancient Chinese human body system model, named as lambda algorithm, is introduced. The lambda algorithm utilizes five-element multi-segment string to represent the n-dimensional Euclidean point and hence the string based operation rules for expansion, comparison and sorting candidate strings. The algorithm enjoys the simplest mathematical operations but generates highest searching speed and accuracy. We furthermore explore to merge the lambda algorithm with maximum likelihood procedure for creating a non-derivative scheme – likelihood- lambda procedure. A illustrative example is given.
Źródło:
Journal of Polish Safety and Reliability Association; 2011, 2, 1; 59--72
2084-5316
Pojawia się w:
Journal of Polish Safety and Reliability Association
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Image reconstruction with the use of evolutionary algorithms and cellular automata
Autorzy:
Seredyński, F.
Skaruz, J.
Piraszewski, A.
Powiązania:
https://bibliotekanauki.pl/articles/106216.pdf
Data publikacji:
2012
Wydawca:
Uniwersytet Marii Curie-Skłodowskiej. Wydawnictwo Uniwersytetu Marii Curie-Skłodowskiej
Tematy:
image reconstruction
evolution algorithms
cellular automata
genetic algorithm
Opis:
In the paper we present a new approach to the image reconstruction problem based on evolution algorithms and cellular automata. Two-dimensional, nine state cellular automata with the Moore neighbourhood perform reconstruction of an image presenting a human face. Large space of automata rules is searched through efficiently by the genetic algorithm (GA), which finds a good quality rule. The experimental results show that the obtained rule allows to reconstruct an image with even 70% damaged pixels. Moreover, we show that the rule found in the genetic evolution process can be applied to the reconstruction of images of the same class but not presented during the evolutionary one.
Źródło:
Annales Universitatis Mariae Curie-Skłodowska. Sectio AI, Informatica; 2012, 12, 4; 39-49
1732-1360
2083-3628
Pojawia się w:
Annales Universitatis Mariae Curie-Skłodowska. Sectio AI, Informatica
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Hyper-heuristics for power-aware routing protocols
Autorzy:
Pilski, M.
Seredynski, F.
Powiązania:
https://bibliotekanauki.pl/articles/92944.pdf
Data publikacji:
2008
Wydawca:
Uniwersytet Przyrodniczo-Humanistyczny w Siedlcach
Tematy:
protocols
ad hoc networks
genetic algorithm
hyper-heuristics
Opis:
The idea underlying hyper-heuristics is to discover some combination of straightforward heuristics that performs very well across a whole range of problems. In this paper we describe genetic algorithm-based (GA) approach that learns such a heuristic combination for solving energy-efficient routing problem in mobile ad hoc networks (MANETs).
Źródło:
Studia Informatica : systems and information technology; 2008, 2(11); 37-47
1731-2264
Pojawia się w:
Studia Informatica : systems and information technology
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Optimising a fuzzy fault classification tree by a single-objective genetic algorithm
Autorzy:
Zio, E.
Baraldi, P.
Popescu, I. C.
Powiązania:
https://bibliotekanauki.pl/articles/2069595.pdf
Data publikacji:
2007
Wydawca:
Uniwersytet Morski w Gdyni. Polskie Towarzystwo Bezpieczeństwa i Niezawodności
Tematy:
fault classification
decision tree
fuzzy logic
genetic algorithm
Opis:
In this paper a single-objective Genetic Algorithm is exploited to optimise a Fuzzy Decision Tree for fault classification. The optimisation procedure is presented with respect to an ancillary classification problem built with artificial data. Work is in progress for the application of the proposed approach to a real fault classification problem.
Źródło:
Journal of Polish Safety and Reliability Association; 2007, 2; 391--400
2084-5316
Pojawia się w:
Journal of Polish Safety and Reliability Association
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Use of computer assistance in order to designate the tasks in the municipal services companies
Autorzy:
Izdebski, M.
Jacyna, M.
Powiązania:
https://bibliotekanauki.pl/articles/241863.pdf
Data publikacji:
2014
Wydawca:
Instytut Techniczny Wojsk Lotniczych
Tematy:
municipal services companies
transport
optimization
genetic algorithm
verification
Opis:
In this article, the method of designating the tasks in the municipal services companies was described. Presented method consists of three phase: the preparatory phase, the optimization phase and the generated tasks phase. Each phase was characterized. In this paper, the mathematical model of this problem was presented. The function of criterion and the condition on designating the tasks were defined. The minimum route described in the optimization phase was designated by the genetic algorithm. In this paper, the stages of constructing of the genetic algorithm were presented. A structure of the data processed by the algorithm, a function of adaptation, a selection of chromosomes, a crossover, a mutation and an inversion were characterized. A structure of the data was presented as string of natural numbers. In selection process, the roulette method was used and in the crossover, process the operator PMX was presented. The method was verified in programming language C #. The process of verification was divided into two stages. In the first stage, the best parameters of the genetics algorithm were designated. In the second stage, the algorithm was started with these parameters and the result was compared with the random search algorithm. The random search algorithm generates 2000 routes and the best result is compared with the genetic algorithm. The influence of the inversion, the mutation and the crossover on quality of the results was examined.
Źródło:
Journal of KONES; 2014, 21, 2; 105-112
1231-4005
2354-0133
Pojawia się w:
Journal of KONES
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Cabin placement layout optimisation based on systematic layout planning and genetic algorithm
Autorzy:
Su, Shaojuan
Zheng, Yasai
Xu, Jinan
Wang, Tianlin
Powiązania:
https://bibliotekanauki.pl/articles/259974.pdf
Data publikacji:
2020
Wydawca:
Politechnika Gdańska. Wydział Inżynierii Mechanicznej i Okrętownictwa
Tematy:
cabin placement layout
systematic layout planning
genetic algorithm
Opis:
Cabin placement layout is an important part of ship cabin layout design. A good cabin placement layout can improve the efficiency of the ship’s cabin arrangement. However, optimisation of the layout of cabin placement is not widely studied and more often relies on the experience of the staff. Thus, a novel methodology combining systematic layout planning and a genetic algorithm to optimise the cabin placement is presented in this paper. First key elements are converted by a systematic planning method that is often applied in factory layout, and a preliminary cabin placement layout model is established according to these key elements. Then the circulation strength and adjacency strength are taken as sub-objectives to establish a mathematical model, and an improved genetic algorithm is used to optimise the model. The result of the optimisation is compared with the initial schemes to verify the validity of the algorithm. Finally, the human factors are introduced according to the actual situation. The AHP method is used to select the layout scheme of the cabin that is most likely to be applied in the actual cabin layout.
Źródło:
Polish Maritime Research; 2020, 1; 162-172
1233-2585
Pojawia się w:
Polish Maritime Research
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Research on intelligent avoidance method of shipwreck based on bigdata analysis
Autorzy:
Li, W.
Huang, Q.
Powiązania:
https://bibliotekanauki.pl/articles/260002.pdf
Data publikacji:
2017
Wydawca:
Politechnika Gdańska. Wydział Inżynierii Mechanicznej i Okrętownictwa
Tematy:
big data analysis
shipwreck
intelligent avoidance
genetic algorithm
Opis:
In order to solve the problem that current avoidance method of shipwreck has the problem of low success rate of avoidance, this paper proposes a method of intelligent avoidance of shipwreck based on big data analysis. Firstly,our method used big data analysis to calculate the safe distance of approach of ship under the head-on situation, the crossing situation and the overtaking situation.On this basis, by calculating the risk-degree of collision of ships,our research determined the degree of immediate danger of ships.Finally, we calculated the three kinds of evaluation function of ship navigation, and used genetic algorithm to realize the intelligent avoidance of shipwreck.Experimental result shows that compared the proposed method with the traditional method in two in a recent meeting when the distance to closest point of approach between two ships is 0.13nmile, they can effectively evade.The success rate of avoidance is high.
Źródło:
Polish Maritime Research; 2017, S 3; 113-120
1233-2585
Pojawia się w:
Polish Maritime Research
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Problem-Independent Approach to Multiprocessor Dependent Task Scheduling
Autorzy:
Król, D.
Zydek, D.
Koszałka, L.
Powiązania:
https://bibliotekanauki.pl/articles/226364.pdf
Data publikacji:
2012
Wydawca:
Polska Akademia Nauk. Czytelnia Czasopism PAN
Tematy:
tasks scheduling
DAG
genetic algorithm
tabu search
makespan
Opis:
This paper concerns Directed Acyclic Graph task scheduling on parallel executors. The problem is solved using two new implementations of Tabu Search and genetic algorithm presented in the paper. A new approach to solution coding is also introduced and implemented in both metaheuristics algorithms. Results given by the algorithms are compared to those generated by greedy LPT and SS-FF algorithms; and HAR algorithm. The analysis of the obtained results of multistage simulation experiments confirms the conclusion that the proposed and implemented algorithms are characterized by very good performance and characteristics.
Źródło:
International Journal of Electronics and Telecommunications; 2012, 58, 4; 369-379
2300-1933
Pojawia się w:
International Journal of Electronics and Telecommunications
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Planning and management of aircraft maintenance using a genetic algorithm
Autorzy:
Kowalski, Mirosław
Izdebski, Mariusz
Żak, Jolanta
Gołda, Paweł
Manerowski, Jerzy
Powiązania:
https://bibliotekanauki.pl/articles/1841765.pdf
Data publikacji:
2021
Wydawca:
Polska Akademia Nauk. Polskie Naukowo-Techniczne Towarzystwo Eksploatacyjne PAN
Tematy:
aircraft operation
maintenance
multi-criteria optimization
genetic algorithm
Opis:
The aim of the article was to develop a tool to support the process of planning and managing aircraft (ac) maintenance. Aircraft maintenance management has been presented for scheduled technical inspections resulting from manufacturers’ technical documentation for ac. The authors defined the problem under investigation in the form of a four-phase decisionmaking process taking into account assignment of aircraft to airports and maintenance stations, assignment of crew to maintenance points, setting the schedules, i.e. working days on which aircraft are directed to maintenance facilities. This approach to the planning and management of aircraft maintenance is a new approach, unprecedented in the literature. The authors have developed a mathematical model for aircraft maintenance planning and management in a multi-criteria approach and an optimisation tool based on the operation of a genetic algorithm. To solve the problem, a genetic algorithm was proposed. The individual steps of the algorithm construction were discussed and its effectiveness was verified using real data.
Źródło:
Eksploatacja i Niezawodność; 2021, 23, 1; 143-153
1507-2711
Pojawia się w:
Eksploatacja i Niezawodność
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Optimization Design of Hybrid Mufflers on Broadband Frequencies Using the Genetic Algorithm
Autorzy:
Chiu, M-C.
Powiązania:
https://bibliotekanauki.pl/articles/177052.pdf
Data publikacji:
2011
Wydawca:
Polska Akademia Nauk. Czytelnia Czasopism PAN
Tematy:
dissipative
reactive
hybrid muffler
genetic algorithm
space constraints
Opis:
Recently, there has been research on high frequency dissipative mufflers. However, research on shape optimization of hybrid mufflers that reduce broadband noise within a constrained space is sparse. In this paper, a hybrid muffler composed of a dissipative muffler and a reactive muffler within a constrained space is assessed. Using the eigenvalues and eigenfunctions, a coupling wave equation for the perforated dissipative chamber is simplified into a four-pole matrix form. To efficiently find the optimal shape within a constrained space, a four-pole matrix system used to evaluate the acoustical performance of the sound transmission loss (STL) is eval- uated using a genetic algorithm (GA). A numerical case for eliminating a broadband venting noise is also introduced. To verify the reliability of a GA optimization, optimal noise abatements for two pure tones (500 Hz and 800 Hz) are exemplified. Before the GA operation can be carried out, the accuracy of the mathematical models has been checked using experimental data. Results indicate that the maximal STL is precisely located at the desired target tone. The optimal result of case studies for eliminating broadband noise also reveals that the overall sound power level (SWL) of the hybrid muffler can be reduced from 138.9 dB(A) to 84.5 dB(A), which is superior to other mufflers (a one-chamber dissipative and a one-chamber reactive muffler). Consequently, a successful approach used for the optimal design of the hybrid mufflers within a constrained space has been demonstrated.
Źródło:
Archives of Acoustics; 2011, 36, 4; 795-822
0137-5075
Pojawia się w:
Archives of Acoustics
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Improving estimation accuracy of metallurgical performance of industrial flotation process by using hybrid genetic algorithm – artificial neural network (GA-ANN)
Autorzy:
Allahkarami, E.
Salmani Nuri, O.
Abdollahzadeh, A.
Rezai, B.
Maghsoudi, B.
Powiązania:
https://bibliotekanauki.pl/articles/109424.pdf
Data publikacji:
2017
Wydawca:
Politechnika Wrocławska. Oficyna Wydawnicza Politechniki Wrocławskiej
Tematy:
artificial neural network
genetic algorithm
prediction
copper flotation
Opis:
In this study, a back propagation feed forward neural network, with two hidden layers (10:10:10:4), was applied to predict Cu grade and recovery in industrial flotation plant based on pH, chemical reagents dosage, size percentage of feed passing 75 μm, moisture content in feed, solid ratio, and grade of copper, molybdenum, and iron in feed. Modeling is performed basing on 92 data sets under different operating conditions. A back propagation training was carried out with initial weights randomly mode that may lead to trapping artificial neural network (ANN) into the local minima and converging slowly. So, the genetic algorithm (GA) is combined with ANN for improving the performance of the ANN by optimizing the initial weights of ANN. The results reveal that the GA-ANN model outperforms ANN model for predicting of the metallurgical performance. The hybrid GA-ANN based prediction method, as used in this paper, can be further employed as a reliable and accurate method, in the metallurgical performance prediction.
Źródło:
Physicochemical Problems of Mineral Processing; 2017, 53, 1; 366-378
1643-1049
2084-4735
Pojawia się w:
Physicochemical Problems of Mineral Processing
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Integrated statistical and rule-mining techniques for dna methylation and gene expression data analysis
Autorzy:
Mallik, S.
Mukhopadhyay, A.
Maulik, U.
Powiązania:
https://bibliotekanauki.pl/articles/1396742.pdf
Data publikacji:
2013
Wydawca:
Społeczna Akademia Nauk w Łodzi. Polskie Towarzystwo Sieci Neuronowych
Tematy:
statistical analysis
gene marker
methylation
genetic algorithm
DNA
Opis:
For determination of the relationships among significant gene markers, statistical analysis and association rule mining are considered as very useful protocols. The first protocol identifies the significant differentially expressed/methylated gene markers, whereas the second one produces the interesting relationships among them across different types of samples or conditions. In this article, statistical tests and association rule mining based approaches have been used on gene expression and DNA methylation datasets for the prediction of different classes of samples (viz., Uterine Leiomyoma/class-formersmoker and uterine myometrium/class-neversmoker). A novel rule-based classifier is proposed for this purpose. Depending on sixteen different rule-interestingness measures, we have utilized a Genetic Algorithm based rank aggregation technique on the association rules which are generated from the training set of data by Apriori association rule mining algorithm. After determining the ranks of the rules, we have conducted a majority voting technique on each test point to estimate its class-label through weighted-sum method. We have run this classifier on the combined dataset using 4-fold cross-validations, and thereafter a comparative performance analysis has been made with other popular rulebased classifiers. Finally, the status of some important gene markers has been identified through the frequency analysis in the evolved rules for the two class-labels individually to formulate the interesting associations among them.
Źródło:
Journal of Artificial Intelligence and Soft Computing Research; 2013, 3, 2; 101-115
2083-2567
2449-6499
Pojawia się w:
Journal of Artificial Intelligence and Soft Computing Research
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Evolutionary computation approaches to tip position controller design for a two-link flexible manipulator
Autorzy:
Subudhi, B.
Ranasingh, S.
Swain, A. K.
Powiązania:
https://bibliotekanauki.pl/articles/229971.pdf
Data publikacji:
2011
Wydawca:
Polska Akademia Nauk. Czytelnia Czasopism PAN
Tematy:
flexible manipulator
genetic algorithm
bacteria foraging
fitness function
Opis:
Controlling multi-link flexible robots is very difficult compared rigid ones due to inter-link coupling, nonlinear dynamics, distributed link flexure and under-actuation. Hence, while designing controllers for such systems the controllers should be equipped with optimal gain parameters. Evolutionary Computing (EC) approaches such as Genetic Algorithm (GA), Bacteria Foraging Optimization (BFO) are popular in achieving global parameter optimizations. In this paper we exploit these EC techniques in achieving optimal PD controller for controlling the tip position of a two-link flexible robot. Performance analysis of the EC tuned PD controllers applied to a two-link flexible robot system has been discussed with number of simulation results.
Źródło:
Archives of Control Sciences; 2011, 21, 3; 269-285
1230-2384
Pojawia się w:
Archives of Control Sciences
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Performance investigation and element optimization of 2D array transducer using Bat Algorithm
Autorzy:
Tantawy, Dina Mohamed
Eladawy, Mohamed
Hassan, Mohamed Alimaher
Mubarak, Roaa
Powiązania:
https://bibliotekanauki.pl/articles/140685.pdf
Data publikacji:
2020
Wydawca:
Polska Akademia Nauk. Czytelnia Czasopism PAN
Tematy:
2D ultrasound arrays
Binary Bat Algorithm
Genetic Algorithm
Optimization
Opis:
One of the least expensive and safest diagnostic modalities routinely used is ultrasound imaging. An attractive development in this field is a two-dimensional (2D) matrix probe with three-dimensional (3D) imaging. The main problems to implement this probe come from a large number of elements they need to use. When the number of elements is reduced the side lobes arising from the transducer change along with the grating lobes that are linked to the periodic disposition of the elements. The grating lobes are reduced by placing the elements without any consideration of the grid. In this study, the Binary Bat Algorithm (BBA) is used to optimize the number of active elements in order to lower the side lobe level. The results are compared to other optimization methods to validate the proposed algorithm.
Źródło:
Archives of Electrical Engineering; 2020, 69, 3; 561-579
1427-4221
2300-2506
Pojawia się w:
Archives of Electrical Engineering
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Multilevel inverter with optimal THD through the firefly algorithm
Autorzy:
El Mehdi Belkacem, R.
Benzid, R.
Bouguechal, N.
Powiązania:
https://bibliotekanauki.pl/articles/141495.pdf
Data publikacji:
2017
Wydawca:
Polska Akademia Nauk. Czytelnia Czasopism PAN
Tematy:
firefly algorithm (FFA)
genetic algorithm (GA)
inverter
multilevel
optimized THD
Opis:
Reduction of the Total Harmonic Distortion (THD) in multilevel inverters requires resolution of complex nonlinear transcendental equations; in this paper we propose a combination of one of the best existing optimized hardware structures with the recent firefly algorithm, which was used to optimize the THD, through finding the best switching angles and guaranteeing the minimization of harmonics within a user defined bandwidth. The obtained THD through the simulation of the thirteen-level symmetric inverter has been reduced down to 5% (FFT of 60 harmonics). In order to validate the simulation results, a thirteen-level symmetric inverter prototype has been made, and practically experimented and tested with different loads. Consequently, the measured THD with resistive load was 4.7% on a bandwidth of 3 kHz. The main advantage of the achieved work is the reduction of the THD.
Źródło:
Archives of Electrical Engineering; 2017, 66, 1; 141-154
1427-4221
2300-2506
Pojawia się w:
Archives of Electrical Engineering
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Modified integer model for solving the master bay problem
Autorzy:
Tsymbal, M.
Kamieniev, K.
Powiązania:
https://bibliotekanauki.pl/articles/2063952.pdf
Data publikacji:
2021
Wydawca:
Uniwersytet Morski w Gdyni. Wydział Nawigacyjny
Tematy:
ship operation problem
master bay problem
integer model
modified integer model
genetic algorithm
steady-state genetic algorithm
numerical experiment
feasibility study
Opis:
One of key components in keeping a ship seaworthy is a correctly prepared cargo plan. Considering the recent cost cutting measures and reduced transportation volumes relevance of optimizing such a plan cannot be understated. Though there’s a number of studies addressing the issue none of them covers all the operational and constructional constraints necessary to factor for. This article presents an integer model that tries to address some of the constraints missed by other researches. A method for solving the model is designed and developed based on a steady-state genetic algorithm. A numerical experiment is conducted showing the method’s feasibility.
Źródło:
TransNav : International Journal on Marine Navigation and Safety of Sea Transportation; 2021, 15, 3; 749--753
2083-6473
2083-6481
Pojawia się w:
TransNav : International Journal on Marine Navigation and Safety of Sea Transportation
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Wykorzystanie algorytmów genetycznych i mrówkowych w problemach transportowych
Using genetic and ant algorithms to solve transport problems
Autorzy:
Zduńczuk, J.
Przystupa, W.
Powiązania:
https://bibliotekanauki.pl/articles/287396.pdf
Data publikacji:
2008
Wydawca:
Polskie Towarzystwo Inżynierii Rolniczej
Tematy:
transport
algorytm genetyczny
algorytm mrówkowy
metaheurystyka
genetic algorithm
ant algorithm
metaheuristics
Opis:
W pracy przedstawiono możliwości zastosowania metaheurystyk w transporcie. Przy użyciu algorytmu genetycznego i mrówkowego dokonano optymalizacji długości trasy przejazdu, a rezultaty porównano ze znanymi wynikami. Przedstawiono również próbę optymalizacji tras ze względu na czas trwania przejazdu.
The paper presents possibilities to employ metaheuristics in transport. The research involved using genetic and ant algorithm to optimise drive/ride route length, and obtained results were compared to known results. Moreover, the paper presents an effort to optimise routes with regard to drive duration.
Źródło:
Inżynieria Rolnicza; 2008, R. 12, nr 7(105), 7(105); 237-243
1429-7264
Pojawia się w:
Inżynieria Rolnicza
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Analog Circuit Based on Computational Intelligence Techniques
Autorzy:
Oltean, G.
Hintea, S.
Şipos, E.
Powiązania:
https://bibliotekanauki.pl/articles/385049.pdf
Data publikacji:
2009
Wydawca:
Sieć Badawcza Łukasiewicz - Przemysłowy Instytut Automatyki i Pomiarów
Tematy:
analog circuit design
optimization
genetic algorithm
neuro-fuzzy systems
Opis:
This paper presents a new method for analog circuit design optimization. Our approach turns to good account the advantages offered by computational intelligence techniques. Design objectives can be expressed in a flexible manner using fuzzy sets. This way appears the possibility to consider different degrees for requirement achievements and acceptability degree for a particular solution. Neuro-fuzzy systems (universal approximators) are used to model the complex multi-variable and nonlinear circuit performances. These models satisfy two main requirements: high accuracy and low computation complexity. An efficient and robust genetic algorithm does avoiding local minima the exploration of the large, multidimensional solution space in quest for the optimal solution.
Źródło:
Journal of Automation Mobile Robotics and Intelligent Systems; 2009, 3, 2; 63-69
1897-8649
2080-2145
Pojawia się w:
Journal of Automation Mobile Robotics and Intelligent Systems
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
The application of genetic algorithm in the assignment problems in the transportation company
Autorzy:
Izdebski, M.
Jacyna, M.
Powiązania:
https://bibliotekanauki.pl/articles/247149.pdf
Data publikacji:
2018
Wydawca:
Instytut Techniczny Wojsk Lotniczych
Tematy:
assignment problem
genetic algorithm
multi-criterion optimization
transportation company
Opis:
The article presents the problem of the task assignment of the vehicles for the transportation company, which deals with the transport of the cargo in the full truckload system. The presented problem is a complex decision making issue which has not been analysed in the literature before. There must be passed through two stages in order to solve the task assignment problem of the vehicles for the transportation company. The first stage is to designate the tasks, the other one is to determine the number of the vehicles that perform these tasks. The task in the analysed problem is defined as transporting the cargo from the suppliers to the recipients. The transportation routes of the cargo must be determined. In order to solve the task assignment problem of the vehicles, the genetic algorithm has been developed. The construction stages of this algorithm are presented. The algorithm has been developed to solve the multi-criteria decision problem. What is more, the algorithm is verified by the use of the real input data.
Źródło:
Journal of KONES; 2018, 25, 4; 133-140
1231-4005
2354-0133
Pojawia się w:
Journal of KONES
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Structural weight minimization of high speed vehicle-passenger catamaran by genetic algorithm
Autorzy:
Sekulski, Z.
Powiązania:
https://bibliotekanauki.pl/articles/258678.pdf
Data publikacji:
2009
Wydawca:
Politechnika Gdańska. Wydział Inżynierii Mechanicznej i Okrętownictwa
Tematy:
ship structure
optimization
topology optimization
sizing optimization
genetic algorithm
Opis:
Reduction of hull structural weight is the most important aim in the design of many ship types. But the ability of designers to produce optimal designs of ship structures is severely limited by the calculation techniques available for this task. Complete definition of the optimal structural design requires formulation of size-topology-shape-material optimization task unifying optimization problems from four areas and effective solution of the problem. So far a significant progress towards solution of this problem has not been achieved. In other hand in recent years attempts have been made to apply genetic algorithm (GA) optimization techniques to design of ship structures. An objective of the paper was to create a computer code and investigate a possibility of simultaneous optimization of both topology and scantlings of structural elements of large spacial sections of ships using GA. In the paper GA is applied to solve the problem of structural weight minimisation of a high speed vehicle-passenger catamaran with several design variables as dimensions of the plate thickness, longitudinal stiffeners and transverse frames and spacing between longitudinals and transversal members. Results of numerical experiments obtained using the code are presented. They shows that GA can be an efficient optimization tool for simultaneous design of topology and sizing high speed craft structures.
Źródło:
Polish Maritime Research; 2009, 2; 11-23
1233-2585
Pojawia się w:
Polish Maritime Research
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Application of fuzzy logic with genetic algorithms to FMEA method
Zastosowanie logiki rozmytej z algorytmami genetycznymi do metody FMEA
Autorzy:
Belu, N.
Ionescu, L.
Powiązania:
https://bibliotekanauki.pl/articles/203218.pdf
Data publikacji:
2014
Wydawca:
Politechnika Poznańska. Wydawnictwo Politechniki Poznańskiej
Tematy:
FMEA
fuzzy logic
genetic algorithm
Costs
Risk Priority Number
Opis:
Failure Mode and Effect Analysis (FMEA) is one of the well-known techniques of quality management that is used for continuous improvement in product or process design. One important issue of FMEA is the determination of the risk priorities of failure modes. The purpose of this paper is to compare three different methods for prioritizing failure modes in a process FMEA study. These methods are traditional approach, fuzzy logic and Genetic Algorithms using a risk-cost model of FMEA - to estimate the weight of risk factors. According to the findings, the integration of Genetic Algorithms and fuzzy revealed a difference in prioritizing failure modes among the methods. Because these methods eliminate some of the shortcomings of the traditional approach, they are useful tools in identifying the high priority failure modes. They can also provide the stability of process assurance.
Analiza przyczyn i skutków wad (FMEA) należy do dobrze znanych technik zarządzania jakością; jest wykorzystywana do ciągłego doskonalenia projektów, produktów lub procesów. Jedną z ważnych kwestii FMEA jest ustalanie priorytetów ryzyka niezgodności. Celem niniejszej pracy jest porównanie trzech metod ustalania poziomu ryzyka niezgodności: podejścia tradycyjnego, logiki rozmytej i algorytmów genetycznych na potrzeby analizy FMEA. Integracja algorytmów genetycznych i logiki rozmytej ujawniła różnicę w ustalaniu znaczenia przyczyn niezgodności. Ponieważ metody te eliminują niektóre wady podejścia tradycyjnego, są użytecznymi narzędziami w identyfikacji przyczyn niezgodności o wysokim ryzyku. Mogą również zapewniać stabilność procesu.
Źródło:
Zeszyty Naukowe Politechniki Poznańskiej. Organizacja i Zarządzanie; 2014, 62; 5-19
0239-9415
Pojawia się w:
Zeszyty Naukowe Politechniki Poznańskiej. Organizacja i Zarządzanie
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Optimization of Spectrum Sensing Parameters in Cognitive Radio Using Adaptive Genetic Algorithm
Autorzy:
Chatterjee, S.
Dutta, S.
Bhattacharya, P. P.
Roy, J. S.
Powiązania:
https://bibliotekanauki.pl/articles/308511.pdf
Data publikacji:
2017
Wydawca:
Instytut Łączności - Państwowy Instytut Badawczy
Tematy:
adaptive genetic algorithm
bandwidth
cognitive radio
spectrum sensing
throughput
Opis:
Quality of service parameters of cognitive radio, like, bandwidth, throughput and spectral efficiency are optimized using adaptive and demand based genetic algorithm. Simulation results show that the proposed method gives better real life solution to the cognitive radio network than other known approach.
Źródło:
Journal of Telecommunications and Information Technology; 2017, 1; 21-27
1509-4553
1899-8852
Pojawia się w:
Journal of Telecommunications and Information Technology
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Optimization model the pipe diameter in the drinking water distribution network using multi-objective genetic algorithm
Autorzy:
Sulianto, -
Setiono, Ernawan
Yasa, I. Wayan
Powiązania:
https://bibliotekanauki.pl/articles/1844381.pdf
Data publikacji:
2021
Wydawca:
Instytut Technologiczno-Przyrodniczy
Tematy:
diameter
genetic algorithm
network
Newton Raphson method
optimum
pipe
Opis:
Under conditions of gravity flow, the performance of a distribution pipe network for drinking water supply can be measured by investment cost and the difference in real and target pressures at each node to ensure fairness of the service. Therefore, the objective function for the optimization in the design of a complex gravity flow pipe network is a multi-purpose equation system set up to minimize the above-mentioned two parameters. This article presents a new model as an alternative solution to solving the optimization equation system by combining the Newton–Raphson and genetic algorithm (GA) methods into a single unit so that the resulting model can work effectively. The Newton–Raphson method is used to solve the hydraulic equation system in pipelines and the GA is used to find the optimal pipe diameter combination in a network. Among application models in a complex pipe network consisting of 12 elements and 10 nodes, this model is able to show satisfactory performance. Considering variations in the value of the weighting factor in the objective function, opti-mal conditions can be achieved at the investment cost factor (ω1) = 0.75 and the relative energy equalization factor at the service node (ω2) = 0.25. With relevant GA input parameters, optimal conditions are achieved at the best fitness value of 1.016 which is equivalent to the investment cost of USD 56.67 thous. with an average relative energy deviation of 1.925 m.
Źródło:
Journal of Water and Land Development; 2021, 48; 55-64
1429-7426
2083-4535
Pojawia się w:
Journal of Water and Land Development
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Application of Genetic Algorithm to Determine Thermal Properties of Microelectronic Layered Structures
Autorzy:
Arsoba, R.
Suszyński, Z.
Powiązania:
https://bibliotekanauki.pl/articles/92932.pdf
Data publikacji:
2008
Wydawca:
Uniwersytet Przyrodniczo-Humanistyczny w Siedlcach
Tematy:
genetic algorithm
inverse problem
microelectronics
thermal properties
layered structure
Opis:
In the paper, possibilities of application of genetic algorithms to determine thermal properties depth profile in microelectronic layered structures were presented. A developed computational method was described and results obtained using the method for a thyristor structure were presented.
Źródło:
Studia Informatica : systems and information technology; 2008, 1(10); 15-26
1731-2264
Pojawia się w:
Studia Informatica : systems and information technology
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Two stage optimization of the PMSM with excitation system composed of different materials
Autorzy:
Knypiński, Ł.
Nowak, L.
Powiązania:
https://bibliotekanauki.pl/articles/97722.pdf
Data publikacji:
2013
Wydawca:
Politechnika Poznańska. Wydawnictwo Politechniki Poznańskiej
Tematy:
electric machines
permanent magnet synchronous motor
optimization
genetic algorithm
Opis:
The paper presents the algorithm and software for the optimization of the rotor structure of the permanent magnet synchronous motor with magnet composed of two materials about different magnetic properties. The software consists of two modules: a numerical model of the PMSM motor and an optimization solver. Numerical implementation is based on finite element method. The optimization module has been elaborated employing the Delphi environment. For the rotor structure optimization the genetic algorithm has been applied Selected results of the calculation are presented and discussed.
Źródło:
Computer Applications in Electrical Engineering; 2013, 11; 148-158
1508-4248
Pojawia się w:
Computer Applications in Electrical Engineering
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Automatic identification of malfunctions of large turbomachinery during transient states with genetic algorithm optimization
Autorzy:
Barszcz, Tomasz
Zabaryłło, Mateusz
Powiązania:
https://bibliotekanauki.pl/articles/2052104.pdf
Data publikacji:
2022
Wydawca:
Polska Akademia Nauk. Czytelnia Czasopism PAN
Tematy:
machine learning
fault detection
transient
turbine generator
genetic algorithm
Opis:
Turbines and generators operating in the power generation industry are a major source of electrical energy worldwide. These are critical machines and their malfunctions should be detected in advance in order to avoid catastrophic failures and unplanned shutdowns. A maintenance strategy which enables to detect malfunctions at early stages of their existence plays a crucial role in facilities using such types of machinery. The best source of data applied for assessment of the technical condition are the transient data measured during start-ups and coast-downs. Most of the proposed methods using signal decomposition are applied to small machines with a rolling element bearing in steady-state operation with a shaft considered as a rigid body. The machines examined in the authors’ research operate above their first critical rotational speed interval and thus their shafts are considered to be flexible and are equipped with a hydrodynamic sliding bearing. Such an arrangement introduces significant complexity to the analysis of the machine behavior, and consequently, analyzing such data requires a highly skilled human expert. The main novelty proposed in the paper is the decomposition of transient vibration data into components responsible for particular failure modes. The method is automated and can be used for identification of turbogenerator malfunctions. Each parameter of a particular decomposed function has its physical representation and can help the maintenance staff to operate the machine properly. The parameters can also be used by the managing personnel to plan overhauls more precisely. The method has been validated on real-life data originating from a 200 MW class turbine. The real-life field data, along with the data generated by means of the commercial software utilized in GE’s engineering department for this particular class of machines, was used as the reference data set for an unbalanced response during the transients in question.
Źródło:
Metrology and Measurement Systems; 2022, 29, 1; 175-190
0860-8229
Pojawia się w:
Metrology and Measurement Systems
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Model i implementacja systemowego algorytmu ewolucyjnego do poszukiwania nowego stanu systemu elektroenergetycznej sieci przesyłowej
Autorzy:
Tchórzewski, J.
Ruciński, A.
Powiązania:
https://bibliotekanauki.pl/articles/92875.pdf
Data publikacji:
2005
Wydawca:
Uniwersytet Przyrodniczo-Humanistyczny w Siedlcach
Tematy:
algorytm genetyczny
systemowy algorytm ewolucyjny
SAE
genetic algorithm
system evolving algorithm
Opis:
In article some results of using system evolving algorithm SAE for search a new state of development of electric power transmission network Is presented. Electric power transmission network Is simulated as a operator of transmission system (polish: Operator Systemu Przesyłowego: OSP). It is received by them existing distributed beginning popu¬lation and existing fitness function which takes advantage of systems divergence. Identification of electric power transmission system (ESP) which Is understudied as technology system and which Is management by OSP is carried out using System Identification Toolbox. In result Is obtained model of system in characteristic form such as th, tf, zpk, ss, ABCD. Next on the base model of OSP in transmission form Is generated beginning population, which Is using as chromosome population. After them SAE algorithm Is generated new population, by them SAE Is implemented in Matlab language. Results which Is obtained In this process was Interpreted using function from for example Control System Toolbox.
Źródło:
Studia Informatica : systems and information technology; 2005, 1(5); 59-67
1731-2264
Pojawia się w:
Studia Informatica : systems and information technology
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Multi-objective optimization of high speed vehicle-passenger catamaran by genetic algorithm. Part II. Computational simulations
Autorzy:
Sekulski, Z.
Powiązania:
https://bibliotekanauki.pl/articles/260598.pdf
Data publikacji:
2011
Wydawca:
Politechnika Gdańska. Wydział Inżynierii Mechanicznej i Okrętownictwa
Tematy:
ship structure
multi-objective optimization
evolutionary algorithm
genetic algorithm
Pareto domination
Opis:
Real ship structural design problems are usually characterized by presence of many conflicting objectives. Simultaneously, a complete definition of the optimum structural design requires a formulation of size-topology-shape-material optimization task unifying the optimization problems of the four areas and giving an effective solution of the problem. So far, a significant progress towards the solution of the problem has not been obtained. An objective of the present paper was to develop an evolutionary algorithm for multiobjective optimization of structural elements of large spatial sections of ships. Selected elements of the multi-criteria optimization theory have been presented in detail. Methods for solution of the multi-criteria optimization problems have been discussed with the focus on the evolutionary optimization algorithms. In the paper an evolutionary algorithm where selection takes place based on the aggregated objective function combined with domination attributes as well as distance to the asymptotic solution, is proposed and applied to solve the problem of optimizing structural elements with respect to their weight and surface area on a high speed vehicle-passenger catamaran structure, with several design variables, such as plate thickness, scantlings of longitudinal stiffeners and transverse frames, and spacing between longitudinal and transversal members, taken into account. Details of the computational models were at the level typical for conceptual design. Scantlings were analyzed by using selected rules of a classification society. The results of numerical experiments with the use of the developed algorithm, are presented. They show that the proposed genetic algorithm can be an efficient tool for multi-objective optimization of ship structures. The paper is published in three parts: Part I: Theoretical background on evolutionary multi-objective optimization, Part II: Computational investigations, and Part III: Analysis of the results.
Źródło:
Polish Maritime Research; 2011, 3; 3-30
1233-2585
Pojawia się w:
Polish Maritime Research
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
A genetic algorithm-based approach for flexible job shop rescheduling problem with machine failure interference
Autorzy:
Liang, Zhongyuan
Zhong, Peisi
Zhang, Chao
Yang, Wenlei
Xiong, Wei
Yang, Shihao
Meng, Jing
Powiązania:
https://bibliotekanauki.pl/articles/27320976.pdf
Data publikacji:
2023
Wydawca:
Polska Akademia Nauk. Polskie Naukowo-Techniczne Towarzystwo Eksploatacyjne PAN
Tematy:
genetic algorithm
rescheduling
machine failure
flexible job shop scheduling
Opis:
Rescheduling is the guarantee to maintain the reliable operation of production system process. In production system, the original scheduling scheme cannot be carried out when machine breaks down. It is necessary to transfer the production tasks in the failure cycle and replan the production path to ensure that the production tasks are completed on time and maintain the stability of production system. To address this issue, in this paper, we studied the event-driven rescheduling policy in dynamic environment, and established the usage rules of right-shift rescheduling and complete rescheduling based on the type of interference events. And then, we proposed the rescheduling decision method based on genetic algorithm for solving flexible job shop scheduling problem with machine fault interference. In addition, we extended the "mk" series of instances by introducing the machine fault interference information. The solution data show that the complete rescheduling method can respond effectively to the rescheduling of flexible job shop scheduling problem with machine failure interference.
Źródło:
Eksploatacja i Niezawodność; 2023, 25, 4; art. no. 171784
1507-2711
Pojawia się w:
Eksploatacja i Niezawodność
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Multi-objective design optimization of five-phase fractional-slot concentrated-winding surface-mounted permanent-magnet machine
Autorzy:
Nekoubin, Amir
Soltani, Jafar
Dowlatshah, Milad
Powiązania:
https://bibliotekanauki.pl/articles/949883.pdf
Data publikacji:
2020
Wydawca:
Polska Akademia Nauk. Czytelnia Czasopism PAN
Tematy:
Finite Element Method
genetic algorithm
optimization
permanent-magnet motors
Opis:
The multi-phase permanent-magnet machines with a fractional-slot concentratedwinding (FSCW) are a suitable choice for certain purposes like aircraft, marine, and electric vehicles, because of the fault tolerance and high power density capability. The paper aims to design, optimize and prototype a five-phase fractional-slot concentrated-winding surface-mounted permanent-magnet motor. To optimize the designed multi-phase motor a multi-objective optimization technique based on the genetic algorithm method is applied. The machine design objectives are to maximize torque density of the motor and maximize efficiency then to determine the best choice of the designed machine parameters. Then, the two-dimensional Finite Element Method (2D-FEM) is employed to verify the performance of the optimized machine. Finally, the optimized machine is prototyped. The paper found that the results of the prototyped machine validate the results of theatrical analyses of the machine and accurate consideration of the parameters improved the acting of the machine.
Źródło:
Archives of Electrical Engineering; 2020, 69, 4; 873-889
1427-4221
2300-2506
Pojawia się w:
Archives of Electrical Engineering
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Koncepcja sterowania pojazdem podwodnym w przypadku wystąpienia awarii pędnika oparta na algorytmie genetycznym
The concept of an underwater vehicle control in the event of failure of thruster based on genetic algorithm
Autorzy:
Leszczyński, T.
Powiązania:
https://bibliotekanauki.pl/articles/222034.pdf
Data publikacji:
2005
Wydawca:
Akademia Marynarki Wojennej. Wydział Dowodzenia i Operacji Morskich
Tematy:
algorytm genetyczny
pędnik
okręt podwodny
genetic algorithm
propeller
submarine
Opis:
W pracy przedstawiono propozycję rozwiązania problemu dotyczącego sterowania pojazdem podwodnym w przypadku, gdy podczas realizacji zadania awarii ulega jeden z jego pędników. Wykorzystano do tego algorytmizację genetyczną. Przyjęto założenie, że w pojeździe podwodnym znajduje się system diagnostyczny wykrywający awarię pędnika oraz narzucono określony sposób poruszania się pojazdu po wystąpieniu awarii. Zamieszczone zostały wstępne wyniki symulacji dla zadania utrzymania określonego kursu oraz możliwości dalszego rozwoju metody.
The paper presents a proposal of the solution to the problem related to control of an under- water vehicle when one of its propellers fails while carrying out a task. A genetic algorithmization was applied to the solve the task. It was assumed that an under-water vehicle is equipped with a diagnostic system which registers the propeller failure, and a method of vehicle movement in the case of the propeller failure was pre-set. It also includes the initial simulation results of maintaining the pre-set course and possibility of evolution of the method.
Źródło:
Zeszyty Naukowe Akademii Marynarki Wojennej; 2005, R. 46 nr 3 (162), 3 (162); 69-78
0860-889X
Pojawia się w:
Zeszyty Naukowe Akademii Marynarki Wojennej
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Sensor Network Deployment Optimization for Improved Area Coverage Using a Genetic Algorithm
Autorzy:
Szklarski, Łukasz
Powiązania:
https://bibliotekanauki.pl/articles/1861643.pdf
Data publikacji:
2016
Wydawca:
Wyższa Szkoła Bezpieczeństwa Publicznego i Indywidualnego Apeiron w Krakowie
Tematy:
network of sensors
genetic algorithm
sensors deployment
area coverage
Opis:
Ensuring optimal coverage is a central objective of every sensor deployment plan. Effective monitoring of the environment helps to minimize manpower and time, while enhancing surveillance capability. In this paper, a solution for improved area coverage was presented. A lattice of a pre-defined parameter has been used as an input for the algorithm. For the purpose of the research the blanket deployment strategy has been adopted. Then, a genetic algorithm has been proposed and implemented to find an optimal solution. The proposed approach has been tested and the conclusions have been drawn. The results proved that the proposed genetic algorithm could already provide satisfactory results, usually finding only suboptimal solutions.
Źródło:
Security Dimensions; 2016, 19(19); 150-181
2353-7000
Pojawia się w:
Security Dimensions
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Towards a linguistic description of dependencies in data
Autorzy:
Batyrshin, I.
Wagenknecht, M.
Powiązania:
https://bibliotekanauki.pl/articles/908041.pdf
Data publikacji:
2002
Wydawca:
Uniwersytet Zielonogórski. Oficyna Wydawnicza
Tematy:
informatyka
fuzzy approximation
linguistic term
fuzzy rule
genetic algorithm
Opis:
The problem of a linguistic description of dependencies in data by a set of rules Rk: "If X is Tk then Y is Sk" is considered, where Tk's are linguistic terms like SMALL, BETWEEN 5 AND 7 describing some fuzzy intervals Ak. Sk's are linguistic terms like DECREASING and QUICKLY INCREASING describing the slopes pk of linear functions yk=pkx +qk approximating data on Ak. The decision of this problem is obtained as a result of a fuzzy partition of the domain X on fuzzy intervals Ak, approximation of given data {xi,yi}, i=1,...,n by linear functions yk=pkx+qk on these intervals and by re-translation of the obtained results into linguistic form. The properties of the genetic algorithm used for construction of the optimal partition and several methods of data re-translation are described. The methods are illustrated by examples, and potential applications of the proposed methods are discussed.
Źródło:
International Journal of Applied Mathematics and Computer Science; 2002, 12, 3; 391-401
1641-876X
2083-8492
Pojawia się w:
International Journal of Applied Mathematics and Computer Science
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Mechanical buckling of functionally graded polyethylene/clay nanocomposites columns based on the Engesser-Timoshenko beam theory
Autorzy:
Yas, M. H.
Khorramabadi, M. K.
Powiązania:
https://bibliotekanauki.pl/articles/949299.pdf
Data publikacji:
2018
Wydawca:
Polskie Towarzystwo Mechaniki Teoretycznej i Stosowanej
Tematy:
mechanical buckling
functionally graded nanocomposite
montmorillonite
genetic algorithm theory
Opis:
This paper deals with mechanical buckling of polyethylene/clay nanocomposite beams of functionally graded and uniformly distributed of nanoclay subjected to axial compressive load with simply supported conditions at both ends. The Young moduli of functionally graded and uniformly distributed nanocomposites are calculated using a genetic algorithm procedure and then compared with experimental results. The formulation is modified to include the effect of nanoparticles weight fractions in the calculation of the Young modulus for uniform distribution. Also, it is modified to take into account the Young modulus as a function of the thickness coordinate. The displacement field of the beam is assumed based on the Engesser-Timoshenko beam theory. Applying the Hamilton principle, governing equations are derived. The influence of nanoparticles on the buckling load of the beam is presented. To investigate the accuracy of the present analysis, a compression study with the experimental results is carried out.
Źródło:
Journal of Theoretical and Applied Mechanics; 2018, 56, 3; 701-712
1429-2955
Pojawia się w:
Journal of Theoretical and Applied Mechanics
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Genetic algorithm finds routes in travelling salesman problem with profits
Algorytm genetyczny odnajduje trasy w problemie komiwojażera z zyskami
Autorzy:
Piwońska, A.
Powiązania:
https://bibliotekanauki.pl/articles/341053.pdf
Data publikacji:
2010
Wydawca:
Politechnika Białostocka. Oficyna Wydawnicza Politechniki Białostockiej
Tematy:
algorytm genetyczny
zysk
komiwojażer
genetic algorithm
traveling salesman problem
Opis:
Travelling salesman problem with profits is a version of a classic travelling salesman problem where it is not necessary to visit all vertices. Instead of it, with each vertex a number meaning a profit is associated. The problem is to find a cycle in a graph which maximizes collected profit but does not exceed a given cost constraint. This problem is NP-hard. Additional assumptions to this problem were proposed in the paper.We assumed that a graph may not be a complete graph. Moreover, repeated visiting of a given vertex is allowed, however with an assumption that a profit is realized only during first visiting. With these additional assumptions, the problem is more real-life and could have applications in logistics and shipping. To solve the problem, a genetic algorithm with special operators was proposed. The algorithm was tested on networks of cities in some voivodeships of Poland, obtaining very good results.
Problem komiwojażera z zyskami (ang. TSP with profits) jest pewną wersją klasycznego problemu komiwojażera, w której nie jest konieczne odwiedzenie wszystkich wierzchołków grafu. Zamiast tego, z każdym wierzchołkiem związana jest pewna liczba oznaczająca zysk. Problem polega na znalezieniu cyklu w grafie, który maksymalizuje zysk, ale którego koszt nie przekracza zadanego ograniczenia. Problem ten jest problemem NPtrudnym. Do tak postawionego problemu, w pracy zaproponowano dodatkowe założenia. Przyjęto mianowicie, że graf nie musi być pełny. Ponadto dopuszczona jest możliwość powrotów, czyli ponownego odwiedzenia danego wierzchołka, przy założeniu jednak, iż zysk realizowany jest tylko podczas pierwszego odwiedzenia. Przy tych dodatkowych założeniach problem jest bardziej realny i może mieć konkretne zastosowania w logistyce i spedycji. Do rozwiązania problemu zaproponowano algorytm genetyczny, uzyskując bardzo dobre wyniki.
Źródło:
Zeszyty Naukowe Politechniki Białostockiej. Informatyka; 2010, 5; 51-65
1644-0331
Pojawia się w:
Zeszyty Naukowe Politechniki Białostockiej. Informatyka
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
An improved genetic algorithm for solving the Selective Travelling Salesman Problem on a road network
Ulepszony algorytm genetyczny do rozwiązania selektywnego problemu komiwojażera w sieci drogowej
Autorzy:
Piwońska, A.
Powiązania:
https://bibliotekanauki.pl/articles/341085.pdf
Data publikacji:
2011
Wydawca:
Politechnika Białostocka. Oficyna Wydawnicza Politechniki Białostockiej
Tematy:
algorytm genetyczny
mutacja usuwająca
komiwojażer
genetic algorithm
deletion mutation
Opis:
The Selective Travelling Salesman Problem (STSP) is a modified version of the Travelling Salesman Problem (TSP) where it is not necessary to visit all vertices. Instead of it, with each vertex a number meaning a profit is associated. The problem is to find a cycle which maximizes collected profit but does not exceed a given cost constraint. A direct application of the STSP, e.g. in Intelligent Transportation Systems, is finding an optimal tour in road networks. However, while the classic STSP is defined on a complete graph, a road network is in general not complete and often has a rather sparse edge set. This paper presents the STSP defined on a road network (R-STSP). Since the R-STSP is NP-hard, the improved genetic algorithm (IGA) is proposed which is the enlarged version of our previous GA. The main aim of this paper is to investigate the role of the deletion mutation in the performance of the IGA.
Selektywny problem komiwojażera (STSP) jest zmodyfikowaną wersją problemu komiwojażera (TSP), w której nie jest konieczne odwiedzenie wszystkich wierzchołków. Zamiast tego, z każdym wierzchołkiem związana jest liczba oznaczająca zysk. Problem polega na znalezieniu cyklu w grafie, który maksymalizuje zysk, ale którego koszt nie przekracza zadanego ograniczenia. Bezpośrednim zastosowaniem problemu STSP, np. w Inteligentnych Systemach Transportowych, jest odnajdywanie optymalnej trasy w sieci drogowej. Jednakże, podczas gdy klasyczny problem STSP jest zdefiniowany na grafie zupełnym, sieć drogowa zwykle nie jest grafem pełnym i często ma rzadki zbiór krawędzi. Artykuł przedstawia problem STSP zdefinowany w sieci drogowej (R-STSP). Ponieważ R-STSP jest NP-trudny, zaproponowano ulepszony algorytm genetyczny (IGA), który jest rozszerzoną wersją poprzedniego algorytmu genetycznego. Głównym celem artykułu jest zbadanie roli mutacji usuwającej w w jakości wyników IGA.
Źródło:
Zeszyty Naukowe Politechniki Białostockiej. Informatyka; 2011, 7; 59-70
1644-0331
Pojawia się w:
Zeszyty Naukowe Politechniki Białostockiej. Informatyka
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
A new genetic approach for transport network design and optimization
Autorzy:
Dinu, S.
Bordea, G.
Powiązania:
https://bibliotekanauki.pl/articles/200177.pdf
Data publikacji:
2011
Wydawca:
Polska Akademia Nauk. Czytelnia Czasopism PAN
Tematy:
genetic algorithm
bilevel programming
Network Design Problem
complex-encoding
Opis:
This paper presents an improved Genetic Algorithm to solve the Transportation Network Design Problem (CTNDP) with interactions among different links. The CTNDP is formulated in an optimal design as a bi-level programming model. A key factor in the present approach is the combination of diploid based complex-encoding with meiosis specific features. The novel mutation operator proposed is another improvement that leads to a better robustness and convergence stability. The computational results obtained by comparing the performance of the proposed algorithm and other Genetic Algorithms for a test network demonstrates its better local searching ability, as well as its high efficiency. Finally, suggestions for further research and extensions are given.
Źródło:
Bulletin of the Polish Academy of Sciences. Technical Sciences; 2011, 59, 3; 263-272
0239-7528
Pojawia się w:
Bulletin of the Polish Academy of Sciences. Technical Sciences
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Software Systems Clustering Using Estimation of Distribution Approach
Autorzy:
Tajgardan, M.
Izadkhah, H.
Lotfi, S.
Powiązania:
https://bibliotekanauki.pl/articles/108635.pdf
Data publikacji:
2016
Wydawca:
Społeczna Akademia Nauk w Łodzi
Tematy:
Software System
Clustering, Genetic Algorithm
Estimation of Distribution Algorithm (EDA)
Probability Model
Opis:
Software clustering is usually used for program understanding. Since the software clustering is a NP-complete problem, a number of Genetic Algorithms (GAs) are proposed for solving this problem. In literature, there are two wellknown GAs for software clustering, namely, Bunch and DAGC, that use the genetic operators such as crossover and mutation to better search the solution space and generating better solutions during genetic algorithm evolutionary process. The major drawbacks of these operators are (1) the difficulty of defining operators, (2) the difficulty of determining the probability rate of these operators, and (3) do not guarantee to maintain building blocks. Estimation of Distribution (EDA) based approaches, by removing crossover and mutation operators and maintaining building blocks, can be used to solve the problems of genetic algorithms. This approach creates the probabilistic models from individuals to generate new population during evolutionary process, aiming to achieve more success in solving the problems. The aim of this paper is to recast EDA for software clustering problems, which can overcome the existing genetic operators’ limitations. For achieving this aim, we propose a new distribution probability function and a new EDA based algorithm for software clustering. To the best knowledge of the authors, EDA has not been investigated to solve the software clustering problem. The proposed EDA has been compared with two well-known genetic algorithms on twelve benchmarks. Experimental results show that the proposed approach provides more accurate results, improves the speed of convergence and provides better stability when compared against existing genetic algorithms such as Bunch and DAGC.
Źródło:
Journal of Applied Computer Science Methods; 2016, 8 No. 2; 99-113
1689-9636
Pojawia się w:
Journal of Applied Computer Science Methods
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Heuristic algorithms applied to the problems of servicing actors in supply chains
Autorzy:
Izdebski, M.
Jacyna-Gołda, I.
Markowska, K.
Murawski, J.
Powiązania:
https://bibliotekanauki.pl/articles/224087.pdf
Data publikacji:
2017
Wydawca:
Polska Akademia Nauk. Czytelnia Czasopism PAN
Tematy:
supply chain
genetic algorithm
ant algorithm
łańcuchy dostaw
algorytm genetyczny
algorytm mrówkowy
Opis:
The paper discusses main decision problems analysed in the subject matter of servicing actors operating in the supply chains, i.e. the vehicle routing problem, vehicles-to-task assignment problem and the problem of entities’ localization in the supply chain. The input data used to describe supply chains is given as well as the basic constraints and the criterion functions used in the development of mathematical models describing the supply chains. Servicing actors in supply chains is the complex decision making problem. Operators in the supply chains are constrained by: production capacity of the suppliers, the demand of the customers in particular working days, storage capacities of warehouses, handling capacities of warehouses, suppliers’ and warehouses’ time windows and other. The efficiency of supply chain is described by cost of transport between operators, costs of passing cargoes through warehouses and delivery time to the recipient. The heuristic algorithms, like genetic and ant algorithms are detailed and used to identify issues related to the operation of actors operating in the supply chains are described. These algorithms are used for solving localization problems in supply chains, vehicle routing problems, and assignment problems. The complexity of presented issues (TSP is known as NP-hard problem) limits the use of precise algorithms and implies the need to use heuristic algorithms. It should be noted that solutions generated by these algorithms for complex decision instances are sub-optimal solutions, but nonetheless it is accepted from the practical point of view.
Źródło:
Archives of Transport; 2017, 44, 4; 25-34
0866-9546
2300-8830
Pojawia się w:
Archives of Transport
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Optimization of electric and magnetic field intensities in proximity of power lines using genetic and particle swarm algorithms
Autorzy:
Król, K.
Machczyński, W.
Powiązania:
https://bibliotekanauki.pl/articles/141588.pdf
Data publikacji:
2018
Wydawca:
Polska Akademia Nauk. Czytelnia Czasopism PAN
Tematy:
power line
electric field
magnetic field
optimization
genetic algorithm
particle swarm algorithm
Opis:
The paper presents optimization of power line geometrical parameters aimed to reduce the intensity of the electric field and magnetic field intensity under an overhead power line with the use of a genetic algorithm (AG) and particle swarm optimization (PSO). The variation of charge distribution along the conductors as well as the sag of the overhead line and induced currents in earth wires were taken into account. The conductor sag was approximated by a chain curve. The charge simulation method (CSM) and the method of images were used in the simulations of an electric field, while a magnetic field were calculated using the Biot–Savart law. Sample calculations in a three-dimensional system were made for a 220 kV single – circuit power line. A comparison of the used optimization algorithms was made.
Źródło:
Archives of Electrical Engineering; 2018, 67, 4; 829-843
1427-4221
2300-2506
Pojawia się w:
Archives of Electrical Engineering
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Meta-heuristic approach based on genetic and greedy algorithms to solve flexible job-shop scheduling problem
Autorzy:
Rezaeipanah, Amin
Sarhangnia, Fariba
Abdollahi, Mohammad Javad
Powiązania:
https://bibliotekanauki.pl/articles/2097966.pdf
Data publikacji:
2021
Wydawca:
Akademia Górniczo-Hutnicza im. Stanisława Staszica w Krakowie. Wydawnictwo AGH
Tematy:
job-shop scheduling
meta-heuristic method
genetic algorithm
greedy algorithm
jobs priority
Opis:
Job-shop scheduling systems are one of the applications of group technology in industry, the purpose of which is to take advantage of the physical or operational similarities of products in their various aspects of construction and design. Additionally, these systems are identified as cellular manufacturing systems (CMS). In this paper, a meta-heuristic method that is based on combining genetic and greedy algorithms has been used in order to optimize and evaluate the performance criteria of the flexible job-shop scheduling problem. In order to improve the efficiency of the genetic algorithm, the initial population is generated by the greedy algorithm, and several elitist operators are used to improve the solutions. The greedy algorithm that is used to improve the generation of the initial population prioritizes the cells and the job in each cell and, thus, offers quality solutions. The proposed algorithm is tested over the P-FJSP dataset and compared with the state-of-the-art techniques of this literature. To evaluate the performance of the diversity, spacing, quality, and run-time criteria were used in a multi-objective function. The results of the simulation indicate the better performance of the proposed method as compared to the NRGA and NSGA-II methods.
Źródło:
Computer Science; 2021, 22 (4); 463--488
1508-2806
2300-7036
Pojawia się w:
Computer Science
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Particle Swarm Optimization Algorithm for Leakage Power Reduction in VLSI Circuits
Autorzy:
Leela Rani, V.
Madhavi Latha, M.
Powiązania:
https://bibliotekanauki.pl/articles/225990.pdf
Data publikacji:
2016
Wydawca:
Polska Akademia Nauk. Czytelnia Czasopism PAN
Tematy:
leakage power
PSO algorithm
genetic algorithm
minimum leakage vector
Verilog-HDL implementation
Opis:
Leakage power is the dominant source of power dissipation in nanometer technology. As per the International Technology Roadmap for Semiconductors (ITRS) static power dominates dynamic power with the advancement in technology. One of the well-known techniques used for leakage reduction is Input Vector Control (IVC). Due to stacking effect in IVC, it gives less leakage for the Minimum Leakage Vector (MLV) applied at inputs of test circuit. This paper introduces Particle Swarm Optimization (PSO) algorithm to the field of VLSI to find minimum leakage vector. Another optimization algorithm called Genetic algorithm (GA) is also implemented to search MLV and compared with PSO in terms of number of iterations. The proposed approach is validated by simulating few test circuits. Both GA and PSO algorithms are implemented in Verilog HDL and the simulations are carried out using Xilinx 9.2i. From the simulation results it is found that PSO based approach is best in finding MLV compared to Genetic based implementation as PSO technique uses less runtime compared to GA. To the best of the author’s knowledge PSO algorithm is used in IVC technique to optimize power for the first time and it is quite successful in searching MLV.
Źródło:
International Journal of Electronics and Telecommunications; 2016, 62, 2; 179-186
2300-1933
Pojawia się w:
International Journal of Electronics and Telecommunications
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Hybrydowy algorytm mrówkowy wykorzystujący algorytm genetyczny do wyznaczania trasy w systemie nawigacji
A hybrid ant algorithm using genetic algorithm to determine the route in navigation system
Autorzy:
Komar, D.
Powiązania:
https://bibliotekanauki.pl/articles/131927.pdf
Data publikacji:
2013
Wydawca:
Wrocławska Wyższa Szkoła Informatyki Stosowanej Horyzont
Tematy:
algorytm mrówkowy
algorytm genetyczny
system nawigacji
ant algorithm
genetic algorithm
navigation system
Opis:
Artykuł ma na celu zaprezentowanie nowej implementacji hybrydowego algorytmu mrówkowego, który do rozwiązywania postawionego problemu wyznaczenia optymalnej trasy przejazdu będzie wykorzystywał również algorytm genetyczny. Autor przedstawi wyniki symulacji przeprowadzonej na podstawie rzeczywistych danych, ukazując znaczny wzrost efektywności rozwiązywania problemu. Otrzymane wyniki wykazały, że nowy algorytm wyznaczał w większej liczbie przypadków znacznie krótszy czas przejazdu, a tym samym redukował występujące czynniki zakłócające i negatywnie wpływające na osobę kierującą pojazdem.
The purpose of this paper is to present the new implementation of a hybrid ant algorithm that will also use a genetic algorithm in order to solve the problem consisting in optimal route calculation. The author will present results of simulations that were performed based on real data and showed a significant increase of problem solution effectiveness. The obtained results proved that the new algorithm determined in more number of cases a significantly shorter journey time and in consequence reduced the occurring confounding factors which had a negative impact on the person driving a vehicle.
Źródło:
Biuletyn Naukowy Wrocławskiej Wyższej Szkoły Informatyki Stosowanej. Informatyka; 2013, 3; 23-27
2082-9892
Pojawia się w:
Biuletyn Naukowy Wrocławskiej Wyższej Szkoły Informatyki Stosowanej. Informatyka
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Kodowanie cech sygnałów w systemie wnioskowania diagnostycznego
Signal feature encoding in an inference diagnostic system
Autorzy:
Timofiejczuk, A.
Powiązania:
https://bibliotekanauki.pl/articles/301412.pdf
Data publikacji:
2009
Wydawca:
Polska Akademia Nauk. Polskie Naukowo-Techniczne Towarzystwo Eksploatacyjne PAN
Tematy:
kodowanie
algorytm genetyczny
analiza sygnałów
encoding
genetic algorithm
signal analysis
Opis:
W referacie opisano część badań, których celem jest zastosowanie wnioskowania diagnostycznego z uwzględnieniem kontekstu. Zgodnie z opracowanym podejściem konteksty działania obiektu mogą być identyfikowane z zastosowaniem algorytmów ewolucyjnych. Jednym z najistotniejszych czynników zastosowania tych algorytmów jest odpowiednie przygotowanie danych wejściowych. W referacie opisano opracowane sposoby kodowania dla trzech rodzajów cech sygnałów. Przykłady zastosowania opisanych sposobów kodowania zastosowano dla sygnałów zarejestrowanych podczas działania stanowiska modelującego działanie maszyny wirnikowej.
In the paper a part of research focused on context based diagnostic inference has been presented. According to the elaborated approach contexts of machinery operation can be identifi ed with the use of evolutionary algorithms. One of most important factors of the application of such algorithms is a proper form of input data. In the paper encoding of three different types of signal features have been discussed. Examples of elaborated notations have been applied to signals recorded during operation of a model of rotating machinery.
Źródło:
Eksploatacja i Niezawodność; 2009, 1; 22-27
1507-2711
Pojawia się w:
Eksploatacja i Niezawodność
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Identyfikacja prostych modeli dynamiki poprzez iterowany algorytm genetycznymodelowanie
Identification of simple dynamics models by iterated genetic algorithm
Autorzy:
Hoczek, T.
Powiązania:
https://bibliotekanauki.pl/articles/154486.pdf
Data publikacji:
2012
Wydawca:
Stowarzyszenie Inżynierów i Techników Mechaników Polskich
Tematy:
FOPDT
SOPDT
algorytmy genetyczne
identyfikacja
modelowanie
genetic algorithm
system identification
Opis:
W niniejszym artykule zaproponowano metodę identyfikacji opartą na iterowanym algorytmie genetycznym dla systemów FOPDT (First Order Plus Dead Time) oraz SOPDT (Second Order Plus Dead Time), w których występują zakłócenia o znacznej amplitudzie. Zbadano również wpływ poziomu zakłóceń na dokładność identyfikacji systemu.
An iterated genetic algorithm for identification of FOPDT (First Order Plus Dead Time) and SOPDT (Second Order Plus Dead Time) models is proposed in the paper. It is designed for high noise/signal ratio systems. The method proposed requires a little knowledge about the identified system, including determination of search space borders. It may be also used for approximation of higher order systems by FOPDT or SOPDT models. The identification results were compared with those obtained from other methods, such as the traditional "two point" method and modern MatlabŽ ident(.) tool. Additionally, the impact of interference/ noise level on the model identification accuracy was analyzed. The identified model can be used for tuning PID regulators or can be implemented in more advanced control schemas e.g. Smith predictor or MPC. System identification with use of a genetic algorithm offers numerous advantages and may be implemented as an efficient alternative to classical methods, especially when the interference level is high.
Źródło:
Pomiary Automatyka Kontrola; 2012, R. 58, nr 10, 10; 850-853
0032-4140
Pojawia się w:
Pomiary Automatyka Kontrola
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Zastosowanie algorytmu genetycznego do tworzenia portretów pamięciowych
Autorzy:
Stolc, K.
Powiązania:
https://bibliotekanauki.pl/articles/118353.pdf
Data publikacji:
2016
Wydawca:
Politechnika Koszalińska. Wydawnictwo Uczelniane
Tematy:
algorytm genetyczny
tworzenie portretu pamięciowego
genetic algorithm
creation of photofits
Opis:
W artykule przedstawiony został sposób wykorzystania algorytmu genetycznego do tworzenia portretu pamięciowego metodą komputerową. Zastosowanie metod sztucznej inteligencji umożliwiło wygenerowanie portretu pamięciowego bez konieczności wyboru przez użytkownika poszczególnych elementów twarzy. Zadanie świadka odtwarzającego portret pamięciowy sprowadza się w tym wypadku do określenia stopnia podobieństwa przedstawianych wizerunków do poszukiwanej osoby. Szczegółowo opisane zostały najistotniejsze etapy algorytmu, czyli określenie cech populacji początkowej, funkcja oceny, selekcja oraz operatory genetyczne – krzyżowanie oraz mutacja. Przeprowadzone zostały badania na przykładowej bazie wzorców zawierającej takie elementy jak: owal twarzy, włosy, brwi, oczy, uszy, nos i usta. Analiza ich wyników umożliwiła optymalizację ustawień parametrów algorytmu genetycznego.
The article shows the way of implementation of the genetic algorithm for computerbased creation of photofits. The usage of artificial intelligence has made it possible to generate photofits without the user needed to be requested for selecting particular elements of a face. Determining the degree of similarity between the images shown and the actual appearance of the wanted person can now be considered as the one sole task of a witness who is trying to reproduce a photofit picture. The fundamental steps of the algorithm are described in the article, that is the determination of the attributes of the original population, evaluation function, selection and genetic operators – crossing and mutation. Research has been conveyed on an exemplary set of patterns which include following elements: oval of a face, ears, eyes, eyebrows, hair, lips and nose. The analysis of the outcome of the investigation has made it possible to optimize the settings of the genetic algorithm.
Źródło:
Zeszyty Naukowe Wydziału Elektroniki i Informatyki Politechniki Koszalińskiej; 2016, 10; 119-130
1897-7421
Pojawia się w:
Zeszyty Naukowe Wydziału Elektroniki i Informatyki Politechniki Koszalińskiej
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Algorytmy genetyczne w logistyce zaopatrzenia
Genetic algorithms in logistics of supplies
Autorzy:
Rojek, K.
Powiązania:
https://bibliotekanauki.pl/articles/313952.pdf
Data publikacji:
2017
Wydawca:
Instytut Naukowo-Wydawniczy "SPATIUM"
Tematy:
algorytm genetyczny
łańcuch dostaw
logistyka
genetic algorithm
supply chain
logistics
Opis:
W artykule przedstawiono zasady działania algorytmów genetycznych oraz wskazano sfery ich zastosowania w obszarze kształtowania łańcucha dostaw. Dokonano również charakterystyki wybranych problemów decyzyjnych w logistyce zaopatrzenia. Skupiono się przede wszystkim na metodach wyboru dostawców.
Partner selection is an important issue in the supply chain management. The paper presents decision-making areas in logistic including supply-chain management and logistics processes in enterprise management. Presents also selected decision problems in the management of supply processes. Presented identifying supply needs using ABC/XYZ methods, using multi-objective partner selection and effect and the possibility of the use of GE in logistics.
Źródło:
Autobusy : technika, eksploatacja, systemy transportowe; 2017, 18, 1-2; 53-58
1509-5878
2450-7725
Pojawia się w:
Autobusy : technika, eksploatacja, systemy transportowe
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
The Use of a Global Index of Acoustic Assessment for Predicting Noise in Industrial Rooms and Optimizing the Location of Machinery and Workstations
Autorzy:
Pleban, D.
Powiązania:
https://bibliotekanauki.pl/articles/89745.pdf
Data publikacji:
2014
Wydawca:
Centralny Instytut Ochrony Pracy
Tematy:
noise
machinery
optimization
genetic algorithm
hałas
maszyny
optymalizacja
algorytm genetyczny
Opis:
This paper describes the results of a study aimed at developing a tool for optimizing the location of machinery and workstations. A global index of acoustic assessment of machines was developed for this purpose. This index and a genetic algorithm were used in a computer tool for predicting noise emission of machines as well as optimizing the location of machines and workstations in industrial rooms. The results of laboratory and simulation tests demonstrate that the developed global index and the genetic algorithm support measures aimed at noise reduction at workstations.
Źródło:
International Journal of Occupational Safety and Ergonomics; 2014, 20, 4; 627-638
1080-3548
Pojawia się w:
International Journal of Occupational Safety and Ergonomics
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Game Theoretical Model Applied to Scheduling in Grid Computing
Autorzy:
Świtalski, P.
Seredyński, F.
Powiązania:
https://bibliotekanauki.pl/articles/93040.pdf
Data publikacji:
2007
Wydawca:
Uniwersytet Przyrodniczo-Humanistyczny w Siedlcach
Tematy:
scheduling
game theory
prisoner's dilemma
genetic algorithm
grid
task
job
Opis:
We consider a grid computational model which consist of a number of computation nodes and a number of users. Each user generates a computation load (jobs) requesting computational and communication resources. A deadline for each job is also defined. We propose a scheduling algorithm which is based on Iterated Prisoner's Dilemma (IPD) under the Random Pairing game, where nodes (players) of the grid system decide about their behavior: cooperate or defect. In this game players play a game with randomly chosen players and receive payoffs. Each player has strategies which define its decision. Genetic algorithm (GA) is used to evolve strategies to optimize a criterion related to scheduling problem. In this paper we show that GA is able to discover a strategy in the IPD model providing a cooperation between node-players, which permits to solve scheduling problem in grid.
Źródło:
Studia Informatica : systems and information technology; 2007, 2(9); 19-27
1731-2264
Pojawia się w:
Studia Informatica : systems and information technology
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Simultaneous optimization of flotation column performance using genetic evolutionary algorithm
Autorzy:
Nakhaei, F.
Irannajad, M.
Yousefikhoshbakht, M.
Powiązania:
https://bibliotekanauki.pl/articles/110806.pdf
Data publikacji:
2016
Wydawca:
Politechnika Wrocławska. Oficyna Wydawnicza Politechniki Wrocławskiej
Tematy:
flotation column
optimization
genetic algorithm
non-linear regression
upgrading curve
Opis:
Column flotation is a multivariable process. Its optimization guarantees the metallurgical yield of the process, expressed by the grade and recovery of the concentrate. The present work aimed at applying genetic algorithms (GAs) to optimize a pilot column flotation process which is characterized by being difficult to be optimized via conventional methods. A non-linear mathematical model was used to describe the dynamic behavior of the multivariable process. The solution of the optimization problem using conventional algorithms does not always lead to convergence because of the high dimensionality and non-linearity of the model. In order to deal with this process, the use of a genetic evolutionary algorithm is justified. In this way, GA was coupled with the multivariate non-linear regression (MNLR) of the column flotation metallurgical performance as a fitting function in order to optimize the column flotation process. Then, this kind of intelligent approach was verified by using mineral processing approaches such as Halbich’s upgrading curve. The aim of the optimization through GAs was searching for the process inputs that maximize the productivity of copper in the Sarcheshmeh pilot plant. In this case, the simulation optimization problem was defined as finding the best values for the froth height, chemical reagent dosage, wash water, air flow rate, air holdup, and Cu grade in rougher and column feed streams. The results indicated that GA was a robust and powerful search method to find the best values of the flotation column model parameters that lead to more reliable simulation predictions at a reasonable time. Based on the grade–recovery Halbich upgrading curve, the MNLR model coupled with GA can be used for determination of the flotation optimum conditions.
Źródło:
Physicochemical Problems of Mineral Processing; 2016, 52, 2; 874-893
1643-1049
2084-4735
Pojawia się w:
Physicochemical Problems of Mineral Processing
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Numerical analysis of tailing dam with calibration based on genetic algorithm and geotechnical monitoring data
Autorzy:
Grosel, Szczepan
Powiązania:
https://bibliotekanauki.pl/articles/1845160.pdf
Data publikacji:
2021
Wydawca:
Politechnika Wrocławska. Oficyna Wydawnicza Politechniki Wrocławskiej
Tematy:
soil parameters
optimization
slope stability
genetic algorithm
observational method
monitoring
Opis:
The article presents a method of calibration of material parameters of a numerical model based on a genetic algorithm, which allows to match the calculation results with measurements from the geotechnical monitoring network. This method can be used for the maintenance of objects managed by the observation method, which requires continuous monitoring and design alterations. The correctness of the calibration method has been verified on the basis of artificially generated data in order to eliminate inaccuracies related to approximations resulting from the numerical model generation. Using the example of the tailing dam model the quality of prediction of the selected measurement points was verified. Moreover, changes of factor of safety values, which is an important indicator for designing this type of construction, were analyzed. It was decided to exploit the case of dam of reservoir, which is under continuous construction, that is dam height is increasing constantly, because in this situation the use of the observation method is relevant.
Źródło:
Studia Geotechnica et Mechanica; 2021, 43, 1; 34-47
0137-6365
2083-831X
Pojawia się w:
Studia Geotechnica et Mechanica
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Genetic Algorithm Embedded into a Quality-Oriented Workflow of Methods for the Development of a Linear Drive used in Intralogistic Systems
Autorzy:
Wörner, L.
Kulig, S.
Willing, M.
Winzer, P.
Powiązania:
https://bibliotekanauki.pl/articles/140602.pdf
Data publikacji:
2014
Wydawca:
Polska Akademia Nauk. Czytelnia Czasopism PAN
Tematy:
DeCoDe
genetic algorithm
intralogistic systems
linear induction machine
system model
Opis:
This paper presents the results of the DFG-project (Deutsche Forschungsgemeinschaft) Q-ELF (“Qualitätsorientierter Methodenworkflow für die Produktneuentwicklung eines Linearantriebs in der Fördertechnik”) carried out in cooperation of the TU Dortmund University (support code KU 1307/12-1) with the BUW Wuppertal (support code WI 1234-11/1). The project continues the former project SFB 696 (Sonderforschungsbereich) regarding the Demand Compliant Design (DeCoDe) and the corresponding system model that strengthens the knowledge management to create high-quality mechatronical systems. In contrast to the SFB, which comprised the reverse engineering of a belt conveyor, Q-ELF applied a workflow of methods for quality oriented development on a new product. The DeCoDe ensures a methodical development that connects different engineering domains. This connection is important because the most problems and malfunctions arise at the interface of different domains due to their different notations for example. This approach also enables a methodical comparison of different competing concepts to pick the best suited one. A genetic algorithm is presented to further decrease the design-space. The project was carried out to develop linear drives for intralogistic systems.
Źródło:
Archives of Electrical Engineering; 2014, 63, 4; 647-665
1427-4221
2300-2506
Pojawia się w:
Archives of Electrical Engineering
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Distributed generation’s integration planning involving growth load models by means of genetic algorithm
Autorzy:
Rahman, Y. A.
Manjang, S.
Yusran, A.
Ilham, A.
Powiązania:
https://bibliotekanauki.pl/articles/141167.pdf
Data publikacji:
2018
Wydawca:
Polska Akademia Nauk. Czytelnia Czasopism PAN
Tematy:
distributed generation
genetic algorithm
load models
power loss
load growth
Opis:
The growth in the system load accompanied by an increase of power loss in the distribution system. Distributed generation (DG) is an important identity in the electric power sector that substantially overcomes power loss and voltage drop problems when it is coordinated with a location and size properly. In this study, the DG integration into the network is optimally distributed by considering the load conditions in different load models used to surmount the impact of load growth. There are five load models tested namely constant, residential, industrial, commercial and mixed loads. The growth of the electrical load is modeled for the base year up to the fifth year as a short-term plan. Minimization of system power loss is taken as the main objective function considering voltage limits. Determination of the location and size of DG is optimally done by using the breeder genetic algorithm (BGA). The proposed studies were applied to the IEEE 30 radial distribution system with single and multiple placement DG scenarios. The results indicated that installing an optimal location and size DG could have a strong potential to reduce power loss and to secure future energy demand of load models. Also, commercial load requires the largest DG active injection power to maintain the voltage value within tolerable limits up to five years.
Źródło:
Archives of Electrical Engineering; 2018, 67, 3; 667--682
1427-4221
2300-2506
Pojawia się w:
Archives of Electrical Engineering
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Quality improvement of a gear transmission by means of genetic algorithm
Autorzy:
Lempa, Paweł
Lisowski, Edward
Masui, Fumito
Filo, Grzegorz
Ptaszynski, Michal
Domagała, Mariusz
Fabiś-Domagała, Joanna
Powiązania:
https://bibliotekanauki.pl/articles/104043.pdf
Data publikacji:
2019
Wydawca:
Stowarzyszenie Menedżerów Jakości i Produkcji
Tematy:
optimization
genetic algorithm
gear transmission
optymalizacja
algorytm genetyczny
przekładnia zębata
Opis:
The article deals with the issue of quality improvement of a gear transmission by optimizing its geometry with the use of genetic algorithms. The optimization method is focused on increasing productivity and efficiency of the pump and reducing its pulsation. The best results are tested on mathematical model and automatically modelled in 3D be means of PTC Creo Software. The developed solution proved to be an effective tool in the search for better results, which greatly improved parameters of pump especially reduced flow pulsation.
Źródło:
Quality Production Improvement - QPI; 2019, 1, 1; 386-393
2657-8603
Pojawia się w:
Quality Production Improvement - QPI
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
A strategy in sports betting with the nearest neighbours search and genetic algorithms
Autorzy:
Borycki, D.
Powiązania:
https://bibliotekanauki.pl/articles/106184.pdf
Data publikacji:
2011
Wydawca:
Uniwersytet Marii Curie-Skłodowskiej. Wydawnictwo Uniwersytetu Marii Curie-Skłodowskiej
Tematy:
sports betting
nearest neighbour search
genetic algorithm
English Premier League
Opis:
The point of sports betting is not merely to correctly predict the outcome of a game, but to actually win on a bet. We propose a model of sports betting that uses the nearest neighbours search and genetic algorithms to do the job. It uses data on the teams playing, their respective formations, individual players, results of previous games, as well as odds offered by bookmakers. The model has been trained using the data from the seasons 2002/03 until 2008/09 of the English Premier League and tested against the already played games of the seasons 2009/10 and 2010/11.
Źródło:
Annales Universitatis Mariae Curie-Skłodowska. Sectio AI, Informatica; 2011, 11, 1; 7-13
1732-1360
2083-3628
Pojawia się w:
Annales Universitatis Mariae Curie-Skłodowska. Sectio AI, Informatica
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Simulation of the characteristics of the ball movement on a beam by the use of genetic algorithm
Symulacja charakterystyk ruchu kulki po równoważni poprzez zastosowanie algorytmu genetycznego
Autorzy:
Woźniak, M.
Gabryel, M.
Nowicki, R.
Powiązania:
https://bibliotekanauki.pl/articles/87328.pdf
Data publikacji:
2012
Wydawca:
Politechnika Śląska. Wydawnictwo Politechniki Śląskiej
Tematy:
algorytm genetyczny
układ dynamiczny
symulacja
genetic algorithm
dynamical system
simulation
Opis:
Article aims to show the possibility of simulating the characteristics of different technical systems in a way of genetic evolution. Genetic algorithms (GA) are widely used in computer science, mathematics and technology and broadly understood engineering that the authors describe in papers. In the literature were shown examples of GA used to solve logistic problems, structural or design in engineering, computer science and even biology or chemistry. In this paper, the authors seek to demonstrate the applicability of GA methods in simulation of the system characteristics of dynamic systems.
Artykuł ma na celu ukazanie możliwości symulowania charakterystyk różnych systemów technicznych w drodze genetycznej ewolucji. Algorytmy genetyczne (GA) są szeroko stosowane w informatyce, matematyce oraz szeroko rozumianej inżynierii, co opisują autorzy w pracach. W literaturze wykazano przykłady GA wykorzystywane do rozwiązywania problemów logistycznych, strukturalnych, projektowania inżynierskiego, informatyki i nawet biologii czy chemii. W tym artykule autorzy starają się wykazać przydatność metod GA w symulacji charakterystyk układów dynamicznych.
Źródło:
Zeszyty Naukowe. Matematyka Stosowana / Politechnika Śląska; 2012, 2; 19-33
2084-073X
Pojawia się w:
Zeszyty Naukowe. Matematyka Stosowana / Politechnika Śląska
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
The Unrelated Parallel Machines Scheduling Problem with Machine and Job Dependent Setup Times, Availability Constraints, Time Windows and Maintenance Times
Autorzy:
Agárdi, Anita
Nehéz, Károly
Powiązania:
https://bibliotekanauki.pl/articles/2023961.pdf
Data publikacji:
2021-09
Wydawca:
Polska Akademia Nauk. Czytelnia Czasopism PAN
Tematy:
production scheduling
parallel machine
setup time
time windows
genetic algorithm
Opis:
Unrelated Parallel Machines Scheduling Problem (U-PMSP) is a category of discrete optimization problems in which various manufacturing jobs are assigned to identical parallel machines at particular times. In this paper, a specific production scheduling task the U-PMSP with Machine and Job Dependent Setup Times, Availability Constraint, Time Windows and Maintenance Times is introduced. Machines with different capacity limits and maintenance times are available to perform the tasks. After that our problem, the U-PMSP with Machine and Job Dependent Setup Times, Availability Constraints, Time Windows and Maintenance Times is detailed. After that, the applied optimization algorithm and their operators are introduced. The proposed algorithm is the genetic algorithm (GA), and proposed operators are the order crossover, partially matched crossover, cycle crossover and the 2-opt as a mutation operator. Then we prove the efficiency of our algorithm with test results. We also prove the efficiency of the algorithm on our own data set and benchmark data set. The authors conclude that this GA is effective for solving high complexity parallel machine problems.
Źródło:
Management and Production Engineering Review; 2021, 13, 3; 15-24
2080-8208
2082-1344
Pojawia się w:
Management and Production Engineering Review
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Construction of Variable Strength Covering Array for Combinatorial Testing Using a Greedy Approach to Genetic Algorithm
Autorzy:
Bansal, P
Sabharwal, S
Mittal, N
Arora, S
Powiązania:
https://bibliotekanauki.pl/articles/384137.pdf
Data publikacji:
2015
Wydawca:
Politechnika Wrocławska. Oficyna Wydawnicza Politechniki Wrocławskiej
Tematy:
combinatorial testing
variable strength covering array
genetic algorithm
greedy approach
Opis:
The limitation of time and budget usually prohibits exhaustive testing of interactions between components in a component based software system. Combinatorial testing is a software testing technique that can be used to detect faults in a component based software system caused by the interactions of components in an effective and efficient way. Most of the research in the field of combinatorial testing till now has focused on the construction of optimal covering array (CA) of fixed strength t which covers all t-way interactions among components. The size of CA increases with the increase in strength of testing t, which further increases the cost of testing. However, not all components require higher strength interaction testing. Hence, in a system with k components a technique is required to construct CA of fixed strength t which covers all t-way interactions among k components and all ti-way (where ti > t) interactions between a subset of k components. This is achieved using the variable strength covering array (VSCA). In this paper we propose a greedy based genetic algorithm (GA) to generate optimal VSCA. Experiments are conducted on several benchmark configurations to evaluate the effectiveness of the proposed approach.
Źródło:
e-Informatica Software Engineering Journal; 2015, 9, 1; 87-105
1897-7979
Pojawia się w:
e-Informatica Software Engineering Journal
Dostawca treści:
Biblioteka Nauki
Artykuł
Wyświetlanie 1-100 z 375

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