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-50 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ł
Wyświetlanie 1-50 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