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ę "branch and bound" wg kryterium: Temat

  Lista filtrów
Wyrównaj
Wyświetlanie 1-15 z 21
Tytuł:
Analysis of performance for the DIRECT global optimization algorithm
Analiza działania algorytmu optymalizacji globalnej DIRECT
Autorzy:
Borowik, P.
Chwastek, K.
Powiązania:
https://bibliotekanauki.pl/articles/159401.pdf
Data publikacji:
2016
Wydawca:
Sieć Badawcza Łukasiewicz - Instytut Elektrotechniki
Tematy:
algorithm "branch-and-bound"
optimization
simulations
algorytm "branch-and-bound"
optymalizacja
symulacje
Opis:
The usefulness of the "branch-and-bound" algorithm for solving chosen optimization problems is considered in the paper. Simulations have been carried out for chosen benchmark tasks with different complexity and number of dimensions.
W pracy dokonano oceny użyteczności algorytmu "branch-and-bound" do rozwiązywania wybranych zadań optymalizacji. Przeprowadzono symulacje dla wybranych zadań testowych o różnej złożoności i liczbie wymiarów.
Źródło:
Prace Instytutu Elektrotechniki; 2016, 273; 55-62
0032-6216
Pojawia się w:
Prace Instytutu Elektrotechniki
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Integrating pivot based search with branch and bound for binary MIPs
Autorzy:
Lokketangen, A.
Woodruff, D.
Powiązania:
https://bibliotekanauki.pl/articles/206756.pdf
Data publikacji:
2000
Wydawca:
Polska Akademia Nauk. Instytut Badań Systemowych PAN
Tematy:
branch and bound
chunking
heuristics
tabu search
Opis:
This paper examines integration of a sophisticated, pivot-based tabu search into branch and bound for 0-1 MIPS and global diversification tests using chunking. Issues related to behavior of a tabu search within a branch and bound algorithm are analyzed using computational experiments. Results are presented showing that the inclusion of the local search sometimes results in fewer and nodes and lower CPU times even when used in a callback mode. The main benefit in incorporating a pivot based heuristic is that an integer feasible solution can be found earlier in the branching process. Computational experiments are presented showing that for some instances the overall search time is improved, while for some others the tabu search can find good solutions quickly.
Źródło:
Control and Cybernetics; 2000, 29, 3; 741-759
0324-8569
Pojawia się w:
Control and Cybernetics
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
The branch and bound algorithm for a backup virtual path assignment in survivable atm networks
Autorzy:
Walkowiak, K.
Powiązania:
https://bibliotekanauki.pl/articles/907991.pdf
Data publikacji:
2002
Wydawca:
Uniwersytet Zielonogórski. Oficyna Wydawnicza
Tematy:
automatyka
survivable networks
ATM
branch and bound algorithm
Opis:
Issues of network survivability are important, since users of computer networks should be provided with some guarantees of data delivery. A large amount of data may be lost in high-speed Asynchronous Transfer Mode (ATM) due to a network failure and cause significant economic loses. This paper addresses problems of network survivability. The characteristics of virtual paths and their influence on network restoration are examined. A new problem of Backup Virtual Path Routing is presented for the local-destination rerouting strategy. The function of the flow lost due to a failure of a single link is chosen as the performance index. The problem of finding the optimal virtual path assignment is NP-complete. Therefore we develop an exact algorithm based on the branch and bound approach. Moreover, two heuristic algorithms are proposed. Numerical results are presented.
Źródło:
International Journal of Applied Mathematics and Computer Science; 2002, 12, 2; 257-267
1641-876X
2083-8492
Pojawia się w:
International Journal of Applied Mathematics and Computer Science
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
The branch and bound algorithm improvement in divisible load scheduling with result collection on heterogeneous systems by new heuristic function
Autorzy:
Fard, F. N.
Mohammadi, S.
Parvizi, P.
Powiązania:
https://bibliotekanauki.pl/articles/385127.pdf
Data publikacji:
2012
Wydawca:
Sieć Badawcza Łukasiewicz - Przemysłowy Instytut Automatyki i Pomiarów
Tematy:
divisible load scheduling
heterogeneous systems
branch and bound algorithm
Opis:
In this paper we propose a new heuristic function for branch and bound algorithm. By this function we can increase the efficiency of branch and bound algorithm. Divisible loads represent computations which can be arbitrarily divided into parts and performed independently parallel. The scheduling problem consists in distributing the load in a heterogeneous system taking into account communication and computation times, so that the whole processing time is as short as possible. Since our scheduling problem is computationally hard, we propose a branch & bound algorithm. By simulating and comparing results it is observed which this result produces better answers than other methods, it means that branch and bound algorithm have less total average of relative error percentage in the variety Heuristic functions.
Źródło:
Journal of Automation Mobile Robotics and Intelligent Systems; 2012, 6, 3; 47-50
1897-8649
2080-2145
Pojawia się w:
Journal of Automation Mobile Robotics and Intelligent Systems
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
When is an Incomplete 3 × n Latin Rectangle Completable?
Autorzy:
Euler, Reinhardt
Oleksik, Paweł
Powiązania:
https://bibliotekanauki.pl/articles/30146857.pdf
Data publikacji:
2013-03-01
Wydawca:
Uniwersytet Zielonogórski. Wydział Matematyki, Informatyki i Ekonometrii
Tematy:
incomplete latin rectangle
completability
solution space enumeration
branch-and-bound
Opis:
We use the concept of an availability matrix, introduced in Euler [7], to describe the family of all minimal incomplete 3 × n latin rectangles that are not completable. We also present a complete description of minimal incomplete such latin squares of order 4.
Źródło:
Discussiones Mathematicae Graph Theory; 2013, 33, 1; 57-69
2083-5892
Pojawia się w:
Discussiones Mathematicae Graph Theory
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Scatter Search based algorithms for min-max regret task scheduling problems with interval uncertainty
Autorzy:
Józefczyk, J.
Siepak, M.
Powiązania:
https://bibliotekanauki.pl/articles/206069.pdf
Data publikacji:
2013
Wydawca:
Polska Akademia Nauk. Instytut Badań Systemowych PAN
Tematy:
task scheduling
interval uncertainty
min-max regret
branch and bound
Opis:
Uncertain versions of three task scheduling problems: P║Cmax, F2║Cmax, R║Σ Cj are investigated. Parametric uncertainty is only considered which is represented by intervals. It is assumed that values of execution times of tasks are not a priori given, and they belong to the intervals of known bounds. No distributions additionally characterizing the uncertain parameters are assumed. The regret is used as the basis for a criterion evaluating the uncertainty. In a consequence, min-max regret combinatorial problems are solved. Heuristic algorithms based on Scatter Search are proposed. They are evaluated via computational experiments and compared to a simple middle intervals heuristics and to exact solutions for small instances of the problems considered.
Źródło:
Control and Cybernetics; 2013, 42, 3; 667-698
0324-8569
Pojawia się w:
Control and Cybernetics
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
On probabilistic bounds inspired by interval arithmetic
Autorzy:
Zilinskas, A.
Zilinskas, J.
Powiązania:
https://bibliotekanauki.pl/articles/969846.pdf
Data publikacji:
2010
Wydawca:
Polska Akademia Nauk. Instytut Badań Systemowych PAN
Tematy:
global optimization
branch and bound method
randomized computing
interval arithmetic
Opis:
A randomized method aimed at evaluation of probabilistic bounds for function values is considered. Stochastic intervals tightly covering ranges of function values with probability close to one are modelled by a randomized method inspired by interval arithmetic. Statistical properties of the modelled intervals are investigated experimentally. The experimental results are discussed with respect to application of this method in the construction of a branch and bound type randomized algorithm for global optimization.
Źródło:
Control and Cybernetics; 2010, 39, 2; 507-525
0324-8569
Pojawia się w:
Control and Cybernetics
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Efficient implementation of branch-and-bound method on desktop grids
Autorzy:
Tlan, B.
Posypkin, M.
Powiązania:
https://bibliotekanauki.pl/articles/305762.pdf
Data publikacji:
2014
Wydawca:
Akademia Górniczo-Hutnicza im. Stanisława Staszica w Krakowie. Wydawnictwo AGH
Tematy:
BOINC
branch-and-bound method
distributed computing
volunteer computing
desktop grid
Opis:
The Berkeley Open Infrastructure for Network Computing (BOINC) is an open-source middleware system for volunteer and desktop grid computing. In this paper, we propose BNBTEST, a BOINC version of the distributed branch-and-bound method. The crucial issues of the distributed branch-and-bound method are traversing the search tree and loading the balance. We developed a subtask packaging method and three different subtask distribution strategies to solve these.
Źródło:
Computer Science; 2014, 15 (3); 239-252
1508-2806
2300-7036
Pojawia się w:
Computer Science
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Target assignment problem for air raid
Autorzy:
Chudy, M.
Powiązania:
https://bibliotekanauki.pl/articles/205571.pdf
Data publikacji:
1999
Wydawca:
Polska Akademia Nauk. Instytut Badań Systemowych PAN
Tematy:
problem przyporządkowania adresów
air raid planning
assignment problem
branch-and-bound method
Opis:
The article deals with two formulations of the target assignment problem. The first one concerns a homogeneous collection of air raid means (different types of aircrafts and missiles). We propose a method for solving a subclass of the problem. The approach consists of two parts. First, an equivalent assignment-type problem is constructed, then a modified branch-and-bound method is used to solve the problem. The other formulation concerns a heterogencous collection of means. To describe this problem a new algebra is introduced
Źródło:
Control and Cybernetics; 1999, 28, 1; 101-113
0324-8569
Pojawia się w:
Control and Cybernetics
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ł:
Właściwości programowej realizacji zadania programowania całkowitoliczbowego
Look-and-feel realization of integer programming problems
Autorzy:
Ostanin, A.
Wasiluk, J.
Powiązania:
https://bibliotekanauki.pl/articles/341141.pdf
Data publikacji:
2008
Wydawca:
Politechnika Białostocka. Oficyna Wydawnicza Politechniki Białostockiej
Tematy:
programowanie całkowitoliczbowe
metoda gałęzi i granic
decyzja o rozgałęzieniu
integer programming
branch-and-bound method
deciding whether to branch
Opis:
Praca poświęcona jest problemom realizacji nowej optymalizacyjnej funkcji bintprog jako nieodłącznej części Optimization Toolbox 3.0 programowego pakietu MATLAB 7. Wprowadzenie nowej funkcji istotnie poszerza skalę rozwiązywanych optymalizacyjnych zadań, ponieważ potwierdza fakt realizowania metody gałęzi i granic. Badanie tej metody wchodzi w skład programu wielu uczelnianych kursów i daje podstawędo rozwiązywania większości zadań programowania całkowitoliczbowego. Na zakończenie podano przykłady niektórych reprezentatywnych wyników uzyskanych w badaniach.
The paper is dedicated to the problems of realization a new optimization function bintprog as inseparable part of Optimization Toolbox 3.0, pack MATLAB 7. Introduction of the new function essentially extends the scale of optimization assignments that should be solved, because it confirms the fact of realizing the branch-and-bound method. Investigation of this methods is included in many of educational courses and gives base to solving most of integer programming problems. Some representative results of tests are given at the end of the paper.
Źródło:
Zeszyty Naukowe Politechniki Białostockiej. Informatyka; 2008, 3; 97-110
1644-0331
Pojawia się w:
Zeszyty Naukowe Politechniki Białostockiej. Informatyka
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Task allocation algorithms for maximizing reliability of heterogeneous distributed computing systems
Autorzy:
Mahmood, A.
Powiązania:
https://bibliotekanauki.pl/articles/205582.pdf
Data publikacji:
2001
Wydawca:
Polska Akademia Nauk. Instytut Badań Systemowych PAN
Tematy:
heurystyka
niezawodność
obliczenie zdecentralizowane
przetwarzanie rozproszone
A* algorithm
branch-and-bound
distributed computing
heuristics
reliability
task allocation
Opis:
The rapid progress of microprocessor and communication technologies has made the distributed computing system economically attractive for many computer applications. One of the first problems encountered in the operation of a distributed system is the problem of allocating the tasks among the processing nodes. The task allocation problem is known to be computationally intractable for large task sets. In this paper, we consider the task allocation problem with the goal of maximizing reliability of heterogeneous distributed systems. After presenting a quantitative task allocation model, we present a least-cost branch-and-bound algorithm to find optimal task allocations. We also present two heuristic algorithms to obtain suboptimal allocations for realistic size large problems in a reasonable amount of computational time. Simulation was used to study the performance of the proposed algorithms for a large number of problems. Also, performance of the proposed algorithms has been compared with a well-known heuristics available in the literature.
Źródło:
Control and Cybernetics; 2001, 30, 1; 115-130
0324-8569
Pojawia się w:
Control and Cybernetics
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
The branch-and-bound method and genetic algorithm in avoidance of ships collisions in fuzzy environment
Autorzy:
Mohamed-Seghir, Mostefa
Powiązania:
https://bibliotekanauki.pl/articles/259091.pdf
Data publikacji:
2012
Wydawca:
Politechnika Gdańska. Wydział Inżynierii Mechanicznej i Okrętownictwa
Tematy:
safe ship control
optimal control
safe trajectories
branch and bound method
genetic algorithm
ship control
fuzzy set theory
Opis:
Marine navigation consists in continuous observation of the situation at sea, determination the anti-collision manoeuvre. So it necessary to determine ship safe trajectory as a sequence of ship course changing manoeuvres. Each manoeuvre is undertaken on the basis of information obtained from the anti-collision system ARPA. This paper describes a method of safe ship control in the collision situation in a fuzzy environment based on a branch and bound method and a genetic algorithm. The optimal safe ship trajectory in a collision situation is presented as multistage decision-making process.
Źródło:
Polish Maritime Research; 2012, S 1; 45-49
1233-2585
Pojawia się w:
Polish Maritime Research
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Development the methods of optimum placement undirected planar objects with piecewise non-linear boundaries in the multiply area
Autorzy:
Chaplya, Yu.
Sobol, O.
Powiązania:
https://bibliotekanauki.pl/articles/411345.pdf
Data publikacji:
2016
Wydawca:
Polska Akademia Nauk. Oddział w Lublinie PAN
Tematy:
optimal placement
object with piecewise linear boundary
multiply area
mathematical model
branch and bound method
method of simulated annealing
Opis:
In this paper the statement of the problem is formulated and the mathematical model of optimization the placement of the undirected planar geometrical objects with piecewise non-linear boundaries in the multiply area is developed. It is shown the geometrical interpretation and derived the estimate of the number of restrictions in the model. On the basis of a mathematical model for finding the global extremum of the objective function was proposed modified method of branches and boundaries. It is also shown the solutions tree that takes into account the problems of optimal placement of undirected planar geometrical object with piecewise nonlinear boundaries in the multiply area, and received the complexity of this method. For locally optimal solutions of the problem modified simulated annealing method has been developed. Thus the analytical expressions for the function of energy system were received, the function, that describes the decrease of temperature over time, function that forms a new state of system. The method of formation the new state of the system was investigated in more detail, which is based on a random permutation of numbers the pair of the objects, it is also based on a consistent placement of objects according to reshuffle their numbers and determining the probability of transition to a new state. It is shown the example of determining permissible points of placement the local coordinate system of the specific geometrical object. The conclusion is that to solve practical optimization problems of placement of the undirected planar geometrical objects with piecewise non-linear boundaries in the multiply area should be used the modified simulated annealing method.
Źródło:
ECONTECHMOD : An International Quarterly Journal on Economics of Technology and Modelling Processes; 2016, 5, 2; 39-44
2084-5715
Pojawia się w:
ECONTECHMOD : An International Quarterly Journal on Economics of Technology and Modelling Processes
Dostawca treści:
Biblioteka Nauki
Artykuł
Wyświetlanie 1-15 z 21

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