Combinatorial optimization problems arise in different fields of science and engineering. There exist some general techniques coping with these problems such as simulated annealing (SA). In spite of SA success, it usually requires costly experimental studies in fine tuning the most suitable annealing schedule. In this Letter, the classical integrated circuit placement problem is faced by Thermo...

In this paper a parallel algorithm for simulated annealing (S.A.) in the continuous case, the Multiple Trials and Adaptive Supplementary Search, MTASS algorithm, is presented. It is based on a combination of multiple trials, local improved searchs and an adaptive cooling schedule. The results in optimizing some standard test problems are compared with a sequential S.A. algorithms and another pa...

An eecient recursive task allocation scheme, based on the Kernighan-Lin mincut bi-section heuristic, is proposed for the eeective mapping of tasks of a parallel program onto a hypercube parallel computer. It is evaluated by comparison with an adaptive, scaled simulated annealing method. The recursive allocation scheme is shown to be eeective on a number of large test task graphs { its solution ...

Simulated annealing is a powerful stochastic search method, but it still has the disadvantage of blind search. Tabu search (TS) which can prevent cycling and enhance diversi/cation, is an adaptive strategy based on tabu list. By reasonably combining simulated annealing with TS, an e#ective hybrid algorithm for the problem of packing circles into a larger containing circle is presented. Based on...

An eecient recursive task allocation scheme, based on the Kernighan-Lin mincut bi-section heuristic, is proposed for the eeective mapping of tasks of a parallel program onto a hypercube parallel computer. It is evaluated by comparison with an adaptive, scaled simulated annealing method. The recursive allocation scheme is shown to be eeective on a number of large test task graphs { its solution ...

Many heuristics, such as simulated annealing, genetic algorithms, greedy randomized adaptive search procedures are stochastic. In this paper, we propose a deterministic heuristic algorithm, which is applied to the quadratic assignment problem. We refer this algorithm to as intensive search algorithm (or briefly intensive search). We tested our algorithm on the various instances from the library...

Civil aviation transportation equipment is more convenient and faster than other tools an essential part of intelligent transportation. It significant to study the reliability positioning information enhance traffic safety. Advanced receiver autonomous integrity monitoring (ARAIM) can provide vertical guidance during different navigation stages in civil fields. The traditional multiple hypothes...

A simulated annealing procedure with acceptance-probability control instead of the usual temperature control is proposed. The algorithm presented here has proved to be fully insensitive to initial parameters values, free of local-minima trapping problems, and shows superior convergence compared to adaptive-step classical simulated annealing with exponential cooling schedule. Experiments on comp...