Search Results - (( using computational modified algorithm ) OR ( basic optimization based algorithm ))

Refine Results
  1. 1

    A novel quasi-oppositional modified Jaya algorithm for multi-objective optimal power flow solution by Warid, Warid, Hizam, Hashim, Mariun, Norman, Abdul Wahab, Noor Izzri

    Published 2018
    “…An intelligence strategy called quasi-oppositional based learning is incorporated into the proposed algorithm to enhance its convergence property, exploration capability, and solution optimality. …”
    Get full text
    Get full text
    Get full text
    Article
  2. 2

    Fuzzy adaptive teaching learning-based optimization for solving unconstrained numerical optimization problems by Din, Fakhrud, Khalid, Shah, Fayaz, Muhammad, Gwak, Jeonghwan, Kamal Z., Zamli, Mashwani, Wali Khan

    Published 2022
    “…The performance of the fuzzy adaptive teaching learning-based optimization is evaluated against other metaheuristic algorithms including basic teaching learning-based optimization on 23 unconstrained global test functions. …”
    Get full text
    Get full text
    Get full text
    Article
  3. 3

    Integration of enchanced jump point search (JPS) algorithm with modified bresenham technique for path planning in virtual grid-based environment by Nurul Atikah Janis

    Published 2018
    “…We demonstrate our framework; the integration of enhanced Jump Point Search algorithm with modified Bresenham for heuristic computation in virtual grid-based environment. …”
    Get full text
    Get full text
    Get full text
    Thesis
  4. 4

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

    Published 2009
    “…Computational results, for a test set consisting of 73 unconstrained optimization problems, show that the proposed algorithm is very encouraging. …”
    Get full text
    Get full text
    Get full text
    Article
  5. 5

    Hybrid-discrete multi-objective particle swarm optimization for multi-objective job-shop scheduling by Anuar, Nurul Izah

    Published 2022
    “…This research first proposes an improved continuous MOPSO to address the rapid clustering problem that exists in the basic PSO algorithm using three improvement strategies: re-initialization of particles, systematic switch of best solutions and mutation on global best selection. …”
    Get full text
    Get full text
    Get full text
    Get full text
    Thesis
  6. 6

    Parametric modelling of a TRMS using dynamic spread factor particle swarm optimisation by Toha, Siti Fauziah, Abd Latiff, I., Mohamad, M., Tokhi, M Osman

    Published 2009
    “…In this paper, a sound approach for a Twin Rotor Multi-input Multi-Output System (TRMS) parametric modeling is proposed based on dynamic spread factor particle swarm optimization. …”
    Get full text
    Get full text
    Get full text
    Proceeding Paper
  7. 7

    Power System State Estimation In Large-Scale Networks by NURSYARIZAL MOHD NOR, NURSYARIZAL

    Published 2010
    “…The gain and the Jacobian matrices associated with the basic algorithm require large storage and have to be evaluated at every iteration, resulting in more computation time. …”
    Get full text
    Get full text
    Thesis
  8. 8

    Classification of herbs plant diseases via hierachical dynamic artificial neural network after image removal using kernel regression framework by Abdullah, Lili Nurliyana, Khalid, Fatimah, Borhan, N.M.

    Published 2011
    “…This paper is to propose an unsupervised diseases pattern recognition and classification algorithm that is based on a modified Hierarchical Dynamic Artificial Neural Network which provides an adjustable sensitivity-specificity herbs diseases detection and classification from the analysis of noise-free colored herbs images. …”
    Get full text
    Get full text
    Article
  9. 9
  10. 10

    Classification of herbs plant diseases via hierarchical dynamic artificial neural network by Abdullah, Lili Nurliyana, Khalid, Fatimah, Borhan, N.M.

    Published 2010
    “…This paper is to propose an unsupervised diseases pattern recognition and classification algorithm that is based on a modified Hierarchical Dynamic Artificial Neural Network which provides an adjustable sensitivity-specificity herbs diseases detection and classification from the analysis of noise-free colored herbs images. …”
    Get full text
    Get full text
    Article
  11. 11

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

    Published 2017
    “…In the proposed novel QOJaya algorithm, an intelligence strategy, namely, quasi-oppositional based learning (QOBL) is incorporated into the basic Jaya algorithm to enhance its convergence speed and solution optimality. …”
    Get full text
    Get full text
    Thesis
  12. 12
  13. 13
  14. 14
  15. 15

    Voting algorithms for large scale fault-tolerant systems by Karimi, Abbas

    Published 2011
    “…To solve this problem and gain benefits of this algorithm, we employed parallel algorithm technique and by using optimal number of processors, we could propose optimal algorithms known as Parallel Average Voting and Parallel Weighted Average Voting which both have optimal time complexity and less calculation cost. …”
    Get full text
    Get full text
    Thesis
  16. 16

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

    Optimized clustering with modified K-means algorithm by Alibuhtto, Mohamed Cassim

    Published 2021
    “…In order to obtain the optimum number of clusters and at the same time could deal with correlated variables in huge data, modified k-means algorithm was proposed. The proposed algorithm utilised a distance measure to compute the between groups’ separation to accelerate the process of identifying an optimal number of clusters using k-means. …”
    Get full text
    Get full text
    Get full text
    Get full text
    Thesis
  18. 18
  19. 19
  20. 20