نتایج جستجو برای: two stage decomposing heuristic
تعداد نتایج: 2736362 فیلتر نتایج به سال:
We examine several formulations of fuzzy rule selection for the design of fuzzy rulebased classification systems in our twostage approach. The first stage is heuristic rule extraction where a large number of candidate rules are extracted. The second stage is evolutionary rule selection where fuzzy rule-based systems are constructed by choosing a small number of candidate rules. Rule selection i...
This two-part paper presents modelling and scheduling approaches of flexible manufacturing systems using Petri nets (PNs) and artificial intelligence (AI)-based heuristic search methods. In Part I, PN-based modelling approaches and basic AI-based heuristic search algorithms were presented. In Part II, a new heuristic function that exploits PN information is proposed. Heuristic information obtai...
data envelopment analysis (dea) is a powerful tool for measuring relative efficiency of organizational units referred to as decision making units (dmus). in most cases dmus have network structures with internal linking activities. traditional dea models, however, consider dmus as black boxes with no regard to their linking activities and therefore do not provide decision makers with the reasons...
We consider a special type of dimensionality reduction classification problem where the decision-making objective is to minimize misclassification cost and attributes (MMCA). We propose a two-stage solution approach for solving the MMCA problem. Using simulated data sets and different misclassification cost matrices, we test our two-stage exhaustive and simulated annealing procedures. Our resul...
Consider a continuous-review, serial inventory system with N stages. Material flows from stage N to stage N − 1, N − 1 to N − 2, etc., until stage 1, where stationary compound Poisson demand occurs. Let and denote the demand rate and the mean of demand size, and D t denote the demand over a time interval t. There is a constant lead time Lj for stage j . Define L̃i = ∑i j=1Lj . Inventory is contr...
0
This article addresses a challenging industrial problem known as the unrelated parallel machine scheduling (UPMSP) with sequence-dependent setup times. In UPMSP, we have set of machines and group jobs. The goal is to find optimal way schedule jobs for execution by one several available machines. UPMSP has been classified an NP-hard optimisation and, thus, cannot be solved exact methods. Meta-he...
the determination of the ultimate pit limit (upl) is the first step in the open pit mine planning process. in this stage that parts of the mineral deposit that are economic to mine are determined. there are several mathematical, heuristic and meta-heuristic algorithms to determine upl. the optimization criterion in these algorithms is maximization of the total profit whilst satisfying the...
This paper investigates a different foundation for decision theory in which successive model refinement is central. The idea is to modify utility so that it can sometimes be calculated for an outcome without considering all the relevant properties that can be proved of the outcome, and without considering the utilities of its children. We build partially ordered heuristic utility functions. We ...
نمودار تعداد نتایج جستجو در هر سال
با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید