Search Results - (( problem solving system algorithm ) OR ( java applications optimization algorithm ))

Refine Results
  1. 1

    Parallel distributed genetic algorithm development based on microcontrollers framework by Krishnan P.S., Kiong T.S., Koh J.

    Published 2023
    “…Genetic algorithms are powerful optimizing techniques that are used successfully to solve problems in many different disciplines. …”
    Conference paper
  2. 2
  3. 3

    Performance evaluation of real-time multiprocessor scheduling algorithms by Alhussian, H., Zakaria, N., Abdulkadir, S.J., Fageeri, S.O.

    Published 2016
    “…These results suggests that optimal algorithms may turn to be non-optimal when practically implemented, unlike USG which reveals far less scheduling overhead and hence could be practically implemented in real-world applications. …”
    Get full text
    Get full text
    Conference or Workshop Item
  4. 4

    Solving Economic Dispatch Problems Utilizing Cuckoo Search Algorithm by M. H., Sulaiman, Mohd Rusllim, Mohamed

    Published 2014
    “…This paper presents one of the latest nature-inspired meta-heuristics algorithms, namely Cuckoo Search (CS) algorithm to solve economic dispatch (ED) problems in power system. …”
    Get full text
    Get full text
    Get full text
    Conference or Workshop Item
  5. 5

    Solving economic load dispatch problem using genetic algorithm method / Norliza Kamarulzaman by Kamarulzaman, Norliza

    Published 2009
    “…This thesis studies an approach to solve economic load dispatch problem on operation of power systems. …”
    Get full text
    Get full text
    Thesis
  6. 6

    Ant colony optimization in dynamic environments by Chen, Fei Huang

    Published 2010
    “…In order to achieve this objective, six ant algorithms namely Ant System (AS), Ant Colony System (ACS), Best-Worst Ant System (BWAS), Elitist Ant System (EAS), Max-Min Ant System (MMAS) and Rank-Based Ant System (RBAS) were implemented to solve a dynamic optimization problem in the form of the dynamic Traveling Salesman Problem (TSP). …”
    Get full text
    Get full text
    Get full text
    Thesis
  7. 7

    Shuffled Frog Leaping Algorithm (SFLA) for solving profit based unit commitment problem / Nurul Izzati Mohd Hanapiah by Mohd Hanapiah, Nurul Izzati

    Published 2016
    “…This thesis presents the Shuffled Frog Leaping Algorithm (SFLA) technique is used to solve the Profit Based Unit Commitment Problem (PBUCP). …”
    Get full text
    Get full text
    Thesis
  8. 8

    Levy tunicate swarm algorithm for solving numerical and real-world optimization problems by J. J., Jui, M. A., Ahmad, M. I. M., Rashid

    Published 2022
    “…The proposed Levy Tunicate Swarm Algorithm (LTSA) is a novel metaheuristic algorithm that integrates the Levy distribution into a new metaheuristic algorithm called Tunicate Swarm Algorithm (TSA) to solve numerical and real-world optimization problems. …”
    Get full text
    Get full text
    Get full text
    Conference or Workshop Item
  9. 9

    Artificial bee colony algorithm for solving optimal power flow problem by Le Dinh, L., Vo Ngoc, D., Vasant, P.

    Published 2013
    “…This paper proposes an artificial bee colony (ABC) algorithm for solving optimal power flow (OPF) problem. …”
    Get full text
    Get full text
    Article
  10. 10

    Route Optimization System by Zulkifli, Abdul Hayy

    Published 2005
    “…After much research into the many algorithms available, and considering some, including Genetic Algorithm (GA), the author selected Dijkstra's Algorithm (DA). …”
    Get full text
    Get full text
    Final Year Project
  11. 11

    Shuffled frog leaping algorithm for solving economic load dispatch problem / Mohammad Ariffin Aizat Ezanee by Ezanee, Mohammad Ariffin Aizat

    Published 2015
    “…Shuffled Frog Leaping Algorithm (SFLA) is proposed to solve Economic Load Dispatch (ELD) problem. …”
    Get full text
    Get full text
    Thesis
  12. 12
  13. 13

    An enhanced swap sequence-based particle swarm optimization algorithm to solve TSP by Bibi Aamirah Shafaa Emambocus, Muhammed Basheer Jasser, Muzaffar Hamzah, Aida Mustapha, Angela Amphawan

    Published 2021
    “…Since there is no known polynomial-time algorithm for solving large scale TSP, metaheuristic algorithms such as Ant Colony Optimization (ACO), Bee Colony Optimization (BCO), and Particle Swarm Optimization (PSO) have been widely used to solve TSP problems through their high quality solutions. …”
    Get full text
    Get full text
    Get full text
    Get full text
    Get full text
    Article
  14. 14

    An Application of Cuckoo Search Algorithm for Solving Optimal Chiller Loading Problem for Energy Conservation by M. H., Sulaiman, Muhammad Ikram, Mohd Rashid, Mohd Rusllim, Mohamed, Omar, Aliman, Hamdan, Daniyal

    Published 2014
    “…On the other hand, CSA is a one of well-known swarm intelligence techniques that has been used to solve many optimization problems. In order to show the effectiveness of CSA in solving OCL problem, a case study with six-chiller system is considered. …”
    Get full text
    Conference or Workshop Item
  15. 15

    Ant colony optimization algorithm for dynamic scheduling of jobs in computational grid by Ku-Mahamud, Ku Ruhana, Ramli, Razamin, Yusof, Yuhanis, Mohamed Din, Aniza, Mahmuddin, Massudi

    Published 2012
    “…In computational grid, job scheduling is one of the main factors affecting grid computing performance. Job scheduling problem is classified as an NP-hard problem.Such a problem can be solved only by using approximate algorithms such as heuristic and meta-heuristic algorithms.Among different optimization algorithms for job scheduling, ant colony system algorithm is a popular meta-heuristic algorithm which has the ability to solve different types of NP-hard problems.However, ant colony system algorithm has a deficiency in its heuristic function which affects the algorithm behavior in terms of finding the shortest connection between edges.This research focuses on a new heuristic function where information about recent ants’ discoveries has been considered.The new heuristic function has been integrated into the classical ant colony system algorithm.Furthermore, the enhanced algorithm has been implemented to solve the travelling salesman problem as well as in scheduling of jobs in computational grid.A simulator with dynamic environment feature to mimic real life application has been development to validate the proposed enhanced ant colony system algorithm. …”
    Get full text
    Get full text
    Monograph
  16. 16

    An improved adaptive shuffled frog leaping algorithm to solve various non smooth economic dispatch problems in power system / Mohamad Helmi Muhamad Izham by Muhamad Izham, Mohamad Helmi

    Published 2016
    “…This thesis discusses the solution of Economic Dispatch (ED) problems which is to minimize the total cost of generation in power system operation by using an improved adaptive shuffled frog leaping algorithm (lASFLA). …”
    Get full text
    Get full text
    Thesis
  17. 17

    Solving optimal power flow problem with stochastic wind–solar–small hydro power using barnacles mating optimizer by Mohd Herwan, Sulaiman, Zuriani, Mustaffa

    Published 2021
    “…Optimal Power Flow (OPF) is a complex and challenging problem in power system that includes non-convex and non-linear constrained optimization problems. …”
    Get full text
    Get full text
    Get full text
    Get full text
    Article
  18. 18

    Application of Krylov Subspace methods for solving Continuous Power Flow problem in voltage stability analysis of power system by Jasni, Jasronita

    Published 2010
    “…The CPF algorithm has also been found to fail for a system which has a very sharp turning point for the solution curve which can drag the system to have convergence problem. …”
    Get full text
    Get full text
    Thesis
  19. 19

    Enhancement of Ant System Algorithm for Course Timetabling Problem by Djamarus, Djasli

    Published 2009
    “…As a member of the NP Problem, an exact algorithm to solve the course scheduling problem is not available to date. …”
    Get full text
    Get full text
    Get full text
    Thesis
  20. 20