Search Results - (( parallel optimization bat algorithm ) OR ( problem implementation using algorithm ))

Refine Results
  1. 1

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

    Published 2018
    “…Based on literature, stereo algorithm is already being implemented to solve the distance measurement problem. …”
    Get full text
    Get full text
    Thesis
  2. 2

    A hybrid bat–swarm algorithm for optimizing dam and reservoir operation by Yaseen, Zaher Mundher, Allawi, Mohammed Falah, Karami, Hojat, Ehteram, Mohammad, Farzin, Saeed, Ahmed, Ali Najah, Koting, Suhana, Mohd, Nuruol Syuhadaa, Jaafar, Wan Zurina Wan, Afan, Haitham Abdulmohsin, El-Shafie, Ahmed

    Published 2019
    “…This study proposes a new hybrid optimization algorithm based on a bat algorithm (BA) and particle swarm optimization algorithm (PSOA) called the hybrid bat–swarm algorithm (HB-SA). …”
    Get full text
    Get full text
    Article
  3. 3
  4. 4

    Quantum Processing Framework And Hybrid Algorithms For Routing Problems by Soltan Aghaei, Mohammad Reza

    Published 2010
    “…The focus of this study is developing a framework of QAPU and hybrid architecture for classical-quantum algorithms. The framework is used to increase the implementation performance of quantum algorithms. …”
    Get full text
    Get full text
    Thesis
  5. 5

    Low-level hybridization scripting language with dynamic parameterization in PSO-GA / Suraya Masrom by Masrom, Suraya

    Published 2015
    “…However, in many cases, implementing the suitable hybrid algorithms for a given optimization problem is a considerably difficult, which in most cases, is time consuming. …”
    Get full text
    Get full text
    Thesis
  6. 6

    Festive season balancing groceries optimization / Fairuz Mohamed Razi by Mohamed Razi, Fairuz

    Published 2012
    “…This research uses Genetic Algorithms concept and technique to solve an optimization problem in shortage in supply-demand during festive season which is during Hari Raya Aidilfitri. …”
    Get full text
    Get full text
    Thesis
  7. 7

    The Implementation of Genetic Algorithm in Path Optimization by Jumali, Suriana

    Published 2005
    “…In this project, TSP will be used to model and easy visualize the path optimization problem and Genetic Algorithm (GA) was chosen to be implemented in resolving the problem. …”
    Get full text
    Get full text
    Final Year Project
  8. 8

    Enhancing Market-Based Scheduling Algorithm on Globally Distributed Web Servers Using Least Suitable Sealed Bid Technique by Al-Ewiwi, Mahmoud

    Published 2006
    “…Scheduling of a multiple distributed servers is considered as a complex problem.considered as NP-complete problem,where no single efficient algorithm guaranteed to produce optimal results.This thesis investigates on how to find optimal solution for distribute system,by implementing market based scheduling Algorithm(MBSA).On implementing the MBSA, a new auction technique which is the least suitable sealed bid auction will be introduced.it is found that least suitable sealed bid technique will give the close-to-optimum solution.In the implementation, cooperative agents were used as a middleware between web servers and stand-alone schedulers. …”
    Get full text
    Get full text
    Thesis
  9. 9

    Diagnosis of eyesight using Improved Clonal Selection Algorithm (ICLONALG) / Nor Khirda Masri by Masri, Nor Khirda

    Published 2017
    “…This study aims to implement the classification algorithm using the Improved Clonal Selection Algorithm (ICLONALG) to classify the eyesight’s problems. …”
    Get full text
    Get full text
    Thesis
  10. 10
  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
    “…We have chosen four neighborhood based algorithms which are commonly used in optimization problems and divided them in newly implemented and re-implemented category. …”
    Get full text
    Get full text
    Thesis
  12. 12

    A hybrid algorithm for finding shortest path in network routing. by Soltan Aghaei, Mohammad Reza, Ahmad Zulkarnain, Zuriati, Mamat, Ali, Zainuddin, Hishamuddin

    Published 2009
    “…This wave gives an O( N ) steps quantum algorithm for identifying that record, where was used classical Dijkstra’s algorithm for finding shortest path problem in the graph of network and implement quantum search. …”
    Get full text
    Article
  13. 13

    Simulation of shortest path using a-star algorithm / Nurul Hani Nortaja by Nurul Hani , Nortaja

    Published 2004
    “…The steps to calculate a shortest path using A • algorithm is shown by using appropriate examples and related figures. …”
    Get full text
    Get full text
    Thesis
  14. 14

    Optimal path planning algorithm for swarm robots using bat algorithm with mutation (bam) by Lim, Pei Yee

    Published 2022
    “…However, there is still room for improvement such as implementing the obstacle avoidance algorithm into swarm robot. …”
    Get full text
    Get full text
    Undergraduates Project Papers
  15. 15

    Faculty timetabling using genetic algorithm by Liong, Boon Yaun

    Published 2011
    “…Faculty Timetabling using Genetic Algorithm (FTGA) is an application that generate optimum timetable for faculty.The target user of this application is faculty staff who responsible in generate timetable.The problem statement of the project is many clashing exist in the timetable.Faculty staff needs to solve the clashing manually.This will waste time and it is a problem for staff to solve the clashing.By implement GA,clashing will be reduced.The objective of the project is to develop aprototype in scheduling application for generates an optimum timetable for a faculty.Genetic algorithm will be implemented.The scope of FTGA is Faculty of Computer Systems & Software Engineering (FCSSE).The methodology use in this project is prototype model.The testing result show 95 out of 100 test cases achieved the maximum fitness value which means there is no clashing in the timetable.The maximum generation is set to 15 generation.Population for each generation is 3 populations.Percentage of FTGA solve the problem is 95%.…”
    Get full text
    Get full text
    Undergraduates Project Papers
  16. 16

    Garbage truck staff duty roster using genetic algorithm / Nadea Suneeza Zulkifli by Zulkifli, Nadea Suneeza

    Published 2017
    “…This technique is used because studies have shown reasonably good results when genetic algorithms are applied to the staff-scheduling problem. …”
    Get full text
    Get full text
    Thesis
  17. 17

    Comparative implementation of the benchmark Dejong 5 function using flower pollination algorithm and the African buffalo optimization by Odili, Julius Beneoluchi, Noraziah, Ahmad

    Published 2019
    “…We conclude from this study that in implementing FPA and ABO for solving the benchmark Dejong 5 problem, a population of 10 search agents and using 1000 iterations can produce effective and efficient outcomes.…”
    Get full text
    Get full text
    Get full text
    Article
  18. 18

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

    Published 2022
    “…This research aims to model and optimise multi-hole drilling problems using Particle Swarm Optimisation (PSO) algorithm. …”
    Get full text
    Get full text
    Thesis
  19. 19

    An experiment on the performance of shortest path algorithm by Chan, Simon Yew Meng, Adnan, Nur’ayuni, Sukri, Syazwan Syafiqah, Wan Zainon, Wan Mohd Nazmee

    Published 2016
    “…Shortest path algorithms are one of the main algorithms used in most navigation system. …”
    Get full text
    Get full text
    Get full text
    Conference or Workshop Item
  20. 20

    An enumerative algorithm for the maximum clique problem by Mustafa, Mamat, Suyudi, M., Sukono, ., Bon, A.T.

    Published 2019
    “…Partial enumerative algorithms are presented for maximum clique problems which are very easy to implement. …”
    Get full text
    Get full text
    Conference or Workshop Item