نتایج جستجو برای: bound algorithm is proposed then
تعداد نتایج: 7661678 فیلتر نتایج به سال:
In this paper, we propose a vibration damping optimization algorithm to solve a fuzzy mathematical model for the single-item capacitated lot-sizing problem. At first, a fuzzy mathematical model for the single-item capacitated lot-sizing problem is presented. The possibility approach is chosen to convert the fuzzy mathematical model to crisp mathematical model. The obtained crisp model is in the...
the treatment of in completely formed pulpless teeth has presented considrable problems. these teeth have wide open apexes and the walls of the root canal diverge toward the apical tissues. mechanical preparation cannot be done in the normal manner beacause of the large initial size and the taper of apical part of the canal , a mechanical stop cannot be produced at the apex of the canal and , t...
A One-Dimensional Binary Integer Programming Problem (1DB-IPP) is concerned with selecting a subset from a set of k items in budget constraint to optimize an objective function. In this problem a dominant solution is defined as a feasible selection to which no further item could be added in budget constraint. This paper presents a simple algorithm for Enumeration of Dominant Solutions (EDS) and...
this paper proposes a novel hybrid algorithm namely apso-bfo which combines merits of bacterial foraging optimization (bfo) algorithm and adaptive particle swarm optimization (apso) algorithm to determine the optimal pid parameters for control of nonlinear systems. to balance between exploration and exploitation, the proposed hybrid algorithm accomplishes global search over the whole search spa...
Unfortunately, among internet services, users are faced with several unwanted messages that are not even related to their interests and scope, and they contain advertising or even malicious content. Spam email contains a huge collection of infected and malicious advertising emails that harms data destroying and stealing personal information for malicious purposes. In most cases, spam emails con...
this article deals with the issues associated with developing a new design methodology for the nonlinear model-predictive control (mpc) of a chemical plant. a combination of multiple neural networks is selected and used to model a nonlinear multi-input multi-output (mimo) process with time delays. an optimization procedure for a neural mpc algorithm based on this model is then developed. the p...
In this paper, we present a new path-following interior-point algorithm for -horizontal linear complementarity problems (HLCPs). The algorithm uses only full-Newton steps which has the advantage that no line searchs are needed. Moreover, we obtain the currently best known iteration bound for the algorithm with small-update method, namely, , which is as good as the linear analogue.
One of the important factor in the design of automated guided vehicle systems (AGVS) is the flow path design. This paper presents a branch-and-bound algorithm to determining the flow path by considering not only loaded-vehicles, but also empty-vehicles. The objective is to find the flow path, which will minimize total travel of loaded vehicles. We know that in branch-and-bound method a branch c...
In this paper, the system reliability in the design stage and before production is improved. The proposed algorithm is based on the fact that the chosen structure should be practical in reality. First, possible structures for the system of interest are designed then the optimum structure is chosen for production. The proposed approach to select the optimal alternative is to determine the effe...
A shortest path problem is a practical issue in networks for real-world situations. This paper addresses the fuzzy shortest path (FSP) problem to obtain the best fuzzy path among fuzzy paths sets. For this purpose, a new efficient algorithm is introduced based on a new definition of ideal fuzzy sets (IFSs) in order to determine the fuzzy shortest path. Moreover, this algorithm is developed for ...
نمودار تعداد نتایج جستجو در هر سال
با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید