نتایج جستجو برای: discrete optimization
تعداد نتایج: 467118 فیلتر نتایج به سال:
logit models are one of the most important discrete choice models and they play an important role in describing decision makers’ choices among alternatives. in this paper the multi-nominal logit models has been used in mode choice modeling of isfahan. despite the availability of different mathematical computer programs there are not so many programs available for estimating discrete choice mode...
The new optimization method for fiber orientation angle optimization of symmetrical multilayer plates like plywood is proposed. Optimization method consists of seeking for minimal compliance by choosing appropriate fiber orientation angle in outer layers of flexural plate. The discrete values of fiber orientation angles are used in method. Optimization results of simply supported plate and mult...
Methods of discrete optimization play an important role in the area of control and optimization of industrial processes. Due to the fact that most discrete optimization problems are NP-complete, a lot of specialized methods have been developed for them, which differ with respect to algorithmic properties, see e.g [5, 7]. For this reason a user is not always able to select the algorithm that fit...
this paper describes a methodology in designing high-performance concrete for simply supported beams, using a hybrid optimization strategy based on a variable neighborhood search threshold acceptance algorithm. three strategies have been applied to discrete optimization of reinforced concrete beams: variable neighborhood descent (vnd), reduced neighborhood search (rns) and basic variable neighb...
Stochastic discrete resource allocation problems are difficult to solve. In this paper, we propose a new algorithm designed specifically to tackle them. The algorithm combines with the Nested Partitions method, the Ordinal Optimization techniques, and an efficient simulation control technique. The resulting hybrid algorithm retains the global perspective of the Nested Partitions method and the ...
Ant colony optimization is a technique for optimization that was introduced in the early 1990’s. The inspiring source of ant colony optimization is the foraging behavior of real ant colonies. This behavior is exploited in artificial ant colonies for the search of approximate solutions to discrete optimization problems, to continuous optimization problems, and to important problems in telecommun...
Aproximity theorem is astatement that, given an optimization problem and its relaxation, an optimal solution to the original problem exists in acertain neighborhood of asolution to the relaxation. Proximity theorems have been used successfully, for example, in designing efficient algorithms for discrete resource allocation problems. After reviewing the recent results for $\mathrm{L}$-convex and...
نمودار تعداد نتایج جستجو در هر سال
با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید