This paper investigates scheduling job shop problems with sequence-dependent setup times under minimization of makespan. We develop an effective metaheuristic, simulated annealing with novel operators, to potentially solve the problem. Simulated annealing is a well-recognized algorithm and historically classified as a local-search-based metaheuristic. The performance of simulated annealing crit...

An important stage in circuit design is placement where components are assigned to physical locations on a chip A popular contemporary method for placement is the use of simulated annealing While this approach has been shown to produce good placement solutions recent work in genetic algorithms has produced promising results The purpose of this study is to determine which approach will result in...

This paper reports on the application of a simulated annealing algorithm to the minimum cost design of reinforced concrete retaining structures. Cantilever retaining walls are investigated, being representative of reinforced concrete retaining structures that are required to resist a combination of earth and hydrostatic loading. To solve such a constrained optimisation problem, a modified simul...

mutual information (mi) is a widely used similarity metric for multimodality image registration. however, it involves an extremely high computational time especially when it is applied to volume images. moreover, its robustness is affected by existence of local maxima. the multi-resolution pyramid approaches have been proposed to speed up the registration process and increase the accuracy of th...

After a brief description of the electoral setup, we (i) outline the use of a simulated annealing algorithm, designed to find a good design for sample surveys, which is based on the identification of representative electoral sections, (ii) describe the methods used to analyze the data obtained from sample surveys on politically relevant topics, (iii) outline the proceedings of election day —det...