نتایج جستجو برای: heuristic algorithms
تعداد نتایج: 368456 فیلتر نتایج به سال:
It is one of the topics that have been studied extensively on maximum power point tracking (MPPT) recently. Traditional or soft computing methods are used for MPPT. Since approaches more effective than traditional approaches, studies MPPT shifted in this direction. This study aims comparison performance seven meta-heuristic training algorithms neuro-fuzzy The particle swarm optimization (PSO), ...
Yazılım güvenlik açığının tahmini, güvenli yazılım geliştirmek için önemli bir husustur. Ancak, bilgi sistemine saldırı yapıldığında büyük kayıplara neden olabilir. Tehlikeli kodun tespiti çaba gerektirir ve bu da bilinmeyen ciddi sonuçlara yol açabilir. Etkili sağlamak açıklarının oluşmasını önlemek veya açıklarını azaltmak meta-sezgisel tabanlı yaklaşımlar geliştirmeye güçlü ihtiyaç vardır. a...
Incremental heuristic search algorithms can solve sequences of similar search problems potentially faster than heuristic search algorithms that solve each search problem from scratch. So far, there existed incremental heuristic search algorithms (such as Adaptive A*) that make the h-values of the current A* search more informed, which can speed up future A* searches, and incremental heuristic s...
This paper deals with minimization of tardiness in single machine scheduling problem when each job has two different due-dates i.e. ordinary due-date and drop dead date. The drop dead date is the date in which jobs’ weights rise sharply or the customer cancels the order. A linear programming formulation is developed for the problem and since the problem is known to be NP-hard, three heuristic...
heuristics are often used to provide solutions for flow shop scheduling problems.the performance of a heuristic is usually judged by comparing solutions and run times on test cases.this investigation proposes an analytical alternative ,called asymptotic convergence ,which tests the convergence of the heuristic to a lower bound as problem size grows. the test is a stronger variation of worst cas...
this paper presents a new mathematical model for a hybrid flow shop scheduling problem with multiprocessor tasks in which sequence dependent set up times and preemption are considered. the objective is to minimize the weighted sum of makespan and maximum tardiness. three meta-heuristic methods based on genetic algorithm (ga), imperialist competitive algorithm (ica) and a hybrid approach of ga a...
The satisfiability problem is a basic core NP-complete problem. In recent years, a lot of heuristic algorithms have been developed to solve this problem, and many experiments have evaluated and compared the performance of different heuristic algorithms. However, rigorous theoretical analysis and comparison are rare. This paper analyzes and compares the expected runtime of three basic heuristic ...
نمودار تعداد نتایج جستجو در هر سال
با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید