نتایج جستجو برای: simulated annealing sa
تعداد نتایج: 172508 فیلتر نتایج به سال:
This paper proposes a multi-objective memetic algorithm based on NSGA-II and Simulated Annealing (SA), NSGA-II-SA, for calibration of microscopic vehicular traffic flow simulation models. The NSGA-II algorithm performs a scan in the search space and obtains the Pareto front which is optimized locally with SA. The best solution of the obtained front is selected. Two CORSIM models were calibrated...
Many significant engineering and scientific problems involve optimization of some criteria over a combinatorial configuration space. The two methods most often used to solve these problems effectively—simulated annealing (SA) and genetic algorithms (GA)—do not easily lend themselves to massive parallel implementations. Simulated annealing is a naturally serial algorithm, while GA involves a sel...
In this paper we discuss the solution of the clustering problem usually solved by the K-means algorithm. The problem is known to have local minimum solutions.A simulated annealing algorithm for the clustering problem. The solution of the clustering problem usually solved by the K-means algorithm.In this paper, we explore the applicability of simulated annealing. Clustering problem is investigat...
Morpion Solitaire is a popular paper-and-pencil game. We investigate random sampling and simulated annealing algorithms for disjoint and touching models of the game. Our experiments show that simulated annealing (SA) works quite well and fast. We used it to find the best known results for non-trivial cases of the disjoint model.
In most real world application and problems, a homogeneous product is carried from an origin to a destination by using different transportation modes (e.g., road, air, rail and water). This paper investigates a fixed charge transportation problem (FCTP), in which there are different routes with different capacities between suppliers and customers. To solve such a NP-hard problem, four meta-heur...
This paper attempts to overcome the local convergence problem of the Expectation Maximization (EM) based training of the Hidden Markov Model (HMM) in speech recognition. We propose a hybrid algorithm, Simulated Annealing Stochastic version of EM (SASEM), combining Simulated Annealing with EM that reformulates the HMM estimation process using a stochastic step between the EM steps and the SA. Th...
In this paper, an improved floorplanning algorithm, named the floorplanning algorithm based on particle swarm optimization algorithm nesting simulated annealing to optimize the floorplans (PSO-SA-NoC), has been proposed with simulations conducted to verify this algorithm. The simulation results are compared with the original Simulated Annealing-NoC. The results show that the CPU’s process time ...
Combinatorial optimization problems arise in many scientific and practical applications. Therefore many researchers try to find or improve different methods to solve these problems with high quality results and in less time. Genetic Algorithm (GA) and Simulated Annealing (SA) have been used to solve optimization problems. Both GA and SA search a solution space throughout a sequence of iterative...
Combinatorial optimization problems arise in many scientific and practical applications. Therefore many researchers try to find or improve different methods to solve these problems with high quality results and in less time. Genetic Algorithm (GA) and Simulated Annealing (SA) have been used to solve optimization problems. Both GA and SA search a solution space throughout a sequence of iterative...
با پیشرفت فناوری مجتمع سازی، روز به روز روش های نوینی برای طراحی اتوماتیک vlsi در بخش های مختلف طراحی فیزیکی مدار و تحلیل آن پیش از ساخت (fabrication)، در حال ارائه هستند که در بخش آرایش (layout) به طور کلی شامل مراحل طراحی و تحلیل طراحی سطح (floorplanning)، جادهی (placement) و مسیر بندی (routing) می باشند. هر مرحله در فرآیند طراحی همبستگی زیادی با مراحل قبل دارد، لذا در هر مرحله آزمایش های دا...
نمودار تعداد نتایج جستجو در هر سال
با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید