Informacja

Drogi użytkowniku, aplikacja do prawidłowego działania wymaga obsługi JavaScript. Proszę włącz obsługę JavaScript w Twojej przeglądarce.

Wyszukujesz frazę "linear optimization" wg kryterium: Temat


Tytuł:
A declarative approach to shop orders optimization
Autorzy:
Wikarek, Jarosław
Sitek, Paweł
Jagodziński, Mieczysław
Powiązania:
https://bibliotekanauki.pl/articles/117721.pdf
Data publikacji:
2019
Wydawca:
Polskie Towarzystwo Promocji Wiedzy
Tematy:
MRP II
linear optimization
relational databases
ECLiPSe-CLP
optymalizacja liniowa
relacyjne bazy danych
Opis:
The paper presents the problem of material requirements planning with optimization of load distribution between work centers and workers’ groups. Moreover, it discusses the computational example for shop orders optimization. The data for this example were taken from the relational database. The method of Constraint Logic Programming (CLP) for shop orders optimization has been suggested. Using Constraint Logic Programming, the constraints may be directly introduced to the problem declaration, which is equivalent to the source code of the program. The ECLiPSe-CLP software system has been presented. It allows for solving optimization problems concerning dimensions greater than in the case of the professional mathematical programming solver “LINGO”. The application of ECLiPSe-CLP in accessing data from relational databases has been presented.
Źródło:
Applied Computer Science; 2019, 15, 4; 5-15
1895-3735
Pojawia się w:
Applied Computer Science
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Determination of Approaches for Project Costs Minimization with Use of Dual Problems
Autorzy:
Chernov, S.
Titov, S.
Chernova, L.
Kunanets, N.
Powiązania:
https://bibliotekanauki.pl/articles/410624.pdf
Data publikacji:
2019
Wydawca:
Polska Akademia Nauk. Oddział w Lublinie PAN
Tematy:
linear optimization
primal problem
dual problem
duality
objective function
constraint system
pairs of dual problems
Opis:
For determining ways of company development, ensuring the growth of profit in manufacture and sales of certain products, it has been proposed to use an algorithm of constructing a problem being inverse to primal-dual one, for minimization of the project costs. The primal and the inverse problems contribute to improving the efficiency of calculation when determining approaches for minimization of costs. This pair of problems is mutually conjugate. The proposed rigorous approach to obtaining the algorithm of constructing a dual problem is based on the following statement: a problem being inverse to a dual one is a primal (original) problem. The authors have proposed and rigorously proven the algorithm of a general approach to the construction of conjugate problem pairs. Formalization of the algorithm developed allows obtaining easily correct pairs of known dual problems. This permitted proposing and proving the truth of the algorithm of constructing a dual problem for the arbitrary form of a primal problem representation.
Źródło:
ECONTECHMOD : An International Quarterly Journal on Economics of Technology and Modelling Processes; 2019, 8, 2; 61-68
2084-5715
Pojawia się w:
ECONTECHMOD : An International Quarterly Journal on Economics of Technology and Modelling Processes
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Wybrane zagadnienia wielokryterialnego planowania sieci WLAN
Selected issues of multi-objective WLAN planning
Autorzy:
Pieprzycki, A.
Ludwin, W.
Powiązania:
https://bibliotekanauki.pl/articles/93106.pdf
Data publikacji:
2018
Wydawca:
Państwowa Wyższa Szkoła Zawodowa w Tarnowie
Tematy:
wielokryterialny algorytm optymalizacji
planowanie
WLAN
optymalizacja nieliniowa
cuckoo search
multi objective swarm optimization
multiobjective cuckoo search
WLAN planning
non–linear optimization
Opis:
Celem artykułu jest zastosowanie wielokryterialnego podejścia do planowania MOO (Multi Objective Optimisation) sieci łączności bezprzewodowej WLAN (Wireless Local Area Network) z wykorzystaniem wybranych rojowych metod optymalizacji. W tym celu, w procesie poszukiwania ekstremów dwóch funkcji kryterialnych, które są wskaźnikiem optymalizacyjnych, zastosowano dwa algorytmy rojowe: kukułki MOCS (Multi Objective Cuckoo Search) oraz optymalizacji rojem cząstek MOPSO (Multi Objective Particle Swarm Optimisation). Wyniki porównano z jednokryterialnym SOO (Single Objective Optimisation) zasięgowym planowaniem sieci bazującym na regularnym rozmieszczeniu punktów testujących TP (test point) z wykorzystaniem rojowego algorytmu kukułki CS (Cuckoo Search).
The aim of the article is to apply a multicriteria approach to MOO (Multi Objective Optimization) planning for WLAN (Wireless Local Area Network) using selected swarm optimization methods. For this purpose, in the process of searching for the extremum of two criterion functions, which are an optimization index, two swarm algorithms were used: MOCS (Multi Objective Cuckoo Search) and MOPSO (Multi Objective Particle Swarm Optimization). The results were compared with the single-criterion SOO (Single Objective Optimization) range-based network planning based on the regular distribution of TP (test point) using the CS Cuckoo Search algorithm.
Źródło:
Science, Technology and Innovation; 2018, 3, 2; 69-78
2544-9125
Pojawia się w:
Science, Technology and Innovation
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Advances in development of dedicated evolutionary algorithms for large non-linear constrained optimization problems
Autorzy:
Głowacki, M.
Orkisz, J.
Powiązania:
https://bibliotekanauki.pl/articles/31343110.pdf
Data publikacji:
2013
Wydawca:
Instytut Podstawowych Problemów Techniki PAN
Tematy:
evolutionary algorithms
large non-linear constrained optimization
solution efficiency increase
algorytmy ewolucyjne
Opis:
Efficient optimization algorithms are of great importance in many scientific and engineering applications. This paper considers development of dedicated Evolutionary Algorithms (EA) based approach for solving large, non-linear, constrained optimization problems. The EA are precisely understood here as decimal-coded Genetic Algorithms consisting of three basic operators: selection, crossover and mutation, followed by several newly developed calculation speed-up techniques. Efficiency increase of the EA computations may be obtained in several ways, including simple concepts proposed here like: solution smoothing and balancing, a posteriori solution error analysis, non-standard use of distributed and parallel calculations, and step-by-step mesh refinement. Efficiency of the proposed techniques has been evaluated using several benchmark tests. These preliminary tests indicate significant speed-up of the large optimization processes involved. Considered are applications of the EA to the sample problem of residual stresses analysis in elastic-plastic bodies being under cyclic loadings, and to a wide class of problems resulting from the Physically Based Approximation (PBA) of experimental data.
Źródło:
IPPT Reports on Fundamental Technological Research; 2013, 4; 25-29
2299-3657
Pojawia się w:
IPPT Reports on Fundamental Technological Research
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
On LQ optimization problem subject to fractional order irregular singular systems
Autorzy:
Muhafzan, -
Nazra, Admi
Yulianti, Lyra
Zulakmal, -
Revina, Refi
Powiązania:
https://bibliotekanauki.pl/articles/1409212.pdf
Data publikacji:
2021
Wydawca:
Polska Akademia Nauk. Czytelnia Czasopism PAN
Tematy:
linear quadratic optimization
fractional order
irregular singular system
Caputo fractional derivative
Mittag-Leffler function
Opis:
In this paper we discuss the linear quadratic (LQ) optimization problem subject to fractional order irregular singular systems. The aim of this paper is to find the control-state pairs satisfying the dynamic constraint of the form a fractional order irregular singular systems such that the LQ objective functional is minimized. The method of solving is to convert such LQ optimization into the standard fractional LQ optimization problem. Under some particularly conditions we find the solution of the problem under consideration.
Źródło:
Archives of Control Sciences; 2020, 30, 4; 745-756
1230-2384
Pojawia się w:
Archives of Control 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ł
Tytuł:
Optimum design of non-uniform symmetrical linear antenna arrays using a novel modified invasive weeds optimization
Autorzy:
Kenane, E.
Djahli, F.
Powiązania:
https://bibliotekanauki.pl/articles/140370.pdf
Data publikacji:
2016
Wydawca:
Polska Akademia Nauk. Czytelnia Czasopism PAN
Tematy:
invasive weeds optimization
non uniform linear array
optimization
synthesis
Opis:
This paper presents a new modified method for the synthesis of non-uniform linear antenna arrays. Based on the recently developed invasive weeds optimization technique (IWO), the modified invasive weeds optimization method (MIWO) uses the mutation process for the calculation of standard deviation (SD). Since the good choice of SD is particularly important in such algorithm, MIWO uses new values of this parameter to optimize the spacing between the array elements, which can improve the overall efficiency of the classical IWO method in terms of side lobe level (SLL) suppression and nulls control. Numerical examples are presented and compared to the existing array designs found in the literature, such as ant colony optimization (ACO), particle swarm optimization (PSO), and comprehensive learning PSO (CLPSO). Results show that MIWO method can be a good alternative in the design of non-uniform linear antenna array.
Źródło:
Archives of Electrical Engineering; 2016, 65, 1; 5-18
1427-4221
2300-2506
Pojawia się w:
Archives of Electrical Engineering
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
The accuracy investigation of point coordinates’ determination using a fixed basis for high-precision geodesy binding
Autorzy:
Litynskyi, Volodymyr
Litynskyi, Svyatoslav
Vivat, Anatolii
Fys, Mykhailo
Brydun, Andrii
Powiązania:
https://bibliotekanauki.pl/articles/106849.pdf
Data publikacji:
2019
Wydawca:
Politechnika Warszawska. Wydział Geodezji i Kartografii
Tematy:
optimization of linear-angular measurements
linear-angular measurements
coordinates determination
accuracy of coordinates determination
optymalizacja pomiarów liniowo-kątowych
pomiary liniowo-kątowe
określanie współrzędnych
dokładność określenia współrzędnych
Opis:
Modern scanners can perform terrestrial topographic survey with resolution of 1 cm and accuracy of 2 mm in just a few minute‘s time, from the distance of up to 100 meters. However, for surface topographical surveying of large territories or complex industrial objects, it is necessary to conduct geodetic traverses and perform their binding to the points of the geodesic basis. One method of coordinate transferring during surveying is by using the method of inverse linear-angular intersection, which involves the measuring of the respective sides S1, S2 and the β angle between them. This method is more precise than the classical one, which usually contains centring and reduction errors. The linear-angular intersection method can also be used for many applications in engineering geodesy, for laying geodetic traverses, and for binding to the wall based points of ground-surveying.
Źródło:
Reports on Geodesy and Geoinformatics; 2019, 107; 19-23
2391-8365
2391-8152
Pojawia się w:
Reports on Geodesy and Geoinformatics
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Wielowymiarowa analiza atrakcyjności inwestycyjnej spółek sektora spożywczego notowanych na Giełdzie Papierów Wartościowych w Warszawie
Multivariate investment attractiveness analysis of food sector companies of Warsaw Stock Exchange
Autorzy:
Kijek, Arkadiusz
Powiązania:
https://bibliotekanauki.pl/articles/425056.pdf
Data publikacji:
2014
Wydawca:
Wydawnictwo Uniwersytetu Ekonomicznego we Wrocławiu
Tematy:
investment attractiveness index
linear ordering
portfolio analysis
optimization
Opis:
The article presents the results of study of investment attractiveness of food sector companies listed at the Warsaw Stock Exchange. The multivariate statistical methods are applied to evaluate the financial standing of companies. The author constructs the investment attractiveness index that is used to order companies by their economic and financial standing. Based on the values of investment attractiveness index the structure of optimal portfolios are determined according to Markowitz portfolio theory. The results of survey indicate directions of investment portfolio diversification.
Źródło:
Econometrics. Ekonometria. Advances in Applied Data Analytics; 2014, 4(46); 175-188
1507-3866
Pojawia się w:
Econometrics. Ekonometria. Advances in Applied Data Analytics
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Uncertain Semivariogram Model using Robust Optimization for Application of Lead Pollutant Data
Autorzy:
Azizah, Annisa
Ruchjana, Budi Nurani
Chaerani, Diah
Powiązania:
https://bibliotekanauki.pl/articles/1030126.pdf
Data publikacji:
2020
Wydawca:
Przedsiębiorstwo Wydawnictw Naukowych Darwin / Scientific Publishing House DARWIN
Tematy:
Lead Pollutan
Linear Programming
Robust Optimization
Semivariogram
Software R
Opis:
Semivariogram is a half variance diagram of the difference between observations at the location s_i with another location that is as far as h units of distance. Semivariogram is used to describe the correlation of observation sorted by location. This research discusses the theoretical Semivariogram for the Spherical, Gaussian, and Exponential Semivariogram models through the Linear Programming approach. Next, the Semivariogram parameter estimation is studied with the assumption that there are data uncertainties, called the Uncertain Semivariogram. The method used to overcome the uncertainty data is Robust Optimization. The Uncertain Semivariogram using Robust Optimization are solved using the box and ellipsoidal uncertainty set approach. The calculation of the application of the model was carried out using the R software. For the case study, the application of the model used secondary data of Lead pollutant data in the Meuse River floodplains on the borders of France and the Netherlands at 164 locations. Based on the calculation results, the Exponential theoretical Semivariogram model is obtained as the best Semivariogram model, because it has a minimum SSE. Furthermore, the application of the Uncertain Semivariogram model using Robust Optimization on the Semivariogram Exponential model of Lead pollutant data is carried out using the box and ellipsoidal uncertainty set approach which is to obtain computationally tractable results.
Źródło:
World Scientific News; 2020, 143; 155-169
2392-2192
Pojawia się w:
World Scientific News
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Unequally Spaced Antenna Array Synthesis Using Accelerating Gaussian Mutated Cat Swarm Optimization
Autorzy:
Kumar, Prasanna K.
Pappula, Lakshman
Madhav, B. T. P.
Prabhakar, V. S. V.
Powiązania:
https://bibliotekanauki.pl/articles/2058505.pdf
Data publikacji:
2022
Wydawca:
Instytut Łączności - Państwowy Instytut Badawczy
Tematy:
Gaussian mutation
cat swarm optimization
linear antenna array
PSLL
Opis:
Low peak sidelobe level (PSLL) and antenna arrays with high directivity are needed nowadays for reliable wireless communication systems. Controlling the PSLL is a major is sue in designing effective antenna array systems. In this paper, a nature inspired technique, namely accelerating Gaussian mutated cat swarm optimization (AGMCSO) that attributes global search abilities, is proposed to control PSLL in the radiation pattern. In AGM-SCO, Gaussian mutation with an acceleration parameter is used in the position-updated equa tion, which allows the algorithm to search in a systematic way to prevent premature convergence and to enhance the speed of convergence. Experiments concerning several benchmark multimodal problems have been conducted and the obtained results illustrate that AGMCSO shows excellent performance concerning evolutionary speed and accuracy. To validate the overall efficacy of the algorithm, a sensitivity analysis was per formed for different AGMCSO parameters. AGMCSO was researched on numerous linear, unequally spaced antenna ar rays and the results show that in terms of generating low PSLL with a narrow first null beamwidth (FNBW), AGMCSO out performs conventional algorithms.
Źródło:
Journal of Telecommunications and Information Technology; 2022, 1; 99--109
1509-4553
1899-8852
Pojawia się w:
Journal of Telecommunications and Information Technology
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Comparison of bayesian and other approaches to the estimation of fatigue crack growth rate from 2D textural features
Autorzy:
Mojzeš, M.
Kukal, J.
Lauschmann, H.
Powiązania:
https://bibliotekanauki.pl/articles/279255.pdf
Data publikacji:
2017
Wydawca:
Polskie Towarzystwo Mechaniki Teoretycznej i Stosowanej
Tematy:
quantitative fractography
optimization
heuristic
linear regression
sub-model selection
Opis:
The fatigue crack growth rate can be explained using features of the surface of a structure. Among other methods, linear regression can be used to explain crack growth velocity. Nonlinear transformations of fracture surface texture features may be useful as explanatory variables. Nonetheless, the number of derived explanatory variables increases very quickly, and it is very important to select only few of the best performing ones and prevent overfitting at the same time. To perform selection of the explanatory variables, it is necessary to assess quality of the given sub-model. We use fractographic data to study performance of different information criteria and statistical tests as means of the sub-model quality measurement. Furthermore, to address overfitting, we provide recommendations based on a cross-validation analysis. Among other conclusions, we suggest the Bayesian Information Criterion, which favours sub-models fitting the data considerably well and does not lose the capability to generalize at the same time.
Źródło:
Journal of Theoretical and Applied Mechanics; 2017, 55, 4; 1269-1278
1429-2955
Pojawia się w:
Journal of Theoretical and Applied Mechanics
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Generalized ordered linear regression with regularization
Autorzy:
Łęski, J.
Henzel, N.
Powiązania:
https://bibliotekanauki.pl/articles/201591.pdf
Data publikacji:
2012
Wydawca:
Polska Akademia Nauk. Czytelnia Czasopism PAN
Tematy:
linear regression
IRLS
OWA
conjugate gradient optimization
robust methods
Opis:
Linear regression analysis has become a fundamental tool in experimental sciences. We propose a new method for parameter estimation in linear models. The 'Generalized Ordered Linear Regression with Regularization' (GOLRR) uses various loss functions (including the o-insensitive ones), ordered weighted averaging of the residuals, and regularization. The algorithm consists in solving a sequence of weighted quadratic minimization problems where the weights used for the next iteration depend not only on the values but also on the order of the model residuals obtained for the current iteration. Such regression problem may be transformed into the iterative reweighted least squares scenario. The conjugate gradient algorithm is used to minimize the proposed criterion function. Finally, numerical examples are given to demonstrate the validity of the method proposed.
Źródło:
Bulletin of the Polish Academy of Sciences. Technical Sciences; 2012, 60, 3; 481-489
0239-7528
Pojawia się w:
Bulletin of the Polish Academy of Sciences. Technical Sciences
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
An approach to finding trade-off solutions by a linear transformation of objective functions
Autorzy:
Podkopaev, D.
Powiązania:
https://bibliotekanauki.pl/articles/970405.pdf
Data publikacji:
2007
Wydawca:
Polska Akademia Nauk. Instytut Badań Systemowych PAN
Tematy:
multiple objective optimization
trade-offs
linear transformation of objective functions
Opis:
We address the problem of deriving Pareto optimal solutions of multiple objective optimization problems with predetermined upper bounds on trade-offs. As shown, this can be achieved by a linear transformation of objective functions. Each non-diagonal element of the transformation matrix is related to a bound on the trade-off between a pair of the objective functions.
Źródło:
Control and Cybernetics; 2007, 36, 2; 347-355
0324-8569
Pojawia się w:
Control and Cybernetics
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Decision problem for a finite states change of semi-Markov process
Autorzy:
Grabski, F.
Powiązania:
https://bibliotekanauki.pl/articles/2069327.pdf
Data publikacji:
2015
Wydawca:
Uniwersytet Morski w Gdyni. Polskie Towarzystwo Bezpieczeństwa i Niezawodności
Tematy:
reliability
semi-Markov decision processes
optimization
Howard algorithm
linear programming
Opis:
In the paper there are presented basic concepts and some results of the theory of semi-Markov decision processes. The algorithm of optimization a SM decision process with a finite number of state changes is discussed here. The algorithm is based on a dynamic programming method. To clarify it the SM decision model for the maintenance operation is shown.
Źródło:
Journal of Polish Safety and Reliability Association; 2015, 6, 1; 95--100
2084-5316
Pojawia się w:
Journal of Polish Safety and Reliability Association
Dostawca treści:
Biblioteka Nauki
Artykuł

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