نتایج جستجو برای: simulated annealing method
تعداد نتایج: 1740668 فیلتر نتایج به سال:
Virtually all implementations of simulated annealing are simplified by assuming discrete unknowns, yet continuous-parameter annealing has many potential applications to image processing. A wide array of problems such as speech formant tracking, boundary estimation and phase-unwrapping can be approached as global minimization of contour energy function. This thesis proposes to solve such problem...
Flower pollination algorithm (FP) is a new nature-inspired algorithm, based on the characteristics of flowering plants. Combining with the features of flower pollination algorithm, an improved simulated annealing algorithm is proposed in this paper (FPSA). It can improve the speed of annealing. The initial state of simulated annealing and new solutions are generated by flower pollination. There...
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...
scheduling for job shop is very important in both fields of production management and combinatorial op-timization. however, it is quite difficult to achieve an optimal solution to this problem with traditional opti-mization approaches owing to the high computational complexity. the combination of several optimization criteria induces additional complexity and new problems. in this paper, we pro...
this study is devoted to the formulation of the network design problem of one-way streets and the application of simulated annealing (sa) algorithm to solve this problem for a large real network. it discusses some points of views on one-way street networks, the objective function used for design, the way in which design constraints may be considered, and the traffic problems concerning one-way ...
The choice of a good annealing schedule is necessary for good performance of simulated annealing for combinatorial optimization problems. In this paper, we pose the simulated annealing task decision-theoretically for the first time, allowing the user to explicitly define utilities of time and solution quality. We then demonstrate the application of reinforcement learning techniques towards appr...
نمودار تعداد نتایج جستجو در هر سال
با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید