in this paper, the researchers have investigated a concatenated robot move (crm) sequence problem and minimal part set (mps) schedule problem with different setup times for two-machine robotic cell. they have focused on simultaneous solving of crm sequence and mps schedule problems with different loading and unloading times. they have applied a simulated annealing (sa) algorithm to provide a go...

Method for geophysical parameter estimations with microwave radiometer data based on Simulated Annealing: SA is proposed. Geophysical parameters which are estimated with microwave radiometer data are closely related each other. Therefore simultaneous estimation makes constraints in accordance with the relations. On the other hand, SA requires huge computer resources for convergence. In order to...

In this paper, the researchers have investigated a Concatenated Robot Move (CRM) sequence problem and Minimal Part Set (MPS) schedule problem with different setup times for two-machine robotic cell. They have focused on simultaneous solving of CRM sequence and MPS schedule problems with different loading and unloading times. They have applied a Simulated Annealing (SA) algorithm to provide a go...

Simulated Annealing (SA) is a powerful stochastic search algorithm applicable to a wide range of problems. This paper presents some experiments of applying SA to an NP-hard problem, i.e., call routing in circuit-switched telecommunications networks. The call routing problem considered here can be described as assigning calls to paths in a network so that the number of calls blocked can be minim...

In Network-on-Chip (NoC) application design, coresearch, genetic algorithms and neural networks [1] are based to-node mapping is an important but intractable optimization on empirical techniques in nature. Simulated annealing (SA) problem. In the paper, we use simulated annealing to tackle the [7] is a generic probabilistic meta-algorithm for the global mapping problem in 2D mesh NoCs. In parti...

This paper addresses the dynamic vehicle routing problem. The proposed work includes the optimization in path selection using simulated annealing and hybrid memetic-genetic algorithm. In this paper, first we apply simulated annealing approach to the input of VRP.We use standard SA method that includes various types of move including insertion move, swap move,2-opt move,3-opt move to solve VRP.T...

Bacterial foraging optimization algorithm (BFOA) has been widely accepted as a global optimization algorithm of current interest for optimization and control. BFOA is inspired by the social foraging behavior of Escherichia coli. BFOA has already drawn the attention of researchers because of its efficiency in solving real-world optimization problems arising in several application domains. Simula...

The log-likelihood function of threshold vector error correction models is neither differentiable, nor smooth with respect to some parameters. Therefore, it is very difficult to implement maximum likelihood estimation (MLE) of the model. A new estimation method, which is based on a hybrid algorithm and MLE, is proposed to resolve this problem. The hybrid algorithm, referred to as genetic-simula...

The permutation flowshop scheduling problem with the objective of minimizing total flow time is known as a NP-hard problem, even for the two-machine cases. Because of the computational complexity of this problem, a multi-start simulated annealing (MSA) heuristic, which adopts a multi-start hill climbing strategy in the simulated annealing (SA) heuristic, is proposed to obtain close-to-optimal s...

An appropriate combination of multiple biometric sensors increases the reliability of verification through biometrics. In this paper we propose an effective method of fusion of biometrics based on a dynamic selection of threshold point of fingerprint and iris biometrics towards identifier of an optimal set of rules for fusion. The effectiveness of the method has been established using several b...