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ę "dynamic problem" wg kryterium: Temat

  Lista filtrów
Wyrównaj
    Wyświetlanie 1-4 z 4
    Tytuł:
    Shape optimization of thermoviscoelastic contact problems
    Autorzy:
    Myśliński, A.
    Powiązania:
    https://bibliotekanauki.pl/articles/970530.pdf
    Data publikacji:
    2003
    Wydawca:
    Polska Akademia Nauk. Instytut Badań Systemowych PAN
    Tematy:
    optymalizacja kształtu
    analiza czułości
    warunek konieczny optymalności
    dynamic thermoviscoelastic contact problem
    shape optimization
    sensitivity analysis
    necessary optimality condition
    Opis:
    This paper is concerned with a shape optimization problem of a viscoelastic body in unilateral dynamic contact with a rigid foundation. The contact with Coulomb friction is assumed to occur at a portion of the boundary of the body. The nonpenetration condition is described in terms of velocities. The thermal deformation is taken into account. Using the material derivative method as well as the results concerning the regularity of solutions to dynamic variational thermoviscoelastic problem the directional derivative of the cost functional is calculated. A necessary optimality condition is formulated.
    Źródło:
    Control and Cybernetics; 2003, 32, 3; 611-627
    0324-8569
    Pojawia się w:
    Control and Cybernetics
    Dostawca treści:
    Biblioteka Nauki
    Artykuł
    Tytuł:
    Tabu search: global intensification using dynamic programming
    Autorzy:
    Wilbaut, C.
    Hanafi, S.
    Fréville, A.
    Balev, S.
    Powiązania:
    https://bibliotekanauki.pl/articles/970871.pdf
    Data publikacji:
    2006
    Wydawca:
    Polska Akademia Nauk. Instytut Badań Systemowych PAN
    Tematy:
    programowanie dynamiczne
    tabu search
    dynamic programming
    global intensification
    multidimensional 0-1 knapsack problem
    Opis:
    Tabu search has proven highly successful in solving hard combinatorial optimization problems. In this paper, we propose a hybrid method that combines adaptive memory, sparse dynamic programming, and reduction techniques to reduce and explore the search space. Our approach starts with a bi-partition of the variables, involving a small core problem, which never exceeds 15 variables, solved using the "forward" phase of the dynamic programming procedure. Then, the remaining subspace is explored using tabu search, and each partial solution is completed with the information stored during the forward phase of dynamic programming. Our approach can be seen as a global intensification mechanism, since at each iteration, the move evaluations involve solving a reduced problem implicitly. The proposed specialized tabu search approach was tested in the context of the multidimensional 0-1 knapsack problem. Our approach was compared to ILOG's commercial product CPLEX and to the corresponding "pure" tabu search (i.e., without a core problem) for various sets of test problems available in OR-libraries. The results are encouraging. In particular, this enhances the robustness of the approach, given that it performs better than the corresponding pure tabu search most of the time. Moreover, our approach compares well with CPLEX when the number of variables is large; it is able to provide elite feasible solutions in a very reasonable amount of computational time.
    Źródło:
    Control and Cybernetics; 2006, 35, 3; 579-598
    0324-8569
    Pojawia się w:
    Control and Cybernetics
    Dostawca treści:
    Biblioteka Nauki
    Artykuł
    Tytuł:
    DP2PN2Solver: A flexible dynamic programming solver software tool
    Autorzy:
    Mauch, H.
    Powiązania:
    https://bibliotekanauki.pl/articles/970851.pdf
    Data publikacji:
    2006
    Wydawca:
    Polska Akademia Nauk. Instytut Badań Systemowych PAN
    Tematy:
    sieć Bellmana
    model sieci Petri
    programowanie dynamiczne
    Bellman net
    dynamic programming
    matrix chain multiplication problem
    optimization software
    Petri net model
    traveling salesman problem
    Opis:
    Dynamic programming (DP) is a very general optimization technique, which can be applied to numerous decision problems that typically require a sequence of decisions to be made. The solver software DP2PN2Solver presented in this paper is a general, flexible, and expandable software tool that solves DP problems. It consists of modules on two levels. A level one module takes the specification of a discrete DP problem instance as input and produces an intermediate Petri net (PN) representation called Bellman net (Lew, 2002; Lew, Mauch, 2003, 2004) as output - a middle layer, which concisely captures all the essential elements of a DP problem in a standardized and mathematically precise fashion. The optimal solution for the problem instance is computed by an "executable" code (e.g. Java, Spreadsheet, etc.) derived by a level two module from the Bellman net representation. DP2PN2Solver's unique potential lies in its Bellman net representation. In theory, a PN's intrinsic concurrency allows to distribute the computational load encountered when solving a single DP problem instance to several computational units.
    Źródło:
    Control and Cybernetics; 2006, 35, 3; 687-702
    0324-8569
    Pojawia się w:
    Control and Cybernetics
    Dostawca treści:
    Biblioteka Nauki
    Artykuł
    Tytuł:
    The corridor method: a dynamic programming inspired metaheuristic
    Autorzy:
    Sniedovich, M.
    Viß, S.
    Powiązania:
    https://bibliotekanauki.pl/articles/970877.pdf
    Data publikacji:
    2006
    Wydawca:
    Polska Akademia Nauk. Instytut Badań Systemowych PAN
    Tematy:
    programowanie dynamiczne
    metaheuristics
    dynamic programming
    curse of dimensionality
    very large neighborhoods
    corridor method
    global optimization
    move-based
    method-based
    traveling salesman problem
    Opis:
    This paper presents a dynamic programming inspired metaheuristic called Corridor Method. It can be classified as a method-based iterated local search in that it deploys method-based neighborhoods. By this we mean that the search for a new candidate solution is carried out by a fully-fledged optimization method and generates a global optimal solution over the neighborhood. The neighborhoods are thus constructed to be suitable domains for the fully-fledged optimization method used. Typically, these neighborhoods are obtained by the imposition of exogenous constraints on the decision space of the target problem and therefore must be compatible with the optimization method used to search these neighborhoods. This is in sharp contrast to traditional metaheuristics where neighborhoods are move-based, that is, they are generated by subjecting the candidate solution to small changes called moves. While conceptually this method-based paradigm applies to any optimization method, in practice it is best suited to support optimization methods such as dynamic programming, where it is easy to control the size of a problem, hence the complexity of algorithms, by means of exogenous constraints. The essential features of the Corridor Method are illustrated by a number of examples, including the traveling salesman problem, where exponentially large neighborhoods are searched by a linear time/space dynamic programming algorithm.
    Źródło:
    Control and Cybernetics; 2006, 35, 3; 551-578
    0324-8569
    Pojawia się w:
    Control and Cybernetics
    Dostawca treści:
    Biblioteka Nauki
    Artykuł
      Wyświetlanie 1-4 z 4

      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