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

target coverage is one of the important problems in visual sensor networks. the coverage should be accompanied with an efficient use of energy in order to increase the network lifetime. in this paper, we address the maximum lifetime for visual sensor networks (mlv) problem by maximizing the network lifetime while covering all the targets. for this purpose, we develop a simulated annealing (sa) ...

covering arrays of strength two have been widely studied as combinatorial models of software interaction test suites for pairwise testing. while numerous algorithmic techniques have been developed for the generation of covering arrays with few columns (factors), the construction of covering arrays with many factors and few tests by these techniques is problematic. random generation techniques c...