We study errors of quantum annealing and simulated annealing to highlight better performance of quantum annealing over simulated annealing. Quantum annealing and simulated annealing perform optimization through a quantum adiabatic evolution and a quasi-static evolution respectively. In both methods, dynamics across a phase transition plays a crucial role. The Kibble-Zurek mechanism is known as ...

the markowitz issue of optimization can’t be solved by precise mathematical methods such as second order schematization, when real world condition and limitations are considered. on the other hand, most managers prefer to manage a small portfolio of available assets in place of a huge portfolio. it can be analogized to cardinal constrains, that is, constrains related to minimum and maximum curr...

Capabilities of enhanced simulated-annealing-based algorithms in solving process planning problems in reconfigurable manufacturing are investigated. The algorithms are enhanced by combining variants of the simulated annealing technique with other algorithm concepts such as (i) knowledge exploitation and (ii) parallelism. Four configurations of simulated annealing algorithms are devised and enga...

As multiobjective optimization problems have many solutions, evolutionary algorithms have been widely used for complex multiobjective problems instead of simulated annealing. However, simulated annealing also has favorable characteristics in the multimodal search. We developed several simulated annealing schemes for the multiobjective optimization based on this fact. Simulated annealing and evo...

The paper presents Greedy Randomized Adaptive Search Procedure with Path Relinking (GRASP with PR) for the Critical Node Detection Problem (CNDP). An evolutionary Path Relinking mechanism is added to GRASP with PR to intensify. Our computational experiments show that this algorithm is a competitive method compared with the previously proposed methods for solving CNDP such as Variable Neighborho...

42 Use of Simulated Annealing for Adaptive Control System Tran Trong Dao, Department of Science-Technology, Cooperation and Postgraduate Studies, Ton Duc Thang University, Ho Chi Minh City, Vietnam Ivan Zelinka, Department of Computer Science, Technical University of Ostrava (VSB-TU), Ostrava, Czech Republic Vo Hoang Duy, Department of Control Engineering, Ton Duc Thang University, Ho Chi Minh ...

The Fuzzy Adaptive Neighborhood Search (FANS) method was previously presented and succesfully compared against a genetic algorithm and simulated annealing doing minimization of functions in Rn. Here we propose to evaluate FANS on instances of knapsack with multiple restrictions problems, making comparison against the cited algorithms in order to gain knowledge about the behaviour of our method.

abstract the muskingum method is frequently used to route floods in hydrology. however, application of the model is still difficult because of the parameter estimation’s. recently, some of heuristic methods have been used in order to estimate the nonlinear muskingum model. this paper presents a efficient heuristic algorithm, simulated annealing, which has been used to estimate the three paramet...

in this paper, a mixed-integer linearized programming (minlp) model is presented to design a group layout (gl) of a cellular manufacturing system (cms) in a dynamic environment with considering production planning (pp) decisions. this model incorporates with an extensive coverage of important manufacturing features used in the design of cmss. there are also some features that make the presented...