نتایج جستجو برای: الگوریتم simulated annealing sa
تعداد نتایج: 194674 فیلتر نتایج به سال:
Most nodes of modern massively-parallel computing systems contain processors that use instruction-level parallelism to increase the speed of the individual processor. In order to achieve the greatest speedup possible, the compiler must perform instruction scheduling so that instructions are presented to the processor in the order that is most efficient. Instruction scheduling is a compiler prob...
This paper has been worked on a RAP with multi-state components and the performance rate of each component working state may increase by spending technical and organizational activities costs. Whereas RAP belongs to Np-Hard problems, we used Genetic algorithm (GA) and simulated annealing (SA) and for solving the presented problem and calculating system reliability universal generating function ...
Job Shop Scheduling Problem (JSSP) is an optimization problem in which ideal jobs are assigned to resources at particular times. In recent years many attempts have been made at the solution of JSSP using a various range of tools and techniques such as Branch and Bound and Heuristics algorithms. This paper proposed a new algorithm based on Genetic Algorithm (GA), Tabu Search (TS) and Simulated A...
The Vehicle Routing Problem (VRP) is an important management problem in the field of physical distribution and logistics. Good vehicle routing can not only increase the profit of logistics but also make logistics management more scientific. The Capacitated Vehicle Routing Problem (CVRP) constrained by the capacity of a vehicle is the extension of VRP. Our research applies a two-phase algorithm ...
In this paper we examine the use of compound Gauss Markov random fields (CGMRF) to restore severely blurred high range images. For this deblurring problem, the convergence of the Simulated Annealing (SA) and Iterative Conditional Mode (ICM) algorithms has not been established. We propose two new iterative restoration algorithms which extend the classical SA and ICM approaches. Their convergence...
In the last decade, many heuristic methods have evolved for solving optimization problems that were previously difficult or impossible to solve. These methods include simulated annealing (SA), tabu search (TS), genetic algorithm (GA), differential evolution (DE), evolutionary programming (EP), evolutionary strategy (ES), ant colony optimization (ACO), and particle swarm optimization (PSO). This...
fuzzy cognitive maps (fcms) have successfully been applied in numerous domains to show the relations between essential components in complex systems. in this paper, a novel learning method is proposed to construct fcms based on historical data and by using meta-heuristic: genetic algorithm (ga), simulated annealing (sa), and tabu search (ts). implementation of the proposed method has demonstrat...
abstract: in this paper, an exergy analysis approach is proposed for optimal design of distillation column by using simulated annealing algorithm. first, the simulation of a distillation column was performed by using the shortcut results and irreversibility in each tray was obtained. the area beneath the exergy loss profile was used as irreversibility index in the whole column. then, first opti...
The binary computer-generated hologram (BCGH) has attracted much attention recently because it can address the high-speed spatial light modulator (SLM), such as a digital micromirror device (DMD) SLM. In this paper, our concern is development of an algorithm to produce high-quality BCGHs. particular, simulated annealing (SA) efficient used phase-only hologram. study SA for production BCGH, we f...
Earth dam is a structure as homogeneous or non-homogeneous forms for raising water level or water supply. Earth dam consist of different parts that one of the main parts is clay core. Choosing an optimal non permeable core which causes reduction of seepage through dam body and also being stable is necessary. The objective of this research is to optimize the geometry of earth dam clay core such ...
نمودار تعداد نتایج جستجو در هر سال
با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید