logit models are one of the most important discrete choice models and they play an important role in describing decision makers’ choices among alternatives. in this paper the multi-nominal logit models has been used in mode choice modeling of isfahan. despite the availability of different mathematical computer programs there are not so many programs available for estimating discrete choice mode...

in this paper, a single machine sequencing problem is considered in order to find the sequence of jobs minimizing the sum of the maximum earliness and tardiness with idle times (n/1/i/etmax). due to the time complexity function, this sequencing problem belongs to a class of np-hard ones. thus, a special design of a simulated annealing (sa) method is applied to solve such a hard problem. to comp...

The problem of multiprocessor scheduling can be stated as scheduling a general task graph on a multiprocessor system such that a set of performance criteria will be optimized. This study investigates the use of near optimal scheduling strategies in multiprocessor scheduling problem. The multiprocessor scheduling problem is modeled and simulated using five different simulated annealing algorithm...

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]は,炉内の固体の熱的平衡状態をシミュ レ...