Search Results - (( basic optimization method algorithm ) OR ( using computer modified algorithm ))

Refine Results
  1. 1

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

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

    Hybrid artificial bee colony algorithm with branch and bound for two–sided assembly line balancing by Elteriki, Salem Abdulsalam

    Published 2018
    “…Nevertheless, the ABC is also known to be a slow converging method in achieving an optimal solution. This research is intended to improve the ABC performance in solving the 2SALB problem with the objectives to hybrid ABC algorithm with branch and bound concept and to evaluate the performance of this algorithm in minimizing idle time and number of the workstation . …”
    Get full text
    Get full text
    Get full text
    Get full text
    Thesis
  4. 4

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

    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
    “…The proposed method formulates a modified inertia weight algorithm by using a dynamic spread factor (SF). …”
    Get full text
    Get full text
    Get full text
    Proceeding Paper
  6. 6
  7. 7

    Particle swarm optimization (PSO) for CNC route problem by Nur Azia Azwani, Ismail

    Published 2002
    “…We often see many of the method of Genetic Algorithm (GA), Ant Colony Optimization (ACO), Simulated Annealing Algorithm (SAA) and PSO are used for any optimization problems. …”
    Get full text
    Get full text
    Undergraduates Project Papers
  8. 8

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

    Published 2017
    “…Meanwhile, the proposed QOJaya algorithm produces better results than the basic Jaya method in terms of solution optimality and convergence speed. …”
    Get full text
    Get full text
    Thesis
  9. 9

    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
  10. 10
  11. 11

    Using Electromagnetism-like algorithm and genetic algorithm to optimize time of task scheduling for dual manipulators by Abed I.A., Sahari K.S.M., Koh S.P., Tiong S.K., Jagadeesh P.

    Published 2023
    “…A method based on Electromagnetism-Like algorithm (EM) and Genetic Algorithm (GA) is proposed to determine the time-optimal task scheduling for dual robot manipulators. …”
    Conference paper
  12. 12
  13. 13
  14. 14

    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
  15. 15
  16. 16

    Improved Multi-Verse Optimizer In Text Document Clustering For Topic Extraction by Abasi, Ammar Kamal Mousa

    Published 2021
    “…Second, three multi-verse optimizer algorithm (MVOs), namely, basic MVO, modified MVO, hybrid MVO is proposed to solve the TDC problem; these algorithms are incremental improvements of the preceding versions. …”
    Get full text
    Get full text
    Thesis
  17. 17

    Synthesis of transistor chaining algorithm for CMOS cell layout using euler path / Sukri Hanafiah by Hanafiah, Sukri

    Published 1997
    “…After discussing about the introduction (the basic of CMOS transistor ), we will discuss how to create the Optimal layout of CMOS Functional Array with the minimum separation based on euler path method. …”
    Get full text
    Get full text
    Thesis
  18. 18
  19. 19
  20. 20