Search Results - (( using meta ((method algorithm) OR (path algorithm)) ) OR ( java application testing algorithm ))

Refine Results
  1. 1

    A review on path planning and obstacle avoidance algorithms for autonomous mobile robots by Anis Naema Atiyah, Rafai, Noraziah, Adzhar, Nor Izzati, Jaini

    Published 2022
    “…Taking into consideration commonly used classical approaches such as Dijkstra algorithm (DA), artificial potential field (APF), probabilistic road map (PRM), cell decomposition (CD), and meta-heuristic techniques such as fuzzy logic (FL), neutral network (NN), particle swarm optimization (PSO), genetic algorithm (GA), cuckoo search algorithm (CSO), and artificial bee colony (ABC). …”
    Get full text
    Get full text
    Get full text
    Get full text
    Article
  2. 2

    A comparative study of heuristic methods to solve Traveling Salesman Problem (TPS) by Lim, Yai Fung, Hong, Pei Yee, Ramli, Razamin, Khalid, Ruzelan

    Published 2011
    “…The objective of the TSP is to find the shortest path that reaches all the cities which are interconnected with each other by straight lines.The symmetric TSP is used and the distance between two cities is calculated by using Euclidean equation.In this study, three heuristic methods, namely simulated annealing (SA), tabu search (TS) and reactive tabu search (RTS) are used to solve TSP.SA is a generic probabilistic meta-algorithm for the global optimization problem and TS is a meta-heuristic search technique that guides a local search procedure to explore the solution space beyond local optimality. …”
    Get full text
    Get full text
    Get full text
    Monograph
  3. 3

    A Review of Multi-holes Drilling Path Optimization Using Soft Computing Approaches by Najwa Wahida, Zainal Abidin, M. F. F., Ab Rashid, N. M. Zuki, N. M.

    Published 2017
    “…This paper reviews the research publications on the drilling path optimization using soft computing approaches. …”
    Get full text
    Get full text
    Get full text
    Get full text
    Article
  4. 4
  5. 5

    A Mininet emulation study for SDN fat tree data center sleep mode routing algorithms by Fawzi S., Din N.M.

    Published 2025
    “…Employing sleep mode aligns with sustainability goals and can reduce the environmental impact of data centers by lowering carbon emissions. In this work meta heuristic algorithm is incorporated at the SDN central controller in a fat tree-based data centre for bandwidth usage monitoring, sleep decisions and path selection using Mininet emulation. …”
    Article
  6. 6
  7. 7

    Optimization of multi-holes drilling path using particle swarm optimization by Najwa Wahida, Zainal Abidin

    Published 2022
    “…One way to improve the multi-hole drilling is by optimising the tool path in the process. This research aims to model and optimise multi-hole drilling problems using Particle Swarm Optimisation (PSO) algorithm. …”
    Get full text
    Get full text
    Thesis
  8. 8

    Optimization of multi-holes drilling path using particle swarm optimization by Najwa Wahida, Zainal Abidin, M. F. F., Ab Rashid, N. M. Zuki, N. M.

    Published 2018
    “…PSO algorithm gives the minimum value of fitness path and their CPU time compared to other algorithms. …”
    Get full text
    Get full text
    Get full text
    Get full text
    Book Chapter
  9. 9

    Energy balancing mechanisms for decentralized routing protocols in wireless sensor networks by Saleh, Ahmed Mohammed Shamsan

    Published 2012
    “…Finally, we propose Self-Decision Route Selection scheme which is an improvement of the Hop-based Spanning Tree (HST) algorithm that is used in some routing protocols such as AODV and DSR. …”
    Get full text
    Get full text
    Thesis
  10. 10

    African Buffalo Optimization (ABO): A New Metaheuristic Algorithm by Odili, Julius Beneoluchi, M. N. M., Kahar

    Published 2015
    “…When compared to the Ant Colony Optimization algorithm, Simulated Annealing and Genetic Algorithm, the results obtained from African Buffalo Optimization show that the algorithm works well and can be extended to solving problems like: path planning, scheduling, vehicle routing in addition to other constraint-driven problems.…”
    Get full text
    Get full text
    Get full text
    Article
  11. 11

    An experimental study of neighbourhood based metaheuristic algorithms for test case generation satisfying the modified condition / decision coverage criterion by Haque, Ariful

    Published 2018
    “…Although useful, the existing algorithms does not provide any comparative data to select an algorithm based on the problem size and difficulty and the use of other neighborhood algorithms (including Great Deluge and Late Acceptance Hill Climbing) has not been sufficiently explored as well. …”
    Get full text
    Get full text
    Thesis
  12. 12

    RSA Encryption & Decryption using JAVA by Ramli, Marliyana

    Published 2006
    “…The implementation of this project will be based on Rapid Application Design Methodology (RAD) and will be more focusing on research and finding, ideas and the implementation of the algorithm, and finally running and testing the algorithm. …”
    Get full text
    Get full text
    Final Year Project
  13. 13

    Continuous path planning of Kinematically redundant manipulator using Particle Swarm Optimization by Machmudah, A., Parman, S., Baharom, M.B.

    Published 2018
    “…A complex geometrical path obtained from Bezier and algebraic curves are used as the traced path that should be followed by a 3-Degree of Freedom (DOF) arm robot manipulator and a hyper-redundant manipulator. …”
    Get full text
    Get full text
    Article
  14. 14

    Continuous path planning of Kinematically redundant manipulator using Particle Swarm Optimization by Machmudah, A., Parman, S., Baharom, M.B.

    Published 2018
    “…A complex geometrical path obtained from Bezier and algebraic curves are used as the traced path that should be followed by a 3-Degree of Freedom (DOF) arm robot manipulator and a hyper-redundant manipulator. …”
    Get full text
    Get full text
    Article
  15. 15
  16. 16
  17. 17

    Ant Colony Optimization for Tourist Route by Meeplat, Nopparat

    Published 2005
    “…The second part of this research involves formulating and applying the ACO algorithms to find the shortest path based on the distance calculated from source to destination cities. …”
    Get full text
    Get full text
    Get full text
    Thesis
  18. 18

    An Environmentally Energy Dispatch Using New Meta Heuristic Evolutionary Programming by Mohamad Ridzuan, Mohamad Radzi

    Published 2018
    “…Basically,one important issue in the power system network is to provide the optimal Economic Load Dispatch (ELD) solution in order to guarantee the sustainable consumer load demand.However,today ELD solution is essential to include together with the environmental aspect and known as Environmental Economic Load Dispatch (EELD).For that reason, many researchers continue in the development of new simulation tool specifically to overcome the EELD problems.Therefore,this study prepared an improved hybrid metaheuristic technique named as New Meta Heuristic Evolutionary Programming (NMEP) to provide the best possible solution in solving the identified single objective and multi objective functions for EELD solution.This new technique a merging cloning strategy that involved in an Artificial Immune System (AIS) algorithm into algorithm of Meta Heuristic Evolutionary Programming (Meta-EP).The development of NMEP technique is to minimize total cost,reduce the total emission during generator operation through the common formula in EELD and lowest total system loss.Besides that,all mentioned objective functions were also optimized together simultaneously that formulated using the weighted sum method before had been executed on the multi objective NMEP or called MONMEP.Both individual and multi objective NMEP techniques performance were verified among other two common heuristic methods known as AIS and Meta-EP techniques.In addition,the best possible solution defined using the aggregate function method.Through this method,the selection of the best MOEELD solution became effortless as compared with MO individually that required compare two or more objective function in one time manually.Among those three optimization techniques the lowest total aggregate values mostly resulted via the NMEP technique.Based upon that,the proposed technique is proving as the outstanding method compared with Meta-EP and AIS techniques in solving the EELD problem for both standard IEEE 26 bus and 57 bus systems.…”
    Get full text
    Get full text
    Get full text
    Get full text
    Thesis
  19. 19

    Meta-heuristic structure for multiobjective optimization case study: Green sand mould system by Ganesan, T., Elamvazuthi, I., KuShaari, K.Z., Vasant, P.

    Published 2014
    “…In this chapter, an approach that merges meta-heuristic algorithms with the weighted sum method is introduced. …”
    Get full text
    Get full text
    Book
  20. 20

    Elitist hybrid migrating birds optimization and genetic algorithm based strategy for T-way test suite generation by Hasneeza Liza, Zakaria

    Published 2020
    “…While all these traditional testing methods are useful, they do not deal with interaction testing of inputs. …”
    Get full text
    Get full text
    Thesis