Papers by Keyword: Simulated Annealing (SA)

Paper TitlePage

Authors: Song Chai, Yu Bai Li, Chang Wu, Jian Wang
Abstract: Real-time task schedule problem in Chip-Multiprocessor (CMP) receives wide attention in recent years. It is partly because the increasing demand for CMP solutions call for better schedule algorithm to exploit the full potential of hardware, and partly because of the complexity of schedule problem, which itself is an NP-hard problem. To address this task schedule problem, various of heuristics have been studied, among which, Genetic Algorithm (GA), Particle Swarm Optimization (PSO) and Simulated Annealing (SA) are the most popular ones. In this paper, we implement these 3 schedule heuristics, and compare their performance under the context of real-time tasks scheduling on CMP. According to the results of our intensive simulations, PSO has the best fitness optimization of these 3 algorithms, and SA is the most efficient algorithm.
Authors: A. Norozi, Mohd Khairol Anuar Ariffin, N. Ismail, F. Mustapha
Abstract: As globalization has increased in the past few years, many companies attempts to made appropriate strategic decision to meet with this challenge. The problem under study mainly focuses on minimizing overall make-span but additional objectives such as balancing the assembly line and minimizing the variation of completion time are also considered. Due to the complexity of problem solving procedure by mathematical techniques, this paper presents a new approach of hybrid GA-SA implementation in order to meet the problem objectives. A proposed hybrid GA-SA is executed to overcome the problem complexity and meet the problem objectives. In order to check the efficiency of hybrid search techniques, a comparison is done between the results obtained by hybrid GA-SA and simple GA and the results comparison validates the effectiveness of presented hybrid search techniques.
Authors: Hamed Piroozfard, Adnan Hassan, Ali Mokhtari Moghadam, Ali Derakhshan Asl
Abstract: Job shop scheduling problems are immensely complicated problems in machine scheduling area, and they are classified as NP-hard problems. Finding optimal solutions for job shop scheduling problems with exact methods incur high cost, therefore, looking for approximate solutions with meta-heuristics are favored instead. In this paper, a hybrid framework which is based on a combination of genetic algorithm and simulated annealing is proposed in order to minimize maximum completion time i.e. makespan. In the proposed algorithm, precedence preserving order-based crossover is applied which is able to generate feasible offspring. Two types of mutation operators namely swapping and insertion mutation are used in order to maintain diversity of population and to perform intensive search. Furthermore, a new approach is applied for arranging operations on machines, which improved solution quality and decreased computational time. The proposed hybrid genetic algorithm is tested with a set of benchmarking problems, and simulation results revealed efficiency of the proposed hybrid genetic algorithm compared to conventional genetic based algorithm.
Authors: Yao Yuan Zeng, Wen Tao Zhao, Zheng Hua Wang
Abstract: Hypergraph partitioning is an increasingly important and widely studied research topic in parallel scientific computing. In this paper, we present a multiway hypergraph partitioning algorithm, mixed simulated annealing algorithm for global optimization and tabu search algorithm for local optimization. Experiments on the benchmark suite of several unstructured meshes show that, for 2-, 4-, 8-, 16-and 32-way partitioning, the quality of partition produced by our algorithm are on the average 6% and the maximum 17% better than those produced by partitioning software hMETIS in term of the cutsize metric.
Authors: Xia Ji, Alexander H. Shih, Manik Rajora, Ya Min Shao, Steven Y. Liang
Abstract: Surface integrity, such as surface roughness and residual stress, is an aspect of surface quality on machined parts. Residual stress in the machined surface and subsurface is affected by materials, machining conditions, and tool geometry. These residual stresses could affect the service qualify and component life significantly. Residual stress can be determined by empirical or numerical experiments for selected configurations, even if both are expensive procedures. This paper presents a hybrid neural network that is trained using Simulated Annealing (SA) and Levenberg-Marquardt Algorithm (LM) in order to predict the values of residual stresses in cutting and radial direction after the MQL face turning process accurately. To verify the performance of the proposed approach, the predicted results are compared with the results obtained by training an ANN using SA and LM separately. The results have shown that the hybrid neural network outperforms SA and LM in predicting machining induced surface integrity that is critical to determine the fatigue life of the components.
Authors: Hong Zhou, Ke Luo
Abstract: Be aimed at the problems that K-medoids algorithm is easy to fall into the local optimal value and basic particle swarm algorithm is easy to fall into the premature convergence, this paper joins the Simulated Annealing (SA) thought and proposes a novel K-medoids clustering algorithm based on Particle swarm optimization algorithm with simulated annealing. The new algorithm combines the quick optimization ability of particle swarm optimization algorithm and the probability of jumping property with SA, and maintains the characteristics that particle swarm algorithm is easy to realize, and improves the ability of the algorithm from local extreme value point. The experimental results show that the algorithm enhances the convergence speed and accuracy of the algorithm, and the clustering effect is better than the original k-medoids algorithm.
Authors: Cheng Chien Kuo, Hung Cheng Chen, Teng Fa Taso, Chin Ming Chiang
Abstract: s paper presents a hybrid algorithm, the “particle swarm optimization with simulated annealing behavior (SA-PSO)” algorithm, which combines the advantages of good solution quality in simulated annealing and fast calculation in particle swarm optimization. As stochastic optimization algorithms are sensitive to its parameters, this paper introduces criteria in selecting parameters to improve solution quality. To prove the usability and effectiveness of the proposed algorithm, simulations are performed using 20 different mathematical optimized functions of different dimensions. The results made from different algorithms are then compared between the quality of the solution, the efficiency of searching for the solution and the convergence characteristics. According to the simulation results, SA-PSO obtained higher efficiency, better quality and faster convergence speed than other compared algorithms.
Authors: Yao Yuan Zeng, Wen Tao Zhao, Zheng Hua Wang
Abstract: Multilevel hypergraph partitioning is a significant and extensively researched problem in combinatorial optimization. In this paper, we present a multilevel hypergraph partitioning algorithm based on simulated annealing approach for global optimization. Experiments on the benchmark suite of several unstructured meshes show that, for 2-, 4-, 8-, 16-and 32-way partitioning, although more running time was demanded, the quality of partition produced by our algorithm are on the average 14% and the maximum 22% better than those produced by partitioning software hMETIS in term of the SOED metric.
Authors: Yu Yu Zhou, Yun Qing Rao, Chao Yong Zhang, Guo Jun Zhang
Abstract: In this paper we address a rectangular packing problem (RPP), which is one of the most difficult NP-complete problems. First, greedy biggest space sequencing (GBSS) is presented as a new placement strategy, which is very essential to RPP. Then, borrowing from the respective advantages of the two algorithms, genetic algorithm (GA) and simulated annealing (SA), a hybrid optimization policy is developed. The hybrid GASA is subjected to a test using a set of benchmarks. Compared to other approaches from the literature the hybrid optimization strategy performs better.
Authors: Ruey Maw Chen, Frode Eika Sandnes
Abstract: The permutation flow shop problem (PFSP) is an NP-hard permutation sequencing scheduling problem, many meta-heuristics based schemes have been proposed for finding near optimal solutions. A simple insertion simulated annealing (SISA) scheme consisting of two phases is proposed for solving PFSP. First, to reduce the complexity, a simple insertion local search is conducted for constructing the solution. Second, to ensure continuous exploration in the search space, two non-decreasing temperature control mechanisms named Heating SA and Steady SA are introduced in a simulated annealing (SA) procedure. The Heating SA increases the exploration search ability and the Steady SA enhances the exploitation search ability. The most important feature of SISA is its simple implementation and low computation time complexity. Experimental results are compared with other state-of-the-art algorithms and reveal that SISA is able to efficiently yield good permutation schedule.
Showing 1 to 10 of 113 Paper Titles