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-15 z 34
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ł:
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ł:
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ł:
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ł:
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ł:
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ł:
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ł:
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ł:
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ł:
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ł:
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ł
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ł:
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ł:
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ł
Wyświetlanie 1-15 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