نتایج جستجو برای: multi start simulated annealing

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

Seyed Mahmood Hashemi

Fuzzy clustering methods are conveniently employed in constructing a fuzzy model of a system, but they need to tune some parameters. In this research, FCM is chosen for fuzzy clustering. Parameters such as the number of clusters and the value of fuzzifier significantly influence the extent of generalization of the fuzzy model. These two parameters require tuning to reduce the overfitting in the...

2014
Sanjay Kr. Singh Nitish Katal S. G. Modani

This study presents the use and comparison of various bio-inspired algorithms for optimizing the response of a PID controller for a Brushless DC Motor in contrast to the conventional methods of tuning. For the optimization of the PID controllers Genetic Algorithm, Multi-objective Genetic Algorithm and Simulated Annealing have been used. PID controller tuning with soft-computing algorithms compr...

2011
Kai-Shiuan Shih Tzuu-Hseng S. Li Shun-Hung Tsai S.-H. TSAI

In this paper, a novel adaptive fuzzy robust controller with a state observer approach based on the hybrid particle swarm optimization-simulated annealing (PSO-SA) technique for a class of multi-input multi-output (MIMO) nonlinear systems with disturbances is proposed. Firstly, particle swarm optimization-simulated annealing (PSO-SA) is used to adjust the fuzzy membership functions, while adapt...

Journal: :journal of industrial engineering, international 2011
a.m kimiagari h mosadegh

in this paper, the researchers have investigated a concatenated robot move (crm) sequence problem and minimal part set (mps) schedule problem with different setup times for two-machine robotic cell. they have focused on simultaneous solving of crm sequence and mps schedule problems with different loading and unloading times. they have applied a simulated annealing (sa) algorithm to provide a go...

ژورنال: :فصلنامه دانش مدیریت (منتشر نمی شود) 2003
دکتر بابک سهرابی

این مقاله الگوریتم sa ( simulated annealing ) را بعنوان یک الگوریتم ابتکاری و هوشمند جهت برنامه ریزی بهتر تعویض قطعات به منظور حداقل کردن زمان خوابیدگی مورد بررسی قرار می دهد نتایج حاصل از الگوریتم با روش متداول مقایسه شده و عملکرد آن را در قالب کیفیت جواب و سرعت محاسبات نشان می دهد

Journal: :international journal of industrial engineering and productional research- 0
hasan hosseini nasab yazd university hamid reza kamali yazd university

this article addresses a single row facility layout problem where the objective is to optimize the arrangement of some rectangular facilities with different dimensions on a line. regarding the np-hard nature of the considered problem, a hybrid meta-heuristic algorithm based on simulated annealing has been proposed to obtain a near optimal solution. a number of test problems are randomly generat...

Journal: :journal of computer and robotics 0
behrooz shahrokhzadeh faculty of computer and information technology engineering, qazvin branch, islamic azad university, qazvin, iran mehdi dehghan department of computer engineering, amirkabir university of technology, tehran, iran mohammadreza shahrokhzadeh university of applied sciences & technology, tehran, iran

target coverage is one of the important problems in visual sensor networks. the coverage should be accompanied with an efficient use of energy in order to increase the network lifetime. in this paper, we address the maximum lifetime for visual sensor networks (mlv) problem by maximizing the network lifetime while covering all the targets. for this purpose, we develop a simulated annealing (sa) ...

Journal: :journal of algorithms and computation 0
charles colbourn arizona state university, p.o. box 878809, , tempe, az 85287-8809, u.s.a. and state key laboratory of software development environment,, beihang university, beijing 100191, china. jose torres-jimenez cinvestav-tamaulipas, information technology laboratory,, km. 6 carretera victoria-monterrey, 87276 victoria tamps., mexico

covering arrays of strength two have been widely studied as combinatorial models of software interaction test suites for pairwise testing. while numerous algorithmic techniques have been developed for the generation of covering arrays with few columns (factors), the construction of covering arrays with many factors and few tests by these techniques is problematic. random generation techniques c...

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

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