Search Results - (( problem solving modified algorithm ) OR ( java application using algorithm ))

Refine Results
  1. 1

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

    Published 2016
    “…A modified adaptive bats sonar algorithm is then proposed for solving constrained optimisation problems. …”
    Get full text
    Get full text
    Thesis
  2. 2

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

    Published 2017
    “…The proposed algorithm is applied to solve the constrained optimisation problems coupled with penalty function method as constraint handling technique. …”
    Get full text
    Get full text
    Get full text
    Article
  3. 3

    Modified adaptive bats sonar algorithm with doppler effect mechanism for solving single objective unconstrained optimization problems by N. A., Azlan, Nafrizuan, Mat Yahya

    Published 2019
    “…The comparative study has shown that MABSA-DE outperforms the original algorithm, and thus, it can be an efficient alternative method in solving single objective unconstrained optimization problems.…”
    Get full text
    Get full text
    Conference or Workshop Item
  4. 4

    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
  5. 5

    Path Optimization For Cooperative Multi-Head 3d Printing by Cheong, Kah Jun

    Published 2020
    “…Therefore, to solve the LPOP, two algorithms are proposed, the modified AS algorithm and the modified ACS algorithm. …”
    Get full text
    Get full text
    Final Year Project / Dissertation / Thesis
  6. 6
  7. 7

    Modified multi verse optimizer for solving optimization problems using benchmark functions by Jui, Julakha Jahan, Mohd Ashraf, Ahmad, Muhammad Ikram, Mohd Rashid

    Published 2020
    “…Firstly, an average position selection mechanism is proposed for solving the local optima problem and secondly, the MVO algorithm is hybrid with another metaheuristics algorithm namely the Sine Cosine Algorithm (SCA) for better balancing the exploration and exploitation of standard MVO algorithm so that it can improve its searching capability. …”
    Get full text
    Get full text
    Get full text
    Conference or Workshop Item
  8. 8
  9. 9

    Performance evaluation of heuristic methods in solving symmetric travelling salesman problems by Lim, Yai-Fung, Hong, Pei Yee, Ramli, Razamin, Khalid, Ruzelan, Baten, Md Azizul

    Published 2016
    “…The algorithms proposed in this study should be considered in solving symmetric travelling salesman problems.…”
    Get full text
    Get full text
    Get full text
    Article
  10. 10

    Modified Firefly Algorithm in Solving Economic Dispatch Problems with Practical Constraints by M. H., Sulaiman

    Published 2012
    “…This paper presents a modified Firefly Algorithm (MFA) for solving economic dispatch (ED) problems. …”
    Get full text
    Get full text
    Conference or Workshop Item
  11. 11

    Hybridization of modified sine cosine algorithm with tabu search for solving quadratic assignment problem by Nurdiyana, Jamil

    Published 2022
    “…Sine Cosine Algorithm (SCA) is a population-based metaheuristic method that widely used to solve various optimization problem due to its ability in stabilizing between exploration and exploitation. …”
    Get full text
    Get full text
    Thesis
  12. 12
  13. 13
  14. 14

    Modifying maximum likelihood test for solving singularity and outlier problems in high dimensional cases by Hafeez, Ahmad

    Published 2021
    “…However, the performance of the classical location and scatter estimators is usually flawed by singularity and outliers’ problems in high dimensional data sets. The study aimed to modify the existing ML test by incorporating the Cholesky banded regularization methods and thresholding sample covariance matrix to resolve singularity problems and incorporating the L₁-median with Weiszfeld’s algorithm (MLw) covariance matrix to solve outliers’ problem in high dimensional data sets. …”
    Get full text
    Get full text
    Get full text
    Get full text
    Thesis
  15. 15

    Modified multi-verse optimizer for solving numerical optimization problems by Jui, Julakha Jahan, Mohd Ashraf, Ahmad, Muhammad Ikram, Mohd Rashid

    Published 2020
    “…Firstly, an average position selection mechanism is proposed for solving the local optima problem and secondly, the MVO algorithm is hybrid with another metaheuristics algorithm namely the Sine Cosine Algorithm (SCA) for better balancing the exploration and exploitation of standard MVO algorithm so that it can improve its searching capability. …”
    Get full text
    Get full text
    Conference or Workshop Item
  16. 16
  17. 17

    Memoryless modified symmetric rank-one method for large-scale unconstrained optimization by Modarres, Farzin, Abu Hassan, Malik, Leong, Wah June

    Published 2009
    “…In this study, we present a scaled memoryless modified Symmetric Rank-One (SR1) algorithm and investigate the numerical performance of the proposed algorithm for solving large-scale unconstrained optimization problems. …”
    Get full text
    Get full text
    Get full text
    Article
  18. 18

    Modification of the ant colony optimization algorithm for solving multi-agent task allocation problem in agricultural application by Hardhienata, Medria Kusuma Dewi, Priandana, Karlisa, Putra, Daffa Rangga, Sriatun, Mamiek, Wulandari, Buono, Agus, Mohamed, Raihani

    Published 2024
    “…Simulation results showed that the proposed ACO algorithm with the modified efficiency factor improved the performance of basic ACO algorithm for solving task allocation problem in terms of the average total travel cost for each agent. …”
    Get full text
    Get full text
    Get full text
    Article
  19. 19

    Approximate maximum clique algorithm (AMCA): A clever technique for solving the maximum clique problem through near optimal algorithm for minimum vertex cover problem by Fayaz, Muhammad, Arshad,, Shakeel, Shah,, Abdul Salam, Shah, Asadullah

    Published 2018
    “…Background and Objective: The process of solving the Maximum Clique (MC) problem through approximation algorithms is harder, however, the Maximum Vertex Cover (MVC) problem can easily be solved using approximation algorithms. …”
    Get full text
    Get full text
    Get full text
    Get full text
    Article
  20. 20

    Enhancement on the modified artificial bee colony algorithm to optimize the vehicle routing problem with time windows by Sankor, Salah Mortada Shahen

    Published 2022
    “…The Artificial Bee Colony (ABC) is a popular swarm intelligence algorithm for COP. In this study, existing Modified ABC (MABC) algorithm is revised to solve the VRPTW. …”
    Get full text
    Get full text
    Thesis