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ę "0-1 knapsack problem" wg kryterium: Temat

  Lista filtrów
Wyrównaj
    Wyświetlanie 1-3 z 3
    Tytuł:
    Numerical application of the SPEA algorithm to reliability multi-objective optimization
    Autorzy:
    Guze, S.
    Powiązania:
    https://bibliotekanauki.pl/articles/2069179.pdf
    Data publikacji:
    2015
    Wydawca:
    Uniwersytet Morski w Gdyni. Polskie Towarzystwo Bezpieczeństwa i Niezawodności
    Tematy:
    multi-objective
    optimization
    reliability
    0-1 knapsack problem
    SPEA
    Opis:
    The main aim of the paper is the computer-aided multi-objective reliability optimization using the SPEA algorithm. This algorithm and the binary knapsack problem are described. Furthermore, the computer program that solves the knapsack problem with accordance to SPEA algorithm is introduced. Example of the possible application of this program to the multi-objective reliability optimization of exemplary parallel-series system is shown.
    Źródło:
    Journal of Polish Safety and Reliability Association; 2015, 6, 1; 101--114
    2084-5316
    Pojawia się w:
    Journal of Polish Safety and Reliability Association
    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ł:
    Appraisal of genetic algorithm and its application in 0-1 knapsack problem
    Autorzy:
    Okwu, Modestus
    Otanocha, Omonigho B.
    Omoregbee, Henry O.
    Edward, Bright A.
    Powiązania:
    https://bibliotekanauki.pl/articles/95189.pdf
    Data publikacji:
    2020
    Wydawca:
    Politechnika Koszalińska. Wydawnictwo Uczelniane
    Tematy:
    classical techniques
    genetic algorithm
    evolutionary biology
    0-1 knapsack problem
    techniki klasyczne
    algorytm genetyczny
    biologia ewolucyjna
    problem plecakowy
    Opis:
    A lot of uncertainties and complexities exist in real life problem. Unfortunately, the world approaches such intricate realistic life problems using traditional methods which has failed to offer robust solutions. In recent times, researchers look beyond classical techniques. There is a model shift from the use of classical techniques to the use of standardized intelligent biological systems or evolutionary biology. Genetic Algorithm (GA) has been recognized as a prospective technique capable of handling uncertainties and providing optimized solutions in diverse area, especially in homes, offices, stores and industrial operations. This research is focused on the appraisal of GA and its application in real life problem. The scenario considered is the application of GA in 0-1 knapsack problem. From the solution of the GA model, it was observed that there is no combination that would give the exact weight or capacity the 35 kg bag can carry but the possible range from the solution model is 34 kg and 36 kg. Since the weight of the bag is 35 kg, the feasible or near optimal solution weight of items the bag can carry would be 34 kg at benefit of 16. Additional load beyond 34 kg could lead to warping of the bag.
    Źródło:
    Journal of Mechanical and Energy Engineering; 2020, 4, 1; 39-46
    2544-0780
    2544-1671
    Pojawia się w:
    Journal of Mechanical and Energy Engineering
    Dostawca treści:
    Biblioteka Nauki
    Artykuł
      Wyświetlanie 1-3 z 3

      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