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