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ę "algorithm," wg kryterium: Temat

  Lista filtrów
Wyrównaj
Wyświetlanie 1-15 z 101
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ł:
Optimization of electric and magnetic field intensities in proximity of power lines using genetic and particle swarm algorithms
Autorzy:
Król, K.
Machczyński, W.
Powiązania:
https://bibliotekanauki.pl/articles/141588.pdf
Data publikacji:
2018
Wydawca:
Polska Akademia Nauk. Czytelnia Czasopism PAN
Tematy:
power line
electric field
magnetic field
optimization
genetic algorithm
particle swarm algorithm
Opis:
The paper presents optimization of power line geometrical parameters aimed to reduce the intensity of the electric field and magnetic field intensity under an overhead power line with the use of a genetic algorithm (AG) and particle swarm optimization (PSO). The variation of charge distribution along the conductors as well as the sag of the overhead line and induced currents in earth wires were taken into account. The conductor sag was approximated by a chain curve. The charge simulation method (CSM) and the method of images were used in the simulations of an electric field, while a magnetic field were calculated using the Biot–Savart law. Sample calculations in a three-dimensional system were made for a 220 kV single – circuit power line. A comparison of the used optimization algorithms was made.
Źródło:
Archives of Electrical Engineering; 2018, 67, 4; 829-843
1427-4221
2300-2506
Pojawia się w:
Archives of Electrical Engineering
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Evolutionary algorithm with a configurable search mechanism
Autorzy:
Łapa, Krystian
Cpałka, Krzysztof
Laskowski, Łukasz
Cader, Andrzej
Zeng, Zhigang
Powiązania:
https://bibliotekanauki.pl/articles/1837536.pdf
Data publikacji:
2020
Wydawca:
Społeczna Akademia Nauk w Łodzi. Polskie Towarzystwo Sieci Neuronowych
Tematy:
evolutionary algorithm
population-based algorithm
optimization
operator pool
operator selection
individual selection
Opis:
In this paper, we propose a new population-based evolutionary algorithm that automatically configures the used search mechanism during its operation, which consists in choosing for each individual of the population a single evolutionary operator from the pool. The pool of operators comes from various evolutionary algorithms. With this idea, a flexible balance between exploration and exploitation of the problem domain can be achieved. The approach proposed in this paper might offer an inspirational alternative in creating evolutionary algorithms and their modifications. Moreover, different strategies for mutating those parts of individuals that encode the used search operators are also taken into account. The effectiveness of the proposed algorithm has been tested using typical benchmarks used to test evolutionary algorithms.
Źródło:
Journal of Artificial Intelligence and Soft Computing Research; 2020, 10, 3; 151-171
2083-2567
2449-6499
Pojawia się w:
Journal of Artificial Intelligence and Soft Computing Research
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ł:
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ł:
Ant algorithm for AP-N aimed at optimization of complex systems
Autorzy:
Mikulik, J.
Zajdel, M.
Powiązania:
https://bibliotekanauki.pl/articles/375987.pdf
Data publikacji:
2010
Wydawca:
Akademia Górniczo-Hutnicza im. Stanisława Staszica w Krakowie. Wydawnictwo AGH
Tematy:
assignment problem
ant algorithm
optimization
Opis:
Assignment Problem (AP), which is well known combinatorial problem, has been studied extensively in the course of many operational and technical researches. It has been shown to be NP-hard for three or more dimensions and a few non-deterministic methods have been proposed to solve it. This paper pays attention on new heuristic search method for the n-dimensional assignment problem, based on swarm intelligence and comparing results with those obtained by other scientists. It indicates possible direction of solutions of problems and presents a way of behaviour using ant algorithm for multidimensional optimization complex systems. Results of researches in the form of computational simulations outcomes are presented.
Źródło:
Decision Making in Manufacturing and Services; 2010, 4, 1-2; 29-36
1896-8325
2300-7087
Pojawia się w:
Decision Making in Manufacturing and Services
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ł:
The Use of Heuristic Algorithms to Optimize the Transport Issues on the Example of Municipal Services Companies
Autorzy:
Izdebski, M.
Powiązania:
https://bibliotekanauki.pl/articles/223579.pdf
Data publikacji:
2014
Wydawca:
Polska Akademia Nauk. Czytelnia Czasopism PAN
Tematy:
municipal services companies
transport
optimization
genetic algorithm
ant algorithm
usługi komunalne
optymalizacja
algorytm genetyczny
Opis:
In this article the main optimization problems in the municipal services companies were presented. These problems concern the issue of vehicle routing. The mathematical models of these problems were described. The function of criterion and the conditions on designating the vehicle routing were defined. In this paper the hybrid algorithm solving the presented problems was proposed. The hybrid algorithm consists of two heuristic algorithms: the ant and the genetic algorithm. In this paper the stages of constructing of the hybrid 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. This algorithm was verified in programming language C #. The process of verification was divided into two stages. In the first stage the best parameters of the hybrid 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 hybrid algorithm.
Źródło:
Archives of Transport; 2014, 29, 1; 27-36
0866-9546
2300-8830
Pojawia się w:
Archives of Transport
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Algorithmic optimization of the calculation with the consideration of the interconnection of the basic economic parameters of the flight route of the model air carrier
Autorzy:
Szabo, Stanislav
Blistanova, Monika
Mako, Sebastian
Vajdova, Iveta
Pilat, Marek
Powiązania:
https://bibliotekanauki.pl/articles/410102.pdf
Data publikacji:
2020
Wydawca:
STE GROUP
Tematy:
algorithm
optimization
economic analysis
load factor
Opis:
The load factor is the determining factor for airlines in economic terms and the prediction of the future development of the flight route. The combination of load factor and break-even point provides the airline with a comprehensive picture of the business of the flight route and the optimization of pricing for the flight route. The purpose of the article is to propose and adapt the development of air transport prices on a given line using maximally recalculated values and maximize profit. The optimized calculation algorithm then facilitates the understanding of the individual steps of the load factor calculation and the monitoring of price development by means of the chi-square mathematical method by which we observed the interconnection of the ticket price and the load factor. To describe the problem, we chose the Bratislava – Larnaca route.
Źródło:
Management Systems in Production Engineering; 2020, 1 (28); 34-39
2299-0461
Pojawia się w:
Management Systems in Production Engineering
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
An application of evolutionary and immune algorithms for the optimisation of packing a diversified set of packets on a pallet
Zastosowanie algorytmów ewolucyjnych i immunologicznych do optymalizacji ułożenia różnorodnych pakunków na palecie
Autorzy:
Mrówczyńska, B.
Powiązania:
https://bibliotekanauki.pl/articles/258154.pdf
Data publikacji:
2008
Wydawca:
Sieć Badawcza Łukasiewicz - Instytut Technologii Eksploatacji - Państwowy Instytut Badawczy
Tematy:
algorytm ewolucyjny
algorytm immunologiczny
optymalizacja
układanie paczek
paleta
evolutionary algorithm
immunology algorithm
optimization
packages distributing
pallet
Opis:
This paper deals with an application of evolutionary and immune algorithms to load a diversified set of packages on a pallet in fully automated warehouses, where workers will be substituted by mobile robots. There are some problems in semi-automated warehouses, where new workers do not have enough experience to know how to distribute packages on pallet. The aim of this work was to formulate the problem of loading a diversified set of packages on a pallet both in evolutionary and immune algorithms. The evolutionary algorithm is inspired by natural evolution. It searches for a solution in the evolution way. The artificial immune system is based on immunology principles. The adaptive immune system helps to recognise and respond to any microbe that has never attacked the body. The presented algorithm of the immune optimisation uses part of this immune system.
W niniejszym artykule przedstawiono zastosowanie algorytmu ewolucyjnego i algorytmu immunologicznego do optymalizacji załadunku palety różnorodnymi towarami. Automatyzacja załadunku jest potrzebna zarówno w całkowicie zautomatyzowanych magazynach, obsługiwanych przez mobilne roboty, jak i w częściowo zautomatyzowanych, ale z dużą fluktuacją zatrudnienia operatorów wózków widłowych, co powoduje zatrudnianie ciągle nowych, niedoświadczonych w pakowaniu palet pracowników. W artykule zostało sformułowane zadanie optymalizacji. Zadanie należy do NP trudnych. Przedstawiono dwie metody rozwiązania: algorytmy ewolucyjne oraz algorytmy immunologiczne. Obie metody należą do metod sztucznej inteligencji. Pierwsza z nich poszukuje rozwiązania w sposób naśladujący naturalną ewolucję. W drugiej do znalezienia rozwiązania wykorzystuje się metody, w jaki żywy organizm identyfikuje przeciwciała.
Źródło:
Problemy Eksploatacji; 2008, 4; 137-145
1232-9312
Pojawia się w:
Problemy Eksploatacji
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ł:
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ł:
A new concept of an artificial ecosystem algorithm for optimization problems
Autorzy:
Baczynski, D.
Powiązania:
https://bibliotekanauki.pl/articles/205935.pdf
Data publikacji:
2016
Wydawca:
Polska Akademia Nauk. Instytut Badań Systemowych PAN
Tematy:
artificial ecosystem algorithm
optimization
computational intelligence methods
Opis:
This article provides, first, a review of applications of the ecosystem idea in different computational intelligence methods. The article presents the bases of ecosystem operation and a new concept for modelling the phenomena occurring in an ecosystem, with the aim of using these for optimization purposes. The author’s original form of the Artificial Ecosystem Algorithm (AEA) and its constituent parts are presented. The construction of the proposed algorithm was dedicated for continuous optimisation. The operation of the Artificial Ecosystem Algorithm is also compared with an Evolutionary Algorithm and PSO for six test functions for various numbers of variables. Conclusions concerning operation, structure and complexity of AEA are provided at the end.
Źródło:
Control and Cybernetics; 2016, 45, 1; 5-36
0324-8569
Pojawia się w:
Control and Cybernetics
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Network routing method for ships and other moving objects using MATLAB
Autorzy:
Sakharov, Vladimir V.
Chertkov, Alexandr A.
Ariefjew, Igor B.
Powiązania:
https://bibliotekanauki.pl/articles/135140.pdf
Data publikacji:
2020
Wydawca:
Akademia Morska w Szczecinie. Wydawnictwo AMSz
Tematy:
algorithm
path
optimization
transport
automation
moving object
Opis:
Task planning involves automating the creation of the routes for vessels with known coordinates in a confined space. The management of vessel release in a given area affects the time required for a vessel to complete its voyage, and maximizing vessel performance involves identifying the shortest route. A key issue in automating the generation of the optimal (shortest) routes is selecting the appropriate mathematical apparatus. This paper considers an optimization method based on a recursive algorithm using Bellman-Ford routing tasks for large dimensions. Unlike other optimization techniques, the proposed method enables the shortest path to be assessed in a network model with a complex topology, even if there are arcs with negative weights. The practical implementation of the modified Floyd algorithm was demonstrated using a sample automated build and using it to calculate a network model with a complex topology, using an iterative procedure for a program prepared in MATLAB. Implementation of the computer model is simple, and unlike existing models, it eliminates restrictions associated with the presence of negative weights and cycles on a network and automates search shortcuts in ground branch functional means in MATLAB. To confirm the accuracy of the obtained results, we performed an example calculation using the network. The proposed algorithm and recursive procedure are recommended for finding energy-efficient solutions during the management of mobile objects on waterways.
Źródło:
Zeszyty Naukowe Akademii Morskiej w Szczecinie; 2020, 62 (134); 61-68
1733-8670
2392-0378
Pojawia się w:
Zeszyty Naukowe Akademii Morskiej w Szczecinie
Dostawca treści:
Biblioteka Nauki
Artykuł
Wyświetlanie 1-15 z 101

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