Search Results - (( using second problems algorithm ) OR ( java adaptation optimization algorithm ))

Search alternatives:

Refine Results
  1. 1
  2. 2

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

    Tiki-taka algorithm: a novel metaheuristic inspired by football playing style by Mohd Fadzil Faisae, Ab Rashid

    Published 2021
    “…The algorithm was tested using 19 benchmark functions and five engineering design problems. …”
    Get full text
    Get full text
    Get full text
    Article
  4. 4

    Formulating new enhanced pattern classification algorithms based on ACO-SVM by Alwan, Hiba Basim, Ku-Mahamud, Ku Ruhana

    Published 2013
    “…ACO originally deals with discrete optimization problem.In applying ACO for solving SVM model selection problem which are continuous variables, there is a need to discretize the continuously value into discrete values.This discretization process would result in loss of some information and hence affects the classification accuracy and seeking time.In this algorithm we propose to solve SVM model selection problem using IACOR without the need to discretize continuous value for SVM.The second algorithm aims to simultaneously solve SVM model selection problem and selects a small number of features.SVM model selection and selection of suitable and small number of feature subsets must occur simultaneously because error produced from the feature subset selection phase will affect the values of SVM model selection and result in low classification accuracy.In this second algorithm we propose the use of IACOMV to simultaneously solve SVM model selection problem and features subset selection.Ten benchmark datasets were used to evaluate the proposed algorithms.Results showed that the proposed algorithms can enhance the classification accuracy with small size of features subset.…”
    Get full text
    Get full text
    Get full text
    Article
  5. 5

    Hybrid multiobjective genetic algorithm for integrated dynamic scheduling and routing of jobs and automated guided vehicles in flexible manufacturing systems by Umar, Umar Ali

    Published 2014
    “…First scenario uses static consideration, the second scenario uses dynamic consideration with machine failure recovery. …”
    Get full text
    Get full text
    Thesis
  6. 6

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

    Published 2018
    “…The second technique is to solve bi-objective functions by using the BOBAT algorithm. …”
    Get full text
    Get full text
    Thesis
  7. 7

    A new cryptographic algorithm based on decomposition problem in elliptic curve cryptography / Hilyati Hanina Zazali by Hilyati Hanina, Zazali

    Published 2012
    “…This approach presents better platform in finite field E as compared to the original works using the braid groups. The second algorithm deals with the use of Decomposition Problem in encryption scheme for ECC. …”
    Get full text
    Get full text
    Get full text
    Get full text
    Get full text
    Thesis
  8. 8

    Multi-objective optimisation of assembly line balancing type-e problem with resource constraints by Masitah, Jusop

    Published 2016
    “…Later, the optimisation algorithm will be tested and verified using test problems from literature. …”
    Get full text
    Get full text
    Thesis
  9. 9

    Optimization Of Bar Linkage By Using Genetic Algorithms by Ramasamy, Mugilan

    Published 2005
    “…Penalty-based transformation method is used in this thesis to change the constrained problems into unconstrained ones. …”
    Get full text
    Get full text
    Monograph
  10. 10

    Harmony annealing algorithm for curriculum-based course timetabling problem by Wahid, Juliana, Mohd Hussin, Naimah

    Published 2012
    “…An attempt to solve these problems was made via an approach broken down into two parts; first, constructive algorithm with saturation degree approach was used to ensure a feasible solution, where the hard constraints are satisfied.Secondly, Harmony annealing algorithm was used to further improve the results obtained.The algorithm produced results that were not comparatively better than those previously known as best solution.With proper modification in terms of the approach in this algorithm would make the algorithm perform better on curriculum-based course timetabling.…”
    Get full text
    Get full text
    Get full text
    Conference or Workshop Item
  11. 11

    Application Of Higher Order Compact Finite Difference Methods To Problems In Fluid Dynamics by Yap, Wen Jiun

    Published 2003
    “…The performance of the two different approaches are compared and found on par with each other. Second, the numerical algorithms are used to solve the quasi-one-dimensional subsonic-supersonic nozzle flow. …”
    Get full text
    Get full text
    Thesis
  12. 12

    Enhanced Intelligent Water Drops Algorithm for University Examination Timetabling Problems by Bashar AbedAl Mohdi Talal AlDeeb

    Published 2024
    “…The main motivations for investigating IWD algorithm are: (i) IWD has been successfully employed to solve many optimization problems. …”
    thesis::doctoral thesis
  13. 13

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

    Optimization of ship routing using hybrid genetic algorithm / Ismail by ., Ismail

    Published 2014
    “…The results from this experiment show that the hybrid GA has better performance compared to the general GA, the PELNI method and the heuristic algorithm. The second experiment is to generate routes using three algorithms discussed in the research. …”
    Get full text
    Get full text
    Thesis
  15. 15

    Bezier curves for solving Fredholm integral equations of the second kind by Ghomanjani, Fateme, Farahi, Mohammad Hadi, Kilicman, Adem

    Published 2014
    “…The Bezier curves are presented to estimate the solution of the linear Fredholm integral equation of the second kind. A direct algorithm for solving this problem is given. …”
    Get full text
    Get full text
    Get full text
    Article
  16. 16
  17. 17

    Numerical solution of second order linear two-point boundry value problem using direct multistep method by Chew, Khui Tat

    Published 2012
    “…These methods are then used together with linear shooting technique in solving second order linear two-point boundary value problems using constant step size. …”
    Get full text
    Get full text
    Thesis
  18. 18

    Hybrid performance measures and mixed evaluation method for data classification problems by Hossin, Mohammad

    Published 2012
    “…This study investigates two different issues of performance measure in data classification problem. First, this study examines the use of accuracy measure as a discriminator for building an optimized Prototype Selection (PS) algorithm. …”
    Get full text
    Get full text
    Thesis
  19. 19

    Development of optimization Alghorithm for uncertain non-linear dynamical system by Abdul Aziz, Mohd. Ismail, Yaacob, Nazeeruddin, Mohd. Said, Norfarizan, Hamzah, Nor Hazadura

    Published 2004
    “…Algorithms used to solve these problems are expected to satisfy the objectives consistently and since time translates into cost, must also be fast. …”
    Get full text
    Get full text
    Monograph
  20. 20

    A fuzzy genetic algorithm based on binary encoding for solving multidimensional knapsack problems by Varnamkhasti, Mohammad Jalali, Lee, Lai Soon

    Published 2012
    “…Computational experiments are conducted on the proposed techniques and the results are compared with other genetic operators, heuristics, and local search algorithms commonly used for solving multidimensional 0/1 knapsack problems published in the literature.…”
    Get full text
    Get full text
    Article