The path integral Monte Carlo simulated quantum annealing algorithm is applied to the optimization of a large hard instance of the random satisfiability problem (N = 10,000). The dynamical behavior of the quantum and the classical annealing are compared, showing important qualitative differences in the way of exploring the complex energy landscape of the combinatorial optimization problem. At v...

Two applications of simulated annealing are shown to optimise discretisation. First, a random but highly uniform pattern is generated using simulated annealing, whereby the average distance between the samples is maximised. In the other example, simulated annealing increases the time resolution of the discrete wind signal using an interpolation procedure that produces subscale speeds with consi...

Effects of post-sintering annealing treatment between 300 and 1000ºC for up to 8 hrs time periods followed by either furnace cooling (FC) or air-cooling (AC) on the hard magnetic properties of some Nd-Fe-B based sintered magnets was investigated. It was shown that the intrinsic coercivity (Hci), second quadrant demagnetization loop shape and thus the energy density (BH)max varied considerably a...

A fuzzy based method has been proposed for identification of probable capacitor nodes of radial distribution system. Simulated annealing technique has been used for final selection of the capacitor sizes. New fuzzy membership functions have been formulated where the active power membership is an exponential function of the nodal per unit active power and branch active power loss, the reactive m...

To improve the precision of three-dimensional hand tracking based on the particle filtering, a novel algorithm using Multi-Model fusion to improve the state prediction of particle filtering is put forward. Through analyzing the experimental data of the virtual interactive platform system, combining with the behavior understanding and description of hand, we firstly construct a model for human h...

This paper addresses the Vehicle Routing Problem with Delivery Time Cost. This problem aims to find a set of routes of minimal total costs including the travelling cost and delivery time cost, starting and ending at the depot, in such a way that each customer is visited by one vehicle given the capacity of the vehicle to satisfy a specific demand. In this research, a hybrid metaheuristic approa...

Simulated Annealing is a family of randomized algorithms for solving multivariate global optimization problems. Empirical results from the application of Simulated Annealing algorithms to certain hard problems including certain types of NPcomplete problems demonstrate that these algorithms yield better results than known heuristic algorithms. But for the worst case input, the time bound can be ...

For many optimization algorithms the time to solution depends not only on the problem size but also on the specific problem instance and may vary by many orders of magnitude. It is then necessary to investigate the full distribution and especially its tail. Here, we analyze the distributions of annealing times for simulated annealing and simulated quantum annealing (by path integral quantum Mon...

We study the performance of quantum annealing for systems with ground-state degeneracy by directly solving the Schrödinger equation for small systems and quantum Monte Carlo simulations for larger systems. The results indicate that naive quantum annealing using a transverse field may not be well suited to identify all degenerate ground-state configurations, although the value of the ground-stat...

Simulated Annealing, a wide-spread technique for combinatorial optimisation, is employed to find the optimal candidate in a candidate set, as defined in Optimality Theory (OT). Being a heuristic techniques, simulated annealing does not guarantee to return the correct solution, and yet, some result is always returned within a constant time. Similarly to language production, this time framework c...