Search Results - (( problem using random algorithm ) OR ( java application tree algorithm ))

Search alternatives:

Refine Results
  1. 1
    Separator Database and SPM Tree Framework for Mining Sequential Patterns Using Prefixspan with Pseudoprojection

    Separator Database and SPM Tree Framework for Mining Sequential Patterns Using Prefixspan with Pseudoprojection by Saputra , Dhany, Rambli, Dayang R.A., Foong, Oi Mean

    Published 2008
    Get full text
    Get full text
    Thesis
    Save to List
    Saved in:
  2. 2
    African Buffalo Optimization and the Randomized Insertion Algorithm for the Asymmetric Travelling Salesman’s Problems

    African Buffalo Optimization and the Randomized Insertion Algorithm for the Asymmetric Travelling Salesman’s Problems by Odili, Julius Beneoluchi, M. N. M., Kahar, Noraziah, Ahmad, Odili, Esther Abiodun

    Published 2016
    “…This paper presents a comparative study of the African Buffalo Optimization algorithm and the Randomized Insertion Algorithm to solving the asymmetric Travelling Salesman’s Problem with the overall objective of determining a better method to solving the asymmetric Travelling Salesman’s Problem instances. …”
    Get full text
    Get full text
    Get full text
    Article
    Save to List
    Saved in:
  3. 3
    A Comparative Study of African Buffalo Optimization and Randomized Insertion Algorithm for Asymmetric Travelling Salesman's Problem

    A Comparative Study of African Buffalo Optimization and Randomized Insertion Algorithm for Asymmetric Travelling Salesman's Problem by Odili, Julius Beneoluchi, M. N. M., Kahar, Shahid, Anwar, Azrag, M. A. K.

    Published 2015
    “…In this study, a comparative study of the African Buffalo Optimization algorithm and the Randomized Insertion Algorithm to solving the asymmetric Travelling Salesman's Problem is made with the aim of ascertaining a better method to solving the asymmetric Travelling Salesman's Problem instances. …”
    Get full text
    Get full text
    Get full text
    Get full text
    Conference or Workshop Item
    Save to List
    Saved in:
  4. 4
    Hybrid optimization approach to estimate random demand

    Hybrid optimization approach to estimate random demand by Wahab, Musa, Ku-Mahamud, Ku Ruhana, Yasin, Azman

    Published 2012
    “…The main objective of this study is to develop a demand forecasting model that should reflect the characteristics of random demand patterns.To accomplish this goal, a hybrid algorithm combining a genetic algorithm and a local search algorithm method was developed to overcome premature convergence in local optima problems.The performance of the hybrid algorithm was compared with a single algorithm model in estimating parameter values that minimize objective function which was used to measure the goodness-of-fit between the observed data and simulated results.However, two problems had to be overcome in the forecasting random demand model. …”
    Get full text
    Get full text
    Get full text
    Conference or Workshop Item
    Save to List
    Saved in:
  5. 5
    New random approaches of modified adaptive bats sonar algorithm for reservoir operation optimization problems

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

    Published 2024
    “…This PhD thesis introduces an extended version of MABSA aimed at addressing constrained multi objective optimization problems by incorporating innovative random approaches, focusing to solves reservoir optimization problems. …”
    Get full text
    Get full text
    Thesis
    Save to List
    Saved in:
  6. 6
    Study and Implementation of Data Mining in Urban Gardening

    Study and Implementation of Data Mining in Urban Gardening by Mohana, Muniandy, Lee, Eu Vern

    Published 2019
    “…Using the J48 tree algorithm implemented through WEKA API on a Java Servlet, data provided is processed to derive a health index of the plant, with the possible outcomes set to “Good,” “Okay”, or “Bad”. …”
    Get full text
    Get full text
    Get full text
    Article
    Save to List
    Saved in:
  7. 7
    The Anglerfish algorithm: a derivation of randomized incremental construction technique for solving the traveling salesman problem

    The Anglerfish algorithm: a derivation of randomized incremental construction technique for solving the traveling salesman problem by Pook, Mei Foong, Ramlan, Effirul Ikhwan

    Published 2019
    “…Benchmarking is conducted using the traveling salesman problem. The results are comparable with the results of advanced metaheuristic algorithms. …”
    Get full text
    Get full text
    Article
    Save to List
    Saved in:
  8. 8
    Combining approximation algorithm with genetic algorithm at the initial population for NP-complete problem

    Combining approximation algorithm with genetic algorithm at the initial population for NP-complete problem by Razip, H., Zakaria, M.N.

    Published 2018
    “…We tested this approach by sampling the populations for some Set Covering Problems from OR Library using the randomized rounding method (AAR) and compared them with that sampled using a randomized heuristics (R) in terms of redundancy rate, diversity and closeness to the optimal solution (OPT). …”
    Get full text
    Get full text
    Article
    Save to List
    Saved in:
  9. 9
    Comparative Analysis of Low Discrepancy Sequence-Based Initialization Approaches Using Population-Based Algorithms for Solving the Global Optimization Problems

    Comparative Analysis of Low Discrepancy Sequence-Based Initialization Approaches Using Population-Based Algorithms for Solving the Global Optimization Problems by Waqas Haider Bangyal, Kashif Nisar, Ag. Asri Bin Ag. Ibrahim, Muhammad Reazul Haque, Joel J. P. C. Rodrigues, Danda B. Rawat

    Published 2021
    “…Metaheuristic algorithms have been widely used to solve diverse kinds of optimization problems. …”
    Get full text
    Get full text
    Get full text
    Get full text
    Get full text
    Article
    Save to List
    Saved in:
  10. 10
    Node placement optimization using extended virtual force and cuckoo search algorithm in wireless sensor network

    Node placement optimization using extended virtual force and cuckoo search algorithm in wireless sensor network by Puteri Azwa, Ahmad

    Published 2014
    “…The implementation of the EVFCS improved the problems of initial random deployment.…”
    Get full text
    Get full text
    Get full text
    Thesis
    Save to List
    Saved in:
  11. 11
    Improved stochastic gradient descent algorithm with mean-gradient adaptive stepsize for solving large-scale optimization problems

    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
    Save to List
    Saved in:
  12. 12
    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
    “…After critical assessments of the performances of eleven algorithms consisting of two heuristics (Randomized Insertion Algorithm and the Honey Bee Mating Optimization for the Travelling Salesman’s Problem), two trajectory algorithms (Simulated Annealing and Evolutionary Simulated Annealing) and seven population-based optimization algorithms (Genetic Algorithm, Artificial Bee Colony, African Buffalo Optimization, Bat Algorithm, Particle Swarm Optimization, Ant Colony Optimization and Firefly Algorithm) in solving the 60 popular and complex benchmark symmetric Travelling Salesman’s optimization problems out of the total 118 as well as all the 18 asymmetric Travelling Salesman’s Problems test cases available in TSPLIB91. …”
    Get full text
    Get full text
    Get full text
    Article
    Save to List
    Saved in:
  13. 13
    Mining Sequential Patterns using I-PrefixSpan

    Mining Sequential Patterns using I-PrefixSpan by Saputra , Dhany, Dayang R.A. Rambli, Foong, Oi Mean

    Published 2008
    Get full text
    Get full text
    Citation Index Journal
    Save to List
    Saved in:
  14. 14
    A comparative performance analysis of computational intelligence techniques to solve the asymmetric travelling salesman problem

    A comparative performance analysis of computational intelligence techniques to solve the asymmetric travelling salesman problem by Odili, Julius Beneoluchi, Noraziah, Ahmad, Zarina, M.

    Published 2021
    “…The comparative algorithms in this study employ different techniques in their search for solutions to ATSP: the African Buffalo Optimization employs the modified Karp–Steele mechanism, Model-Induced Max-Min Ant Colony Optimization (MIMM-ACO) employs the path construction with patching technique, Cooperative Genetic Ant System uses natural selection and ordering; Randomized Insertion Algorithm uses the random insertion approach, and the Improved Extremal Optimization uses the grid search strategy. …”
    Get full text
    Get full text
    Get full text
    Article
    Save to List
    Saved in:
  15. 15
    Comparison between Genetic Algorithm and Prey-Predator Algorithm.

    Comparison between Genetic Algorithm and Prey-Predator Algorithm. by Ong, Hong Choon

    “…The use of metaheuristic algorithms to different problems becomes very common after the introduction of genetic algorithm in 1975. …”
    Get full text
    Monograph
    Save to List
    Saved in:
  16. 16
    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
    “…The comparison of the result of the developed integrated algorithm using two benchmark FMS scheduling algorithms datasets is conducted. …”
    Get full text
    Get full text
    Thesis
    Save to List
    Saved in:
  17. 17
    Adoption of machine learning algorithm for analysing supporters and non supporters feedback on political posts / Ogunfolajin Maruff Tunde

    Adoption of machine learning algorithm for analysing supporters and non supporters feedback on political posts / Ogunfolajin Maruff Tunde by Ogunfolajin Maruff , Tunde

    Published 2022
    “…This thesis is based on the application of sentiment classification algorithm to tweet data with the goal of classifying messages based on the polarity of sentiment towards a particular topic (or subject matter). …”
    Get full text
    Get full text
    Get full text
    Thesis
    Save to List
    Saved in:
  18. 18
    The normalized random map of gradient for generating multifocus image fusion

    The normalized random map of gradient for generating multifocus image fusion by Ismail, ., Kamarul Hawari, Ghazali

    Published 2020
    “…In order to handle this problem, the proposed method a concise algorithm which is able to generate an accurate fused image without using a complicated mathematical equation and tough algorithm. …”
    Get full text
    Get full text
    Get full text
    Article
    Save to List
    Saved in:
  19. 19
    Solving Assembly Line Balancing Problem Using Genetic Algorithm With Heuristics-Treated Initial Population

    Solving Assembly Line Balancing Problem Using Genetic Algorithm With Heuristics-Treated Initial Population by Chong, Kuan Eng, Omar, Mohamed K, Abu Bakar, Nooh

    Published 2008
    “…Although genetic algorithm (GA) has been widely used to address assembly line balancing problems (ALBP), not much attention has been given to the population initialization procedure. …”
    Get full text
    Get full text
    Get full text
    Conference or Workshop Item
    Save to List
    Saved in:
  20. 20
    A Comparative Study on three Component Selection Mechanisms for Hyper-Heuristics in Expensive Optimization

    A Comparative Study on three Component Selection Mechanisms for Hyper-Heuristics in Expensive Optimization by Jia Hui Ong, Jason Teo

    Published 2018
    “…Numerous studies in optimization problems often lead to tailoring a specific algorithm to adapt to the problem instances, especially in expensive optimization problems. …”
    Get full text
    Get full text
    Get full text
    Article
    Save to List
    Saved in:

Search Tools: