Search alternatives:
processing algorithm » processing algorithms (Expand Search)
waste processing » image processing (Expand Search), text processing (Expand Search), melt processing (Expand Search)
update » updated (Expand Search)
search » research (Expand Search)
processing algorithm » processing algorithms (Expand Search)
waste processing » image processing (Expand Search), text processing (Expand Search), melt processing (Expand Search)
update » updated (Expand Search)
search » research (Expand Search)
-
1
Development of Lévy flight-based reptile search algorithm with local search ability for power systems engineering design problems
Published 2022“…Therefore, the paper discusses the development of the Lévy flight-based reptile search algorithm with local search capability and evaluates its potential against challenging power systems engineering optimization problems. …”
Get full text
-
2
A Tabu Search-Based Algorithm For The Fuzzy Clustering Problem
Published 2020“…The Fuzzy Clustering Problem (FCP) is a mathematical program which is difficult to solve since it is nonconvex, which implies possession of many local minima. The fuzzy C-means heuristic is the widely known approach to this problem, but it is guaranteed only to yield local minima. …”
Get full text
article -
3
Integrating genetic algorithms, tabu search, and simulatedannealing for the unit commitment problem
Published 1999“…The fitness function is constructed from the total operating cost of the generating units without penalty terms. In the tabu search part of the proposed algorithm, a simple short-term memory procedure is used to counter the danger of entrapment at a local optimum, and the premature convergence of the genetic algorithm. …”
Get full text
Get full text
article -
4
A New Genetic-Based Tabu Search Algorithm For Unit Commitment Problem
Published 2020“…A fitness function is constructed from the total operating cost of the generating units without penalty terms. In the tabu search part of the algorithm, a simple short term memory procedure is used to counterthe danger of entrapment at a local optimum by preventing cycling of solutions, and the premature convergence of the genetic algorithm. …”
Get full text
article -
5
Integrating Genetic Algorithms, Tabu Search, And Simulated Annealing For The Unit Commitment Problem
Published 2020“…The fitness function is constructed from the total operating cost of the generating units without penalty terms. In the tabu search part of the proposed algorithm, a simple short-term memory procedure is used to counter the danger of entrapment at a local optimum, and the premature convergence of the genetic algorithm. …”
Get full text
article -
6
Fuzzy Logic Adaptive Crow Search Algorithm for MPPT of a Partially Shaded Photovoltaic System
Published 2024“…Furthermore, a higher value of the fl is preferred to guide the optimization process in the direction of global search, whilst a lower fl value directs the algorithm in the direction of local search. …”
-
7
A Modified Oppositional Chaotic Local Search Strategy Based Aquila Optimizer to Design an Effective Controller for Vehicle Cruise Control System
Published 2023“…CEC2019 test suite is also used to perform ablation experiments to reveal the separate contributions of chaotic local search and modified opposition-based learning strategies to the CmOBL-AO algorithm. …”
Get full text
-
8
-
9
-
10
Unit commitment by tabu search
Published 1998“…The former is solved using the tabu search algorithm (TSA) while the latter problem is solved via a quadratic programming routine. …”
Get full text
Get full text
article -
11
Extended Behavioral Modeling of FET and Lattice-Mismatched HEMT Devices
Published 2016Subjects: Get full text
doctoralThesis -
12
A TABU SEARCH APPROACH TO THE CLUSTERING PROBLEM
Published 2020“…In this paper, we develop a new algorithm for solving this problem based on a tabu search technique. …”
Get full text
article -
13
Fixed set search applied to the multi-objective minimum weighted vertex cover problem
Published 2022“…One important characteristic of the proposed GRASP is that it avoids the use of weighted sums of objective functions in the local search and the greedy algorithm. In the second stage, the bi-objective GRASP is extended to the FSS by adding a learning mechanism adapted to multi-objective problems. …”
-
14
Application of Heuristic Algorithms for Multiuser Detection
Published 0000“…In this paper we propose application of heuristic algorithms in multiuser detection (MUD). The proposed algorithm combines a tabu search heuristic algorithm with a local search heuristic algorithm. …”
Get full text
Get full text
article -
15
MSD-NAS: multi-scale dense neural architecture search for real-time pedestrian lane detection
Published 2023“…This paper proposes a novel neural architecture search (NAS) algorithm, named MSD-NAS, to automate this laborious task. …”
-
16
Computational Experience On Four Algorithms For The Hard Clustering Problem
Published 2020“…The problem is a difficult optimization problem due to the fact that: it posseses many local minima. Several algorithms have been developed to solve this problem which include the k-means algorithm, the simulated annealing algorithm, the tabu search algorithm, and the genetic algorithm. …”
Get full text
article -
17
Capturing outline of fonts using genetic algorithm and splines
Published 2001“…Some examples are given to show the results obtained from the algorithm…”
Get full text
Get full text
article -
18
-
19
Economic load dispatch using memetic sine cosine algorithm
Published 2022“…Therefore, β-hill climbing optimizer, a recent local search algorithm, is hybridized as a new operator in SCA to empower its exploitation capability to tackle ELD. …”
Get full text
-
20
A hybridization of evolution strategies with iterated greedy algorithm for no-wait flow shop scheduling problems
Published 2024“…The selection process employs (µ + λ)-ES, allowing excellent parent solutions to survive multiple generations until a better offspring surpasses them. The IG algorithm’s straightforward search mechanism aids in further improving the solution and avoiding local minima. …”