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-25 z 37
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ł:
Optimization of complex systems reliability by firefly algorithm
Optymalizacja niezawodności złożonych systemów za pomocą algorytmu świetlika
Autorzy:
Kwiecień, J.
Filipowicz, B.
Powiązania:
https://bibliotekanauki.pl/articles/1365697.pdf
Data publikacji:
2017
Wydawca:
Polska Akademia Nauk. Polskie Naukowo-Techniczne Towarzystwo Eksploatacyjne PAN
Tematy:
problemy optymalizacji niezawodności systemów
metody optymalizacji niezawodności
system RRAP
algorytm świetlika
system reliability optimization problems
reliability optimization methods
RRAP system
firefly algorithm
Opis:
Algorytmy bazujące na inteligencji stadnej są coraz częściej stosowane w problemach niezawodności systemów. Artykuł prezentuje zastosowanie algorytmu świetlika do optymalizacji niezawodności dwóch systemów: mostkowego i 10-elementowego, z wykorzystaniem metod zbioru minimalnych ścieżek, minimalnych cięć oraz metody dekompozycji. Uzyskane rezultaty zostały przedstawione i porównane z dostępnymi danymi literaturowymi.
Algorithms based on swarm intelligence are more and more frequently applied to problems of systems reliability. The article presents the application of a firefly algorithm to the reliability optimization of two systems: bridge and 10-unit, with minimal paths set, minimal cuts set and decomposition methods. The obtained results are presented and compared with the available literature data.
Źródło:
Eksploatacja i Niezawodność; 2017, 19, 2; 296-301
1507-2711
Pojawia się w:
Eksploatacja i Niezawodność
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ł:
Studium przypadku skuteczności nowych metod optymalizacji roju w porównaniu do metod znanych
Autorzy:
Baumgart, Jan
Sangho, Belco
Powiązania:
https://bibliotekanauki.pl/articles/41206153.pdf
Data publikacji:
2021
Wydawca:
Uniwersytet Kazimierza Wielkiego w Bydgoszczy
Tematy:
algorytm roju
wzorce
inspirowanie naturą
metaheurystyka
pojedyncze obiektywne problemy optymalizacji
optymalizacja funkcji
algorytmy optymalizacji
swarm algorithm
patterns
inspired by nature
metaheuristics
single objective optimization problems
function optimization
optimization algorithms
Opis:
Porównianie skuteczności nowych metod optymalizacji roju w porównaniu z metodami znanymi w dziedzinie. Inspirowane naturą algorytmy metaheurystyczne stają się coraz bardziej popularne w rozwiązywaniu problemów optymalizacyjnych. Dzięki ich popularności niemal codziennie możemy zobaczyć nowepodejścia i proponowane rozwiązania. W tym artykule przedstawię porównanie, które pokaże kilka najnowszychprac z tej dziedziny w porównaniu z niektórymi algorytmami traktowanymi jako podstawa dziedziny. Głównymcelem było porównanie ostatnio wprowadzonych algorytmów roju i określenie, kiedy nowe rozwiązania są faktycznie szybsze i bardziej precyzyjne. Podsumowując, czy przetestowane nowe podejścia są lepsze niż obecne,dobrze znane i ugruntowane w terenie algorytmy. Algorytmy brane pod uwagę w tej pracy to: Particle SwarmOptimization [5], Artifical Bee Colony [3], Elephant Herding Optimization [7], Whale Optimization [4] i Gras-shopper Optimization [6].Algorytmy uznawane za nowe w tej dziedzinie porównano z dwoma popularnymi idobrze znanymi algorytmami metaheurystycznymi pod względem dokładności znalezionych rozwiązań i szybkości. Zgodnie z wynikami eksperymentów większość porównywanych nowych algorytmów dawała zadowalającewyniki w użytkowaniu.
Comparing the effectiveness of new methods of swarm optimization in comparison with knownmethods. Nature-inspired metaheuristic algorithms are becoming more and more popular in solving optimization problems. Thanks to their popularity, we can see new approaches and proposed solutions almost everyday. In this article, I will present a comparison that will show some of the most recent works in this fieldcompared to some algorithms considered as the basis of the field. The main goal was to compare the recently introduced swarm algorithms and determine when new solutions are actually faster and more precise. Inconclusion, are the new approaches tested better than the current, well-known and field-grounded algorithms?The algorithms considered in this paper are Particle Swarm Optimization, Artifical Bee Colony, Elephant Herding Optimization, Whale Optimization, and Grasshopper Optimization. Algorithms considered new inthis field were compared with two popular and well-known metaheuristic algorithms in terms of accuracy ofsolutions found and speed. According to the experimental results, most of the compared new algorithms gave satisfactory results in use.
Źródło:
Studia i Materiały Informatyki Stosowanej; 2021, 1; 47-50
1689-6300
Pojawia się w:
Studia i Materiały Informatyki Stosowanej
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ł
Tytuł:
Solution of linear and non-linear boundary value problems using population-distributed parallel differential evolution
Autorzy:
Nasim, Amnah
Burattini, Laura
Fateh, Muhammad Faisal
Zameer, Aneela
Powiązania:
https://bibliotekanauki.pl/articles/91569.pdf
Data publikacji:
2019
Wydawca:
Społeczna Akademia Nauk w Łodzi. Polskie Towarzystwo Sieci Neuronowych
Tematy:
parallel evolutionary algorithms
differential evolution
boundary value problems
optimization
Opis:
Cases where the derivative of a boundary value problem does not exist or is constantly changing, traditional derivative can easily get stuck in the local optima or does not factually represent a constantly changing solution. Hence the need for evolutionary algorithms becomes evident. However, evolutionary algorithms are compute-intensive since they scan the entire solution space for an optimal solution. Larger populations and smaller step sizes allow for improved quality solution but results in an increase in the complexity of the optimization process. In this research a population-distributed implementation for differential evolution algorithm is presented for solving systems of 2nd-order, 2-point boundary value problems (BVPs). In this technique, the system is formulated as an optimization problem by the direct minimization of the overall individual residual error subject to the given constraint boundary conditions and is then solved using differential evolution in the sense that each of the derivatives is replaced by an appropriate difference quotient approximation. Four benchmark BVPs are solved using the proposed parallel framework for differential evolution to observe the speedup in the execution time. Meanwhile, the statistical analysis is provided to discover the effect of parametric changes such as an increase in population individuals and nodes representing features on the quality and behavior of the solutions found by differential evolution. The numerical results demonstrate that the algorithm is quite accurate and efficient for solving 2nd-order, 2-point BVPs.
Źródło:
Journal of Artificial Intelligence and Soft Computing Research; 2019, 9, 3; 205-218
2083-2567
2449-6499
Pojawia się w:
Journal of Artificial Intelligence and Soft Computing Research
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Optimal design of stationary flow problems by path-following interior-point methods
Autorzy:
Antil, H.
Hoppe, R. H.
Linsenmann, C.
Powiązania:
https://bibliotekanauki.pl/articles/970290.pdf
Data publikacji:
2008
Wydawca:
Polska Akademia Nauk. Instytut Badań Systemowych PAN
Tematy:
shape optimization
Stokes flow problems
path-following interior-point methods
Opis:
We consider the numerical solution of structural optimization problems in CFD where the state variables are supposed to satisfy a linear or nonlinear Stokes system and the design variables are subject to bilateral pointwise constraints. Within a primal-dual setting, we suggest an all-at-once approach based on interior-point methods. The discretization is taken care of by Taylor-Hood elements with respect to a simplicial triangulation of the computational domain. The efficient numerical solution of the discretized problem relies on path-following techniques, namely a continuation method with an adaptive choice of the continuation step size, a long-step path-following algorithm and a nonlinear version of Mehrotra's algorithm. The performance of the suggested methods is documented by several illustrative numerical examples.
Źródło:
Control and Cybernetics; 2008, 37, 4; 771-796
0324-8569
Pojawia się w:
Control and Cybernetics
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ł
Tytuł:
Reconstruction of delivery positions in the city of Celje, Slovenia
Wiederaufbau von dem lieferposition in stadt Celje, Slowenien
Autorzy:
Dragan, D.
Vizinger, T.
Intihar, M.
Kramberger, B.
Fosner, M.
Prah, K.
Powiązania:
https://bibliotekanauki.pl/articles/374228.pdf
Data publikacji:
2013
Wydawca:
Politechnika Śląska. Wydawnictwo Politechniki Śląskiej
Tematy:
location problems
maximal covering problems
optimization
simulation
GIS
urban freight transport
problemy lokalizacji
optymalizacja
symulacja
miejski transport towarowy
Opis:
The paper addresses the problem of the reconstruction and allocation of delivery positions in the urban area. The aim is to achieve the optimal reorganization of urban freight transport in old town core in the municipality of Celje. Optimal allocation relies on optimization based on the Monte Carlo simulation and represents a first stage of a two-stage optimization approach to re-design the existing urban freight transport. The number of optimal delivery positions is required to be as minimal as possible, which can still assure a maximal service area within the prescribed radius, while keeping the minimal walking distances of delivery personnel between the nearest delivery position and the customer’s physical location. The main issues of the used heuristic allocation algorithm and the presentation of calculated results are provided. In the near future, the calculated delivery positions are going to be used for the purpose of physical implementation in order to improve the existing delivery transport.
Der Artikel behandelt das Problem der Wiederaufbau und Allokation von den Lieferung Positionen in einem städtischen Gebiet. Der Zweck ist die optimale Reorganisation des städtischen Güterverkehrs im alten Stadtkern in der Gemeinde Celje zu Erreichen. Die optimale Allokation basiert auf der Optimierung auf Basis der Monte-Carlo-Simulationen und stellt die erste Stufe einer zweistufigen Optimierung Verfahren zur Re-Designs der bestehenden städtischen Güterverkehrs. Die Anzahl der optimalen Lieferpositionen sollte so wenig wie möglich sein, aber trotzdem einen maximalen Service-Bereich innerhalb des vorgeschriebenen Radius gewährleisten. Gleichzeitig sollte die Entfernung zwischen den nächstgelegenen Lieferpositionen und Kunden Positionen kleinstmöglich sein. Die wichtigsten Themen des verwendeten Heuristic Zuordnungsalgorithmus und die Darstellung der berechneten Ergebnisse sind gegeben. Die Standorte der berechneten Lieferung Positionen werden zum Zwecke der physikalischen Implementierung genutzt, um den bestehenden Güterverkehr zu verbessern
Źródło:
Transport Problems; 2013, 8, 2; 11-23
1896-0596
2300-861X
Pojawia się w:
Transport Problems
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Topological derivative for optimal control problems
Autorzy:
Sokołowski, J.
Żochowski, A.
Powiązania:
https://bibliotekanauki.pl/articles/206790.pdf
Data publikacji:
1999
Wydawca:
Polska Akademia Nauk. Instytut Badań Systemowych PAN
Tematy:
sterowanie optymalne
asymptotic expansion
control problems
shape derivative
shape optimization
topological derivative
Opis:
The topological derivative is introduced for the extremal values of cost functionals for control problems. The optimal control problem considered in the paper is defined for the elliptic equation which models the deflection of an elastic membrane. The derivative measures the sensitivity of the optimal value of the cost with respect to changes in topology. A change in topology means removing a small ball from the interior of the domain of integration. The topological derivative can be used for obtaining the numerical solutions of the shape optimization problems.
Źródło:
Control and Cybernetics; 1999, 28, 3; 611-625
0324-8569
Pojawia się w:
Control and Cybernetics
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
On the robustness of the topological derivative for Helmholtz problems and applications
Autorzy:
Leugering, Günter
Novotny, Antonio André
Sokolowski, Jan
Powiązania:
https://bibliotekanauki.pl/articles/2183490.pdf
Data publikacji:
2022
Wydawca:
Polska Akademia Nauk. Instytut Badań Systemowych PAN
Tematy:
topological derivative
shape optimization
inverse problems
Helmholtz problem
numerical methods
complex variables
Opis:
We consider Helmholtz problems in two and three dimensions. The topological sensitivity of a given cost function J(uɛ) with respect to a small hole Bɛ around a given point x0ɛ ∈ Bɛ ⊂ Ω depends on various parameters, like the frequency k chosen or certain material parameters or even the shape parameters of the hole Bɛ. These parameters are either deliberately chosen in a certain range, as, e.g., the frequencies, or are known only up to some bounds. The problem arises as to whether one can obtain a uniform design using the topological gradient. We show that for 2-d and 3-d Helmholtz problems such a robust design is achievable.
Źródło:
Control and Cybernetics; 2022, 51, 2; 227--248
0324-8569
Pojawia się w:
Control and Cybernetics
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Solving of linear programming by method of structural optimization
Autorzy:
Karganov, S. A.
Powiązania:
https://bibliotekanauki.pl/articles/906235.pdf
Data publikacji:
2013
Wydawca:
Akademia Morska w Szczecinie. Wydawnictwo AMSz
Tematy:
linear programming
direct and inverse problems
simplex method
objectively determined valuations
structural optimization
Opis:
The paper lists the problems hindering the use in business practices of the results of solving direct and inverse problems in linear programming. It is shown that overcoming these obstacles lies in the way of using of developed by the author and described in this paper method of structural optimization and algorithms for its implementation. Here are some examples of solutions by the method of structural optimization of production planning problems.
Źródło:
Zeszyty Naukowe Akademii Morskiej w Szczecinie; 2013, 34 (106); 48-58
1733-8670
2392-0378
Pojawia się w:
Zeszyty Naukowe Akademii Morskiej w Szczecinie
Dostawca treści:
Biblioteka Nauki
Artykuł
Wyświetlanie 1-25 z 37

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