نتایج جستجو برای: annealing algorithm

تعداد نتایج: 774367  

2006
Lichao Wang Jianliang Li Yun Zou

Considering the characteristics of Simulated Annealing Algorithm (SAA), based on the agents’ perception and retroaction to their surroundings, in this paper a new algorithm called Multi-agent Annealing Algorithm (MAA) is presented. And the global convergence of MAA is gotten. Finally, we make several numerical experiments to compare MAA with SAA and Genetic Algorithm (GA) by three classical tes...

1998
Rajeev K. Puri Joerg Aichelin

We here present the details of the numerical realization of the recently advanced algorithm developed to identify the fragmentation in heavy ion reactions. This new algorithm is based on the Simulated Annealing method and is dubbed as Simulated Annealing Clusterization Algorithm [SACA]. We discuss the different parameters used in the Simulated Annealing method and present an economical set of t...

2013
Kohei Ogawa Motoki Imamura Ichiro Takeuchi Masashi Sugiyama

The semi-supervised support vector machine (SVM) is a maximum-margin classification algorithm based on both labeled and unlabeled data. Training SVM involves either a combinatorial or non-convex optimization problem and thus finding the global optimal solution is intractable in practice. It has been demonstrated that a key to successfully find a good (local) solution of SVM is to gradually incr...

Journal: :Physical review. E, Statistical, nonlinear, and soft matter physics 2015
E M Inack S Pilati

We analyze the performance of quantum annealing as a heuristic optimization method to find the absolute minimum of various continuous models, including landscapes with only two wells and also models with many competing minima and with disorder. The simulations performed using a projective quantum Monte Carlo (QMC) algorithm are compared with those based on the finite-temperature path-integral Q...

2005
Renato Fernandes Hentschke Marcelo de Oliveira Johann Ricardo Augusto da Luz Reis

This paper presents a didactic Simulated Annealing placement tool. Simulated Annealing is a very famous generic combinatorial optimization algorithm that has been successfully applied to VLSI placement. Our tool allows any user to change several parameters of the algorithm and see their implications in the results graphically. At every algorithm step, the current placement disposition is displa...

Journal: :journal of optimization in industrial engineering 2012
esmaeil mehdizadeh fariborz afrabandpei

logistic network design is one of the most important strategic decisions in supply chain management that has recently attracted the attention of many researchers. transportation network design is then one of the most important fields of logistic network. this study is concerned with designing a multi-stage and multi-product logistic network. at first, a mixed integer nonlinear programming model...

2012
Sergio Ledesma Gabriel Aviña Raul Sanchez

Nowadays, there are many optimization problems where exact methods do not exist or where deterministic methods are computationally too complex to implement. Simulated annealing may be the answer for these cases. It is not greedy in the sense that it is not fool with false minima, and is pretty easy to implement. Furthermore, because it does not require a mathematical model, it can be used to so...

نمودار تعداد نتایج جستجو در هر سال

با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید