Search Results - (( developing local problems algorithm ) OR ( java implication based algorithm ))

Refine Results
  1. 1

    Genetic-local hybrid optimizer for solving advance layout problem by Taha, Imad, Ibrahim Habra, Hind Saleem

    Published 2006
    “…Results show the potentiality of the proposed algorithm in solving the problem and outperforming previous algorithms.…”
    Get full text
    Get full text
    Get full text
    Article
  2. 2

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

    Development an accurate and stable range-free localization scheme for anisotropic wireless sensor networks by Han, Fengrong

    Published 2022
    “…This study developed an optimized variation of the DV-Hop localization algorithm for anisotropic wireless sensor networks. …”
    Get full text
    Get full text
    Thesis
  4. 4
  5. 5

    An adaptive ant colony optimization algorithm for rule-based classification by Al-Behadili, Hayder Naser Khraibet

    Published 2020
    “…In this study, a new Ant-Miner classifier is developed, named Adaptive Genetic Iterated-AntMiner (AGI-AntMiner) that aims to avoid local optima and overfitting problems. …”
    Get full text
    Get full text
    Get full text
    Get full text
    Thesis
  6. 6

    A Novel Discrete Filled Function Algorithm in Solving Discrete Optimization Problems (S/O: 12408) by Woon, Siew Fang, Karim, Sharmila, Mohamad, Mohd Saiful Adli

    Published 2016
    “…Most practical discrete and mixed discrete optimization problems are nonlinear and known to have more than one locally optimal solution. …”
    Get full text
    Get full text
    Monograph
  7. 7

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

    Published 2022
    “…Therefore, for solving the SMA algorithm local optima problem, we used the Levy distribution rather than the conventional uniform distribution in the candidate selection procedure. …”
    Get full text
    Get full text
    Get full text
    Conference or Workshop Item
  8. 8

    Seed disperser ant algorithm for optimization / Chang Wen Liang by Chang , Wen Liang

    Published 2018
    “…The Seed Disperser Ant Algorithm (SDAA) is developed based on the evolution or expansion process of Seed Disperser Ant (Aphaenogaster senilis) colony. …”
    Get full text
    Get full text
    Get full text
    Thesis
  9. 9

    Hybridization of modified sine cosine algorithm with tabu search for solving quadratic assignment problem by Nurdiyana, Jamil

    Published 2022
    “…Besides, local search strategy is required in attaining superior results and it is usually designed based on the problem under study. …”
    Get full text
    Get full text
    Thesis
  10. 10

    Development of a Mobile Robot Local Navigation System Based on Fuzzy-Logic Control and Actual Virtual Target Switching by Esmaeili Motlagh, Omid Reza

    Published 2006
    “…Robot local path planning in an unknown and changing environment with uncertainties is one of the most challenging problems in robotics which involves the integration of many different bodies of knowledge. …”
    Get full text
    Get full text
    Thesis
  11. 11
  12. 12

    Multi-Agent cubature Kalman optimizer: A novel metaheuristic algorithm for solving numerical optimization problems by Zulkifli, Musa, Zuwairie, Ibrahim, Mohd Ibrahim, Shapiai

    Published 2024
    “…Metaheuristic algorithms, including the Simulated Kalman Filter (SKF), have been developed to solve these problems. …”
    Get full text
    Get full text
    Get full text
    Article
  13. 13

    A genetic algorithm to minimise the maximum lateness on a single machine family scheduling problem by Lee, Lai Soon, Nazif, Habibeh

    Published 2009
    “…We will develop the proposed OCGA to solve the problem of minimising the total (weighted) completion time as future work. …”
    Get full text
    Conference or Workshop Item
  14. 14

    An immune-genetic algorithm with tabu local search for network intrusion detection system / Hamizan Suhaimi by Suhaimi, Hamizan

    Published 2021
    “…This issue highlights the need to tackle the network intrusion problem efficiently. This research aim is to study the performance of an improvised Genetic Algorithm (GA) by formulating its problem-specific algorithm for network intrusion problem. …”
    Get full text
    Get full text
    Thesis
  15. 15
  16. 16

    Improved Salp Swarm Algorithm based on opposition based learning and novel local search algorithm for feature selection by Tubishat, Mohammad, Idris, Norisma, Shuib, Liyana, Abushariah, Mohammad A.M., Mirjalili, Seyedali

    Published 2020
    “…The second improvement includes the development and use of new Local Search Algorithm with SSA to improve its exploitation. …”
    Get full text
    Get full text
    Article
  17. 17

    Modified multi verse optimizer for solving optimization problems using benchmark functions by Jui, Julakha Jahan, Mohd Ashraf, Ahmad, Muhammad Ikram, Mohd Rashid

    Published 2020
    “…Firstly, an average position selection mechanism is proposed for solving the local optima problem and secondly, the MVO algorithm is hybrid with another metaheuristics algorithm namely the Sine Cosine Algorithm (SCA) for better balancing the exploration and exploitation of standard MVO algorithm so that it can improve its searching capability. …”
    Get full text
    Get full text
    Get full text
    Conference or Workshop Item
  18. 18

    Development of behavior-based reactive navigation system for mobile robot by Mohd Hamami, Mohd Ghazali

    Published 2013
    “…This proved the developed navigation algorithm not only satisfied its objective but also has reliability in its performance.…”
    Get full text
    Get full text
    Thesis
  19. 19

    An Efficient Genetic Algorithm for Large Scale Vehicle Routing Problem Subject to Precedence Constraints by Noraini, Mohd Razali

    Published 2015
    “…The genetic operators used in this study are capable to introduce new fitter offspring and does not trapped in a local optimum. Therefore, it can be stated that the genetic algorithm approach developed in this study is efficient in solving large scale vehicle routing problem subject to precedence constraints with the objective of minimizing the distance travelled.…”
    Get full text
    Get full text
    Get full text
    Article
  20. 20

    Local search heuristics for elective surgery scheduling considering patient urgency by Rashid, N. S. A., Rahmin, N. A. A., Leong, W. J., Mohamed Ali, Nazihah

    Published 2019
    “…An integer linear programming model is referred to solve the problem. As the model consume a high computational time to solve for a large-scale instance, we developed a local search algorithm based on a simple heuristic to deal with the problem. …”
    Get full text
    Get full text
    Get full text
    Article