Search Results - (( program validation using algorithm ) OR ( parameter optimization max algorithm ))

Refine Results
  1. 1

    Reactive approach for automating exploration and exploitation in ant colony optimization by Allwawi, Rafid Sagban Abbood

    Published 2016
    “…Ant colony optimization (ACO) algorithms can be used to solve nondeterministic polynomial hard problems. …”
    Get full text
    Get full text
    Get full text
    Thesis
  2. 2

    Ant colony optimization in dynamic environments by Chen, Fei Huang

    Published 2010
    “…The last objective of this thesis is to optimize the parameter settings of the best performing ant algorithm with local search. …”
    Get full text
    Get full text
    Get full text
    Thesis
  3. 3

    Improvement of Centralized Routing and Scheduling Using Cross-Layer Design and Multi-Slot Assignment in Wimax Mesh Networks by Al-Humairi, Ali Zuhair Abdulameer

    Published 2009
    “…This thesis proposes an optimized strategy namely cross-layer design in routing algorithms used find the best route for all SSs and scheduling algorithms, used to assign a time slot for each possible node transmission. …”
    Get full text
    Get full text
    Thesis
  4. 4

    Prediction and multi-criteria-based schemes for seamless handover mechanism in mobile WiMAX networks by Mubarak, Mohammed Awadh Ahmed Ben

    Published 2013
    “…It reduces the number of handovers by 29.7% and 26.9%, respectively, compared to the conventional RSSI based handover algorithm and the previous worked, mobility improved handover (MIHO) algorithm. …”
    Get full text
    Get full text
    Thesis
  5. 5

    Electric vehicle battery state of charge estimation using metaheuristic-optimized CatBoost algorithms by Mohd Herwan, Sulaiman, Zuriani, Mustaffa, Ahmad Salihin, Samsudin, Amir Izzani, Mohamed, Mohd Mawardi, Saari

    Published 2025
    “…A comprehensive data preprocessing pipeline was implemented, including missing value treatment, outlier removal, and feature normalization using Min-Max scaling. Three distinct metaheuristic algorithms were investigated: Barnacles Mating Optimizer (BMO), Particle Swarm Optimization (PSO), Genetic Algorithm (GA), and Whale Optimization Algorithm (WOA), each integrated with CatBoost to optimize critical parameters including learning rate, tree depth, regularization, and bagging temperature. …”
    Get full text
    Get full text
    Get full text
    Article
  6. 6
  7. 7
  8. 8

    Design Optimization of a Gas Turbine Engine for Marine Applications: Off-Design Performance and Control System Considerations by Machmudah, A., Lemma, T.A., Solihin, M.I., Feriadi, Y., Rajabi, A., Afandi, M.I., Abbasi, A.

    Published 2022
    “…Meta-heuristic optimizations, namely a genetic algorithm (GA) and a whale optimization algorithm (WOA), are applied to optimize the designed control system. …”
    Get full text
    Get full text
    Article
  9. 9
  10. 10

    DC Motor Control using Ant Colony Optimization by Amr Mansour, Sara

    Published 2011
    “…Since 1995 various other extended versions of AS have been developed, induding Ant Colony System (ACS) and MAX-MIN Ant System (MMAS). In 1999 Dorigo proposed the Ant Colony Optimization (ACO) meta-heuristic that became the most successful and recognized algorithm based on ant behaviour [1]. …”
    Get full text
    Get full text
    Final Year Project
  11. 11
  12. 12
  13. 13

    Robust PID anti-swing control of automatic gantry crane based on Kharitonov's stability by Solihin, Mahmud Iwan, Martono, Wahyudi, Legowo, Ari, Akmeliawati, Rini

    Published 2009
    “…The proposed method employs Genetic Algorithm (GA) in min-max optimization to find the stable robust PID. …”
    Get full text
    Get full text
    Get full text
    Proceeding Paper
  14. 14

    Improving neural networks training using experiment design approach by Chong, Wei Kean

    Published 2005
    “…There are several methods of selecting training data from input space for neural networks which include D-optimal and Max-min design approaches. Consider a function approximation problem (Neural Network using Radial Basic Function structure) and limit the amount of training data, say (m) from N amount of possible data. …”
    Get full text
    Get full text
    Thesis
  15. 15

    A multi-depot vehicle routing problem with stochastic road capacity and reduced two-stage stochastic integer linear programming models for rollout algorithm by Anuar, Wadi Khalid, Lee, Lai Soon, Seow, Hsin Vonn, Pickl, Stefan

    Published 2021
    “…Then an extension, MDVRPSRC-2S, is presented as an offline two-stage SILP model of the MDDVRPSRC. These models are validated using small simulated instances with CPLEX. …”
    Get full text
    Get full text
    Article
  16. 16
  17. 17

    Solving Sudoku puzzles in Binary Integer Linear Programming using Branch and Bound algorithm / Ahida Waliyyah Ahmad Fuad by Ahmad Fuad, Ahida Waliyyah

    Published 2024
    “…This study explores the application of a Binary Integer Linear Programming (BILP) model combined with the Branch and Bound (B&B) algorithm to solve Sudoku puzzles. …”
    Get full text
    Get full text
    Thesis
  18. 18

    Augmentation of basic-line-search and quick-simplex-method algorithms to enhance linear programming computational performance by Nor Azlan, Nor Asmaa Alyaa

    Published 2021
    “…Whereas, the validation from the real-world of the two datasets showed that the new augmentation algorithm steadily producing lesser iteration number compared to the conventional Simplex, QSM and BLSA algorithms. …”
    Get full text
    Get full text
    Get full text
    Get full text
    Thesis
  19. 19

    Optimization of hydropower reservoir system using genetic algorithm for various climatic scenarios by Tayebiyan, Aida

    Published 2015
    “…In order to increase the system efficiency and maximize the power generation, constructed operation models were optimized. To determine the optimum solution in each policy, real coded genetic algorithm is used as an optimization technique. …”
    Get full text
    Get full text
    Get full text
    Thesis
  20. 20

    Optimizing Visual Surveillance Sensor Coverage Using Dynamic Programming by Altahir, A.A., Asirvadam, V.S., Hamid, N.H.B., Sebastian, P., Saad, N.B., Ibrahim, R.B., Dass, S.C.

    Published 2017
    “…To validate the proposed algorithm, we compared the outcomes of the dynamic programming algorithm with the existing benchmarking placement optimization techniques. …”
    Get full text
    Get full text
    Article