Search Results - (( based interactive issues algorithm ) OR ( evolution optimization path algorithm ))

The Development Of A Robust Algorithm For Uav Path Planning In 3d Environment by Kok, Kai Yit

“…Significant research has been conducted on Unmanned Aerial Vehicle (UAV) path planning using evolutionary algorithms, such as Particle Swarm Optimization (PSO), Genetic Algorithm (GA), Differential Evolution (DE), and Biogeographic-Based Optimization (BBO). …”
Get full text
Get full text

Development of an improved GWO algorithm for solving optimal paths in complex vertical farms with multi-robot multi-tasking by Shen, Jiazheng, Hong, Tang Sai, Fan, Luxin, Zhao, Ruixin, Mohd Ariffin, Mohd Khairol Anuar, As’arry, Azizan

“…The EPDE-GWO algorithm is compared with Genetic Algorithm (GA), Simulated Annealing (SA), Dung Beetle Optimizer (DBO), and Particle Swarm Optimization (PSO). …”
Get full text
Get full text
Get full text

Path optimization using genetic algorithm evolution by Low C.Y., Chong K.H., Salleh K., Johnny K.S.P.

Finding minimum path by using Genetic Algorithm (GA)/ Siti Zuraifah Hashim by Hashim, Siti Zuraifah

“…Roadways and telephone systems are the examples of them. Genetic Algorithms (GA), pioneered by John Holland, applies the principle of evolution found in nature to the problem of finding an optimal solution. …”
Get full text
Get full text

Differential evolution optimization for constrained routing in Wireless Mesh Networks by Sanni, Mistura Laide, Hassan Abdalla Hashim, Aisha, Hassan, Wan Haslina, Ahmed, Gharib Subhi Mahmoud, Anwar, Farhat, Zakaria, Omar

“…This solution addresses efficient and optimal routing path construction for cost and quality metrics of the application. …”
Get full text
Get full text
Get full text

Literature Review of Optimization Techniques for Chatter Suppression In Machining by A. R., Yusoff, Mohamed Reza Zalani, Mohamed Suffian, Mohd Yusof, Taib

“…Various algorithms can be applied in the optimization of machining problems; however, Differential Evolution is the most appropriate for use in chatter suppression, being less time consuming, locally optimal, and more robust than both Genetic Algorithms, despite their wide applications, and Sequential Quadratic Programming, which is a famous conventional algorithm.…”
Get full text
Get full text
Get full text

Comparative analysis of spiral dynamic algorithm and artificial bee colony optimization for position control of flexible link manipulators by Nor Maniha, Abdul Ghani, Nizaruddin, M. Nasir, Azrul Azim, Abdullah Hashim

“…By integrating the ABC algorithm into the manipulator's control system, the goal is to enhance its ability to plan paths and optimize trajectories. …”
Get full text
Get full text
Get full text

Hybrid genetic algorithm with multi-parents recombination for job shop scheduling problems / Ong Chung Sin by Ong, Chung Sin

“…This mechanism is restricted to search the possible solutions in a critical path. Modification on the path by using neighborhood search significantly reduces the total length of the makespan. …”
Get full text
Get full text
Get full text

Modeling and multi-objective optimal sizing of standalone photovoltaic system based on evolutionary algorithms by Ridha, Hussein Mohammed

“…The IEM algorithm uses the attraction-repulsion mechanism to change the positions of solutions towards the optimality. …”
Get full text
Get full text

A secure trust aware ACO-Based WSN routing protocol for IoT by Sharmin, Afsah, Anwar, Farhat, Motakabber, S. M. A., Hassan Abdalla Hashim, Aisha

“…The performance of the proposed routing algorithm is demonstrated through MATLAB. Based on the proposed system, to find the secure and optimal path while aiming at providing trust in IoT environment, the average energy consumption is minimized by nearly 50% even as the number of nodes has increased, as compared with the conventional ACO algorithm, a current ant-based routing algorithm for IoT-communication, and a present routing protocol RPL for IoT.…”
Get full text
Get full text
Get full text

Effects of Different Superpixel Algorithms on Interactive Segmentations by Soo See, Chai, Luong Goh, Kok, Weng Ng, Giap, Muzaffar, Hamzah

“…The superpixels generated by these five algorithms will be used on two interactive image segmentation algorithms: i) Maximal Similarity based Region Merging (MSRM) and ii) Graph-Based Manifold Ranking (GBMR) with single and multiple strokes on various images from the Berkeley image dataset. …”
Get full text
Get full text
Get full text

On Adopting Parameter Free Optimization Algorithms for Combinatorial Interaction Testing by Kamal Z., Zamli, Alsariera, Yazan A., Nasser, Abdullah B., Alsewari, Abdulrahman A.

“…Although useful, strategies based on the aforementioned optimization algorithms are not without limitation. …”
Get full text
Get full text
Get full text

Dealing with Routing Hole Problem in Multi-hop Hierarchical Routing Protocol in Wireless Sensor Network by Sama, Najm Us

“…The challenging issue of routing protocols is to reduce the communication overhead for data transmission by determining an optimal path. The hierarchical routing technique is one of the energy efficient routing protocols in WSN. …”
Get full text
Get full text

Effects of Different Superpixel Algorithms on Interactive Segmentations by Goh, Kok Luong, Ng, Giap Weng, Muzaffar Hamzah, Chai, Soo See

“…The superpixels generated by these five algorithms will be used on two interactive image segmentation algorithms: i) Maximal Similarity based Region Merging (MSRM) and ii) Graph-Based Manifold Ranking (GBMR) with single and multiple strokes on various images from the Berkeley image dataset. …”
Get full text
Get full text
Get full text
Get full text
Get full text

Sequence and sequence-less t-way test suite generation strategy based on the elitist flower pollination algorithm by Mohammed Abdullah, Abdullah Nasser

“…If t-way strategies are to be adopted in such a system, there is also a need to support test data generation based on sequence of interactions. Addressing these aforementioned issues and complementing the existing sequence based strategies such as t-SEQ, Sequence Covering Array Generator and Bee Algorithm, this thesis presents a unified strategy based on the new meta-heuristic algorithm, called the Elitist Flower Pollination Algorithm (eFPA). …”
Get full text
Get full text

A novel high performance routing technique for cross-referencing DMFBs by Pranab, Roy, Hafizur, Rahaman

Get full text

A variable combinatorial test suite strategy based on modified greedy algorithm by Homaid, Ameen A. Ba, Alsewari, Abdulrahman A.

“…Several researchers have been addressed the combinatorial interaction testing issues by developing the various strategies based on a search-based approach or a pure-computational approach, although, these are useful, but most of them have a lack to support the variable strength interaction which is one of CIT techniques. …”
Get full text
Get full text
Get full text

Sizes of Superpixels and their Effect on Interactive Segmentation by Kok, Luong Goh, Giap, Weng Ng, Muzaffar Hamzah, Soo, See Chai

“…Semi-automated segmentation, also known as interactive image segmentation, is an algorithm that extracts a region of interest (ROI) from an image based on user input. …”
Get full text
Get full text
Get full text
Get full text

Sizes of Superpixels and their Effect on Interactive Segmentation by Goh, Kok Luong, Ng, Giap Weng, Muzaffar, Hamzah, Chai, Soo See

“…Semi-automated segmentation, also known as interactive image segmentation, is an algorithm that extracts a region of interest (ROI) from an image based on user input. …”
Get full text
Get full text
Get full text

TBat: A Novel Strategy for Minimization of T-Way Interaction Test Suite Based on the Particle Swarm Optimization and the Bat Algorithm by Kamal Z., Zamli, Alsariera, Yazan A.

Get full text
Get full text