Search Results - (( using low problem algorithm ) OR ( simulation optimization based algorithm ))

Comparative Analysis of Low Discrepancy Sequence-Based Initialization Approaches Using Population-Based Algorithms for Solving the Global Optimization Problems by Waqas Haider Bangyal, Kashif Nisar, Ag. Asri Bin Ag. Ibrahim, Muhammad Reazul Haque, Joel J. P. C. Rodrigues, Danda B. Rawat

“…Metaheuristic algorithms have been widely used to solve diverse kinds of optimization problems. …”
Get full text
Get full text
Get full text
Get full text
Get full text

Ant colony optimization for rule induction with simulated annealing for terms selection by Saian, Rizauddin, Ku-Mahamud, Ku Ruhana

“…This paper proposes a sequential covering based algorithm that uses an ant colony optimization algorithm to directly extract classification rules from the data set.The proposed algorithm uses a Simulated Annealing algorithm to optimize terms selection, while growing a rule.The proposed algorithm minimizes the problem of a low quality discovered rule by an ant in a colony, where the rule discovered by an ant is not the best quality rule, by optimizing the terms selection in rule construction. …”
Get full text
Get full text
Get full text

Optimal design of power system stabilizer for multimachine power system using farmland fertility algorithm by Sabo, Aliyu, Abdul Wahab, Noor Izzri, Othman, Mohammad Lutfi, Mohd Jaffar, Mai Zurwatul Ahlam, Beiranvand, Hamzeh

“…Moreover, at the end of the analysis, the FFA based PSSs design was found to converge faster with low computational cost and produces enhanced optimal PSSs parameters as compared to the other existing algorithms. …”
Get full text
Get full text
Get full text

Studying the Impact of Initialization for Population-Based Algorithms with Low-Discrepancy Sequences by Adnan Ashraf, Sobia Pervaiz, Waqas Haider Bangyal, Kashif Nisar, Ag. Asri Ag. Ibrahim, Joel J. P. C. Rodrigues, Danda B. Rawat

“…To solve different kinds of optimization challenges, meta-heuristic algorithms have been extensively used. …”
Get full text
Get full text
Get full text
Get full text
Get full text

Low Complexity Error Correction in Low Density Parity Check (LDPC) Code Decoder and Encoder for Decode and Forward Cooperative Wireless Communication by JAM'AAH, SUUD

“…By using the optimization min-sum belief propagation approach, a low complexity min-sum (MS) based decoding algorithm called Variable Global Optimization Min-Sum (VGOMS) has been developed. …”
Get full text
Get full text
Get full text

Fuzzy adaptive emperor penguin optimizer for global optimization problems by Md Abdul, Kader

“…The Emperor Penguin Optimizer (EPO) is a recently developed population-based metaheuristic algorithm that simulates the huddling behaviour of emperor penguins. …”
Get full text
Get full text

FPGA implementation of metaheuristic optimization algorithm by Nurul Hazlina, Noordin, Phuah, Soon Eu, Zuwairie, Ibrahim

“…The selected metaheuristic was the Simulated Kalman Filter (SKF) which proposed an algorithm that was low in complexity and used a small number of steps. …”
Get full text
Get full text
Get full text

Fpga Implementation Of Metaheuristic Optimization Algorithm by Phuah, Soon Eu

“…The selected metaheuristic was the Simulated Kalman Filter (SKF) which proposed an algorithm that was low in complexity and used a small number of steps. …”
Get full text
Get full text

Efficient radio resource management algorithms for downlink long term evolution networks by Mamman, Maharazu

“…The algorithm is based on the idea of the optimization problem in which resource allocation problem is formulated as an optimization problem. …”
Get full text
Get full text

A Novel Polytope Algorithm based on Nelder-mead method for localization in wireless sensor network by Gumaida, Bassam, Abubakar, Adamu

“…This paper emphasizes employing a ranging technique called Received Signal Strength Indicator (shortly RSSI) to calculate the length of distances among all the nodes of WSNs. Results: Simulation results perfectly showed that the suggested localization algorithm based on NMM can carry out a better performance than that of other localization algorithms utilizing other op- timization approaches, including a particle swarm optimization, ant colony (ACO) and bat algorithm (BA). …”
Get full text
Get full text
Get full text
Get full text

Compressed Sensing Implementations For Sparse Channel Estimation In OFDM Systems by Uwaechia, Anthony Ngozichukwuka

“…The optimization of pilot symbols values and their placement as a disjoint optimization problem may not necessarily exhibit low coherence compressed CE. …”
Get full text
Get full text

PARTICLE SWARM OPTIMIZATION MAXIMUM POWER POINT TRACKING FOR PARTIALLY SHADED SOLAR PV by Alvin, Ngu Tien Leong

“…This study proposes a particle swarm optimization (PSO) algorithm based on MPPT for the PGS to operate under PSC. …”
Get full text
Get full text
Get full text

An experimental study of a fuzzy adaptive emperor penguin optimizer for global optimization problem by Kader, Md. Abdul, Zamli, Kamal Z., Alkazemi, Basem Yousef

“…Emperor Penguin Optimizer (EPO) is a recently developed population-based meta-heuristic algorithm that simulates the huddling behavior of emperor penguins. …”
Get full text
Get full text
Get full text

Methane plume localization with enhanced self-best reduction and Gaussian improved particle swarm optimization (GiPSO) by Liew, Jia Hun

“…Adapting the Gaussian gas plume model in the simulation provides the experiment with a realistic optimization problem for GiPSO to optimize in the simulation, where we can test the engagement of dynamically challenging optimization problems such as gas plume dispersions. …”
Get full text
Get full text

Bitwise-based Routing Algorithms in Optical Multistage Interconnection Network by Abed, Farzaneh

“…In the first, the Improved Zero algorithm is proposed to solve the problem and secondly, the Bitwise Improved Zero algorithm is developed. …”
Get full text
Get full text

Energy and spectral efficiency balancing algorithm for energy saving in LTE downlinks by Maharazu, Mamman, Mohd Hanapi, Zurina, Mahmoud Alrashah, Mohamed Alhadi

“…The scheme is formulated as a Multi-objective Optimization Problem (MOP) and its Pareto optimal solution is examined. …”
Get full text
Get full text
Get full text

Topology-aware hypergraph based approach to optimize scheduling of parallel applications onto distributed parallel architectures by Koohi, Sina Zangbari

“…Any optimization algorithm is suitable for only a specific domain of optimization problems. …”
Get full text
Get full text

Deterministic static sensor node placement in wireless sensor network based on territorial predator scent marking behavior by Abidin H.Z., Din N.M., Radzi N.A.M.

“…The main objectives considered in this paper are to achieve maximum coverage and minimum energy consumption with guaranteed connectivity. A simulation study has been carried out to compare the performance of the proposed algorithm implemented in two different single objective approaches with an Integer Linear Programming based algorithm and another biological inspired algorithm. …”

Optimization and control of hydro generation scheduling using hybrid firefly algorithm and particle swarm optimization techniques by Hammid, Ali Thaeer

“…Firstly, a hybrid algorithm namely firefly particle swarm optimization (FPSO) and series division method (SDM) based on the practical swarm optimization and the firefly algorithm is proposed. …”
Get full text
Get full text

A new ant based rule extraction algorithm for web classification by Ku-Mahamud, Ku Ruhana, Saian, Rizauddin

“…Using Classifier-based attribute subset selection will reduce more attributes, but sacrifice the performance of the classifier.A hybrid ant colony optimization with simulated annealing algorithm to discover rules from data is proposed.The simulated annealing technique will minimize the problem of low quality discovered rule by an ant in a colony.The best rule for a colony will then be chosen and later the best rule among the colonies will be included in the rule set.The best rule for a colony will then be chosen and later the best rule among the colonies will be included in the rule set.The rule set is arranged in decreasing order of generation.Thirteen data sets which consist of discrete and continuous data were used to evaluate the performance of the proposed algorithm in terms of accuracy, number of rules and number of terms in the rules.Experimental results obtained from the proposed algorithm are comparable to the results of the Ant-Miner algorithm in terms of rule accuracy but are better in terms of rule simplicity.…”
Get full text
Get full text
Get full text
Get full text