Modeling of fermentation processes is so complicated and uncertain; therefore it is necessary to provide a robust and appropriate dynamic optimization method. In order to obtain the maximum amount of yeast (Saccharomyces cerevisiae), the bioreactor must be operated under optimal conditions. To determine substrate feeding in a fed-batch bioreactor, a simulated annealing (SA) approach was examine...

Projects scheduling by the project portfolio selection, something that has its own complexity and its flexibility, can create different composition of the project portfolio. An integer programming model is formulated for the project portfolio selection and scheduling.Two heuristic algorithms, genetic algorithm (GA) and simulated annealing (SA), are presented to solve the problem. Results of cal...

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