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


Tytuł:
A loss function for box-constrained inverses problems
Autorzy:
Yoneda, K.
Powiązania:
https://bibliotekanauki.pl/articles/375902.pdf
Data publikacji:
2008
Wydawca:
Akademia Górniczo-Hutnicza im. Stanisława Staszica w Krakowie. Wydawnictwo AGH
Tematy:
individual behavior
inverse problems
simultaneous equations
optimization
Opis:
A loss function is proposed for solving box-constrained inverse problems. Given causality mechanisms between inputs and outputs as smooth functions, an inverse problem demands to adjust the input levels to make the output levels as close as possible to the target values; box-constrained refers to the requirement that all outcome levels remain within their respective permissible intervals. A feasible solution is assumed known, which is often the status quo. We propose a loss function which avoids activation of the constraints. A practical advantage of this approach over the usual weighted least squares is that permissible outcome intervals are required in place of target importance weights, facilitating data acquisition. The proposed loss function is smooth and strictly convex with closed-form gradient and Hessian, permitting Newton family algorithms. The author has not been able to locate in the literature the Gibbs distribution corresponding to the loss function. The loss function is closely related to the generalized matching law in psychology.
Źródło:
Decision Making in Manufacturing and Services; 2008, 2, 1-2; 79-98
1896-8325
2300-7087
Pojawia się w:
Decision Making in Manufacturing and Services
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
A manufacturing network for generating added value from a geographical distance for the next generation
Autorzy:
Yukawa, K.
Kawakami, T.
Powiązania:
https://bibliotekanauki.pl/articles/99988.pdf
Data publikacji:
2011
Wydawca:
Wrocławska Rada Federacji Stowarzyszeń Naukowo-Technicznych
Tematy:
virtual concentration
optimization problems
value-added network
Opis:
n this study, we suggested a manufacturing network for generating added value from a geographical distance in terms of value creation from various management resources. Until today, most researchers focused on the Real Concentration of Production Base, which provides certain manufacturing benefits in these domains. However, "the Virtual Concentration of Production Bases" is realized by overcoming large physical distances and time differences between production bases, and creates greater added value for products. We attempted the simulation of the manufacturing network of creating the added value after having shown the new framework of network analysis in the manufacturing system.
Źródło:
Journal of Machine Engineering; 2011, 11, 3; 44-57
1895-7595
2391-8071
Pojawia się w:
Journal of Machine Engineering
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
A Utility Function to Solve Approximate Linear Equations for Decision Making
Autorzy:
Yoneda, K.
Celaschi, W.
Powiązania:
https://bibliotekanauki.pl/articles/375878.pdf
Data publikacji:
2013
Wydawca:
Akademia Górniczo-Hutnicza im. Stanisława Staszica w Krakowie. Wydawnictwo AGH
Tematy:
individual behavior
inverse problems
simultaneous equations
optimization
Opis:
Suppose there are a number of decision variables linearly related to a set of outcome variables. There are at least as many outcome variables as the number of decision variables since all decisions are outcomes by themselves. The quality of outcome is evaluated by a utility function. Given desired values for all outcome variables, decision making reduces to “solving” the system of linear equations with respect to the decision variables; the solution being defined as decision variable values such that maximize the utility function. This paper proposes a family of additively separable utility functions which can be defined by setting four intuitive parameters for each outcome variable: the desired value of the outcome, the lower and the upper limits of its admissible interval, and its importance weight. The utility function takes a nonnegative value within the admissible domain and negative outside; permits gradient methods for maximization; is designed to have a small dynamic range for numerical computation. Small examples are presented to illustrate the proposed method.
Źródło:
Decision Making in Manufacturing and Services; 2013, 7, 1-2; 5-18
1896-8325
2300-7087
Pojawia się w:
Decision Making in Manufacturing and Services
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Algorytm inspirowany polem walki - połączenie algorytmów numerycznych z ideą roju
Autorzy:
Baumgart, Jan
Sangho, Belco
Powiązania:
https://bibliotekanauki.pl/articles/41206049.pdf
Data publikacji:
2021
Wydawca:
Uniwersytet Kazimierza Wielkiego w Bydgoszczy
Tematy:
algorytm optymalizacyjny
inspiracja polem walki
rozwiązanie
optymalizacja
rzeczywiste problemy optymalizacji
optymalizacja funkcji
algorytm numeryczny
optimization algorithms
battlefield inspired inspiration
solution
optimization
real optimization problems
function optimization
numerical algorithm
Opis:
Artykuł przedstawia przygotowany algorytm na bazie połączenia idei znanych metod numerycznych z metodami opartymi na idei roju. Algorytm został przygotowany z inspiracji polem walki podczas którego w równych odstępach żołnierze przeczesują siły wroga z różnymi prędkościami zależnie od posiadanego orężu a następnie ograniczają zakres pola bitwy. Zaproponowane rozwiązanie wywodzi się właśnie ze zbliżonych założeń. Głównym założeniem pracy było przedstawienie potencjalnego zysku z połączenia metod optymalizacji oraz porównanie metody mieszanej z metodami bazującymi na idei roju pod względem prędkości działania oraz skuteczności odnajdowania optimum globalnego.Algorytm został porównany z dwoma algorytmami metaheurystycznymi pod kątem dokładności odnalezionych rozwiązań oraz prędkości. Zgodnie z wynikami eksperymentów posiada wydajność podobną w porównaniu z innymi algorytmami oraz daje zadowalające efekty w wykorzystaniu.
he article presents prepared algorithm based on the combination of the ideas of known numericalmethods with methods based on the idea of a swarm. The algorithm was prepared inspired by the battlefield,during which, at equal intervals, soldiers scour enemy forces at different speeds depending on the weapon theyhave, and then limit the scope of the battlefield. The proposed solution is based on similar assumptions. Themain assumption of the work was to present the potential profit from the combination of optimization methodsand to compare the mixed method with methods based on the idea of a swarm in terms of operating speed andthe effectiveness of finding the global optimum. The algorithm was compared with two metaheuristic algorithmsin terms of the accuracy of the solutions found and speed. According to the results of the experiments, it hasa similar performance compared to other algorithms and gives satisfactory results in use.
Źródło:
Studia i Materiały Informatyki Stosowanej; 2021, 2; 26-31
1689-6300
Pojawia się w:
Studia i Materiały Informatyki Stosowanej
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Application of Genetic Algorithms in Design of Public Transport Network
Autorzy:
Lesiak, Piotr
Bojarczak, Piotr
Powiązania:
https://bibliotekanauki.pl/articles/504669.pdf
Data publikacji:
2015
Wydawca:
Międzynarodowa Wyższa Szkoła Logistyki i Transportu
Tematy:
genetic algorithms
search methods
optimization
transportation problems
Opis:
The paper presents possibilities of application of genetic algorithms in design of public transport network. Transportation tasks such as determination of optimal routes and timetable for means of transport belong to difficult complex optimization problems, therefore they cannot be solved using traditional search algorithms. It turns out that genetic algorithms can be very useful to solve these transportation problem.
Źródło:
Logistics and Transport; 2015, 26, 2; 75-82
1734-2015
Pojawia się w:
Logistics and Transport
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Comparative Study of AMPL, Pyomo and JuMP Optimization Modeling Languages on a Network Linear Programming Problem Example
Studium porównawcze języków modelowania optymalizacyjnego AMPL, Pyomo i JuMP na przykładzie liniowego zadania programowania sieciowego
Autorzy:
Karbowski, Andrzej
Wyskiel, Krzysztof
Powiązania:
https://bibliotekanauki.pl/articles/2068625.pdf
Data publikacji:
2021
Wydawca:
Sieć Badawcza Łukasiewicz - Przemysłowy Instytut Automatyki i Pomiarów
Tematy:
optimization
modeling languages
programming
shortest path problem
network problems
linear programming
optymalizacja
języki modelowania
zadanie najkrótszej ścieżki
zadania sieciowe
programowanie liniowe
zadania grafowe
Opis:
The purpose of this work is a comparative study of three languages (environments) of optimization modeling: AMPL, Pyomo and JuMP. The comparison will be based on three implementations of the shortest path problem formulated as a linear programming problem. The codes for individual models and differences between them will be presented and discussed. Various aspects will be taken into account, such as: simplicity and intuitiveness of implementation, availability of specific data structures for a LP network problems, etc.
Celem pracy jest zbadanie i porównanie możliwości trzech języków (środowisk) modelowania optymalizacyjnego: AMPL, Pyomo i JuMP. Porównanie zostanie oparte na trzech implementacjach zadania najkrótszej ścieżki sformułowanego jako zadanie programowania liniowego. Przedstawione i omówione zostaną kody poszczególnych modeli oraz różnice między nimi. Pod uwagę będą brane różne aspekty, takie jak: prostota i intuicyjność implementacji, dostępność określonych struktur danych dla problemów z siecią LP itp.
Źródło:
Pomiary Automatyka Robotyka; 2021, 25, 3; 23--30
1427-9126
Pojawia się w:
Pomiary Automatyka Robotyka
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Comparison of Selected Fair-optimization Methods for Flow Maximization between Given Pairs of Nodes in Telecommunications Network
Autorzy:
Zalewski, G.
Ogryczak, W.
Powiązania:
https://bibliotekanauki.pl/articles/308874.pdf
Data publikacji:
2016
Wydawca:
Instytut Łączności - Państwowy Instytut Badawczy
Tematy:
allocation problem
decision problems
fair-optimization
linear programming
multi-criteria
networks
ordered weighted averaging
OWA
reference point method
RPM
Opis:
Dimensioning of telecommunications networks requires the allocation of the ows (bandwidth) to given trac demands for the source-destination pairs of nodes. Unit ow allocated to the given demand is associated with revenue that may vary for dierent demands. Problem the decision-making basic algorithms to maximize the total revenue may lead to the solutions that are unacceptable, due to "starvation" or "locking" of some demand paths less attractive with respect to the total revenue. Therefore, the fair optimization approaches must be applied. In this paper, two fair optimization methods are analyzed: the method of ordered weighted average (OWA) and the reference point method (RPM). The study assumes that ows can be bifurcated thus realized in multiple path schemes. To implement optimization model the AMPL was used with general-purpose linear programming solvers. As an example of the data, the Polish backbone network was used.
Źródło:
Journal of Telecommunications and Information Technology; 2016, 3; 18-24
1509-4553
1899-8852
Pojawia się w:
Journal of Telecommunications and Information Technology
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ł:
Determination of selected parameters in a 1D open channel flow model
Autorzy:
Weinerowska-Bords, K.
Powiązania:
https://bibliotekanauki.pl/articles/1933161.pdf
Data publikacji:
2007
Wydawca:
Politechnika Gdańska
Tematy:
determination of parameters
optimization procedures
well-posed and ill-posed problems
numerical methods
Opis:
Determination of the model's parameters is an important stage of mathematical models' application. In the case of a free-surface ID unsteady flow model defined by the de Saint- Venant equations, one of the groups of parameters to be estimated is the set of parameters describing energy losses due to friction. The parameters can be estimated in different ways, but in most cases the task of their determination is an ill-posed problem. In such cases, optimi-zation methods are the most common approach. In spite of numerous examples of such applications, these techniques are still not fully recognized, as there are several problems of different nature that require thorough analysis. Automatic optimization methods are discussed in the paper. The most important questions of choosing the objective function and the optimization algorithm are considered. Problems connected with data reliability and accessibility and their influence on the solution are discussed. The most common pitfalls of optimization applications are discussed. The analysis is supported with numerical examples.
Źródło:
TASK Quarterly. Scientific Bulletin of Academic Computer Centre in Gdansk; 2007, 11, 4; 341-364
1428-6394
Pojawia się w:
TASK Quarterly. Scientific Bulletin of Academic Computer Centre in Gdansk
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Elements of Method Improvement of Flood Zones Determination
Autorzy:
Kryzhovets, Tetiana
Powiązania:
https://bibliotekanauki.pl/articles/1833889.pdf
Data publikacji:
2020
Wydawca:
Polska Akademia Nauk. Oddział w Lublinie PAN
Tematy:
stochastic models
methods of extreme estimation
optimization problems
software
automated information systems
Opis:
The article suggests a possible application of mathematical modeling zones and flooding characteristics that will improve the methodological basis in hydrological calculations and forecasting will provide opportunities for a better understanding of the complex mechanisms of formation flow. The computational scheme is applicable for vertically homogeneous flow conditions extending from steep river flows to tidal influenced estuaries. The system has been used in numerous engineering studies.
Źródło:
ECONTECHMOD : An International Quarterly Journal on Economics of Technology and Modelling Processes; 2020, 9, 1; 25--29
2084-5715
Pojawia się w:
ECONTECHMOD : An International Quarterly Journal on Economics of Technology and Modelling Processes
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Exponential and chaotic neurodynamical tabu searches for quadratic assignment problems
Autorzy:
Hasegawa, M.
Ikeguchi, T.
Aihara, K.
Powiązania:
https://bibliotekanauki.pl/articles/206864.pdf
Data publikacji:
2000
Wydawca:
Polska Akademia Nauk. Instytut Badań Systemowych PAN
Tematy:
problem optymalizacji kombinatorycznej
sieć neuronowa
chaos
combinatorial optimization problems
neural networks
quadratic assignment problems
tabu search
Opis:
We propose a chaotic neurodynamical searching method for the Quadratic Assignment Problems (QAPs). First, we construct a neural network whose behavior is the same as that of the conventional tabu search. Using the dynamics of the tabu search neural network, we realize the exponential tabu search, whose tabu effect decreases exponentially with time, and we show the effectiveness of this type of exponential tabu search. Next, we extend this novel tabu search to a chaotic version. This chaotic method includes both effects of the chaotic dynamical search and the exponential tabu search, and exhibits better performance than the conventional and exponential tabu searches. Last, we propose an automatic parameter tuning method and show that the proposed method exhibits high performance even on large QAPs.
Źródło:
Control and Cybernetics; 2000, 29, 3; 773-788
0324-8569
Pojawia się w:
Control and Cybernetics
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Maximization of an Asymmetric Utility Function by the Least Squares
Autorzy:
Yoneda, K.
Moretti, A. C.
Powiązania:
https://bibliotekanauki.pl/articles/375999.pdf
Data publikacji:
2014
Wydawca:
Akademia Górniczo-Hutnicza im. Stanisława Staszica w Krakowie. Wydawnictwo AGH
Tematy:
individual behavior
inverse problems
simultaneous equations
optimization
Opis:
This note points out that a utility maximization procedure proposed in an earlier paper may be reduced to the least squares. The utility function is asymmetric in the sense that for each cue its ideal value and the permissible range are assigned in such a way that the ideal is not necessarily at the center of the range, like "a beer of 350 ml would be ideal, but acceptable if within [100, 500]". A practical consequence of the observation is that very little programming will be needed to deploy the utility maximization since software for the least squares is widely available.
Źródło:
Decision Making in Manufacturing and Services; 2014, 8, 1-2; 5-12
1896-8325
2300-7087
Pojawia się w:
Decision Making in Manufacturing and Services
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Misfit landforms imposed by ill-conditioned inverse parametric problems
Autorzy:
Łoś, M.
Smołka, M.
Schaefer, R.
Sawicki, J.
Powiązania:
https://bibliotekanauki.pl/articles/305739.pdf
Data publikacji:
2018
Wydawca:
Akademia Górniczo-Hutnicza im. Stanisława Staszica w Krakowie. Wydawnictwo AGH
Tematy:
taxonomy of ill-conditioned problems
ill-posed global optimization problems
fitness landscapes
Opis:
In this paper, we put forward a new topological taxonomy that allows us to distinguish and separate multiple solutions to ill-conditioned parametric inverse problems appearing in engineering, geophysics, medicine, etc. This taxonomy distinguishes the areas of insensitivity to parameters called the landforms of the misfit landscape, be it around minima (lowlands), maxima (uplands), or stationary points (shelves). We have proven their important separability and completeness conditions. In particular, lowlands, uplands, and shelves are pairwise disjoint, and there are no other subsets of the positive measure in the admissible domain on which the misfit function takes a constant value. The topological taxonomy is related to the second, “local” one, which characterizes the types of ill-conditioning of the particular solutions. We hope that the proposed results will be helpful for a better and more precise formulation of ill-conditioned inverse problems and for selecting and profiling complex optimization strategies used in solving these problems.
Źródło:
Computer Science; 2018, 19 (2); 157-178
1508-2806
2300-7036
Pojawia się w:
Computer Science
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Modified blind naked mole-rat algorithm applied to electromagnetic design problems
Autorzy:
Taherdangkoo, Mohammad
Powiązania:
https://bibliotekanauki.pl/articles/1841273.pdf
Data publikacji:
2021
Wydawca:
Polska Akademia Nauk. Czytelnia Czasopism PAN
Tematy:
electromagnetic design problems
global optimization
meta-heuristic algorithm
problemy z projektowaniem elektromagnetycznym
globalna optymalizacja
algorytm metaheurystyczny
Opis:
In this paper,we proposed a modified meta-heuristic algorithm based on the blind naked mole-rat (BNMR) algorithm to solve the multiple standard benchmark problems. We then apply the proposed algorithm to solve an engineering inverse problem in the electromagnetic field to validate the results. The main objective is to modify the BNMR algorithm by employing two different types of distribution processes to improve the search strategy. Furthermore, we proposed an improvement scheme for the objective function and we have changed some parameters in the implementation of the BNMR algorithm. The performance of the BNMR algorithm was improved by introducing several new parameters to find the better target resources in the implementation of a modified BNMR algorithm. The results demonstrate that the changed candidate solutions fall into the neighborhood of the real solution. The results show the superiority of the propose method over other methods in solving various mathematical and electromagnetic problems.
Źródło:
Archives of Electrical Engineering; 2021, 70, 2; 167-380
1427-4221
2300-2506
Pojawia się w:
Archives of Electrical Engineering
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Multiobjective shape optimization of selected coupled problems by means of evolutionary algorithms
Autorzy:
Długosz, A.
Burczyński, T.
Powiązania:
https://bibliotekanauki.pl/articles/202348.pdf
Data publikacji:
2012
Wydawca:
Polska Akademia Nauk. Czytelnia Czasopism PAN
Tematy:
multiobjective optimization
evolutionary algorithms
multiphysics
coupled field problems
finite element method
Opis:
In present paper an improved multi-objective evolutionary algorithm is used for Pareto optimization of selected coupled problems. Coupling of mechanical, electrical and thermal fields is considered. Boundary-value problems of the thermo-elasticity, piezoelectricity and electro-thermo-elasticity are solved by means of finite element method (FEM). Ansys Multiphysics and MSC.Mentat/Marc software are used to solve considered coupled problems. Suitable interfaces between optimization tool and the FEM software are created. Different types of functionals are formulated on the basis of results obtained from the coupled field analysis. Functionals depending on the area or volume of the structure are also proposed. Parametric curves NURBS are used to model some optimized structures. Numerical examples for exemplary three-objective optimization are presented in the paper.
Źródło:
Bulletin of the Polish Academy of Sciences. Technical Sciences; 2012, 60, 2; 215-222
0239-7528
Pojawia się w:
Bulletin of the Polish Academy of Sciences. Technical Sciences
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