Search Results - (( basic optimization _ algorithm ) OR ( using factor problem algorithm ))

Refine Results
  1. 1

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

    Published 2017
    “…Finally, two novel hybrid optimization algorithms namely, FLP-QOJaya algorithm for single objective OPF problems and MFLP-QOMJaya algorithm for MOOPF problems are proposed. …”
    Get full text
    Get full text
    Thesis
  2. 2

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

    A study on the parameter selection of bat algorithm in in optimizing parameters in camera auto calibration problem by Mohd Said, Rahaini, A Aziz, Khairul Azha, Zainal Abidin, Amar Faiz, Mat Jizat, Jessnor Arif, Mohd Khairuddin, Ismail, Widiyanto, Sigit, Abdul Waduth, Mohamed Faisal

    Published 2022
    “…Each bat in the Bat Algorithm represents a potential solution to the issue, and each dimension in the Bat Algorithm's search space represents one of the basic parameters: skew, focal length, and magnification factor. …”
    Get full text
    Get full text
    Get full text
    Article
  5. 5
  6. 6

    Image watermarking optimization algorithms in transform domains and feature regions by Tao, Hai

    Published 2012
    “…The achieved tradeoffs from these techniques between imperceptibility and robustness are controversial.To solve this problem,this study proposes the application of artificial intelligent techniques into digital watermarking by using discrete wavelet transform (DWT) and singular value decomposition (SVD).To protect the copyright information of digital images,the original image is decomposed according to two-dimensional discrete wavelet transform.Subsequently the preprocessed watermark with an affined scrambling transform is embedded into the vertical subband (HLm) coefficients in wavelet domain without compromising the quality of the image.The scaling factors are trained with the assistance of Particle Swarm Optimization (PSO).A new algorithmic framework is used to forecast feasibility of hypothesized watermarked images.In addition,the novelty is to associate the Hybrid Particle Swarm Optimization (HPSO),instead of a single optimization,as a model with SVD.To embed and extract the watermark,the singular values of the blocked host image are modified according to the watermark and scaling factors. …”
    Get full text
    Get full text
    Thesis
  7. 7

    Improving Attentive Sequence-to-Sequence Generative-Based Chatbot Model Using Deep Neural Network Approach by Wan Solehah, Wan Ahmad

    Published 2022
    “…The strategies applied showed that the final accuracy obtained through the training after implementing a modification in the algorithm is at 81% accuracy rate compared to the basic model that recorded its final accuracy at 79% accuracy rate. …”
    Get full text
    Get full text
    Get full text
    Get full text
    Thesis
  8. 8

    Solving power system state estimation using orthogonal decomposition algorithm / Tey Siew Kian by Tey, Siew Kian

    Published 2009
    “…This optimal state estimate and corrected data base are then used by the security monitoring and operation and control functions of the center.Most state estimation programs in practical use are formulated as overdetermined systems (Pozrikidis, 2008) of nonlinear equations and solved as weighted least square problems (refer to section 2.1.1).This research involves finding the least squares solution of the power system state estimation problem, HTR-1HDx = HTR-1 [z - f (x)] (refer to section 2.3.1) and to develop a program to implement the said algorithm. …”
    Get full text
    Get full text
    Get full text
    Get full text
    Get full text
    Get full text
    Get full text
    Get full text
    Get full text
    Get full text
    Get full text
    Get full text
    Get full text
    Get full text
    Get full text
    Get full text
    Get full text
    Get full text
    Get full text
    Get full text
    Get full text
    Get full text
    Get full text
    Get full text
    Get full text
    Thesis
  9. 9

    Basic firefly algorithm for document clustering by Mohammed, Athraa Jasim, Yusof, Yuhanis, Husni, Husniza

    Published 2015
    “…To address the shortcoming, this paper proposes a Basic Firefly (Basic FA) algorithm to cluster text documents.The algorithm employs the Average Distance to Document Centroid (ADDC) as the objective function of the search. …”
    Get full text
    Get full text
    Conference or Workshop Item
  10. 10

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

    Published 2002
    “…The algorithm used in this project is the Global Best (gbest) algorithm where it is a basic algorithm of Particle Swarm Optimization which applicable the shortest time and path of CNC machine to complete the process of drilling. …”
    Get full text
    Get full text
    Undergraduates Project Papers
  11. 11

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

    Public healthcare facility planning in Malaysia : Using location allocation models / S. Sarifah Radiah Shariff by S. Sarifah Radiah, Shariff

    Published 2012
    “…Two basic location allocation models with two different objectives are studied: The p-median problem and the Maximal Covering Location Problem (MCLP). …”
    Get full text
    Get full text
    Get full text
    Get full text
    Get full text
    Get full text
    Get full text
    Get full text
    Thesis
  13. 13

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

    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
    “…This algorithm synergizes the ABC algorithm and Artificial Rabbits Optimization (ARO) algorithm. …”
    Get full text
    Get full text
    Get full text
    Conference or Workshop Item
  18. 18

    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
    “…Significant modifications to the basic Jaya algorithm are done to create a modified Jaya (MJaya) algorithm that can handle the MOOPF problem. …”
    Get full text
    Get full text
    Get full text
    Article
  19. 19

    Convergence Analysis of the African Buffalo Optimization Algorithm by Odili, Julius Beneoluchi, M. N. M., Kahar, Noraziah, Ahmad

    Published 2016
    “…The analysis of the convergence of Nature-inspired optimization algorithms is necessary to help researchers and practitioners understand the workings of the algorithms in the algorithms’ attempts at solutions. …”
    Get full text
    Get full text
    Get full text
    Article
  20. 20

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

    Published 1997
    “…The euler's path it using pseudo input and Heuristic algorithm to find the minimum interlace. The comparison between euler's path and Bipartite graph Algorithm [14] will be made at the end this of this report to see which one give optimal chaining .…”
    Get full text
    Get full text
    Thesis