نتایج جستجو برای: heuristic algorithms

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

A.R. Mojahedfar J. Gholamnejad

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

Journal: :journal of optimization in industrial engineering 2015
parviz fattahi bahman esmailnezhad amir saman kheirkhah

this paper presents a new nonlinear mathematical model to solve a cell formation problem which assumes that processing time and inter-arrival time of parts are random variables. in this research, cells are defined as a queue system which will be optimized via queuing theory. in this queue system, each machine is assumed as a server and each part as a customer. the grouping of machines and parts...

R. Kamyab Moghadas, S. Gholizadeh,

In this study an efficient meta-heuristic is proposed for layout optimization of truss structures by combining cellular automata (CA) and firefly algorithm (FA). In the proposed meta-heuristic, called here as cellular automata firefly algorithm (CAFA), a new equation is presented for position updating of fireflies based on the concept of CA. Two benchmark examples of truss structures are presen...

Journal: :آب و خاک 0
مهدی محمدی قلعه نی امید بزرگ حداد کیومرث ابراهیمی

abstract the muskingum method is frequently used to route floods in hydrology. however, application of the model is still difficult because of the parameter estimation’s. recently, some of heuristic methods have been used in order to estimate the nonlinear muskingum model. this paper presents a efficient heuristic algorithm, simulated annealing, which has been used to estimate the three paramet...

Journal: :مهندسی صنایع 0
قاسم مصلحی مهندسی صنایع مهدی مهنام مهندسی صنایع

this paper addresses the problem of minimizing the sum of maximum earliness and tardiness on identical parallel machines scheduling problem. each job has a processing time and a due date. since this problem is trying to minimize and diminish the values of earliness and tardiness, the results can be useful for just–in-time production systems. it is shown that the problem is np-hard. using effici...

Journal: :IOP Conference Series: Materials Science and Engineering 2018

Journal: :Bulletin of the Polish Academy of Sciences Technical Sciences 2015

Journal: :Proceedings of the Institution of Civil Engineers - Water Management 2014

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

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