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

  Lista filtrów
Wyrównaj
Wyświetlanie 1-15 z 33
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ł:
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ł:
Solving Markov decision processes by d-graph algorithms
Autorzy:
Kátai, Z.
Powiązania:
https://bibliotekanauki.pl/articles/205688.pdf
Data publikacji:
2012
Wydawca:
Polska Akademia Nauk. Instytut Badań Systemowych PAN
Tematy:
Markov decision processes
dynamic programming
graph representation
graph algorithms
optimization problems
Opis:
Markov decision processes (MDPs) provide a mathematical model for sequential decisionmaking (sMDP/dMDP: stochastic/ deterministic MDP). We introduce the concept of generalized dMDP (g-dMDP) where each action may result in more than one next (parallel or clone) state. The common tools to represent dMDPs are digraphs, but these are inadequate for sMDPs and g-dMDPs. We introduce d-graphs as general tools to represent all the above mentioned processes (stationary versions). We also present a combined d-graph algorithm that implements dynamic programming strategies to find optimal policies for the finite/infinite horizon versions of these Markov processes. (The preliminary version of this paper was presented at the Conference MACRo 2011.)
Źródło:
Control and Cybernetics; 2012, 41, 3; 577-593
0324-8569
Pojawia się w:
Control and Cybernetics
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ł:
Sensitivity analysis for state constrained optimal control problems
Autorzy:
Malanowski, K.
Powiązania:
https://bibliotekanauki.pl/articles/206110.pdf
Data publikacji:
2011
Wydawca:
Polska Akademia Nauk. Instytut Badań Systemowych PAN
Tematy:
sensitivity analysis
cone-constrained optimization problems
nonlinear optimal control
first order state constraints
Opis:
A sensitivity result for cone-constrained optimization problem in abstract Hilbert spaces is obtained, using a slight modification of Haraux's theorem on differentiability of the metric projection onto polyhedric sets. This result is applied to sensitivity analysis for nonlinear optimal control problems subject to first order state constraints.
Źródło:
Control and Cybernetics; 2011, 40, 4; 1043-1058
0324-8569
Pojawia się w:
Control and Cybernetics
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Routing flow-shop with buffers and ready times - comparison of selected solution algorithms
Autorzy:
Józefczyk, J.
Markowski, M.
Balgabaeva, L.
Powiązania:
https://bibliotekanauki.pl/articles/406986.pdf
Data publikacji:
2014
Wydawca:
Polska Akademia Nauk. Czytelnia Czasopism PAN
Tematy:
manufacturing systems
operations research
complex systems
optimization problems
scheduling algorithms
routing algorithms
heuristics
computer simulation
Opis:
This article extends the former results concerning the routing flow-shop problem to minimize the makespan on the case with buffers, non-zero ready times and different speeds of machines. The corresponding combinatorial optimization problem is formulated. The exact as well as four heuristic solution algorithms are presented. The branch and bound approach is applied for the former one. The heuristic algorithms employ known constructive idea proposed for the former version of the problem as well as the Tabu Search metaheuristics. Moreover, the improvement procedure is proposed to enhance the quality of both heuristic algorithms. The conducted simulation experiments allow evaluating all algorithms. Firstly, the heuristic algorithms are compared with the exact one for small instances of the problem in terms of the criterion and execution times. Then, for larger instances, the heuristic algorithms are mutually compared. The case study regarding the maintenance of software products, given in the final part of the paper, illustrates the possibility to apply the results for real-world manufacturing systems.
Źródło:
Management and Production Engineering Review; 2014, 5, 4; 26-35
2080-8208
2082-1344
Pojawia się w:
Management and Production Engineering Review
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Process of market strategy optimization using distributed computing systems
Autorzy:
Nowicki, W.
Bera, A.
Błaszyński, P.
Powiązania:
https://bibliotekanauki.pl/articles/407280.pdf
Data publikacji:
2015
Wydawca:
Polska Akademia Nauk. Czytelnia Czasopism PAN
Tematy:
economic systems
financial system
moving average models
optimization problems
performance analysis
prediction methods
prediction problems
project management
work organization
Opis:
If market repeatability is assumed, it is possible with some real probability to deduct short term market changes by making some calculations. The algorithm, based on logical and statistically reasonable scheme to make decisions about opening or closing position on a market, is called an automated strategy. Due to market volatility, all parameters are changing from time to time, so there is need to constantly optimize them. This article describes a team organization process when researching market strategies. Individual team members are merged into small groups, according to their responsibilities. The team members perform data processing tasks through a cascade organization, providing solutions to speed up work related to the use of remote computing resources. They also work out how to store results in a suitable way, according to the type of task, and facilitate the publication of a large amount of results.
Źródło:
Management and Production Engineering Review; 2015, 6, 4; 87-93
2080-8208
2082-1344
Pojawia się w:
Management and Production Engineering Review
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Optimization of membership function parameters for fuzzy controllers of an autonomous mobile robot using the flower pollination algorithm
Autorzy:
Carvajal, O. R.
Castillo, O.
Soria, J.
Powiązania:
https://bibliotekanauki.pl/articles/385152.pdf
Data publikacji:
2018
Wydawca:
Sieć Badawcza Łukasiewicz - Przemysłowy Instytut Automatyki i Pomiarów
Tematy:
Flower Pollination Algorithm
FPA
membership functions
optimization problems
fuzzy system
algorytm zapylenia kwiatowego
problemy optymalizacyjne
system rozmyty
Opis:
In this work we describe the optimization of a Fuzzy Logic Controller (FLC) for an autonomous mobile robot that needs to follow a desired path. The FLC is for the simulation of its trajectory, the parameters of the membership functions of the FLC had not been previously optimized. We consider in this work with the flower pollination algorithm (FPA) as a method for optimizing the FLC. For this reason, we use the FPA to find the best parameters with the objective of minimizing the error between the trajectory of the robot and the reference. A comparative study of results with different metaheuristics is also presented in this work.
Źródło:
Journal of Automation Mobile Robotics and Intelligent Systems; 2018, 12, 1; 44-49
1897-8649
2080-2145
Pojawia się w:
Journal of Automation Mobile Robotics and Intelligent Systems
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Solving Delivery Problems in Distribution Systems
Autorzy:
Michlowicz, Edward
Powiązania:
https://bibliotekanauki.pl/articles/504345.pdf
Data publikacji:
2013
Wydawca:
Międzynarodowa Wyższa Szkoła Logistyki i Transportu
Tematy:
optimization
transport tasks
delivery problems
Opis:
The subject matter of this article is the optimization of delivery problems (Vehicle Routing Problems – VRP) with regard to distribution systems. These issues belong to the class of NP-hard problems. Current solutions to various delivery problems (VRP, TSP, MTSP, VRPTW, RDPTW) were analysed. Two examples were presented. In a transport and production task, a marginal cost equalling (MCE) algorithm was used. In the case of a Multi Depot Vehicle Routing Problem (MDVRP), an evolutionary algorithm was used.
Źródło:
Logistics and Transport; 2013, 18, 2; 33-40
1734-2015
Pojawia się w:
Logistics and Transport
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ł:
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ł:
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ł:
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ł:
Stretching the Least Squares to Embed Loss Function Tables
Autorzy:
Yoneda, K.
Moretti, A. C.
Poker, J. Jr.
Powiązania:
https://bibliotekanauki.pl/articles/375983.pdf
Data publikacji:
2015
Wydawca:
Akademia Górniczo-Hutnicza im. Stanisława Staszica w Krakowie. Wydawnictwo AGH
Tematy:
least squares
individual behavior
inverse problems
simultaneous equations
optimization
Opis:
The method of least squares is extended to accommodate a class of loss functions specified in the form of function tables. The function tables are embedded into the standard quadratic loss function so that nonlinear least squares algorithms can be adopted for loss minimization. This is an alternative to a more straightforward approach which interpolates the function tables and minimizes the resulting loss function by some generic optimization algorithm. The alternative approach has advantages over the straightforward, such as the wider availability of the least squares programs compared to the generic optimization programs and reduction in computational complexity. Examples are given for its application to multiplicative utility function maximization problems.
Źródło:
Decision Making in Manufacturing and Services; 2015, 9, 2; 105-116
1896-8325
2300-7087
Pojawia się w:
Decision Making in Manufacturing and Services
Dostawca treści:
Biblioteka Nauki
Artykuł
Wyświetlanie 1-15 z 33

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