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

  Lista filtrów
Wyrównaj
Wyświetlanie 1-15 z 52
Tytuł:
Firefly algorithm in optimization of queueing systems
Autorzy:
Kwiecień, J.
Filipowicz, B.
Powiązania:
https://bibliotekanauki.pl/articles/201299.pdf
Data publikacji:
2012
Wydawca:
Polska Akademia Nauk. Czytelnia Czasopism PAN
Tematy:
queueing systems
firefly algorithm
Opis:
Queueing theory provides methods for analysis of complex service systems in computer systems, communications, transportation networks and manufacturing. It incorporates Markovian systems with exponential service times and a Poisson arrival process. Two queueing systems with losses are also briefly characterized. The article describes firefly algorithm, which is successfully used for optimization of these queueing systems. The results of experiments performed for selected queueing systems have been also presented.
Źródło:
Bulletin of the Polish Academy of Sciences. Technical Sciences; 2012, 60, 2; 363-368
0239-7528
Pojawia się w:
Bulletin of the Polish Academy of Sciences. Technical Sciences
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Analysis of multi-step algorithms for cognitive maps learning
Autorzy:
Jastriebow, A.
Poczęta, K.
Powiązania:
https://bibliotekanauki.pl/articles/201551.pdf
Data publikacji:
2014
Wydawca:
Polska Akademia Nauk. Czytelnia Czasopism PAN
Tematy:
cognitive maps
multistep learning algorithm
gradient method
Hebbian algorithm
mapy poznawcze
wieloetapowe nauki algorytmu
metoda gradientu
algorytm kWTA
Opis:
This article is devoted to the analysis of multi-step algorithms for cognitive maps learning. Cognitive maps and multi-step supervised learning based on a gradient method and unsupervised one based on the non-linear Hebbian algorithm were described. Comparative analysis of these methods to one-step algorithms, from the point of view of the speed of convergence of a learning algorithm and the influence on the work of the decision systems was performed. Simulation results were done on prepared software tool ISEMK. Obtained results show that implementation of the multi-step technique gives certain possibilities to get quicker values of target relations values and improve the operation of the learned system.
Źródło:
Bulletin of the Polish Academy of Sciences. Technical Sciences; 2014, 62, 4; 735-741
0239-7528
Pojawia się w:
Bulletin of the Polish Academy of Sciences. Technical Sciences
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Comparison of firefly and cockroach algorithms in selected discrete and combinatorial problems
Autorzy:
Kwiecień, J.
Filipowicz, B.
Powiązania:
https://bibliotekanauki.pl/articles/200148.pdf
Data publikacji:
2014
Wydawca:
Polska Akademia Nauk. Czytelnia Czasopism PAN
Tematy:
queueing systems
flow shop scheduling
firefly algorithm
cockroach algorithm
systemy kolejkowe
planowanie przepływów
algorytm świetlika
algorytm karaluch
Opis:
In recent years, newer algorithms inspired by nature have been created and used to solve various problems. Therefore, in the paper we present the application of firefly and cockroach algorithms to optimize two queueing systems and permutation flow shop problems with the objective of minimizing the makespan. The article briefly describes these algorithms to solve selected problems and their results. Because these algorithms were originally developed for continuous optimization problems, we introduce a new formula to transform the position of ith individual to solve the discrete problems.
Źródło:
Bulletin of the Polish Academy of Sciences. Technical Sciences; 2014, 62, 4; 797-804
0239-7528
Pojawia się w:
Bulletin of the Polish Academy of Sciences. Technical Sciences
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
A comparison of nature inspired algorithms for the quadratic assignment problem
Autorzy:
Chmiel, W.
Kadłuczka, P.
Kwiecień, J.
Filipowicz, B.
Powiązania:
https://bibliotekanauki.pl/articles/202135.pdf
Data publikacji:
2017
Wydawca:
Polska Akademia Nauk. Czytelnia Czasopism PAN
Tematy:
permutation problem
quadratic assignment problem
ant algorithm
bees algorithm
problem permutacji
problem przydziału kwadratowego
algorytm Ant Colony
algorytm pszczół
Opis:
This paper presents an application of the ant algorithm and bees algorithm in optimization of QAP problem as an example of NP-hard optimization problem. The experiments with two types of algorithms: the bees algorithm and the ant algorithm were performed for the test instances of the quadratic assignment problem from QAPLIB, designed by Burkard, Karisch and Rendl. On the basis of the experiments results, an influence of particular elements of algorithms, including neighbourhood size and neighbourhood search method, will be determined.
Źródło:
Bulletin of the Polish Academy of Sciences. Technical Sciences; 2017, 65, 4; 513-522
0239-7528
Pojawia się w:
Bulletin of the Polish Academy of Sciences. Technical Sciences
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Topology optimization of trusses using bars exchange method
Autorzy:
Bojczuk, D.
Rębosz-Kurdek, A.
Powiązania:
https://bibliotekanauki.pl/articles/202330.pdf
Data publikacji:
2012
Wydawca:
Polska Akademia Nauk. Czytelnia Czasopism PAN
Tematy:
trusses
algorithm of optimization
optimal topologies
bars exchange
Opis:
The algorithm of optimization of trusses is presented in the paper, where for topology optimization the bars exchange method is used. In the first case, the problem aimed at cost minimization with a constraint set on global stiffness is formulated. In the second case, the problem of minimizing the cost function subjected to stress and cross-sectional area constraints is discussed and here the multiple-load case is taken into consideration. The conditions for introduction of topology modification and its acceptance are specified. The paper is illustrated with three examples.
Źródło:
Bulletin of the Polish Academy of Sciences. Technical Sciences; 2012, 60, 2; 185-189
0239-7528
Pojawia się w:
Bulletin of the Polish Academy of Sciences. Technical Sciences
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Better polynomial algorithms for scheduling unit-length jobswith bipartite incompatibility graphs on uniform machines
Autorzy:
Pikies, T.
Kubale, Marek
Powiązania:
https://bibliotekanauki.pl/articles/201958.pdf
Data publikacji:
2019
Wydawca:
Polska Akademia Nauk. Czytelnia Czasopism PAN
Tematy:
approximation algorithm
graph coloring
incompatible job
polynomial algorithm
scheduling
uniform machine
unit-time jobs
algorytm aproksymacyjny
kolorowanie grafów
algorytm wielomianowy
planowanie
praca jednostkowa
Opis:
The goal of this paper is to explore and to provide tools for the investigation of the problems of unit-length scheduling of incompatible jobs on uniform machines. We present two new algorithms that are a significant improvement over the known algorithms. The first one is Algorithm 2 which is 2-approximate for the problem Qm|pj = 1, G = bisubquartic|Cmax. The second one is Algorithm 3 which is 4-approximate for the problem Qm|pj = 1, G = bisubquartic|ΣCj, where m ϵ {2, 3, 4}. The theory behind the proposed algorithms is based on the properties of 2-coloring with maximal coloring width, and on the properties of ideal machine, an abstract machine that we introduce in this paper.
Źródło:
Bulletin of the Polish Academy of Sciences. Technical Sciences; 2019, 67, 1; 31-36
0239-7528
Pojawia się w:
Bulletin of the Polish Academy of Sciences. Technical Sciences
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
A greedy algorithm for the DNA sequencing by hybridization with positive and negative errors and information about repetitions
Autorzy:
Kwarciak, K.
Formanowicz, P.
Powiązania:
https://bibliotekanauki.pl/articles/202322.pdf
Data publikacji:
2011
Wydawca:
Polska Akademia Nauk. Czytelnia Czasopism PAN
Tematy:
DNA sequencing
l-mer multiplicity
greedy algorithm
combinatorial problems
Opis:
In this paper a greedy algorithm for some variants of the sequencing by hybridization method is presented. In the standard version of the method information about repetitions is not available. In the paper it is assumed that a partial information of this type is a part of the problem instance. Here two simple but realistic models of this information are taken into consideration. The first one assumes it is known if a given element of a spectrum appears in the target sequence once or more than once. The second model uses the knowledge is a given element of a spectrum occurs in the analyzed sequence once, twice or at least three times. The proposed greedy algorithm solves the variant of the problem with positive and negative errors. Results of a computational experiment are reported which, among others, confirm that the additional information leads to the improvement of the obtained solutions. They also show that the more precise model of information increases the quality of reconstructed sequences.
Źródło:
Bulletin of the Polish Academy of Sciences. Technical Sciences; 2011, 59, 1; 111-115
0239-7528
Pojawia się w:
Bulletin of the Polish Academy of Sciences. Technical Sciences
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
A new genetic approach for transport network design and optimization
Autorzy:
Dinu, S.
Bordea, G.
Powiązania:
https://bibliotekanauki.pl/articles/200177.pdf
Data publikacji:
2011
Wydawca:
Polska Akademia Nauk. Czytelnia Czasopism PAN
Tematy:
genetic algorithm
bilevel programming
Network Design Problem
complex-encoding
Opis:
This paper presents an improved Genetic Algorithm to solve the Transportation Network Design Problem (CTNDP) with interactions among different links. The CTNDP is formulated in an optimal design as a bi-level programming model. A key factor in the present approach is the combination of diploid based complex-encoding with meiosis specific features. The novel mutation operator proposed is another improvement that leads to a better robustness and convergence stability. The computational results obtained by comparing the performance of the proposed algorithm and other Genetic Algorithms for a test network demonstrates its better local searching ability, as well as its high efficiency. Finally, suggestions for further research and extensions are given.
Źródło:
Bulletin of the Polish Academy of Sciences. Technical Sciences; 2011, 59, 3; 263-272
0239-7528
Pojawia się w:
Bulletin of the Polish Academy of Sciences. Technical Sciences
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Algorithms of parallel calculations in task of tolerance ellipsoidal estimation of interval model parameters
Autorzy:
Dyvak, M.
Stakhiv, P.
Pukas, A.
Powiązania:
https://bibliotekanauki.pl/articles/201054.pdf
Data publikacji:
2012
Wydawca:
Polska Akademia Nauk. Czytelnia Czasopism PAN
Tematy:
interval model
parameters identification
tolerance ellipsoidal estimation
parallel algorithm
Opis:
The methods of the tolerance ellipsoidal estimation for the tasks of synthesis of the tolerances to parameters of radio-electronic circuits and possibility of its parallelization are considered. These methods are the result of the task of estimation the solutions of an interval system of linear algebraic equations (ISLAE) which is built according to given criteria of optimality. The numerical algorithm is proposed for solving the tolerance ellipsoidal estimation tasks with a possibility of parallelization.
Źródło:
Bulletin of the Polish Academy of Sciences. Technical Sciences; 2012, 60, 1; 159-164
0239-7528
Pojawia się w:
Bulletin of the Polish Academy of Sciences. Technical Sciences
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Neural modeling and optimization of the coverage of the sprayed surface
Autorzy:
Cieniawska, B.
Pentoś, K.
Łuczycka, D.
Powiązania:
https://bibliotekanauki.pl/articles/200585.pdf
Data publikacji:
2020
Wydawca:
Polska Akademia Nauk. Czytelnia Czasopism PAN
Tematy:
spray nozzle
spraying efficiency
spray coverage
artificial neural network
genetic algorithm
Opis:
Improving application efficiency is crucial for both the economic and environmental aspects of plant protection. Mathematical models can help in understanding the relationships between spray application parameters and efficiency, and reducing the negative impact on the environment. The effect of nozzle type, spray pressure, driving speed and spray angle on spray coverage on an artificial plant was studied. Artificial intelligence techniques were used for modeling and the optimization of application process efficiency. The experiments showed a significant effect of droplet size on the percent area coverage of the sprayed surfaces. A high value of the vertical transverse approach surface coverage results from coarse droplets, high driving speed, and nozzles angled forward. Increasing the vertical transverse leaving surface coverage, as well as the coverage of the sum of all sprayed surfaces, requires fine droplets, low driving speed, and nozzles angled backwards. The maximum coverage of the upper level surface is obtained with coarse droplets, low driving speed, and a spray angle perpendicular to the direction of movement. The choice of appropriate nozzle type and spray pressure is an important aspect of chemical crop protection. Higher upper level surface coverage is obtained when single flat fan nozzles are used, while twin nozzles produce better coverage of vertical surfaces. Adequate neural models and evolutionary algorithms can be used for pesticide application process efficiency optimization.
Źródło:
Bulletin of the Polish Academy of Sciences. Technical Sciences; 2020, 68, 3; 601-608
0239-7528
Pojawia się w:
Bulletin of the Polish Academy of Sciences. Technical Sciences
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
GPU-based tuning of quantum-inspired genetic algorithm for a combinatorial optimization problem
Autorzy:
Nowotniak, R.
Kucharski, J.
Powiązania:
https://bibliotekanauki.pl/articles/201268.pdf
Data publikacji:
2012
Wydawca:
Polska Akademia Nauk. Czytelnia Czasopism PAN
Tematy:
quantum-inspired genetic algorithm
evolutionary computing
meta-optimization
parallel algorithms
GPGPU
Opis:
This paper concerns efficient parameters tuning (meta-optimization) of a state-of-the-art metaheuristic, Quantum-Inspired Genetic Algorithm (QIGA), in a GPU-based massively parallel computing environment (NVidia CUDATMtechnology). A novel approach to parallel implementation of the algorithm has been presented. In a block of threads, each thread transforms a separate quantum individual or different quantum gene; In each block, a separate experiment with different population is conducted. The computations have been distributed to eight GPU devices, and over 400× speedup has been gained in comparison to Intel Core i7 2.93GHz CPU. This approach allows efficient meta-optimization of the algorithm parameters. Two criteria for the meta-optimization of the rotation angles in quantum genes state space have been considered. Performance comparison has been performed on combinatorial optimization (knapsack problem), and it has been presented that the tuned algorithm is superior to Simple Genetic Algorithm and to original QIGA algorithm.
Źródło:
Bulletin of the Polish Academy of Sciences. Technical Sciences; 2012, 60, 2; 323-330
0239-7528
Pojawia się w:
Bulletin of the Polish Academy of Sciences. Technical Sciences
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Multi-constrained topology optimization using constant criterion surface algorithm
Autorzy:
Mrzygłód, M.
Powiązania:
https://bibliotekanauki.pl/articles/201310.pdf
Data publikacji:
2012
Wydawca:
Polska Akademia Nauk. Czytelnia Czasopism PAN
Tematy:
multi-constrained topology optimization
stress and fatigue constraints
constant criterion surface algorithm
Opis:
This paper sets out to describe a multi-constrained approach to topology optimization of structures. In the optimization, a constant criterion surface algorithm and the multi-constraint procedure is used. The multi-constraint procedure consists of constraints normalization and equivalent design space assembling. The work is illustrated by an example of the L-shaped domain optimization with the horizontal line support and complex loads. The example takes into consideration stress, fatigue and compliance constraints. The separate and simultaneous application of constraints resulted in significant differences in structure topology layouts. The application of a fatigue constraint gave more conservative results when compared to static stress or compliance limitations. The multi-constrained approach allowed effectively lowering the mass of the structure while satisfying all constraints.
Źródło:
Bulletin of the Polish Academy of Sciences. Technical Sciences; 2012, 60, 2; 229-236
0239-7528
Pojawia się w:
Bulletin of the Polish Academy of Sciences. Technical Sciences
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Research on hybrid modified pathfinder algorithm for optimal reactive power dispatch
Autorzy:
Suresh, V.
Senthil Kumar, S.
Powiązania:
https://bibliotekanauki.pl/articles/2086822.pdf
Data publikacji:
2021
Wydawca:
Polska Akademia Nauk. Czytelnia Czasopism PAN
Tematy:
optimal reactive power dispatch
ORPD
real-power losses
pathfinder algorithm
PFA
modified pathfinder algorithm
mPFA
hybrid pathfinder algorithm
HPFA
optymalna dyspozycja mocy biernej
strata mocy rzeczywistej
algorytm wyszukiwania najkrótszej drogi
algorytm wyszukiwania najkrótszej drogi zmodyfikowany
algorytm wyszukiwania najkrótszej drogi hybrydowy
Opis:
Hybridization of meta-heuristic algorithms plays a major role in the optimization problem. In this paper, a new hybrid meta-heuristic algorithm called hybrid pathfinder algorithm (HPFA) is proposed to solve the optimal reactive power dispatch (ORPD) problem. The superiority of the Differential Evolution (DE) algorithm is the fast convergence speed, a mutation operator in the DE algorithm incorporates into the pathfinder algorithm (PFA). The main objective of this research is to minimize the real power losses and subject to equality and inequality constraints. The HPFA is used to find optimal control variables such as generator voltage magnitude, transformer tap settings and capacitor banks. The proposed HPFA is implemented through several simulation cases on the IEEE 118-bus system and IEEE 300-bus power system. Results show the superiority of the proposed algorithm with good quality of optimal solutions over existing optimization techniques, and hence confirm its potential to solve the ORPD problem.
Źródło:
Bulletin of the Polish Academy of Sciences. Technical Sciences; 2021, 69, 4; e137733, 1--8
0239-7528
Pojawia się w:
Bulletin of the Polish Academy of Sciences. Technical Sciences
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Blocks for two-machines total weighted tardiness flow shop scheduling problem
Autorzy:
Bożejko, W.
Uchroński, M.
Wodecki, M.
Powiązania:
https://bibliotekanauki.pl/articles/202179.pdf
Data publikacji:
2020
Wydawca:
Polska Akademia Nauk. Czytelnia Czasopism PAN
Tematy:
flow shop
two machine
due date
minimal costs
blocks of tasks
parallel algorithm
Opis:
The paper discusses a two-machine flow shop problem with minimization of the sum of tardiness costs, being a a generalization of the popular NP-hard single-machine problem with this criterion. We propose the introduction of new elimination block properties allowing for accelerating the operation of approximate algorithms of local searches, solving this problem and improving the quality of solutions determined by them.
Źródło:
Bulletin of the Polish Academy of Sciences. Technical Sciences; 2020, 68, 1; 31-41
0239-7528
Pojawia się w:
Bulletin of the Polish Academy of Sciences. Technical Sciences
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Artificial bee colony based state feedback position controller for PMSM servo-drive – the efficiency analysis
Autorzy:
Tarczewski, T.
Niewiara, L. J.
Grzesiak, L. M.
Powiązania:
https://bibliotekanauki.pl/articles/200239.pdf
Data publikacji:
2020
Wydawca:
Polska Akademia Nauk. Czytelnia Czasopism PAN
Tematy:
tuning
PMSM servo-drive
artificial bee colony algorithm
linear-quadratic optimization problem
pole placement
Opis:
This paper presents a state feedback controller (SFC) for position control of PMSM servo-drive. Firstly, a short review of the commonly used swarm-based optimization algorithms for tuning of SFC is presented. Then designing process of current control loop as well as of SFC with feedforward path is depicted. Next, coefficients of controller are tuned by using an artificial bee colony (ABC) optimization algorithm. Three of the most commonly applied tuning methods (i.e. linear-quadratic optimization, pole placement technique and direct selection of coefficients) are used and investigated in terms of positioning performance, disturbance compensation and robustness against plant parameter changes. Simulation analysis is supported by experimental tests conducted on laboratory stand with modern PMSM servo-drive.
Źródło:
Bulletin of the Polish Academy of Sciences. Technical Sciences; 2020, 68, 5; 997-1007
0239-7528
Pojawia się w:
Bulletin of the Polish Academy of Sciences. Technical Sciences
Dostawca treści:
Biblioteka Nauki
Artykuł
Wyświetlanie 1-15 z 52

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