نتایج جستجو برای: heuristic 1 and heuristic 2 are 9821

تعداد نتایج: 17652012  

Journal: :international journal of industrial engineering and productional research- 0
yahia zare mehrjerdi department of industrial engineering, yazd university, yazd, iran,

an interactive heuristic approach can offer a practical solution to the problem of linear integer programming (lip) by combining an optimization technique with the decision maker’s (dm) judgment and technical supervision. this is made possible using the concept of bicriterion linear programming (blp) problem in an integer environment. this model proposes two bicriterion linear programs for iden...

Journal: :آب و توسعه پایدار 0
سید مصطفی طباطبایی حسین خزیمه نژاد ابوالفضل اکبرپور

according to the current state of water resources and the increasing demand for water, the supply of future needs will be faced with serious constraints. on the one hand, the failure to supply sometimes causes social and political problems. on the other hand, improper exploitation of water resources will lead to irreparable damages. therefore, the use of optimization models for the planning of ...

Journal: :civil engineering infrastructures journal 0
hessamoddin meshkat razavi ph.d. candidate, department of civil engineering, faculty of engineering, ferdowsi university of mashhad, mashhad, iran hashem shariatmadar associated professor, department of civil engineering, faculty of engineering, ferdowsi university of mashhad, mashhad, iran

this study is investigated the optimum parameters for a tuned mass damper (tmd) under the seismic excitation. shuffled complex evolution (sce) is a meta-heuristic optimization method which is used to find the optimum damping and tuning frequency ratio for a tmd. the efficiency of the tmd is evaluated by decreasing the structural displacement dynamic magnification factor (ddmf) and acceleration ...

Set covering problem has many applications such as emergency systems, retailers’ facilities, hospitals, radar devices, and military logistics, and it is considered as Np-Hard problems. The goal of set covering problem is to find a subset such that :::::::::union::::::::: of the subset members covered the whole set. In this paper, we present a new heuristic algorithm to solve the set covering pr...

2005
Lael J. Schooler Ralph Hertwig Lael Schooler

A few theorists, ranging from William James to contemporary psychologists, have argued that forgetting should not be seen as a nuisance but as key for the proper working of human memory. In this paper, we propose the thesis that forgetting may in addition prove beneficial for inference heuristics that exploit mnemonic information such as recognition and retrieval fluency. To explore the mechani...

Journal: :Journal of the Operational Research Society 2011

Journal: :the modares journal of electrical engineering 2009
keivan navaie

it is shown in [1] that the optimal downlink radio resource allocation for non-realtime traffic in cellular cdma/tdma networks can be mapped to a multi-dimensional multiple-choice knapsack problem (mmkp) which is np-hard. in this correspondence we propose a heuristic algorithm with polynomial time complexity for this problem. numerical results indicate significant computational performance impr...

ژورنال: اندیشه آماری 2018

‎There are two main approches to the fuzzy regression (more precisely‎: ‎regression in fuzzy environment)‎: ‎the least of sum of distances (including two methods of least squared errors and least absolute errors) and the possibilistic method (the method of least whole vaguness under some restrictions)‎. ‎Beside‎, ‎some heuristic methods have been proposed to deal with fuzzy regression‎. ‎Some o...

G. Moslehi and M. Mahnam,

While a great portion of the scheduling literature focuses on time-based criteria, the most important goal of management is maximizing the profitability of the firm. In this paper, the net preset value criterion is studied taking account of linear time-dependent cash flows in single machine and flow shop scheduling problems. First, a heuristic method is presented for the single machine scheduli...

Journal: :journal of mining and environment 2011
j. gholamnejad a.r. mojahedfar

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...

نمودار تعداد نتایج جستجو در هر سال

با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید