نتایج جستجو برای: discrete optimization

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

Journal: :journal of industrial engineering, international 2006
e jahangiri f ghassemi-tari

nonlinear knapsack problems (nkp) are the alternative formulation for the multiple-choice knapsack problems. a powerful approach for solving nkp is dynamic programming which may obtain the global op-timal solution even in the case of discrete solution space for these problems. despite the power of this solu-tion approach, it computationally performs very slowly when the solution space of the pr...

A. Afshar, F. Sharifi , M.R. Jalali, S. Madadgar ,

Ant colony optimization algorithms (ACOs) have been basically introduced to discrete variable problems and applied to different research domains in several engineering fields. Meanwhile, abundant studies have been already involved to adapt different ant models to continuous search spaces. Assessments indicate competitive performance of ACOs on discrete or continuous domains. Therefore, as poten...

Journal: :journal of quality engineering and production optimization 2015
farnaz barzinpour mohammad mohammadpour omran seyed farzad hoseini kaveh fahimi farshid samaei

the dynamic facility layout problem (dflp) is the problem of finding positions of departments onthe plant floor for multiple periods (material flows between departments change during the planning horizon)such that departments do not overlap, and the sum of the material handling and rearrangement costs isminimized. in this paper a new optimization algorithm inspired from colonizing weeds, invasi...

Journal: :international journal of civil engineering 0
a. kaveh iust b. mirzaei iust a. jafarvand iust

in this paper, the problem of simultaneous shape and size optimization of single-layer barrel vault frames which contains both of discrete and continuous variables is addressed. in this method, the improved magnetic charged system search (imcss) is utilized as the optimization algorithm and the open application programming interface (oapi) plays the role of interfacing analysis software with th...

In this paper a league championship algorithm (LCA) is developed for structural optimization where the optimization variables are of discrete type and the set of the values possibly obtained by each variable is also given. LCA is a relatively new metaheuristic algorithm inspired from sport championship process. In LCA, each individual can choose to approach to or retreat from other individuals ...

Journal: :international journal of civil engineering 0
mohsen shahrouzi engineering department, kharazmi university, hesarak, karaj, iran amir abbas rahemi department of engineering, kharazmi university, tehran, iran

well-known seismic design codes have offered an alternative equivalent static procedure for practical purposes instead of verifying design trials with complicated step-y-step dynamic analyses. such a pattern of base-shear distribution over the building height will enforce its special stiffness and strength distribution which is not necessarily best suited for seismic design. the present study, ...

A. Afshar, S. Madadgar,

Most real world engineering design problems, such as cross-country water mains, include combinations of continuous, discrete, and binary value decision variables. Very often, the binary decision variables associate with the presence and/or absence of some nominated alternatives or project’s components. This study extends an existing continuous Ant Colony Optimization (ACO) algorithm to simultan...

R. Sojoudizadeh, S. Gholizadeh,

This paper proposes a modified sine cosine algorithm (MSCA) for discrete sizing optimization of truss structures. The original sine cosine algorithm (SCA) is a population-based metaheuristic that fluctuates the search agents about the best solution based on sine and cosine functions. The efficiency of the original SCA in solving standard optimization problems of well-known mathematical function...

ژورنال: پژوهش های ریاضی 2015
Hosseni , S.M, Keshvari , A.R.,

A new technique to find the optimization parameter in TSVD regularization method is based on a curve which is drawn against the residual norm [5]. Since the TSVD regularization is a method with discrete regularization parameter, then the above-mentioned curve is also discrete. In this paper we present a mathematical analysis of this curve, showing that the curve has L-shaped path very similar t...

Journal: :international journal of mathematical modelling and computations 0
p. vijaya laxmi department of applied mathematics, andhra university, visakhapatnam 530003, india. k. jyothsna department of applied mathematics, andhra university, visakhapatnam 530003, india.

this paper investigates a discrete-time impatient customer queue with bernoulli-schedule vacation interruption. the  vacation times and the service times during regular busy period and during working vacation period are assumed to follow geometric distribution. we obtain the steady-state probabilities at arbitrary and outside observer's observation epochs using recursive technique. cost an...

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

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