Search Results - (( problem solving based algorithm ) OR ( java application bee algorithm ))

Search alternatives:

Refine Results
  1. 1
    An enhanced swap sequence-based particle swarm optimization algorithm to solve TSP

    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
    “…Several variants of PSO have been proposed for solving discrete optimization problems like TSP. Among them, the basic algorithm is the Swap Sequence based PSO (SSPSO), however, it does not perform well in providing high quality solutions. …”
    Get full text
    Get full text
    Get full text
    Get full text
    Get full text
    Article
    Save to List
    Saved in:
  2. 2
    A Genetic Algorithm Based Approach for Solving the Minimum Dominating Set of Queens Problem

    A Genetic Algorithm Based Approach for Solving the Minimum Dominating Set of Queens Problem by Alharbi, Saad, Venkat, Ibrahim

    Published 2017
    “…However, literature shows that limited research has been carried out to solve theMDSQP using bioinspired algorithms. To fill this gap, this paper proposes a simple and effective solution based on genetic algorithms to solve this classical problem. …”
    Get full text
    Get full text
    Get full text
    Article
    Save to List
    Saved in:
  3. 3
    Rule-Based Multi-State Gravitational Search Algorithm for Discrete Optimization Problem

    Rule-Based Multi-State Gravitational Search Algorithm for Discrete Optimization Problem by Ismail, Ibrahim, Zuwairie, Ibrahim, Zulkifli, Md. Yusof

    Published 2015
    “…In this study, rule-based multi-state gravitational search algorithm (RBMSGSA) algorithm is proposed to solve discrete combinatorial optimization problems. …”
    Get full text
    Get full text
    Get full text
    Get full text
    Conference or Workshop Item
    Save to List
    Saved in:
  4. 4
    Harmony great deluge for solving curriculum based course timetabling problem

    Harmony great deluge for solving curriculum based course timetabling problem by Wahid, Juliana, Mohd Hussin, Naimah

    Published 2013
    “…University course timetabling which has been determined as non deterministic polynomial problem that accept widely as problem that are intractable.An efficient algorithm does not exist that is guaranteed to find an optimal solution for such problems.The design of good algorithm to find new methods and techniques to solve such problem is a very active area of research.This paper presents the adaption of the hybridizing between harmony search with great deluge algorithm for solving curriculum-based course timetabling problems.The algorithm can be adapted to the problem.Results were not comparatively better than those previously known as best solution.Proper modification in terms of the approach in this algorithm would make the algorithm perform better on curriculum-based course timetabling.…”
    Get full text
    Get full text
    Get full text
    Conference or Workshop Item
    Save to List
    Saved in:
  5. 5
    Simulated Kalman Filter algorithms for solving optimization problems

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

    Published 2019
    “…Applications and improvements to the HKA algorithm suggest that optimization algorithm based on estimation principle has a huge potential in solving a wide variety of optimization problems. …”
    Get full text
    Get full text
    Thesis
    Save to List
    Saved in:
  6. 6
    A Genetic Algorithm Based Approach for Solving the Minimum Dominating Set of Queens Problem

    A Genetic Algorithm Based Approach for Solving the Minimum Dominating Set of Queens Problem by Alharbi, Saad, Venkat, Ibrahim

    Published 2017
    “…However, literature shows that limited research has been carried out to solve theMDSQP using bioinspired algorithms. To fill this gap, this paper proposes a simple and effective solution based on genetic algorithms to solve this classical problem. …”
    Get full text
    Get full text
    Get full text
    Article
    Save to List
    Saved in:
  7. 7
    A Modified Bats Echolocation-Based Algorithm for Solving Constrained Optimisation Problems

    A Modified Bats Echolocation-Based Algorithm for Solving Constrained Optimisation Problems by N. M., Yahya, Tokhi, M. O.

    Published 2017
    Get full text
    Get full text
    Get full text
    Article
    Save to List
    Saved in:
  8. 8
    Bats echolocation-inspired algorithms for global optimisation problems

    Bats echolocation-inspired algorithms for global optimisation problems by Nafrizuan, Mat Yahya

    Published 2016
    “…An adaptive bats sonar algorithm is proposed for solving single objective optimisation problems. …”
    Get full text
    Get full text
    Thesis
    Save to List
    Saved in:
  9. 9
    Shuffled Frog Leaping Algorithm (SFLA) for solving profit based unit commitment problem / Nurul Izzati Mohd Hanapiah

    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
    Save to List
    Saved in:
  10. 10
    Hybridizing harmony search with local search based metaheuristic for solving curriculum based university course timetabling / Juliana Wahid

    Hybridizing harmony search with local search based metaheuristic for solving curriculum based university course timetabling / Juliana Wahid by Wahid, Juliana

    Published 2017
    “…Thus, this thesis proposed hybrid algorithms between HSA and local search based methods (simulated annealing (SA) and/or great deluge (GD)) to enhance the HSA performance for solving curriculum-based course timetabling (CBCTT) problem which is the variant of UCTP. …”
    Get full text
    Get full text
    Thesis
    Save to List
    Saved in:
  11. 11
    Simulated kalman filter with modified measurement, substitution mutation and hamming distance calculation for solving traveling salesman problem

    Simulated kalman filter with modified measurement, substitution mutation and hamming distance calculation for solving traveling salesman problem by Suhazri Amrin, Rahmad, Zuwairie, Ibrahim, Zulkifli, Md. Yusof

    Published 2022
    “…Purpose – The purpose of the research is to solve Travelling Salesman Problem (TSP) using Simulated Kalman Filter (SKF) algorithm and single-solution SKF (ssSKF) algorithm based on numerical ordering technique. …”
    Get full text
    Get full text
    Get full text
    Get full text
    Conference or Workshop Item
    Save to List
    Saved in:
  12. 12
    A fuzzy genetic algorithm based on binary encoding for solving multidimensional knapsack problems

    A fuzzy genetic algorithm based on binary encoding for solving multidimensional knapsack problems by Varnamkhasti, Mohammad Jalali, Lee, Lai Soon

    Published 2012
    Get full text
    Get full text
    Article
    Save to List
    Saved in:
  13. 13
    A hybrid algorithm based on artificial bee colony and artificial rabbits optimization for solving economic dispatch problem

    A hybrid algorithm based on artificial bee colony and artificial rabbits optimization for solving economic dispatch problem by Lee, Wei Wen, Hashim, Mohd Ruzaini

    Published 2023
    Get full text
    Get full text
    Get full text
    Conference or Workshop Item
    Save to List
    Saved in:
  14. 14
    Chaotic Immune Symbiotic Organisms Search algorithm for solving optimisation problem

    Chaotic Immune Symbiotic Organisms Search algorithm for solving optimisation problem by Zamani M.K.M., Musirin I., Suliman S.I., Mustaffa S.A.S.

    Published 2023
    “…Good performance of these heuristics-based algorithm has been implied through various implementation in solving optimisation problems. …”
    Article
    Save to List
    Saved in:
  15. 15
    Finite impulse response optimizers for solving optimization problems

    Finite impulse response optimizers for solving optimization problems by Tasiransurini, Ab Rahman

    Published 2019
    “…Optimization problems are frequently found in various fields. The classification of estimation-based metaheuristic algorithms has been introduced for solving optimization problems. …”
    Get full text
    Get full text
    Thesis
    Save to List
    Saved in:
  16. 16
    Gravitational search – bat algorithm for solving single and bi-objective of non-linear functions

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

    Published 2018
    “…Later, this algorithm was used to solve bi-objective Production Planning (PP) and Scheduling Problem (Sch.P). …”
    Get full text
    Get full text
    Thesis
    Save to List
    Saved in:
  17. 17
    Performance comparison of linear and non-linear great deluge algorithms in solving university course timetabling problems

    Performance comparison of linear and non-linear great deluge algorithms in solving university course timetabling problems by Joe Henry Obit, Yik Junn Kuan, Rayner Alfred

    Published 2017
    “…This research does not focus on hard constraints involved as the initial solution is solved based on Constraint Programming algorithm. …”
    Get full text
    Get full text
    Get full text
    Get full text
    Get full text
    Article
    Save to List
    Saved in:
  18. 18
    Finite impulse response optimizers for solving optimization problems

    Finite impulse response optimizers for solving optimization problems by Ab Rahman, Tasiransurini

    Published 2019
    “…Optimization problems are frequently found in various fields. The classification of estimation-based metaheuristic algorithms has been introduced for solving optimization problems. …”
    Get full text
    Get full text
    Thesis
    Save to List
    Saved in:
  19. 19
    Solving multi-task optimization problems using the sine cosine algorithm

    Solving multi-task optimization problems using the sine cosine algorithm by Kamal Z., Zamli, Kader, Md. Abdul

    Published 2022
    “…More precisely, our work investigates the adoption of partitioned population based on Sine Cosine algorithm for dealing with MTO problem. …”
    Get full text
    Get full text
    Get full text
    Get full text
    Conference or Workshop Item
    Save to List
    Saved in:
  20. 20
    Optimal power flow based on fuzzy linear programming and modified Jaya algorithms

    Optimal power flow based on fuzzy linear programming and modified Jaya algorithms by Alzihaymee, Warid Sayel Warid

    Published 2017
    “…In addition, two novel Jaya-based methods namely, the modified Jaya (MJaya) algorithm and quasi-oppositional modified Jaya (QOMJaya) algorithm are proposed to solve different MOOPF problems. …”
    Get full text
    Get full text
    Thesis
    Save to List
    Saved in:

Search Tools: