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ę "dynamic optimization" wg kryterium: Temat

  Lista filtrów
Wyrównaj
Wyświetlanie 1-15 z 72
Tytuł:
Self-Adaptive Differential Evolution with Hybrid Rules of Perturbation for Dynamic Optimization
Autorzy:
Trojanowski, K.
Raciborski, M.
Kaczyński, P.
Powiązania:
https://bibliotekanauki.pl/articles/308439.pdf
Data publikacji:
2011
Wydawca:
Instytut Łączności - Państwowy Instytut Badawczy
Tematy:
adaptive differential evolution
dynamic optimization
symmetric a-stable distribution
Opis:
In this paper an adaptive differential evolution approach for dynamic optimization problems is studied. A new benchmark suite Syringa is also presented. The suite allows to generate test-cases from a multiple number of dynamic optimization classes. Two dynamic benchmarks: Generalized Dynamic Benchmark Generator (GDBG) and Moving Peaks Benchmark (MPB) have been simulated in Syringa and in the presented research they were subject of the experimental research. Two versions of adaptive differential evolution approach, namely the jDE algorithm have been heavily tested: the pure version of jDE and jDE equipped with solutions mutated with a new operator. The operator uses a symmetric ?-stable distribution variate for modification of the solution coordinates.
Źródło:
Journal of Telecommunications and Information Technology; 2011, 4; 20-30
1509-4553
1899-8852
Pojawia się w:
Journal of Telecommunications and Information Technology
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Evolutionary multi-agent systems in non-stationary environments
Autorzy:
Kisiel-Dorohinicki, M.
Powiązania:
https://bibliotekanauki.pl/articles/305810.pdf
Data publikacji:
2013
Wydawca:
Akademia Górniczo-Hutnicza im. Stanisława Staszica w Krakowie. Wydawnictwo AGH
Tematy:
multi-agent systems
evolutionary computation
dynamic optimization
non-stationary environment
Opis:
In this article, the performance of an evolutionary multi-agent system in dynamic optimization is evaluated in comparison to classical evolutionary algorithms. The starting point is a general introduction describing the background, structure and behavior of EMAS against classical evolutionary techniques. Then, the properties of energy-based selection are investigated to show how they may influence the diversity of the population in EMAS. The considerations are illustrated by experimental results based on the dynamic version of the well-known, high-dimensional Rastrigin function benchmark.
Źródło:
Computer Science; 2013, 14 (4); 563-575
1508-2806
2300-7036
Pojawia się w:
Computer Science
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Multi-swarm that learns
Autorzy:
Trojanowski, K.
Powiązania:
https://bibliotekanauki.pl/articles/969816.pdf
Data publikacji:
2010
Wydawca:
Polska Akademia Nauk. Instytut Badań Systemowych PAN
Tematy:
particle swarm optimization (PSO)
multi-swarm
dynamic optimization
memory
clusters
clustering evolving data streams
quantum particles
Opis:
This paper studies particle swarm optimization approach enriched by two versions of an extension aimed at gathering information during the optimization process. Application of these extensions, called memory mechanisms, increases computational cost, but it is spent to a benefit by incorporating the knowledge about the problem into the algorithm and this way improving its search abilities. The first mechanism is based on the idea of storing explicit solutions while the second one applies one-pass clustering algorithm to build clusters containing search experiences. The main disadvantage of the former mechanism is lack of good rules for identification of outdated solutions among the remembered ones and as a consequence unlimited growth of the memory structures as the optimization process goes. The latter mechanism uses other form of knowledge representation and thus allows us to control the amount of allocated resources more efficiently than the former one. Both mechanisms have been experimentally verified and their advantages and disadvantages in application for different types of optimized environments are discussed.
Źródło:
Control and Cybernetics; 2010, 39, 2; 359-375
0324-8569
Pojawia się w:
Control and Cybernetics
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Optimisation of operating conditions in fed-batch baker’s yeast fermentation
Autorzy:
Atasoy, I.
Yuceer, M.
Berber, R.
Powiązania:
https://bibliotekanauki.pl/articles/185738.pdf
Data publikacji:
2013
Wydawca:
Polska Akademia Nauk. Czytelnia Czasopism PAN
Tematy:
fed-batch fermenter
baker's yeast
dynamic optimization
SQP
Nonlinear
fermentator półciągły
drożdże piekarskie
optymalizacja dynamiczna
nieliniowość
Opis:
Saccharamyces cerevisia known as baker’s yeast is a product used in various food industries. Worldwide economic competition makes it a necessity that industrial processes be operated in optimum conditions, thus maximisation of biomass in production of saccharamyces cerevisia in fedbatch reactors has gained importance. The facts that the dynamic fermentation model must be considered as a constraint in the optimisation problem, and dynamics involved are complicated, make optimisation of fed-batch processes more difficult. In this work, the amount of biomass in the production of baker’s yeast in fed-batch fermenters was intended to be maximised while minimising unwanted alcohol formation, by regulating substrate and air feed rates. This multiobjective problem has been tackled earlier only from the point of view of finding optimum substrate rate, but no account of air feed rate profiles has been provided. Control vector parameterisation approach was applied the original dynamic optimisation problem which was converted into a NLP problem. Then SQP was used for solving the dynamic optimisation problem. The results demonstrate that optimum substrate and air feeding profiles can be obtained by the proposed optimisation algorithm to achieve the two conflicting goals of maximising biomass and minimising alcohol formation.
Źródło:
Chemical and Process Engineering; 2013, 34, 1; 175-186
0208-6425
2300-1925
Pojawia się w:
Chemical and Process Engineering
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
A Performance Study on Synchronous and Asynchronous Update Rules for A Plug-In Direct Particle Swarm Repetitive Controller
Autorzy:
Ufnalski, B.
Grzesiak, L. M.
Powiązania:
https://bibliotekanauki.pl/articles/141272.pdf
Data publikacji:
2014
Wydawca:
Polska Akademia Nauk. Czytelnia Czasopism PAN
Tematy:
repetitive process control
particle swarm optimization (PSO)
synchronous and asynchronous update rules
dynamic optimization problem
repetitive disturbance rejection
optimal control
Opis:
In this paper two different update schemes for the recently developed plug-in direct particle swarm repetitive controller (PDPSRC) are investigated and compared. The proposed approach employs the particle swarm optimizer (PSO) to solve in on-line mode a dynamic optimization problem (DOP) related to the control task in the constant-amplitude constant-frequency voltage-source inverter (CACF VSI) with an LC output filter. The effectiveness of synchronous and asynchronous update rules, both commonly used in static optimization problems (SOPs), is assessed and compared in the case of PDPSRC. The performance of the controller, when synthesized using each of the update schemes, is studied numerically.
Źródło:
Archives of Electrical Engineering; 2014, 63, 4; 635-646
1427-4221
2300-2506
Pojawia się w:
Archives of Electrical Engineering
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Travel management optimization based on air pollution condition using Markov decision process and genetic algorithm (case study: Shiraz city)
Autorzy:
Bagheri, Mohammad
Ghafourian, Hossein
Kashefiolasl, Morteza
Pour, Mohammad Taghi Sadati
Rabbani, Mohammad
Powiązania:
https://bibliotekanauki.pl/articles/223520.pdf
Data publikacji:
2020
Wydawca:
Polska Akademia Nauk. Czytelnia Czasopism PAN
Tematy:
air pollution
dynamic optimization
genetic algorithm
Markov decision-making process
zarządzanie transportem
optymalizacja
zanieczyszczenie powietrza
algorytm genetyczny
proces decyzyjny Markowa
Opis:
Currently, air pollution and energy consumption are the main issues in the transportation area in large urban cities. In these cities, most people choose their transportation mode according to corresponding utility including traveller's and trip’s characteristics. Also, there is no effective solution in terms of population growth, urban space, and transportation demands, so it is essential to optimize systematically travel demands in the real network of roads in urban areas, especially in congested areas. Travel Demand Management (TDM) is one of the well-known ways to solve these problems. TDM defined as a strategy that aims to maximize the efficiency of the urban transport system by granting certain privileges for public transportation modes, Enforcement on the private car traffic prohibition in specific places or times, increase in the cost of using certain facilities like parking in congested areas. Network pricing is one of the most effective methods of managing transportation demands for reducing traffic and controlling air pollution especially in the crowded parts of downtown. A little paper may exist that optimize urban transportations in busy parts of cities with combined Markov decision making processes with reward and evolutionary-based algorithms and simultaneously considering customers’ and trip’s characteristics. Therefore, we present a new network traffic management for urban cities that optimizes a multi-objective function that related to the expected value of the Markov decision system’s reward using the Genetic Algorithm. The planned Shiraz city is taken as a benchmark for evaluating the performance of the proposed approach. At first, an analysis is also performed on the impact of the toll levels on the variation of the user and operator cost components, respectively. After choosing suitable values for the network parameters, simulation of the Markov decision process and GA is dynamically performed, then the optimal decision for the Markov decision process in terms of total reward is obtained. The results illustrate that the proposed cordon pricing has significant improvement in performance for all seasons including spring, autumn, and winter.
Źródło:
Archives of Transport; 2020, 53, 1; 89-102
0866-9546
2300-8830
Pojawia się w:
Archives of Transport
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Dynamic asset allocation under uncertainty for pension fund management
Autorzy:
Pflug, G.
Świętanowski, A.
Powiązania:
https://bibliotekanauki.pl/articles/205561.pdf
Data publikacji:
1999
Wydawca:
Polska Akademia Nauk. Instytut Badań Systemowych PAN
Tematy:
model finansowy
optymalizacja stochastyczna
podejmowanie decyzji
procesy Markowa
asset liability management
financial modeling
investment
pension fund management
portfolio
risk management
stochastic dynamic optimization
Opis:
Decision making in managing the asset and liability structure of a pension fund can be supported by stochastic dynamic optimization. We discuss our model, which is based on data analysis and forecast for the asset-side as well as a simulation model for the liability side. The core of our decision support system consists of the following building blocks : a set of securities, a pricing module based on a multifactor Markov model to derive expected returns of securities, a simulation-based model for liabilities, a carefully chosen objective function suitable for the pension fund and a stochastic optimization problem solver. We consider the use of different objectives in the model and decomposition techniques to solve the stochastic portfolio optimization problem. Our final goal is to design an efficient parallel implementation.
Źródło:
Control and Cybernetics; 1999, 28, 4; 755-777
0324-8569
Pojawia się w:
Control and Cybernetics
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Object library of algorithms for dynamic optimization problems; Benchmarking SQP and nonlinear interior point methods
Autorzy:
Błaszczyk, J.
Karbowski, A.
Malinowski, K.
Powiązania:
https://bibliotekanauki.pl/articles/929795.pdf
Data publikacji:
2007
Wydawca:
Uniwersytet Zielonogórski. Oficyna Wydawnicza
Tematy:
optymalizacja dynamiczna
programowanie kwadratowe sekwencyjne
różniczkowanie automatyczne
obliczenia numeryczne
analiza danych
dynamic optimization
large-scale optimization
sequential quadratic programming
nonlinear interior-point methods
object-oriented numerical computations
automatic differentiation
performance data analysis
Opis:
The main purpose of this paper is to describe the design, implementation and possibilities of our object-oriented library of algorithms for dynamic optimization problems. We briefly present library classes for the formulation and manipulation of dynamic optimization problems, and give a general survey of solver classes for unconstrained and constrained optimization. We also demonstrate methods of derivative evaluation that we used, in particular automatic differentiation. Further, we briefly formulate and characterize the class of problems solved by our optimization classes. The solution of dynamic optimization problems with general constraints is performed by transformation into structured large-scale nonlinear programming problems and applying methods for nonlinear optimization. Two main algorithms of solvers for constrained dynamic optimization are presented in detail: the sequential quadratic programming (SQP) exploring the multistage structure of the dynamic optimization problem during the solution of a sequence of quadratic subproblems, and the nonlinear interior-point method implemented in a general-purpose large-scale optimizer IPOPT. At the end, we include a typical numerical example of the application of the constrained solvers to a large-scale discrete-time optimal control problem and we use the performance profiles methodology to compare the efficiency and robustness of different solvers or different options of the same solver. In conclusions, we summarize our experience gathered during the library development.
Źródło:
International Journal of Applied Mathematics and Computer Science; 2007, 17, 4; 515-537
1641-876X
2083-8492
Pojawia się w:
International Journal of Applied Mathematics and Computer Science
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Repetitive neurocontroller with disturbance feedforward path active in the pass-to-pass direction for a VSI inverter with an output LC filter
Autorzy:
Ufnalski, B.
Grzesiak, L. M.
Powiązania:
https://bibliotekanauki.pl/articles/200017.pdf
Data publikacji:
2016
Wydawca:
Polska Akademia Nauk. Czytelnia Czasopism PAN
Tematy:
repetitive control
feedforward neural network
dynamic optimization problem
repetitive disturbance rejection
voltage source inverter
disturbance dual feedforward path
sterowanie powtarzalne
sieci neuronowe
problem optymalizacji dynamicznej
przetwornica napięcia
odrzucanie zakłóceń
Opis:
An enhancement to the previously developed repetitive neurocontroller (RNC) is discussed and investigated in the paper. Originally, the time-base generator (TBG) has been used to produce the only input signal for the neural approximator. The resulting search space makes the dynamic optimization problem (DOP) of shaping the control signal solvable with the help of a function approximator such as the feed-forward neural network (FFNN). The plant under consideration, i.e. a constant-amplitude constant-frequency voltage-source inverter (CACF VSI) with an output LC filter, is assumed to be equipped with the disturbance load current sensor to enable implementation of the disturbance feed-forward (pDFF) path as a part of the non-repetitive subsystem acting in the along the pass p-direction. An investigation has been undertaken to explore potential benefits of using this signal also as an additional input for the RNC to augment the approximation space and potentially enhance the convergence rate of the real-time search process. It is numerically demonstrated in the paper that the disturbance feed-forward path active in the pass-to-pass k-direction (kDFF) improves the dynamics of the repetitive part as well indeed.
Źródło:
Bulletin of the Polish Academy of Sciences. Technical Sciences; 2016, 64, 1; 115-125
0239-7528
Pojawia się w:
Bulletin of the Polish Academy of Sciences. Technical Sciences
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Plug-in direct particle swarm repetitive controller with a reduced dimensionality of a fitness landscape – a multi-swarm approach
Autorzy:
Ufnalski, B.
Grzesiak, L. M.
Powiązania:
https://bibliotekanauki.pl/articles/202046.pdf
Data publikacji:
2015
Wydawca:
Polska Akademia Nauk. Czytelnia Czasopism PAN
Tematy:
repetitive process control
dynamic optimization problem
particle swarm optimizer
repetitive disturbance rejection
noninteracting subswarms
dimension-reduced fitness functional
powtarzalne sterowanie procesem
problem optymalizacji dynamicznej
optymalizator rojem cząstek
odrzucanie zakłóceń
sprawność funkcjonalna
Opis:
The paper describes a modification to the recently developed plug-in direct particle swarm repetitive controller (PDPSRC) for the sine-wave constant-amplitude constant-frequency (CACF) voltage-source inverter (VSI). The original PDPSRC algorithm assumes that the particle swarm optimizer (PSO) takes into account a performance index defined over the whole reference signal period. Each particle stores all the samples of the control signal, e.g. α = 200 samples for a controller working at 10 kHz and the reference frequency equal to 50 Hz. Therefore, the fitness landscape (i.e. the performance index) is -dimensional ( D), which makes optimization challenging. That solution can be categorized as the single-swarm one. It has been previously shown that the swarm controller does not suffer from long-term stability issues encountered in the classic iterative learning controllers (ILC). However, the convergence of the swarm has to be kept at a relatively low rate to enable successful exploitation in the D search space, which in turn results in slow responsiveness of the PDPSRC. Here a multi-swarm approach is proposed in which we divide a dynamic optimization problem (DOP) among less dimensional swarms. The reference signal period is segmented into shorter intervals and the control signal is optimized in each interval independently by separate swarms. The effectiveness of the proposed approach is illustrated with the help of numerical experiments on the CACF VSI with an output LC filter operating under nonlinear loads.
Źródło:
Bulletin of the Polish Academy of Sciences. Technical Sciences; 2015, 63, 4; 857-866
0239-7528
Pojawia się w:
Bulletin of the Polish Academy of Sciences. Technical Sciences
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Dynamic programming approach to shape optimization
Autorzy:
Fulmański, P.
Nowakowski, A.
Powiązania:
https://bibliotekanauki.pl/articles/206302.pdf
Data publikacji:
2014
Wydawca:
Polska Akademia Nauk. Instytut Badań Systemowych PAN
Tematy:
dynamic programming
shape optimization
Opis:
We provide a dynamic programming approach through the level set setting to structural optimization problems. By constructing a dual dynamic programming method we provide the verification theorem for optimal and "−optimal solutions of shape optimization problem.
Źródło:
Control and Cybernetics; 2014, 43, 3; 379-401
0324-8569
Pojawia się w:
Control and Cybernetics
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Polioptymalizacja procesów nieliniowych
Polyoptimization of non-linear processes
Autorzy:
Tarnowski, W.
Powiązania:
https://bibliotekanauki.pl/articles/156779.pdf
Data publikacji:
2007
Wydawca:
Stowarzyszenie Inżynierów i Techników Mechaników Polskich
Tematy:
polioptymalizacja procesu
dyskretyzacja
zamiana zadania optymalizacji dynamicznej na zadanie optymalizacji statycznej
polyoptimization
discretization
conversion of dynamic to static optimization problem
Opis:
Sformułowano zadanie jednoczesnego poszukiwania polioptymalnej funkcji sterowania procesu oraz parametrów konstrukcyjnych obiektu, w którym ten proces przebiega. Zaproponowano dyskretyzację zmiennych niezależnych jako sposób zamiany na zadanie polioptymalizacji statycznej, znacznie łatwiejsze do rozwiązania. Podkreślono rolę sposobu dyskretyzacji. Przedstawiono przykład sterowania samochodem, i rozwiązano go za pomocą algorytmu genetycznego. Innym przykładem jest układ sterowania procesem sterowania nieliniowego. Przedstawiono oprogramowanie zadania. Omówiono otrzymane wyniki. Przedyskutowano metodykę postępowania.
An optimization problem of control functions and object parameters simultaneously, is formulated. Discretization of independent variables is to convert an original problem into a static optimization problem, much easier to be solved. A way of discretization is important on the adequacy and accuracy of a solution. Two examples are included: a control of a car, and an automatic control by the bi-stable regulator. Computer codes are given. A general methodology is proposed.
Źródło:
Pomiary Automatyka Kontrola; 2007, R. 53, nr 8, 8; 73-78
0032-4140
Pojawia się w:
Pomiary Automatyka Kontrola
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Simulation and optimization of a new energy vehicle power battery pack structure
Autorzy:
Ruan, Guanqiang
Yu, Changqing
Hu, Xing
Hua, Jing
Powiązania:
https://bibliotekanauki.pl/articles/2055057.pdf
Data publikacji:
2021
Wydawca:
Polskie Towarzystwo Mechaniki Teoretycznej i Stosowanej
Tematy:
static
dynamic
modal
lightweight
optimization
Opis:
With the rapid growth in new energy vehicle industry, more and more new energy vehicle battery packs catch fire or even explode due to the internal short circuit. Comparing with traditional vehicles, the new energy vehicles industry should pay more attention to safety of power battery pack structures. The battery pack is an important barrier to protect the internal batteries. A battery pack structure model is imported into ANSYS for structural optimization under sharp acceleration, sharp turn and sharp deceleration turn conditions on the bumpy road. Based on the simulation, the battery pack structure is improved, and suitable materials are determined. Then the collision resistance of the optimized battery pack is verified, and the safety level is greatly improved. While ensuring the safety and reliability of the battery pack structure, it also reduces the weight to satisfy the lightweight design and complies with relevant technical standards.
Źródło:
Journal of Theoretical and Applied Mechanics; 2021, 59, 4; 565--578
1429-2955
Pojawia się w:
Journal of Theoretical and Applied Mechanics
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
A concept of using a dynamic programming method to optimize an investment portfolio allowing for asymmetric rates of return and a minimum risk portfol
Autorzy:
Tymiński, Jerzy
Powiązania:
https://bibliotekanauki.pl/articles/950699.pdf
Data publikacji:
2014
Wydawca:
Wydawnictwo Uniwersytetu Ekonomicznego we Wrocławiu
Tematy:
optimization
dynamic programming
asymmetry
risk
Opis:
Investment management on the capital market is a complex and multifarious process and the accuracy of decisions is an indispensable condition that an investor needs to fulfill if the expected economic results are to be achieved. The paper presents the concept of the optimization of investment portfolio on the capital market of shares. The maximum value of portfolio quality measure was used as an optimization criterion. It is expressed by the index of variability R/σ of the rate of return for each share in the portfolio. The cumulation of values of R/σ index in the successive years of the investigated period allowed for an econometric estimation of the continuous functions and their maximum. The indexes of asymmetry of rate of return for particular shares in the portfolio were introduced into the functions, which enabled to increase the efficiency of the selection of shares for the portfolio. This, in turn, allowed to achieve the optimum structure of shares in the portfolio.
Źródło:
Financial Sciences. Nauki o Finansach; 2014, 4(21); 52-61
2080-5993
2449-9811
Pojawia się w:
Financial Sciences. Nauki o Finansach
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Modelling of optimum cascade of ideal mixing reactors
Autorzy:
Efremov, G.
Geller, J.
Powiązania:
https://bibliotekanauki.pl/articles/298243.pdf
Data publikacji:
2017
Wydawca:
Uniwersytet Warmińsko-Mazurski w Olsztynie
Tematy:
optimization
cascade reactors
dynamic programming
polymerization
Opis:
It is discussed the using of dynamic programming method to optimize the parameters of the cascade of ideal mixing reactors, which is held isothermal first order reaction. It is found, that the minimum volume of the cascade of reactors corresponds to the minimum residence time of substance in this cascade. The optimum value of residence time for all reactors are equal and all ratio of input and output concentrations are equal, hence, and all volumes of reactors are also equal. A total volume of the cascade of reactors is less than the amount single. Application of the method of dynamic programming is illustrated with an example of the calculation of the polymerization in a cascade of four reactors according to the literature experimental data.
Źródło:
Technical Sciences / University of Warmia and Mazury in Olsztyn; 2017, 20(2); 149-160
1505-4675
2083-4527
Pojawia się w:
Technical Sciences / University of Warmia and Mazury in Olsztyn
Dostawca treści:
Biblioteka Nauki
Artykuł
Wyświetlanie 1-15 z 72

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