Preferencje help
Widoczny [Schowaj] Abstrakt
Liczba wyników

Znaleziono wyników: 2

Liczba wyników na stronie
first rewind previous Strona / 1 next fast forward last
Wyniki wyszukiwania
Wyszukiwano:
w słowach kluczowych:  0-1 knapsack problem
help Sortuj według:

help Ogranicz wyniki do:
first rewind previous Strona / 1 next fast forward last
EN
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.
EN
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.
first rewind previous Strona / 1 next fast forward last
JavaScript jest wyłączony w Twojej przeglądarce internetowej. Włącz go, a następnie odśwież stronę, aby móc w pełni z niej korzystać.