Search Results - (( solution population approach algorithm ) OR ( java implication based algorithm ))

Refine Results
  1. 1

    Design and statistical analysis of initial solution construction approach in curriculum based course timetabling problem by Wahid, Juliana, Mohd Hussin, Naimah

    Published 2017
    “…To produce a population of initial solution require algorithm that can produce multiple feasible solutions and these solutions must be diverse. …”
    Get full text
    Get full text
    Conference or Workshop Item
  2. 2

    NSGA-III algorithm for optimizing robot collaborative task allocation in the internet of things environment by Shen, jiazheng, Tang, Sai Hong, Mohd Ariffin, Mohd Khairol Anuar, As’arry, Azizan, Wang, Xinming

    Published 2024
    “…The experiment verified that this strategy can approach the optimal solution more closely during the population convergence process, and compared it with traditional Multi TSP algorithms and single function multi-objective Multi TSP algorithms. …”
    Get full text
    Get full text
    Get full text
    Article
  3. 3

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

    Published 2018
    “…In Genetic Algorithm (GA), the prevalent approach to population initialization are heuristics and randomization. …”
    Get full text
    Get full text
    Article
  4. 4

    Hybridizing harmony search with local search based metaheuristic for solving curriculum based university course timetabling / Juliana Wahid by Wahid, Juliana

    Published 2017
    “…The approach produced solutions that are at par quality with the previous published results. …”
    Get full text
    Get full text
    Thesis
  5. 5

    Enhanced Harris's Hawk algorithm for continuous multi-objective optimization problems by Yasear, Shaymah Akram

    Published 2020
    “…Harris’s hawk multi-objective optimizer (HHMO) algorithm is a MOSIbased algorithm that was developed based on the reference point approach. …”
    Get full text
    Get full text
    Get full text
    Get full text
    Thesis
  6. 6
  7. 7

    A novel clustering based genetic algorithm for route optimization by Aibinu, Abiodun Musa, Salau, Habeeb Bello, Najeeb, Athaur Rahman, Nwohu, Mark Ndubuka, Akachukwu, Chichebe

    Published 2016
    “…In addition, the introduction of dynamic population control with polygamy selection processes enabled fast convergence to optimal solution and diversity in the population respectively.…”
    Get full text
    Get full text
    Get full text
    Get full text
    Get full text
    Article
  8. 8

    Construction of initial solution population for curriculum-based course timetabling using combination of graph heuristics by Wahid, Juliana, Mohd Hussin, Naimah

    Published 2016
    “…The construction of population of initial solution is a crucial task in population-based metaheuristic approach for solving curriculum-based university course timetabling problem because it can affect the convergence speed and also the quality of the final solution.This paper presents an exploration on combination of graph heuristics in construction approach in curriculum based course timetabling problem to produce a population of initial solutions.The graph heuristics were set as single and combination of two heuristics.In addition, several ways of assigning courses into room and timeslot are implemented.All settings of heuristics are then tested on the same curriculum based course timetabling problem instances and are compared with each other in terms of number of population produced.The result shows that combination of largest degree followed by saturation degree heuristic produce the highest number of population of initial solutions.The results from this study can be used in the improvement phase of algorithm that uses population of initial solutions…”
    Get full text
    Get full text
    Get full text
    Article
  9. 9
  10. 10

    Constructing population of initial solutions for curriculum – based course timetabling problem by Wahid, Juliana, Mohd Hussin, Naimah

    Published 2012
    “…This paper presents an investigation of a combination of graph coloring heuristics in construction approach in University course timetabling problem (UCTP) to produce a population of initial solutions. …”
    Get full text
    Get full text
    Conference or Workshop Item
  11. 11

    A Kalman Filter Approach for Solving Unimodal Optimization Problems by Zuwairie, Ibrahim, Nor Hidayati, Abdul Aziz, Nor Azlina, Ab. Aziz, Saifudin, Razali, Mohd Ibrahim, Shapiai, Sophan Wahyudi, Nawawi, Mohd Saberi, Mohamad

    Published 2015
    “…In this paper, a new population-based metaheuristic optimization algorithm, named Simulated Kalman Filter (SKF) is introduced. …”
    Get full text
    Get full text
    Get full text
    Article
  12. 12

    Hybrid bat algorithm for minimum dominating set problem by Abed, S.A., Rais, H.M.

    Published 2017
    “…However, population-based algorithms are not good in exploiting the search space in comparison to single-solution based methods, therefore we included simulated annealing (SA) algorithm to balance between exploitation and exploration in order to reach a best possible solution. …”
    Get full text
    Get full text
    Article
  13. 13
  14. 14
  15. 15

    Simulated Kalman Filter algorithms for solving optimization problems by Nor Hidayati, Abdul Aziz

    Published 2019
    “…However, the HKA algorithm has its own flaws. Although it was introduced as a population-based stochastic optimization algorithm, HKA is not exactly a population-based algorithm because it initializes and updates only a single solution. …”
    Get full text
    Get full text
    Thesis
  16. 16
  17. 17

    Solving the minimum dominating set problem of partitioned graphs using a hybrid bat algorithm by Abed, S.A., Rais, H.M.

    Published 2020
    “…The BA explores a wide area of the search space; thus, it is capable of the diversification procedure. However, population-based algorithms are not good in exploiting the search space in comparison to single-solution based methods, therefore, we included the Simulated annealing (SA) algorithm to balance between exploitation and exploration in order to reach a best possible solution. …”
    Get full text
    Get full text
    Article
  18. 18

    Interacted multiple ant colonies optimization approach to enhance the performance of ant colony optimization algorithms by Aljanaby, Alaa, Ku-Mahamud, Ku Ruhana, Md. Norwawi, Norita

    Published 2010
    “…Computational test shows promising results of the new approach. The proposed approach outperforms the single colony ant algorithms in term of solution quality with the same computational effort.…”
    Get full text
    Get full text
    Get full text
    Article
  19. 19

    A kidney algorithm with elitism for combinatorial testing problem by Bahomaid, Ameen A., Alsewari, Abdulrahman A., Kamal Z., Zamli, Alhendawi, Kamal M., Al-Janabi, Ala Aldeen

    Published 2020
    “…Although, KA may be easy to fall into local optima by keeping the worst solutions from the past generation as a new population with the best solutions. …”
    Get full text
    Get full text
    Get full text
    Conference or Workshop Item
  20. 20

    Multi-robot path planning based on the improved nutcracker optimization algorithm and the dynamic window approach by Zhao, Jiangrong, Ding, Hongwei, Zhu, Yuanjing, Yang, Zhijun, Hu, Peng, Wang, Zongshan

    Published 2024
    “…This paper proposes a multi-robot path planning algorithm that integrates the improved nutcracker optimization algorithm with the improved dynamic window approach. …”
    Get full text
    Get full text
    Get full text
    Article