Relations of simulated annealing and quantum annealing are studied by a mapping from the transition matrix of classical Markovian dynamics of the Ising model to a quantum Hamiltonian and vice versa. It is shown that these two operators, the transition matrix and the Hamiltonian, share the eigenvalue spectrum. Thus, if simulated annealing with slow temperature change does not encounter a difficu...

This paper considers the determination of optimal team lineups in Twenty20 cricket where a lineup consists of three components: team selection, batting order and bowling order. Via match simulation, we estimate the expected runs scored minus the expected runs allowed for a given lineup. The lineup is then optimized over a vast combinatorial space via simulated annealing. We observe that the com...

The analysis of interrupts is a structured quagmire. In this position paper, we demonstrate the investigation of simulated annealing. KaliNil, our new methodology for DNS, is the solution to all of these problems.

連続設計変数を持つ最適化問題に対しては, これまで非線形数理計画法による解法が主流で あった.設計空間が単峰で,しかも目的関数の 勾配が連続である場合にはこのアプロ-チは極 めて有効であるが,そうでない場合には遺伝的 アルゴリズム(GA),シミュレーテッドアニー リング(SA),あるいはタブーサーチ(TS)な ど,ヒューリスティックサーチ(heuristic search) [1]とよばれる方法が用いられることも多くなっ てきた.なかでも,GAとSAはこのような手法 の双璧であり,連続最適化問題に対しても多く の研究が行われてきた[2].一般的に,設計空間 内にサイズの大きい局所解領域が多く存在する 場合にはGAが有効であり,設計空間全域的には 単峰に近いが,サイズの小さい局所解領域が無 数に存在する場合にはSAが有効である[3]. SA[4]は,炉内の固体の熱的平衡状態をシミュ レ...

Floorplanning is a crucial phase in VLSI Physical Design. The subsequent placement and routing of the cells/modules are coupled very closely with the quality of the floorplan. A widely used technique for floorplanning is Simulated Annealing. It gives very good floorplanning results but has major limitation in terms of running time. For more than tens of modules Simulated Annealing is not practi...

Optimal expansion of medium-voltage power networks is a common issue in electrical distribution planning. Minimizing total cost of the objective function with technical constraints and reliability limits, make it a combinatorial problem which should be solved by optimization algorithms. This paper presents a new hybrid simulated annealing and tabu search algorithm for distribution network expan...

Two applications of simulated annealing are shown to optimise discretisation. First, a random but highly uniform pattern is generated using simulated annealing, whereby the average distance between the samples is maximised. In the other example, simulated annealing increases the time resolution of the discrete wind signal using an interpolation procedure that produces subscale speeds with consi...