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

  Lista filtrów
Wyrównaj
    Wyświetlanie 1-34 z 34
    Tytuł:
    Tabu Search for target-radar assignment
    Autorzy:
    Hindsberger, M.
    Vidal, R.
    Powiązania:
    https://bibliotekanauki.pl/articles/205568.pdf
    Data publikacji:
    2000
    Wydawca:
    Polska Akademia Nauk. Instytut Badań Systemowych PAN
    Tematy:
    assignment
    combinatorial optimization
    metaheuristics
    tabu search
    Opis:
    In this paper the problem of assigning air-defense illumination radars to enemy targets is presented. A Tabu Search metaheuristic solution is described and the results achieved are compared to those of other heuristic approaches. Implementation and experimental aspects are discussed. It is argued that Tabu Search could be used in near realtime decision making systems.
    Źródło:
    Control and Cybernetics; 2000, 29, 3; 701-724
    0324-8569
    Pojawia się w:
    Control and Cybernetics
    Dostawca treści:
    Biblioteka Nauki
    Artykuł
    Tytuł:
    Tabu search - a guided tour
    Autorzy:
    Hindsberger, M.
    Vidal, R.
    Powiązania:
    https://bibliotekanauki.pl/articles/205563.pdf
    Data publikacji:
    2000
    Wydawca:
    Polska Akademia Nauk. Instytut Badań Systemowych PAN
    Tematy:
    combinatorial optimization
    local search
    metaheuristics
    tabu search
    Opis:
    The main purpose of this paper is to provide an overview of the ideas behind Tabu Search - one of the most popular metaheuristic appoaches. For the sake of concreteness a simple example of the traveling salesman problem will be used in the discussion to illustrate the process of designing a Tabu Search algorithm. In addition, some extensions will be presented. Finally, applications will also be provided as well as references to more specialized publications.
    Źródło:
    Control and Cybernetics; 2000, 29, 3; 631-651
    0324-8569
    Pojawia się w:
    Control and Cybernetics
    Dostawca treści:
    Biblioteka Nauki
    Artykuł
    Tytuł:
    Experiments concerning hashing in the multiobjective tabu search method TAMOCO
    Autorzy:
    Hansen, M.
    Powiązania:
    https://bibliotekanauki.pl/articles/206866.pdf
    Data publikacji:
    2000
    Wydawca:
    Polska Akademia Nauk. Instytut Badań Systemowych PAN
    Tematy:
    hashing
    multiobjective combinatorial optimization (MOCO)
    tabu search
    Opis:
    This paper examines the use of hashing in the multiobjective tabu search, TAMOCO. The hasliing method was suggested by Woodruff and Zemel (1993) as a method of avoiding return to the already examined solutions in the standard single-objective tabu search. While the traditional tabu list is capable of insuring this, it can normally only be used for cycles of a moderate length. The hashing method, however, can efficiently avoid cycles over a much larger number of iterations and must be considered a natural component in the tabu search tool-box. We report from two experiments on practical models where the hashing component has been included into the TAMOCO-procedure ; with two different outcomes.
    Źródło:
    Control and Cybernetics; 2000, 29, 3; 789-798
    0324-8569
    Pojawia się w:
    Control and Cybernetics
    Dostawca treści:
    Biblioteka Nauki
    Artykuł
    Tytuł:
    Predictive Maintenance Sensors Placement by Combinatorial Optimization
    Autorzy:
    Borissova, D. I.
    Mustakerov, I. C.
    Doukovska, L. A.
    Powiązania:
    https://bibliotekanauki.pl/articles/227278.pdf
    Data publikacji:
    2012
    Wydawca:
    Polska Akademia Nauk. Czytelnia Czasopism PAN
    Tematy:
    predictive maintenance
    optimal sensors placement
    combinatorial optimization
    Opis:
    The strategy of predictive maintenance monitoring is important for successful system damage detection. Maintenance monitoring utilizes dynamic response information to identify the possibility of damage. The basic factors of faults detection analysis are related to properties of the structure under inspection, collect the signals and appropriate signals processing. In vibration control, structures response sensing is limited by the number of sensors or the number of input channels of the data acquisition system. An essential problem in predictive maintenance monitoring is the optimal sensor placement. The paper addresses that problem by using mixed integer linear programming tasks solving. The proposed optimal sensors location approach is based on the difference between sensor information if sensor is present and information calculated by linear interpolation if sensor is not present. The tasks results define the optimal sensors locations for a given number of sensors. The results of chosen sensors locations give as close as possible repeating the curve of structure dynamic response function. The proposed approach is implemented in an algorithm for predictive maintenance and the numerical results indicate that together with intelligent signal processing it could be suitable for practical application.
    Źródło:
    International Journal of Electronics and Telecommunications; 2012, 58, 2; 153-158
    2300-1933
    Pojawia się w:
    International Journal of Electronics and Telecommunications
    Dostawca treści:
    Biblioteka Nauki
    Artykuł
    Tytuł:
    Tabu search for multiobjective combinatorial optimization : TAMOCO
    Autorzy:
    Hansen, M.
    Powiązania:
    https://bibliotekanauki.pl/articles/205565.pdf
    Data publikacji:
    2000
    Wydawca:
    Polska Akademia Nauk. Instytut Badań Systemowych PAN
    Tematy:
    polioptymalizacja kombinatoryczna
    metaheuristics
    multiobjective combinatorial optimization (MOCO)
    tabu search
    Opis:
    This paper presents the multiobjective tabu search method, TAMOCO. Being an adaptation of the well-known tabu search, it can be used to generate approximations to the non-dominated solutions of multiobjective combinatorial optimization problems. TAMOCO works with a set of current solutions which, through manipulation of weights, are optimized towards the non-dominated frontier while at the same time seek to disperse over the frontier. The general procedure and some extensions to it are presented, as well as suggestions of usage in interactive procedures. A computational experiment is also presented.
    Źródło:
    Control and Cybernetics; 2000, 29, 3; 799-818
    0324-8569
    Pojawia się w:
    Control and Cybernetics
    Dostawca treści:
    Biblioteka Nauki
    Artykuł
    Tytuł:
    On necessary and sufficient conditions for stability and quasistability in combinatorial multicriteria optimization
    Autorzy:
    Kuzmin, K. G.
    Nikulin, Y. V.
    Makela, M. M.
    Powiązania:
    https://bibliotekanauki.pl/articles/206093.pdf
    Data publikacji:
    2017
    Wydawca:
    Polska Akademia Nauk. Instytut Badań Systemowych PAN
    Tematy:
    sensitivity analysis
    multiple criteria
    combinatorial optimization
    Pareto set
    stability conditions
    Opis:
    We consider a multiple objective combinatorial optimization problem with an arbitrary vector-criterion. The necessary and sufficient conditions for stability and quasistability are obtained for large classes of problems with partial criteria possessing certain properties of regularity.
    Źródło:
    Control and Cybernetics; 2017, 46, 4; 361-382
    0324-8569
    Pojawia się w:
    Control and Cybernetics
    Dostawca treści:
    Biblioteka Nauki
    Artykuł
    Tytuł:
    Solving a permutation problem by a fully polynomial-time approximation scheme
    Autorzy:
    Gawiejnowicz, Stanisław
    Kurc, Wiesław
    Pankowska, Lidia
    Powiązania:
    https://bibliotekanauki.pl/articles/729290.pdf
    Data publikacji:
    2010
    Wydawca:
    Uniwersytet Zielonogórski. Wydział Matematyki, Informatyki i Ekonometrii
    Tematy:
    combinatorial optimization
    discrete control theory
    fully polynomial-time approximation scheme
    Opis:
    For a problem of optimal discrete control with a discrete control set composed of vertices of an n-dimensional permutohedron, a fully polynomial-time approximation scheme is proposed.
    Źródło:
    Discussiones Mathematicae, Differential Inclusions, Control and Optimization; 2010, 30, 2; 191-203
    1509-9407
    Pojawia się w:
    Discussiones Mathematicae, Differential Inclusions, Control and Optimization
    Dostawca treści:
    Biblioteka Nauki
    Artykuł
    Tytuł:
    Qualitative stability analysis of multicriteria combinatorial minimin problems
    Autorzy:
    Emelichev, V. A.
    Karelkina, O. V.
    Kuzmin, K. G.
    Powiązania:
    https://bibliotekanauki.pl/articles/206273.pdf
    Data publikacji:
    2012
    Wydawca:
    Polska Akademia Nauk. Instytut Badań Systemowych PAN
    Tematy:
    combinatorial optimization
    Pareto set
    lexicographic set
    stability analysis
    stability types
    Opis:
    A multicriteria combinatorial problem with minimin partial criteria is considered. Necessary and sufficient conditions for the five known stability types of the problem are obtained. These stability types describe in different ways the behavior of the Pareto and lexicographic sets of the problem under initial data perturba- tions of the vector criteria.
    Źródło:
    Control and Cybernetics; 2012, 41, 1; 57-79
    0324-8569
    Pojawia się w:
    Control and Cybernetics
    Dostawca treści:
    Biblioteka Nauki
    Artykuł
    Tytuł:
    New evaluations of ant colony optimization start nodes
    Autorzy:
    Fidanova, S.
    Marinov, P.
    Atanassov, K.
    Powiązania:
    https://bibliotekanauki.pl/articles/206546.pdf
    Data publikacji:
    2014
    Wydawca:
    Polska Akademia Nauk. Instytut Badań Systemowych PAN
    Tematy:
    combinatorial optimization
    ant algorithms
    start nodes evaluation
    semi random start
    Opis:
    Ant Colony Optimization (ACO) is a stochastic search method that mimics the social behavior of real ant colonies, managing to establish the shortest route to the feeding sources and back. Such algorithms have been developed to arrive at near-optimal solutions to large-scale optimization problems, for which traditional mathematical techniques may fail. In this paper, the semi-random start procedure is applied. A new kind of evaluation of start nodes of the ants is developed and several starting strategies are prepared and combined. The idea of semi-random start is related to a better management of the ants. This new technique is tested on the Multiple Knapsack Problem (MKP). A Comparison among the strategies applied is presented in terms of quality of the results. A comparison is also carried out between the new evaluation and the existing one. Based on this comparative analysis, the performance of the algorithm is discussed. The study presents the idea that should be beneficial to both practitioners and researchers involved in solving optimization problems.
    Źródło:
    Control and Cybernetics; 2014, 43, 3; 471-485
    0324-8569
    Pojawia się w:
    Control and Cybernetics
    Dostawca treści:
    Biblioteka Nauki
    Artykuł
    Tytuł:
    On the robustness of optimal solutions for combinatorial optimization problems
    Autorzy:
    Libura, M.
    Powiązania:
    https://bibliotekanauki.pl/articles/969645.pdf
    Data publikacji:
    2009
    Wydawca:
    Polska Akademia Nauk. Instytut Badań Systemowych PAN
    Tematy:
    robustness analysis
    sensitivity analysis
    combinatorial optimization
    accuracy function
    robustness radius
    Opis:
    We consider the so-called generic combinatorial optimization problem, where the set of feasible solutions is some family of subsets of a finite ground set with specified positive initial weights of elements, and the objective function represents the total weight of elements of a feasible solution. We assume that the weights of all elements may be perturbed simultaneously and independently up to a given percentage of their initial values. A feasible solution which minimizes the worst-case relative regret, is called a robust solution. The maximum percentage level of perturbations, for which an initially optimal solution remains robust, is called the robustness radius of this solution. In this paper we study the robustness aspect of initially optimal solutions and provide lower bounds for their robustness radii.
    Źródło:
    Control and Cybernetics; 2009, 38, 3; 671-685
    0324-8569
    Pojawia się w:
    Control and Cybernetics
    Dostawca treści:
    Biblioteka Nauki
    Artykuł
    Tytuł:
    An ant algorithm for the maximum number of 3-cliques in 3-partite graphs
    Autorzy:
    Schiff, Krzysztof
    Powiązania:
    https://bibliotekanauki.pl/articles/2183443.pdf
    Data publikacji:
    2021
    Wydawca:
    Polska Akademia Nauk. Instytut Badań Systemowych PAN
    Tematy:
    ant colony optimization
    three-partite graph
    3-clique
    combinatorial optimization
    graph theory
    Opis:
    The problem of finding the maximum number of d- vertices cliques (d = 3) in d-partite graph (d = 3) when graph density q is lower than 1 is an important problem in combinatorial optimization and it is one of many NP-complete problems. For this problem a meta-heuristic algorithm has been developed, namely an ant colony optimization algorithm. In this paper a new development of this ant algorithm and experimental results are presented. The problem of finding the maximum number of 3-vertices cliques can be encountered in computer image analysis, computer vision applications, automation and robotic vision systems. The optimal solution of this problem boils down to finding a set of 3-vertices cliques in a 3-partite graph and this set should have cardinality as high as possible. The elaborated ant colony algorithm can be easily modified for d-dimensional problems, that is for finding the maximum number of d-vertices cliques in a d-partite graph.
    Źródło:
    Control and Cybernetics; 2021, 50, 2; 347--358
    0324-8569
    Pojawia się w:
    Control and Cybernetics
    Dostawca treści:
    Biblioteka Nauki
    Artykuł
    Tytuł:
    Graph based discrete optimization in structural dynamics
    Autorzy:
    Blachowski, B.
    Gutkowski, W.
    Powiązania:
    https://bibliotekanauki.pl/articles/200069.pdf
    Data publikacji:
    2014
    Wydawca:
    Polska Akademia Nauk. Czytelnia Czasopism PAN
    Tematy:
    discrete structural optimization
    combinatorial optimization
    structural dynamics
    stochastic loading
    problem oriented optimization
    graphs
    Opis:
    In this study, a relatively simple method of discrete structural optimization with dynamic loads is presented. It is based on a tree graph, representing discrete values of the structural weight. In practical design, the number of such values may be very large. This is because they are equal to the combination numbers, arising from numbers of structural members and prefabricated elements. The starting point of the method is the weight obtained from continuous optimization, which is assumed to be the lower bound of all possible discrete weights. Applying the graph, it is possible to find a set of weights close to the continuous solution. The smallest of these values, fulfilling constraints, is assumed to be the discrete minimum weight solution. Constraints can be imposed on stresses, displacements and accelerations. The short outline of the method is presented in Sec. 2. The idea of discrete structural optimization by means of graphs. The knowledge needed to apply the method is limited to the FEM and graph representation. The paper is illustrated with two examples. The first one deals with a transmission tower subjected to stochastic wind loading. The second one with a composite floor subjected to deterministic dynamic forces, coming from the synchronized crowd activities, like dance or aerobic.
    Źródło:
    Bulletin of the Polish Academy of Sciences. Technical Sciences; 2014, 62, 1; 91-102
    0239-7528
    Pojawia się w:
    Bulletin of the Polish Academy of Sciences. Technical Sciences
    Dostawca treści:
    Biblioteka Nauki
    Artykuł
    Tytuł:
    An Efficient Polynomial Time Approximation Scheme for the Vertex Cover P3 Problem on Planar Graphs
    Autorzy:
    Tu, Jianhua
    Shi, Yongtang
    Powiązania:
    https://bibliotekanauki.pl/articles/31343724.pdf
    Data publikacji:
    2019-02-01
    Wydawca:
    Uniwersytet Zielonogórski. Wydział Matematyki, Informatyki i Ekonometrii
    Tematy:
    combinatorial optimization
    vertex cover P3 problem
    branch- width
    planar graphs
    EPTAS
    Opis:
    Given a graph G = (V,E), the task in the vertex cover P3(VCP3) problem is to find a minimum subset of vertices F ⊆ V such that every path of order 3 in G contains at least one vertex from F. The VCP3 problem remains NP-hard even in planar graphs and has many applications in real world. In this paper, we give a dynamic-programming algorithm to solve the VCP3 problem on graphs of bounded branchwidth. Using the dynamic programming algorithm and the Baker’s EPTAS framework for NP-hard problems, we present an efficient polynomial time approximation scheme (EPTAS) for the VCP3 problem on planar graphs.
    Źródło:
    Discussiones Mathematicae Graph Theory; 2019, 39, 1; 55-65
    2083-5892
    Pojawia się w:
    Discussiones Mathematicae Graph Theory
    Dostawca treści:
    Biblioteka Nauki
    Artykuł
    Tytuł:
    Combinatorial approaches to the capital-budgeting problem
    Autorzy:
    Pichugina, O.
    Powiązania:
    https://bibliotekanauki.pl/articles/411221.pdf
    Data publikacji:
    2016
    Wydawca:
    Polska Akademia Nauk. Oddział w Lublinie PAN
    Tematy:
    capital-budgeting problem
    integer programming
    knapsack problem
    combinatorial optimization
    Branch and Bound
    Opis:
    Optimization approaches, combinatorial and continuous, to a capital-budgeting problem (CBP) are presented. This NP-hard problem, traditionally modelled as a linear binary problem, is represented as a biquadratic over an intersection of a sphere and a supersphere. This allows applying nonlinear optimization to it. Also, the method of combinatorial and surface cuttings (MCSC) is adopted to (CBP). For the single constrained version (1CBP), new combinatorial models are introduced based on joint analysis of the constraint, objective function, and feasible region. Equivalence of (1CBP) to the multichoice knapsack problem (MCKP) is shown. Peculiarities of Branch&Bound techniques to (1CBP) are described.
    Źródło:
    ECONTECHMOD : An International Quarterly Journal on Economics of Technology and Modelling Processes; 2016, 5, 4; 29-36
    2084-5715
    Pojawia się w:
    ECONTECHMOD : An International Quarterly Journal on Economics of Technology and Modelling Processes
    Dostawca treści:
    Biblioteka Nauki
    Artykuł
    Tytuł:
    Optimization of linear functions on a cyclic permutation. Based on the random search
    Autorzy:
    Grebennik, I.
    Baranov, O.
    Chorna, A.
    Gorbacheva, E.
    Powiązania:
    https://bibliotekanauki.pl/articles/411110.pdf
    Data publikacji:
    2016
    Wydawca:
    Polska Akademia Nauk. Oddział w Lublinie PAN
    Tematy:
    combinatorial optimization
    linear function
    cyclic permutations
    random search
    branch and bound algorithm
    parallel computing
    Opis:
    For creating adequate mathematical models of combinatorial problems of constructing optimal cyclic routes, mathematical modeling and solving a number of planning and control tasks solutions of optimization problems on the set of cyclic permutations are required. Review of the publications on combinatorial optimization demonstrates that the optimization problem on the cyclic permutations have not been studied sufficiently. This paper is devoted to solving optimization problem of a linear function with linear constraints on the set of cyclic permutations. For solving problems of this class using of known methods, taking into account the properties of a combinatorial set of cyclic permutations, is proposed. For this purpose we propose a method based on the ideology of random search. Heuristic method based on the strategy of the branch and bound algorithm is proposed to solve auxiliary optimization problem of a linear function without constraints on the set of cyclic permutations. Since application of the branch and bound algorithm immediately leads to an exponential growth of the complexity with increasing the dimension of the problem a number of modifications are suggested. Modifications allow reducing computational expenses for solving higher dimension problems. The effectiveness of the proposed improvements is demonstrated by computational experiments.
    Źródło:
    ECONTECHMOD : An International Quarterly Journal on Economics of Technology and Modelling Processes; 2016, 5, 3; 211-216
    2084-5715
    Pojawia się w:
    ECONTECHMOD : An International Quarterly Journal on Economics of Technology and Modelling Processes
    Dostawca treści:
    Biblioteka Nauki
    Artykuł
    Tytuł:
    Quality of solutions for perturbed combinatorial optimization problems
    Autorzy:
    Libura, M.
    Powiązania:
    https://bibliotekanauki.pl/articles/205967.pdf
    Data publikacji:
    2000
    Wydawca:
    Polska Akademia Nauk. Instytut Badań Systemowych PAN
    Tematy:
    kombinatoryka
    optymalizacja
    teoria zbioru
    accuracy function
    accuracy radius
    combinatorial optimization
    sensitivity analysis
    stability function
    stability radius
    Opis:
    We consider a general combinatorial optimization problem in which the set of feasible solutions is defined as a given and fixed family of subsets for some finite ground set. To any element of the ground set the so-called weight is associated. The problem consists in finding a feasible subset for which the sum of weights of its elements is the minimum. When the weights of elements vary or are estimated with some accuracy, then the solution of the problem obtained for some initial weights may appear non-optimal. In this paper we consider the quality of a given solution in the case of weights perturbation or inaccuracy. Namely, we study the relative error of a given solution as a function of particular weights perturbation. We also calculate the maximum perturbation or estimation errors of weights which preserve the optimality of a given solution of the problem.
    Źródło:
    Control and Cybernetics; 2000, 29, 1; 199-219
    0324-8569
    Pojawia się w:
    Control and Cybernetics
    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ł:
    Neural networks for the N-Queens Problem : a review
    Autorzy:
    Mańdziuk, J.
    Powiązania:
    https://bibliotekanauki.pl/articles/205945.pdf
    Data publikacji:
    2002
    Wydawca:
    Polska Akademia Nauk. Instytut Badań Systemowych PAN
    Tematy:
    optymalizacja kombinatoryczna
    problem n-hetmanów
    sieć Hopfielda
    sieć neuronowa
    combinatorial optimization
    Hopfield network
    N-Queens Problem
    neural networks
    Opis:
    Neural networks can be successfully applied to solving certain types of combinatorial optimization problems. In this paper several neural approaches to solving constrained optimization problems are presented and their properties discussed. The main goal of the paper is to present various improvements to the wellknown Hopfield models which are intensively used in combinatorial optimization domain. These improvements include deterministic modifications (binary Hopfield model with negative self-feedback connections and Maximum Neural Network model), stochastic modifications (Gaussian Machine), chaotic Hopfield-based models (Chaotic Neural Network and Transiently Chaotic Neural Network), hybrid approaches (Dual-mode Dynamic Neural Network and Harmony Theory approach) and finally modifications motivated by digital implementation feasibility (Strictly Digital Neural Network). All these models are compared based on a commonly used benchmark prohlem - the N-Queens Problem (NQP). Numerical results indicate that each of modified Hopfield models can be effectively used to solving the NQP. Coonvergence to solutions rate of these methods is very high - usually close to 100%. Experimental time requirements are generally low - polynomial in most casos. Some discussion of non-neural, heuristic approaches to solving the NQP is also presented in the paper.
    Źródło:
    Control and Cybernetics; 2002, 31, 2; 217-248
    0324-8569
    Pojawia się w:
    Control and Cybernetics
    Dostawca treści:
    Biblioteka Nauki
    Artykuł
    Tytuł:
    Dobór optymalnej taryfy telekomunikacyjnej przy użyciu programowania w logice z ograniczeniami
    Solving the optimal telecommunication rate plan configuration problem with constrained logic programming
    Autorzy:
    Witkowski, Jakub
    Kamiński, Bogumił
    Jakuczun, Wit
    Powiązania:
    https://bibliotekanauki.pl/articles/587282.pdf
    Data publikacji:
    2015
    Wydawca:
    Uniwersytet Ekonomiczny w Katowicach
    Tematy:
    Optymalizacja doboru taryfy
    Optymalizacja kombinatoryczna
    Programowanie w logice z ograniczeniami
    Combinatorial optimization.
    Constrained logic programming
    Rate plan configuration
    Opis:
    Praca opisuje algorytm optymalizacyjny rozwiązujący w efektywny sposób problem wyboru optymalnej taryfy w telefonii komórkowej. Ze względu na bardzo dużą liczbę możliwości łączenia usług telekomunikacyjnych w taryfy rozważany problem optymalizacyjny jest złożonym nieliniowym zagadnieniem programowania kombinatorycznego. W niniejszej pracy pokazujemy, że tego typu zadanie może zostać efektywnie rozwiązane przy pomocy programowania w logice z ograniczeniami (constraint logic programming). Wykorzystanie takiego podejścia dodatkowo pozwala na stworzenie modelu, który może być łatwo modyfikowany. Zapewnia to możliwość jego łatwego wykorzystania w praktyce biznesowej, gdzie składowe taryf telekomunikacyjnych podlegają częstym zmianom.
    We present an efficient algorithm that solves the telecommunication rate plan optimization problem. It is a complex and non-linear combinatorial programming task if we take into account realistic structures of offers available for mobile telephony subscribers. In the paper we show that constrained logic programming is an efficient approach to finding an optimal solution of this problem. Additionally, application of constrained logic programming allows us to formulate the problem in a simple way that provides a low-cost maintenance of the solution in practical applications when the rate plan structure often changes.
    Źródło:
    Studia Ekonomiczne; 2015, 235; 253-265
    2083-8611
    Pojawia się w:
    Studia Ekonomiczne
    Dostawca treści:
    Biblioteka Nauki
    Artykuł
    Tytuł:
    Neural network models for combinatorial optimization : a survey of deterministic, stochastic and chaotic approaches
    Autorzy:
    Smith, K.
    Potvin, J.
    Kwok, T.
    Powiązania:
    https://bibliotekanauki.pl/articles/205943.pdf
    Data publikacji:
    2002
    Wydawca:
    Polska Akademia Nauk. Instytut Badań Systemowych PAN
    Tematy:
    chaos
    odwzorowanie samoporządkujące
    optymalizacja kombinatoryczna
    sieć Hopfielda
    sieć neuronowa
    combinatorial optimization
    deformable templates
    Hopfield networks
    neural networks
    self-organizing maps
    Opis:
    This paper serves as a tutorial on the use of neural networks for solving combinatorial optimization problems. It reviews the two main classes of neural network models : the gradient-based neural networks such as the Hopfield network, and the deformable template approaches such as the elastic net method and self organizing maps. In each class, the original model is presented, its limitations discussed, and subsequent developments and extensions are reviewed. Particular emphasis is placed on stochastic and chaotic variations on the neural network models designed to improve the optimization performance. Finally, the performance of these neural network models is compared and discussed relative to other heuristic approaches.
    Źródło:
    Control and Cybernetics; 2002, 31, 2; 183-216
    0324-8569
    Pojawia się w:
    Control and Cybernetics
    Dostawca treści:
    Biblioteka Nauki
    Artykuł
    Tytuł:
    Analysis of a multimodal transport network in the region with an extremely cold climate
    Autorzy:
    Shevtsov, A. A.
    Zhuravskaya, M. A.
    Powiązania:
    https://bibliotekanauki.pl/articles/108977.pdf
    Data publikacji:
    2017
    Wydawca:
    Stowarzyszenie Menedżerów Jakości i Produkcji
    Tematy:
    objects of transport
    logistics infrastructure
    multimodal transport network
    combinatorial optimization
    multimodalna sieć transportowa
    infrastruktura logistyczna
    analiza ABC
    kombinatoryczne metody optymalizacji
    Opis:
    The role and importance of a multimodal transport network for the territory of the Republic of Sakha (Yakutia) – a region with harsh climatic conditions are defined. The experience of European and, in particular, Scandinavian countries is analyzed with the integration of multimodal technologies into a real operating transport and logistics network. The transport and logistics potential of Yakutia is analyzed. The importance of settlements as potential multimodal centers of transport and logistics network based on combinatorial optimization methods is determined.
    Źródło:
    Archiwum Wiedzy Inżynierskiej; 2017, 2, 1; 75-77
    2544-2449
    Pojawia się w:
    Archiwum Wiedzy Inżynierskiej
    Dostawca treści:
    Biblioteka Nauki
    Artykuł
    Tytuł:
    Optimization of traveling salesman problem using affinity propagation clustering and genetic algorithm
    Autorzy:
    El-Samak, A. F.
    Ashour, W.
    Powiązania:
    https://bibliotekanauki.pl/articles/91810.pdf
    Data publikacji:
    2015
    Wydawca:
    Społeczna Akademia Nauk w Łodzi. Polskie Towarzystwo Sieci Neuronowych
    Tematy:
    combinatorial optimization problem
    travel salesman problem
    genetic algorithm
    evolutionary computation algorithm
    affinity propagation clustering technique
    AP
    problem optymalizacji kombinatorycznej
    algorytm genetyczny
    obliczenia ewolucyjne
    Opis:
    Combinatorial optimization problems, such as travel salesman problem, are usually NPhard and the solution space of this problem is very large. Therefore the set of feasible solutions cannot be evaluated one by one. The simple genetic algorithm is one of the most used evolutionary computation algorithms, that give a good solution for TSP, however, it takes much computational time. In this paper, Affinity Propagation Clustering Technique (AP) is used to optimize the performance of the Genetic Algorithm (GA) for solving TSP. The core idea, which is clustering cities into smaller clusters and solving each cluster using GA separately, thus the access to the optimal solution will be in less computational time. Numerical experiments show that the proposed algorithm can give a good results for TSP problem more than the simple GA.
    Źródło:
    Journal of Artificial Intelligence and Soft Computing Research; 2015, 5, 4; 239-245
    2083-2567
    2449-6499
    Pojawia się w:
    Journal of Artificial Intelligence and Soft Computing Research
    Dostawca treści:
    Biblioteka Nauki
    Artykuł
    Tytuł:
    Binary neural networks for N-queens problems and their VLSI implementations
    Autorzy:
    Funabiki, N.
    Kurokawa, T.
    Ohta, M.
    Powiązania:
    https://bibliotekanauki.pl/articles/205704.pdf
    Data publikacji:
    2002
    Wydawca:
    Polska Akademia Nauk. Instytut Badań Systemowych PAN
    Tematy:
    algorytm
    binarna sieć neuronowa
    N-queens problem
    optymalizacja kombinatoryczna
    problem n-hetmanów
    projekt VLSI
    binary neural network
    combinatorial optimization
    NP-hard
    VLSI design
    algorithm
    Opis:
    Combinatorial optimization problems compose an important class of matliematical problems that include a variety of practical applications, such as VLSI design automation, communication network design and control, job scheduling, games, and genome informatics. These problems usually have a large number of variables to be solved. For example, problems for VLSI design automation require several million variables. Besides, thieir computational complexity is often intractable due to NP-hardness. Neural networks have provided elegant solutions as approximation algorithms to these hard problems due to their natural parallelism and their affinity to hardware realization. Particularly, binary neural networks have great potential to conform to current digital VLSI design technology, because any state and parameter in binary neural networks are expressed in a discrete fashion. This paper presents our studies on binary neural networks to the N-queens problem, and the three different approaches to VLSI implementations focusing on the efficient realization of the synaptic connection networks. Reconfigurable devices such as CPLDs and FPGAs contribute the realization of a scalable architecture with the ultra high speed of computation. Based on the proposed architecture, more than several thousands of binary neurons can be realized on one FPGA chip.
    Źródło:
    Control and Cybernetics; 2002, 31, 2; 271-296
    0324-8569
    Pojawia się w:
    Control and Cybernetics
    Dostawca treści:
    Biblioteka Nauki
    Artykuł
    Tytuł:
    Rack cell configuration problem: a mathematical model and effective combined heuristic
    Autorzy:
    Ratkiewicz, Andrzej
    Lewczuk, Konrad
    Powiązania:
    https://bibliotekanauki.pl/articles/2090699.pdf
    Data publikacji:
    2021
    Wydawca:
    Polska Akademia Nauk. Czytelnia Czasopism PAN
    Tematy:
    combinatorial optimization
    rack cell configuration
    space utilisation
    storage
    cutting problem
    packing problem
    optymalizacja kombinatoryczna
    konfiguracja stelaża
    wykorzystanie przestrzeni
    przechowywanie
    problem z pakowaniem
    problem z cięciem
    Opis:
    This paper discusses the configuration of a space-effective rack cell for storing a given set of heterogeneous items. Rack cells are the primary components of rack storage areas. A rack cell configuration problem (RCCP) for heterogeneous storage is formulated as a combinatorial mathematical model. An effective heuristic for solving the RCCP in practical cases is presented. The proposed heuristic consists of multistage brute force searching of defined sets of feasible solutions and solving linear integer assignment problems by the branch-and-bound method. The developed algorithm was implemented and tested, and the rack cell obtained meets the modularity requirements in the design and operation of heterogeneous storage areas.
    Źródło:
    Bulletin of the Polish Academy of Sciences. Technical Sciences; 2021, 69, 1; e135836, 1--11
    0239-7528
    Pojawia się w:
    Bulletin of the Polish Academy of Sciences. Technical Sciences
    Dostawca treści:
    Biblioteka Nauki
    Artykuł
    Tytuł:
    Algorithms solving the Internet shopping optimization problem with price discounts
    Autorzy:
    Musial, J.
    Pecero, J. E.
    Lopez-Loces, M. C.
    Fraire-Huacuja, H. J.
    Bouvry, P.
    Blazewicz, J.
    Powiązania:
    https://bibliotekanauki.pl/articles/200209.pdf
    Data publikacji:
    2016
    Wydawca:
    Polska Akademia Nauk. Czytelnia Czasopism PAN
    Tematy:
    e-commerce
    Internet shopping
    applications of operations research
    approximations
    algorithms
    heuristics
    combinatorial optimization
    zakupy przez Internet
    wnioski z badań operacyjnych
    aproksymacje
    algorytmy
    heurystyki
    optymalizacja kombinatoryczna
    Opis:
    The Internet shopping optimization problem arises when a customer aims to purchase a list of goods from a set of web-stores with a minimum total cost. This problem is NP-hard in the strong sense. We are interested in solving the Internet shopping optimization problem with additional delivery costs associated to the web-stores where the goods are bought. It is of interest to extend the model including price discounts of goods. The aim of this paper is to present a set of optimization algorithms to solve the problem. Our purpose is to find a compromise solution between computational time and results close to the optimum value. The performance of the set of algorithms is evaluated through simulations using real world data collected from 32 web-stores. The quality of the results provided by the set of algorithms is compared to the optimal solutions for small-size instances of the problem. The optimization algorithms are also evaluated regarding scalability when the size of the instances increases. The set of results revealed that the algorithms are able to compute good quality solutions close to the optimum in a reasonable time with very good scalability demonstrating their practicability.
    Źródło:
    Bulletin of the Polish Academy of Sciences. Technical Sciences; 2016, 64, 3; 505-516
    0239-7528
    Pojawia się w:
    Bulletin of the Polish Academy of Sciences. Technical Sciences
    Dostawca treści:
    Biblioteka Nauki
    Artykuł
    Tytuł:
    Rack cell configuration problem: a mathematical model and effective combined heuristic
    Autorzy:
    Ratkiewicz, Andrzej
    Lewczuk, Konrad
    Powiązania:
    https://bibliotekanauki.pl/articles/2173543.pdf
    Data publikacji:
    2021
    Wydawca:
    Polska Akademia Nauk. Czytelnia Czasopism PAN
    Tematy:
    combinatorial optimization
    rack cell configuration
    space utilisation
    storage
    cutting problem
    packing problem
    optymalizacja kombinatoryczna
    konfiguracja stelaża
    wykorzystanie przestrzeni
    przechowywanie
    problem z pakowaniem
    problem z cięciem
    Opis:
    This paper discusses the configuration of a space-effective rack cell for storing a given set of heterogeneous items. Rack cells are the primary components of rack storage areas. A rack cell configuration problem (RCCP) for heterogeneous storage is formulated as a combinatorial mathematical model. An effective heuristic for solving the RCCP in practical cases is presented. The proposed heuristic consists of multistage brute force searching of defined sets of feasible solutions and solving linear integer assignment problems by the branch-and-bound method. The developed algorithm was implemented and tested, and the rack cell obtained meets the modularity requirements in the design and operation of heterogeneous storage areas.
    Źródło:
    Bulletin of the Polish Academy of Sciences. Technical Sciences; 2021, 69, 1; art. no. e135836
    0239-7528
    Pojawia się w:
    Bulletin of the Polish Academy of Sciences. Technical Sciences
    Dostawca treści:
    Biblioteka Nauki
    Artykuł
    Tytuł:
    Stability and accuracy functions in multicriteria combinatorial optimization problem with [Sigma]-MINMAX and [Sigma]-MINMIN partial criteria
    Autorzy:
    Libura, M.
    Nikulin, Y.
    Powiązania:
    https://bibliotekanauki.pl/articles/970484.pdf
    Data publikacji:
    2004
    Wydawca:
    Polska Akademia Nauk. Instytut Badań Systemowych PAN
    Tematy:
    wielokryterialna optymalizacja kombinatoryczna
    analiza wrażliwości
    funkcje stabilności i dokładności
    optimum Pareto i leksykograficzne
    multicriteria combinatorial optimization
    sensitivity analysis
    stability and accuracy functions
    Pareto and lexicographic optima
    Opis:
    We consider a vector generic combinatorial optimization problem in which initial coefficients of objective functions are subject to perturbations. For Pareto and lexicographic principles of efficiency we introduce appropriate measures of quality of a given feasible solution from the point of view of its stability. These measures correspond to so-called stability and accuracy functions denned earlier for scalar optimization problems. Then we study properties of such functions and calculate the maximal norms of perturbations for which an efficient solution preserves the efficiency.
    Źródło:
    Control and Cybernetics; 2004, 33, 3; 511-524
    0324-8569
    Pojawia się w:
    Control and Cybernetics
    Dostawca treści:
    Biblioteka Nauki
    Artykuł
    Tytuł:
    Optimization using chaotic neural network and its application to lighting design
    Autorzy:
    Nanba, R.
    Hasegawa, M.
    Nishita, T.
    Aihara, K.
    Powiązania:
    https://bibliotekanauki.pl/articles/205753.pdf
    Data publikacji:
    2002
    Wydawca:
    Polska Akademia Nauk. Instytut Badań Systemowych PAN
    Tematy:
    algorytm genetyczny
    denaturacja symulowana
    grafika komputerowa
    metoda energetyczna
    model świetlny
    sieć neuronowa chaotyczna
    zagadnienie optymalizacji kombinatorycznej
    chaotic neural networks
    combinatorial optimization problem
    computer graphics
    genetic algorithm
    lighting design
    radiosity method
    simulated annealing
    Opis:
    We have developed a chaotic neurodynamical searching method for solving the lighting design problems. The goal of this method is to design interior lighting that satisfies required illuminance distribution. We can obtain accurate illuminance distribution by using the radiosity method to calculate interreflection of lights. We formulate the lighting design problem that considers the interreflection of lights as a combinatorial optimization problem, and construct a chaotic neural network which searches the optimum solution of the lighting design problem. The calculated illuminance distribution is visualized using computer graphics. We compare this optimization method with the conventional neural network with gradient dynamics, simulated annealing, and the genetic algorithm, and clarify the effectiveness of the proposed method based on the chaotic neural network.
    Źródło:
    Control and Cybernetics; 2002, 31, 2; 249-269
    0324-8569
    Pojawia się w:
    Control and Cybernetics
    Dostawca treści:
    Biblioteka Nauki
    Artykuł
    Tytuł:
    New lower bounds on the weighted chromatic number of a graph
    Autorzy:
    Caramia, Massimiliano
    Fiala, Jirí
    Powiązania:
    https://bibliotekanauki.pl/articles/744465.pdf
    Data publikacji:
    2004
    Wydawca:
    Uniwersytet Zielonogórski. Wydział Matematyki, Informatyki i Ekonometrii
    Tematy:
    combinatorial analysis
    computational analysis
    optimization
    Opis:
    In this paper we present theoretical and algorithmic results for the computation of lower bounds on the chromatic number of a weighted graph. In particular, we study different ways of a possible improvement of the lower bound offered by a maximum weighted clique. Based on our findings we devise new algorithms and show their performance on random graphs.
    Źródło:
    Discussiones Mathematicae Graph Theory; 2004, 24, 2; 183-195
    2083-5892
    Pojawia się w:
    Discussiones Mathematicae Graph Theory
    Dostawca treści:
    Biblioteka Nauki
    Artykuł
    Tytuł:
    A new approach to identification and optimization of airfoils by using the combinatorial-cyclic method
    Autorzy:
    Ziętarski, S.
    Kachel, S.
    Kozakiewicz, A.
    Powiązania:
    https://bibliotekanauki.pl/articles/132112.pdf
    Data publikacji:
    2014
    Wydawca:
    Stowarzyszenie Inżynierów i Techników Mechaników Polskich
    Tematy:
    airfoils
    design optimization
    combinatorial-cyclic method
    Opis:
    For the last several years the combinatorial-cyclic method of optimization has been validated and expanded to new areas of applications. Although coordinate measurement analysis still is the main area of applications, the method is becoming a useful and unique tool in design optimization, reverse engineering (parametric design included), and virtual engineering. The case study aerodynamics of airplane and turbine airfoils, and simulation of wind tunnels is very difficult and promising as well. To solve all problems arising in these areas, an extensive software within the integrated CAD/CAM /CAE system has been developed, written in GRIP (SIEMENS NX 3.8).
    Źródło:
    Advanced Technologies in Mechanics; 2014, 1, no. 1 (1); 2-14
    2392-0327
    Pojawia się w:
    Advanced Technologies in Mechanics
    Dostawca treści:
    Biblioteka Nauki
    Artykuł
    Tytuł:
    A unified method of identification and optimization of airfoils for aircrafts, turbine and compressor blades
    Autorzy:
    Ziętarski, S.
    Kachel, S.
    Kozakiewicz, A.
    Powiązania:
    https://bibliotekanauki.pl/articles/1396456.pdf
    Data publikacji:
    2015
    Wydawca:
    Stowarzyszenie Inżynierów i Techników Mechaników Polskich
    Tematy:
    airfoils
    design optimization
    combinatorial-cyclic method
    turbine engines
    Opis:
    Topics below are rather undesired, but important, outcome not yet completed research on the aircraft airfoils, turbine and compressor blades, parametric design of airfoils, establishing the relationships based on the results of experiments in a wind tunnel, developing databases for determining the relationships between airfoil parameters and lift and drag coefficients. Reliable database created as a result of the research work allows to simulate the wind tunnel. Very early on, however, was necessary to extend the developed specialized software for a new applications, and it meant the need for generalization of software, e.g. for gas turbine engines, propellers, etc. But after some time it turned out, that in order to achieve the required accuracy, the changes are needed in the underlying assumptions, set decades ago. In addition, coordinate measuring machines and systems, and associated software were not always as accurate as expected. Concepts how to solve it and develop software carrying out these tasks are presented in the article. It is like to withdraw from the old path and look for a new path that will lead to the reliable data base. Processes related to air or gas flow should be similarly defined in all the specialized software applications (e.g. aircrafts and turbine engines). Accuracy (10-9 mm) achieved in virtual measurements within the integrated system can be used to verify the results of CMM and other measuring systems, provided that an appropriate software has been developed.
    Źródło:
    Advanced Technologies in Mechanics; 2015, 2, no. 3 (4); 2-15
    2392-0327
    Pojawia się w:
    Advanced Technologies in Mechanics
    Dostawca treści:
    Biblioteka Nauki
    Artykuł
    Tytuł:
    Perspektywy rozwoju metrologii na zasadach teorii "złotych pierścieni liczbowych"
    Perspectives for development of metrology based on the "gold numerical rings" theory
    Autorzy:
    Riznyk, W.
    Bandyrska, O.
    Powiązania:
    https://bibliotekanauki.pl/articles/158036.pdf
    Data publikacji:
    2007
    Wydawca:
    Stowarzyszenie Inżynierów i Techników Mechaników Polskich
    Tematy:
    metrologia kombinatoryczna
    wzorzec wielowartościowy
    optymalizacja
    zdolność rozdzielcza
    nadmiarowość
    combinatorial metrology
    adjustable gage
    optimization
    resolving ability
    redundancy
    Opis:
    W pracy określone są perspektywy rozwoju nauki metrologicznej na zasadach teorii "złotych pierścieni liczbowych" (ZPL), które prowadzą do koncepcji "metrologii kombinatorycznej", tzn. bazującej na wykorzystaniu nieznanych wcześniej wspaniałych właściwości tych modeli. Jednym z przykładów może być optymalizacja rozmieszczenia czujników pomiarowych w przestrzeni, celem osiągnięcia jak najlepszej zdolności rozdzielczej całego systemu.
    The paper considers perspectives for development of metrology, based on the gold numerical rings theory (GNR)s, which lead to the "combinatorial metrology" conception, namely unknown earlier remarkable properties of the models. As an example can be an optimization for arrangement of sensors spreading in a space for achievement of the best resolving ability.
    Źródło:
    Pomiary Automatyka Kontrola; 2007, R. 53, nr 9 bis, 9 bis; 61-64
    0032-4140
    Pojawia się w:
    Pomiary Automatyka Kontrola
    Dostawca treści:
    Biblioteka Nauki
    Artykuł
    Tytuł:
    Internet shopping optimization problem
    Autorzy:
    Błażewicz, J.
    Kovalyov, M. Y.
    Musiał, J.
    Urbański, A. P.
    Wojciechowski, A.
    Powiązania:
    https://bibliotekanauki.pl/articles/907755.pdf
    Data publikacji:
    2010
    Wydawca:
    Uniwersytet Zielonogórski. Oficyna Wydawnicza
    Tematy:
    algorytm
    złożoność obliczeniowa
    algorytm kombinatoryczny
    optymalizacja
    zakupy internetowe
    algorithm
    computational complexity
    combinatorial algorithms
    optimization
    Internet shopping
    Opis:
    A high number of Internet shops makes it difficult for a customer to review manually all the available offers and select optimal outlets for shopping. A partial solution to the problem is brought by price comparators which produce price rankings from collected offers. However, their possibilities are limited to a comparison of offers for a single product requested by the customer. The issue we investigate in this paper is a multiple-item multiple-shop optimization problem, in which total expenses of a customer to buy a given set of items should be minimized over all available offers. In this paper, the Internet Shopping Optimization Problem (ISOP) is defined in a formal way and a proof of its strong NP-hardness is provided. We also describe polynomial time algorithms for special cases of the problem.
    Źródło:
    International Journal of Applied Mathematics and Computer Science; 2010, 20, 2; 385-390
    1641-876X
    2083-8492
    Pojawia się w:
    International Journal of Applied Mathematics and Computer Science
    Dostawca treści:
    Biblioteka Nauki
    Artykuł
    Tytuł:
    Genetic and combinatorial algorithms for optimal sizing and placement of active power filters
    Autorzy:
    Maciążek, M.
    Grabowski, D.
    Pasko, M.
    Powiązania:
    https://bibliotekanauki.pl/articles/330809.pdf
    Data publikacji:
    2015
    Wydawca:
    Uniwersytet Zielonogórski. Oficyna Wydawnicza
    Tematy:
    power quality
    optimization
    active power filter
    harmonics
    genetic algorithm
    combinatorial algorithm
    jakość energii
    energetyczny filtr aktywny
    algorytm genetyczny
    algorytm kombinatoryczny
    Opis:
    The paper deals with cost effective compensator placement and sizing. It becomes one of the most important problems in contemporary electrical networks, in which voltage and current waveform distortions increase year-by-year reaching or even exceeding limit values. The suppression of distortions could be carried out by means of three types of compensators, i.e., passive filters, active power filters and hybrid filters. So far, passive filters have been more popular mainly because of economic reasons, but active and hybrid filters have some advantages which should cause their wider application in the near future. Active power filter placement and sizing could be regarded as an optimization problem. A few objective functions have been proposed for this problem. In this paper we compare solutions obtained by means of combinatorial and genetic approaches. The theoretical discussion is followed by examples of active power filter placement and sizing.
    Źródło:
    International Journal of Applied Mathematics and Computer Science; 2015, 25, 2; 269-279
    1641-876X
    2083-8492
    Pojawia się w:
    International Journal of Applied Mathematics and Computer Science
    Dostawca treści:
    Biblioteka Nauki
    Artykuł
      Wyświetlanie 1-34 z 34

      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