Inspired by quantum annealing, digital annealing computers specified for computations have been realized on a large scale, such as the Digital Annealer (DA) developed Fujitsu and CMOS Annealing Machine Hitachi. With progress achieved using these computers, it has become necessary to estimate computational hardness of cryptographic problems. This paper focuses lattice problems, closest vector pr...

Simulated Annealing is a family of randomized algorithms used to solve many combinatorial optimization problems. In practice they have been applied to solve some presumably hard (e.g., NP-complete) problems. The level of performance obtained has been promising [5, 2, 6, 14]. The success of this heuristic technique has motivated analysis of this algorithm from a theoretical point of view. In par...

Thermo-electric Coolers nowadays are applied in a wide range of thermal energy systems. Over the past decades, many researches were employed to improve the efficiency of TECs by enhancing the material parameters and design parameters. The material parameters are the most significant, but they are restricted by currently available materials and module fabricating technologies. Therefore, the mai...

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...

scheduling for job shop is very important in both fields of production management and combinatorial op-timization. however, it is quite difficult to achieve an optimal solution to this problem with traditional opti-mization approaches owing to the high computational complexity. the combination of several optimization criteria induces additional complexity and new problems. in this paper, we pro...

in some industries as foundries, it is not technically feasible to interrupt a processor between jobs. this restriction gives rise to a scheduling problem called no-idle scheduling. this paper deals with scheduling of no-idle open shops to minimize maximum completion time of jobs, called makespan. the problem is first mathematically formulated by three different mixed integer linear programming...