Search Results - simulation optimization ((((method algorithm) OR (sensor algorithm))) OR (search algorithm))

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

“…This novel optimization method is a direct search approach and is usually directed to solve nonlinear optimization problems that may not have well-known derivatives, and it is called the Nelder-mead Method (NMM). …”
Get full text
Get full text
Get full text
Get full text

Modelling of multi-robot system for search and rescue by Poy, Yi Ler

“…In this project, this sensor-based algorithm is known as the Obstacle Avoidance Algorithm. …”
Get full text
Get full text

Simulated kalman filter (SKF) based image template matching for distance measurement by using stereo vision system by Nurnajmin Qasrina Ann, Ayop Azmi

“…In addition, it is expected that it can be applied in real-time application. In this study, Simulated Kalman Filter (SKF) is applied to image template matching application as the optimization algorithm. …”
Get full text
Get full text

Exploration of genetic algorithm in network coding for wireless sensor networks by Teo, Kenneth Tze Kin, Chin, Renee Ka Yin, Tan, Shee Eng, Lee, Chun Hoe, Lim, Kit Guan

“…The simulation results show the enhanced genetic algorithm can adapt to various situations with different topologies with a better throughput and energy consumption compared to the store-and-forward method used in conventional wireless sensor network.…”
Get full text
Get full text
Get full text
Get full text
Get full text

Optimization Method Using Modified Harmony Search For Coverage And Energy Efficiency In Wireless Sensor Network by Halim, Nurul Hamimi

“…Coverage and energy efficiency metrics are two fundamental issues for almost all types of application in wireless sensor network (WSNs).Coverage reflects how well an area is monitored by sensor nodes and in energy efficient networks where less energy is consumed to provide the same level of services.These twin specifics are presented to evaluate the performance of a wireless sensor network.Due to its simplicity and ease of analysis,full coverage is widely implemented in many theoretical studies.However,sometimes full coverage is not the best way to represent some real-world application due to its strong restrictions and its deterministic characteristics.In this thesis,Modified Harmony Search algorithm (MHS) is proposed to achieve a sensor node deployment such that the covered area is optimal and data transfer has low energy consumption.Through computer simulations, experimental results verified that the proposed method improved the coverage of area in compare to some related methods.Based on the result obtain from every experiments,coverage area percentage performance is affected by the number of hotspots.This is shown by Harmony Search (HS) based method where the coverage area percentage increases as the number of hotspot increase. …”
Get full text
Get full text
Get full text
Get full text

Hybridization of enhanced ant colony system and Tabu search algorithm for packet routing in wireless sensor network by Husna, Jamal Abdul Nasir

“…Better performances were also achieved for success rate, throughput, and latency when compared to other hybrid routing algorithms such as Fish Swarm Ant Colony Optimization (FSACO), Cuckoo Search-based Clustering Algorithm (ICSCA), and BeeSensor-C. …”
Get full text
Get full text
Get full text
Get full text

Node placement optimization using extended virtual force and cuckoo search algorithm in wireless sensor network by Puteri Azwa, Ahmad

“…In EVFCS, the algorithm searches the best value of threshold distance and relocated the new position of sensor nodes. …”
Get full text
Get full text
Get full text

A discrete simulated kalman filter optimizer for combinatorial optimization problems by Suhazri Amrin, Rahmad

“…An example of a numerical algorithm is the simulated Kalman filter (SKF). Various method has been introduced as an extension of a numerical algorithm to adapt it to a discrete search space. …”
Get full text
Get full text

Development of heuristic methods based on genetic algorithm (GA) for solving vehicle routing problem by Ismail, Zuhaimy, Nurhadi, Irhamah, Zainuddin, Zaitul Marlizawati

“…Genetic Algorithm as population-based methods are better identifying promising areas in the search space, while Tabu Search and Simulated Annealing as trajectory methods are better in exploring promising areas in search space. …”
Get full text
Get full text

Simulated Kalman Filter optimization algorithm for maximization of wireless sensor networks coverage by Nor Azlina, Ab. Aziz, Zuwairie, Ibrahim, Kamarulzaman, Ab Aziz, Nor Hidayati, Abdul Aziz

“…Simulated Kalman Filter (SKF) is a population based optimization algorithm inspired by the Kalman filtering method. …”
Get full text
Get full text
Get full text

IWDSA: a hybrid Intelligent Water Drops with a Simulated Annealing for the localization improvement in wireless sensor networks by Gumaida, Bassam, Ibrahim, Adamu Abubakar

“…The proposed algorithm, named Intelligent Water Drops with Simulated Annealing (IWDSA), combines two powerful optimization methods: Intelligent Water Drops (IWD) and Simulated Annealing (SA). …”
Get full text
Get full text
Get full text

Process Planning Optimization In Reconfigurable Manufacturing Systems by Musharavati, Farayi

“…The five (5) AADTs include; a variant of the simulated annealing algorithm that implements heuristic knowledge at critical decision points, two (2) cooperative search schemes based on a “loose hybridization” of the Boltzmann Machine algorithm with (i) simulated annealing, and (ii) genetic algorithm search techniques, and two (2) modified genetic algorithms. …”
Get full text
Get full text

Hybridizing Invasive Weed Optimization with Firefly Algorithm for Unconstrained and Constrained Optimization Problems by Hyreil A., Kasdirin, N. M., Yahya, M. S. M., Aras, Tokhi, M. O.

“…The invasive weed optimization (IWO) algorithm, on the other hand, is effective in accurate global search, but not in local search. …”
Get full text
Get full text
Get full text

A Hybrid Method Based on Cuckoo Search Algorithm for Global Optimization Problems by Shehab, Mohammad, Khader, Ahamad Tajudin, Laouchedi, Makhlouf

“…However, it undergoes the premature convergence problem for high dimensional problems because the algorithm converges rapidly. Therefore, we proposed a robust approach to solve this issue by hybridizing optimization algorithm, which is a combination of Cuckoo search algorithm and Hill climbing called CSAHC discovers many local optimum traps by using local and global searches, although the local search method is trapped at the local minimum point. …”
Get full text
Get full text
Get full text

Improved particle swarm optimization by fast annealing algorithm by Bashath, Samar, Ismail, Amelia Ritahani

“…The proposed algorithm is meant to solve high dimensional optimization problems based on two strategies, which are utilizing the particle swarm optimization to define the global search area and utilizing the fast-simulated annealing to refine the visited search area. …”
Get full text
Get full text
Get full text
Get full text

Simulated Kalman Filter algorithms for solving optimization problems by Nor Hidayati, Abdul Aziz

“…In this research, two novel estimation-based metaheuristic optimization algorithms, named as Simulated Kalman Filter (SKF), and single-solution Simulated Kalman Filter (ssSKF) algorithms are introduced for global optimization problems. …”
Get full text
Get full text

Short-Term Electricity Price Forecasting via Hybrid Backtracking Search Algorithm and ANFIS Approach by Pourdaryaei, Alireza, Mokhlis, Hazlie, Illias, Hazlee Azil, Kaboli, S. Hr. Aghay, Ahmad, Shameem

“…In addition, to prove the superiority of the proposed hybrid forecasting method the simulation results obtained using ANN and ANFIS models optimized by other well-known optimization methods have been compared with that of proposed method. © 2019 IEEE.…”
Get full text
Get full text

Gravitational search – bat algorithm for solving single and bi-objective of non-linear functions by Abbas, Iraq Tareq

“…Firstly, a new strategy based on a combined method (i.e. single-objective Gravitational Search (GSA) with Bat Algorithm (BAT) (SOGS-BAT)) algorithm is proposed in which relies on the closed interval between 0 and 1 to avoid falling into local search. …”
Get full text
Get full text

Optimization of Grading Ring Design for Metal Oxide Arrester Using Gravitational Search Algorithm by Illias H.A., Zern Hong C., Aramugam K., Mokhlis H., Ariffin A.M., Fairouz Mohd Yousof M.

“…Birds; Electric fields; Genetic algorithms; Grading; Learning algorithms; Metallic compounds; Metals; Particle swarm optimization (PSO); Rings (components); Simulated annealing; Surge protection; Comsol multiphysics; Electric field magnitude; Grading rings; Gravitational search algorithm (GSA); Gravitational search algorithms; Metal oxide arrester; Optimization method; Optimum designs; Dielectric materials…”

Pendulum-like algorithm as a local search technique by Abed I.A., Koh S.P., Sahari K.S.M., Tiong S.K., Younis H.A.-K., Abed A.A.