Preferencje help
Widoczny [Schowaj] Abstrakt
Liczba wyników

Znaleziono wyników: 1

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

help Ogranicz wyniki do:
first rewind previous Strona / 1 next fast forward last
EN
The paper deals with application of the ortho-diagonal (O-D) method of finding the nondominated sets of solutions and evaluations for discrete polyoptimization problems. First, the (O-D) method was modified for finding minimum of a scalar function. The monotonicity property of a vector objective function is used by the (O-D) method for consecutive finding of j-th-criteria partial nondominated sets, j \in {1,2,...,J}. To find the nondominated evaluations sets the discrete neighbourhoods S of the point x_i are investigated starting from the solution x*_1 which minimizes the first objective function. In this way the consecutive nondominated solutions x*_{ND} are determined. An accuracy of solution and CPU computing time depend on the way the discrete neighbourhoods S of the point x_i in the design space are defined. The algorithm of the (O-D) method is applied to solve the discrete polyoptimization of a hall with spatial grid structure.
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ć.