Search Results - (( using optimization problem algorithm ) OR ( using function new algorithm ))

Refine Results
  1. 1

    Gravitational search – bat algorithm for solving single and bi-objective of non-linear functions by Abbas, Iraq Tareq

    Published 2018
    “…Later, this algorithm was used to solve bi-objective Production Planning (PP) and Scheduling Problem (Sch.P). …”
    Get full text
    Get full text
    Thesis
  2. 2

    New random approaches of modified adaptive bats sonar algorithm for reservoir operation optimization problems by Nor Shuhada, Ibrahim

    Published 2024
    “…The increasing interest among researchers in the application of metaheuristic algorithms for search optimization has resulted in notable progress, especially in tackling single objective optimization problems. …”
    Get full text
    Get full text
    Thesis
  3. 3

    Improved stochastic gradient descent algorithm with mean-gradient adaptive stepsize for solving large-scale optimization problems by Zulkifli, Munierah, Abd Rahmin, Nor Aliza, Wah, June Leong

    Published 2023
    “…Stochastic gradient descent (SGD) is one of the most common algorithms used in solving large unconstrained optimization problems. …”
    Get full text
    Get full text
    Get full text
    Article
  4. 4

    A discrete simulated kalman filter optimizer for combinatorial optimization problems by Suhazri Amrin, Rahmad

    Published 2022
    “…Two types of analysis are used to evaluate the proposed algorithm. First, the DSKFO algorithm is used to solve the travelling salesman problem (TSP), and then the algorithm's execution time is measured. …”
    Get full text
    Get full text
    Thesis
  5. 5
  6. 6

    Ant colony optimization algorithm for dynamic scheduling of jobs in computational grid by Ku-Mahamud, Ku Ruhana, Ramli, Razamin, Yusof, Yuhanis, Mohamed Din, Aniza, Mahmuddin, Massudi

    Published 2012
    “…In computational grid, job scheduling is one of the main factors affecting grid computing performance. Job scheduling problem is classified as an NP-hard problem.Such a problem can be solved only by using approximate algorithms such as heuristic and meta-heuristic algorithms.Among different optimization algorithms for job scheduling, ant colony system algorithm is a popular meta-heuristic algorithm which has the ability to solve different types of NP-hard problems.However, ant colony system algorithm has a deficiency in its heuristic function which affects the algorithm behavior in terms of finding the shortest connection between edges.This research focuses on a new heuristic function where information about recent ants’ discoveries has been considered.The new heuristic function has been integrated into the classical ant colony system algorithm.Furthermore, the enhanced algorithm has been implemented to solve the travelling salesman problem as well as in scheduling of jobs in computational grid.A simulator with dynamic environment feature to mimic real life application has been development to validate the proposed enhanced ant colony system algorithm. …”
    Get full text
    Get full text
    Monograph
  7. 7

    Solving 0/1 Knapsack Problem Using Hybrid HS and Jaya Algorithms by Alomoush, Alaa A., Alsewari, Abdulrahman A., Alamri, Hammoudeh S., Kamal Z., Zamli

    Published 2018
    “…In this research, a new hybrid algorithm of Harmony search and Jaya search algorithms applied on 0/1 Knapsack problem to find a near optimal results. …”
    Get full text
    Get full text
    Get full text
    Get full text
    Article
  8. 8
  9. 9

    Levy slime mould algorithm for solving numerical and engineering optimization problems by J. J., Jui, M. A., Ahmad, M. I. M., Rashid

    Published 2022
    “…One classical engineering problem known as the welded beam structure problem is used to test the proposed LSMA algorithm's efficacy. …”
    Get full text
    Get full text
    Get full text
    Conference or Workshop Item
  10. 10

    Levy tunicate swarm algorithm for solving numerical and real-world optimization problems by J. J., Jui, M. A., Ahmad, M. I. M., Rashid

    Published 2022
    “…The proposed Levy Tunicate Swarm Algorithm (LTSA) is a novel metaheuristic algorithm that integrates the Levy distribution into a new metaheuristic algorithm called Tunicate Swarm Algorithm (TSA) to solve numerical and real-world optimization problems. …”
    Get full text
    Get full text
    Get full text
    Conference or Workshop Item
  11. 11

    Development and applications of metaheuristic algorithms in engineering design and structural optimization / Ali Sadollah by Ali, Sadollah

    Published 2013
    “…The efficiency of the proposed optimizers was evaluated using numerous well-known unconstrained and constrained benchmark functions which have been widely used in literature. …”
    Get full text
    Get full text
    Thesis
  12. 12

    Comparative Performance Analysis of Bat Algorithm and Bacterial Foraging Optimization Algorithm using Standard Benchmark Functions by Mazlina, Abdul Majid, Alsariera, Yazan A., Alamri, Hammoudeh S., Nasser, Abdullah M., Kamal Z., Zamli

    Published 2014
    “…Owing to the fact that they are new and much of their relative performance are still unknown (as compared to other established meta-heuristic algorithms), Bacterial Foraging Optimization Algorithm (BFO) and Bat Algorithm (BA) have been adopted for comparison using the 12 selected benchmark functions. …”
    Get full text
    Get full text
    Conference or Workshop Item
  13. 13

    Binary whale optimization algorithm with logarithmic decreasing time-varying modified sigmoid transfer function for descriptor selection problem by Yusof, Norfadzlia Mohd, Muda, Azah Kamilah, Pratama, Satrya Fajri, Carbo-Dorca, Ramon, Abraham, Ajith

    Published 2023
    “…The new Binary Whale Optimization Algorithm is integrated with wrapper feature selection and validated on descriptor selection problem to improve Amphetamine-type stimulants drug classification result. …”
    Get full text
    Get full text
    Get full text
    Conference or Workshop Item
  14. 14

    Optimised Crossover Genetic Algorithms for Combinatorial Optimisation Problems by Nazif, Habibeh

    Published 2010
    “…This thesis focuses on the development of a new stream of crossover within genetic algorithms, called Optimised Crossover Genetic Algorithm (OCGA) for solving combinatorial optimisation problems, which takes into account the objective function in finding the best ofspring solution among an exponentially large number of potential ofspring. …”
    Get full text
    Get full text
    Thesis
  15. 15
  16. 16

    New heuristic function in ant colony system for the travelling salesman problem by Alobaedy, Mustafa Muwafak, Ku-Mahamud, Ku Ruhana

    Published 2012
    “…However, one part of the algorithm, called heuristic function, is not updated at any time throughout the process to reflect the new information discovered by the ants.This paper proposes an Enhanced Ant Colony System algorithm for solving the Travelling Salesman Problem.The enhanced algorithm is able to generate shorter tours within reasonable times by using accumulated values from pheromones and heuristics.The proposed enhanced ACS algorithm integrates a new heuristic function that can reflect the new information discovered by the ants. …”
    Get full text
    Get full text
    Get full text
    Conference or Workshop Item
  17. 17
  18. 18

    Global Particle Swarm Optimization for High Dimension Numerical Functions Analysis by Jamian, J.J., Abdullah, M.N., Mokhlis, Hazlie, Mustafa, M.W., Bakar, Ab Halim Abu

    Published 2014
    “…The Particle Swarm Optimization (PSO) Algorithm is a popular optimization method that is widely used in various applications, due to its simplicity and capability in obtaining optimal results. …”
    Get full text
    Get full text
    Get full text
    Article
  19. 19

    A novel nonlinear time‑varying sigmoid transfer function in binary whale optimization algorithm for descriptors selection in drug classifcation by Mohd Yusof, Norfadzlia, Muda, Azah Kamilah, Pratama, Satrya Fajri, Abraham, Ajith

    Published 2022
    “…The main contribution of this paper is a new version of the nonlinear time-varying Sigmoid transfer function to improve the exploitation and exploration activities in the standard whale optimization algorithm (WOA). …”
    Get full text
    Get full text
    Get full text
    Article
  20. 20

    Hybrid harmony search algorithm for continuous optimization problems by Ala’a Atallah, Hamad Alomoush

    Published 2020
    “…The IHS-GWO is evaluated using two standard benchmarking sets and two real-world optimization problems. …”
    Get full text
    Get full text
    Thesis