نتایج جستجو برای: but approximate solution could be found by heuristic algorithm
تعداد نتایج: 9392687 فیلتر نتایج به سال:
When a nurse at a hospital is unable to be in charge of any of his/her assigned shifts, the roster should be rescheduled to cope with it, which is called nurse rerostering problem. In this problem, we are supposed to find a new one which is close to the given as well as satisfies all the constraints that it inherits from nurse scheduling problem which built the roster. It was proved NP-complete...
the scheduling problems are the non-polynomial problems-hard (np-hard), is to solve it, and meta-heuristic innovative method compared with the exact method require less time and memory.in this research, developed imperialistic competitive algorithm used to solving the single-mode resource-constrained project scheduling problem.also the basic feasible solution algorithm used in order to increase...
This paper presents a set of linearized equations was derived for the motion, relative to an elliptical reference orbit, of an object influenced by J2 perturbation terms. Approximate solution for simulations was used to compare these equations and the linearized keplerian equations to the exact equations. The inclusion of the linearized perturbations in the derived equations increased the high ...
boron nitride semiconducting zigzag swcnt, $b_{cb}$$n_{cn}$$c_{1-cb-cn}$, as a potential candidate for making nanoelectronic devices was examined. in contrast to the previous dft calculations, wherein just one boron and nitrogen doping configuration have been considered, here for the average over all possible configurations, density of states (dos) was calculated in terms of boron and nitrogen ...
Dasgupta recently introduced a cost function for the hierarchical clustering of a set of points given pairwise similarities between them. He showed that this function is NP -hard to optimize, but a top-down recursive partitioning heuristic based on an αn-approximation algorithm for uniform sparsest cut gives an approximation of O(αn logn) (the current best algorithm has αn = O( √ log n)). We sh...
in this research we have studied the effect of some transition-metals (cu, ag and au) substitutions on two-electron reduction potential of flavins by application of dft method. all geometries have been optimized at blyp level of theory and “6-31+g** + lanl2dz” mixed basis set. the frequency job at the same method and basis sets has been performed to obtain gibbs free energy of compounds. it h...
Here, we investigate the classical p-median location problem on a network in which the vertex weights and the distances between vertices are uncertain. We propose a programming model for the uncertain p-median location problem with tail value at risk objective. Then, we show that it is NP-hard. Therefore, a novel hybrid modified binary particle swarm optimization algorithm is presented to obtai...
building on previous studies on intellectual features and learners’ grammar learning, the present study aimed at investigating whether intelligence criterion had any impact on efl learners’ english grammar learning across two intelligence levels. in the current study, the participants were divided into two experimental and control groups by administration of raven i.q. test. this led to the for...
In this paper, two-dimensional cutting stock problem with demand has been studied.In this problem, cutting of large rectangular sheets into specific small pieces should be carried out hence, the waste will be minimized. Solving this problem is important to decrease waste materials in any industry that requires cutting of sheets. In most previus studies, the demand of pieces has not been usually...
نمودار تعداد نتایج جستجو در هر سال
با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید