An algorithm is developed to statistically find the best global fit of a nonlinear non-convex cost-function over a D-dimensional space. It is argued that this algorithm permits an annealing schedule for ''temperature'' T decreasing exponentially in annealing-time k, T = T 0 exp(−ck 1/D). The introduction of re-annealing also permits adaptation to changing sensitivities in the multi-dimensional ...

1 Department of Physics, Government P.G. College, Ramnagar, Nainital (Uttarakhand), INDIA. 2 Department of Physics, R.H. Govt. Post Graduate College, Kashipur, U S Nagar (Uttarakhand), INDIA. ______________________________________________________________________________________ Abstract: Role of high temperature pre-annealing at 1000 0 C for shorter duration of 10 h and longer duration of 40 h,...

An algorithm is developed to statistically find the best global fit of a nonlinear non-convex cost-function over a D-dimensional space. It is argued that this algorithm permits an annealing schedule for ''temperature'' T decreasing exponentially in annealing-time k, T = T 0 exp(−ck 1/D). The introduction of re-annealing also permits adaptation to changing sensitivities in the multi-dimensional ...

The problem of hardware-software partitioning for systems that are being designed as multifunction systems is addressed. Simulated annealing is known to generate very good solutions for most optimization problems, however the running time of this algorithm can be very high. We apply a modified simulated annealing approach to the partitioning problem resulting in a smaller search space, yet yiel...

We explain why quantum adiabatic evolution and simulated annealing perform similarly in certain examples of searching for the minimum of a cost function of n bits. In these examples each bit is treated symmetrically so the cost function depends only on the Hamming weight of the n bits. We also give two examples, closely related to these, where the similarity breaks down in that the quantum adia...

The optimal cooling schedule for simulated annealing is formulated to derive a differential equation for the time-dependent temperature T(t). Based on this equation, the long-term behavior of T(t), entropy production, and the Kullback-Leibler entropy are studied. For some simple examples, such as a many-level system and the small scale traveling salesman problem, the explicit time dependence of...

A bi-objective mathematical model is developed to simultaneously consider the quay crane and yard truck scheduling problems at container terminals. Main real-world assumptions, such as quay cranes with non-crossing constraints, quay cranes’ safety margins and precedence constraints are considered in this model. This integrated approach leads to better efficiency and productivity at container te...

Genetic and simulated annealing algorithms have been used to solve many combinatorial problems. Their results are proven to be efficient in solving such problems. The running time of these techniques is generally less than the run time needed to find the optimal solution. However, in very large-scale problems such as sensor deployment, their running time is extremely slow. In this paper, we int...