Search Results - (( problem solving first algorithm ) OR ( java application optimization algorithm ))

Search alternatives:

Refine Results
  1. 1
    A discrete simulated kalman filter optimizer for combinatorial optimization problems

    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
    Save to List
    Saved in:
  2. 2
    Gravitational search – bat algorithm for solving single and bi-objective of non-linear functions

    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
    Save to List
    Saved in:
  3. 3
    Optimization of blood vessel detection in retina images using multithreading and native code for portable devices

    Optimization of blood vessel detection in retina images using multithreading and native code for portable devices by Tran, Duc Ngoc, Hussin, Fawnizu Azmadi, Yusoff, Mohd Zuki

    Published 2013
    Get full text
    Get full text
    Conference or Workshop Item
    Save to List
    Saved in:
  4. 4
    Performance evaluation of real-time multiprocessor scheduling algorithms

    Performance evaluation of real-time multiprocessor scheduling algorithms by Alhussian, H., Zakaria, N., Abdulkadir, S.J., Fageeri, S.O.

    Published 2016
    “…These results suggests that optimal algorithms may turn to be non-optimal when practically implemented, unlike USG which reveals far less scheduling overhead and hence could be practically implemented in real-world applications. …”
    Get full text
    Get full text
    Conference or Workshop Item
    Save to List
    Saved in:
  5. 5
    Barnacles mating optimizer : a new bio-inspired algorithm for solving engineering optimization problems

    Barnacles mating optimizer : a new bio-inspired algorithm for solving engineering optimization problems by M. H., Sulaiman, Zuriani, Mustaffa, Mohd Mawardi, Saari, Hamdan, Daniyal

    Published 2020
    “…This paper presents a novel bio-inspired optimization algorithm namely the Barnacles Mating Optimizer (BMO) algorithm to solve optimization problems. …”
    Get full text
    Get full text
    Get full text
    Article
    Save to List
    Saved in:
  6. 6
    Formulating and solving stochastic truck and trailer routing problems using meta-heuristic algorithms / Seyedmehdi Mirmohammadsadeghi

    Formulating and solving stochastic truck and trailer routing problems using meta-heuristic algorithms / Seyedmehdi Mirmohammadsadeghi by Seyedmehdi, Mirmohammadsadeghi

    Published 2015
    “…For solving this problem, the aforesaid algorithms have been applied. …”
    Get full text
    Get full text
    Get full text
    Thesis
    Save to List
    Saved in:
  7. 7
    Barnacles mating optimizer: A new bio-inspired algorithm for solving engineering optimization problems

    Barnacles mating optimizer: A new bio-inspired algorithm for solving engineering optimization problems by Mohd Herwan, Sulaiman, Zuriani, Mustaffa, Mohd Mawardi, Saari, Hamdan, Daniyal

    Published 2020
    “…This paper presents a novel bio-inspired optimization algorithm namely the Barnacles Mating Optimizer (BMO) algorithm to solve optimization problems. …”
    Get full text
    Get full text
    Get full text
    Article
    Save to List
    Saved in:
  8. 8
    Performance Analyses of Nature-inspired Algorithms on the Traveling Salesman’s Problems for Strategic Management

    Performance Analyses of Nature-inspired Algorithms on the Traveling Salesman’s Problems for Strategic Management by Julius, Beneoluchi Odili, M. N. M., Kahar, Noraziah, Ahmad, M., Zarina, Riaz, Ul Haq

    Published 2017
    Get full text
    Get full text
    Get full text
    Article
    Save to List
    Saved in:
  9. 9
    Ant colony optimization in dynamic environments

    Ant colony optimization in dynamic environments by Chen, Fei Huang

    Published 2010
    “…This thesis is an investigation into the application ' of ACO for solving dynamic optimization problems. The first objective of this study is to identify which ant algorithm performs the best under a dynamic environment. …”
    Get full text
    Get full text
    Get full text
    Thesis
    Save to List
    Saved in:
  10. 10
    A fuzzy genetic algorithm based on binary encoding for solving multidimensional knapsack problems

    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
    Save to List
    Saved in:
  11. 11
    Simulated kalman filter with modified measurement, substitution mutation and hamming distance calculation for solving traveling salesman problem

    Simulated kalman filter with modified measurement, substitution mutation and hamming distance calculation for solving traveling salesman problem by Suhazri Amrin, Rahmad, Zuwairie, Ibrahim, Zulkifli, Md. Yusof

    Published 2022
    “…Findings – The results of the SKF algorithm and the ssSKF algorithm will be evaluated to decide which algorithm is better at solving this type of problem. …”
    Get full text
    Get full text
    Get full text
    Get full text
    Conference or Workshop Item
    Save to List
    Saved in:
  12. 12
    Generic DNA encoding design scheme to solve combinatorial problems

    Generic DNA encoding design scheme to solve combinatorial problems by Rofilde, Hasudungan

    Published 2015
    “…The complexity of combinatorial problems is classified as NP meaning that algorithms are yet to exist to efficiently solve the problem. …”
    Get full text
    Get full text
    Thesis
    Save to List
    Saved in:
  13. 13
    Route Optimization System

    Route Optimization System by Zulkifli, Abdul Hayy

    Published 2005
    “…After much research into the many algorithms available, and considering some, including Genetic Algorithm (GA), the author selected Dijkstra's Algorithm (DA). …”
    Get full text
    Get full text
    Final Year Project
    Save to List
    Saved in:
  14. 14
    Formulating new enhanced pattern classification algorithms based on ACO-SVM

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

    Published 2013
    “…This paper presents two algorithms that integrate new Ant Colony Optimization (ACO) variants which are Incremental Continuous Ant Colony Optimization (IACOR) and Incremental Mixed Variable Ant Colony Optimization (IACOMV) with Support Vector Machine (SVM) to enhance the performance of SVM.The first algorithm aims to solve SVM model selection problem. …”
    Get full text
    Get full text
    Get full text
    Article
    Save to List
    Saved in:
  15. 15
    Hybrid multiobjective genetic algorithm for integrated dynamic scheduling and routing of jobs and automated guided vehicles in flexible manufacturing systems

    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
    “…Genetic algorithm has recorded of huge success in solving NP-Complete optimization problems with similar nature to this problem. …”
    Get full text
    Get full text
    Thesis
    Save to List
    Saved in:
  16. 16
    Application of Bee Colony Optimization (BCO) in NP-Hard Problems

    Application of Bee Colony Optimization (BCO) in NP-Hard Problems by Kamarudin, Muhammad Sariy Syazwan

    Published 2011
    “…This report presents the first stage of an ongoing research which is the problem solving of highly complex tasks using Bee-Inspired algorithms. …”
    Get full text
    Get full text
    Final Year Project
    Save to List
    Saved in:
  17. 17
    A variant fisher and Jaikuamr algorithm to solve capacitated vehicle routing problem

    A variant fisher and Jaikuamr algorithm to solve capacitated vehicle routing problem by Sultana, Tanzima, Akhand, Md Aminul Haque, Rahman, M.M. Hafizur

    Published 2017
    “…This study investigates a variant of Fisher and Jaikumar algorithm owning to solve CVRP efficiently. In the proposed method clusters form such a way that each cluster cone contains equal number of nodes. …”
    Get full text
    Get full text
    Get full text
    Get full text
    Proceeding Paper
    Save to List
    Saved in:
  18. 18
    A carnivorous plant algorithm for solving global optimization problems

    A carnivorous plant algorithm for solving global optimization problems by Ong, Kok Meng, Ong, Pauline, Sia, Chee Kiong

    Published 2021
    “…Experimental simulations demonstrated the supremacy of the CPA in solving global optimization problems.…”
    Get full text
    Get full text
    Get full text
    Article
    Save to List
    Saved in:
  19. 19
    Solving second order boundary value problem by shooting technique using backward difference formulae

    Solving second order boundary value problem by shooting technique using backward difference formulae by Jafri, Mahanum Diana

    Published 2011
    “…Most of the existing researches involved BVPs will reduce the problem to a system of first order ordinary differential equations (ODEs). …”
    Get full text
    Get full text
    Thesis
    Save to List
    Saved in:
  20. 20
    Two-point block backward differentiation formula for solving higher order ordinary differential equations

    Two-point block backward differentiation formula for solving higher order ordinary differential equations by Zainuddin, Nooraini

    Published 2011
    “…The algorithms are written in C language and the numerical results of these methods are compared to that of reducing it to a system of first order ODEs and solves using the first order ODEs method. …”
    Get full text
    Get full text
    Thesis
    Save to List
    Saved in:

Search Tools: