Search Results - (( construct solution using algorithm ) OR ( java swarm optimization algorithm ))

Refine Results
  1. 1

    Enhancement of Ant Colony Optimization for Grid Job Scheduling and Load Balancing by Husna, Jamal Abdul Nasir

    Published 2011
    “…A simulation environment was developed using Java programming to test the performance of the proposed EACO algorithm against existing grid resource management algorithms such as Antz algorithm, Particle Swarm Optimization algorithm, Space Shared algorithm and Time Shared algorithm, in terms of processing time and resource utilization. …”
    Get full text
    Get full text
    Get full text
    Thesis
  2. 2
  3. 3

    Features selection for intrusion detection system using hybridize PSO-SVM by Tabaan, Alaa Abdulrahman

    Published 2016
    “…Hybridize Particle Swarm Optimization (PSO) as a searching algorithm and support vector machine (SVM) as a classifier had been implemented to cope with this problem. …”
    Get full text
    Get full text
    Thesis
  4. 4

    An ensemble learning method for spam email detection system based on metaheuristic algorithms by Behjat, Amir Rajabi

    Published 2015
    “…In order to address the challenges that mentioned above in this study, in the first phase, a novel architecture based on ensemble feature selection techniques include Modified Binary Bat Algorithm (NBBA), Binary Quantum Particle Swarm Optimization (QBPSO) Algorithm and Binary Quantum Gravita tional Search Algorithm (QBGSA) is hybridized with the Multi-layer Perceptron (MLP) classifier in order to select relevant feature subsets and improve classification accuracy. …”
    Get full text
    Get full text
    Thesis
  5. 5

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

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

    Published 2024
    “…This thesis presents an investigation of using the Intelligent Water Drops (IWD) algorithm to construct and produce good quality solutions for the UETP. …”
    thesis::doctoral thesis
  7. 7

    Sequential constructive algorithm incorporate with fuzzy logic for solving real world course timetabling problem by Tan, Li June, Joe H. Obit, Leau, Yu Beng, Jetol Bolongkikit, Rayner Alfred

    Published 2020
    “…The proposed method will be used to generate feasible solution as well as improve the quality of the solution. …”
    Get full text
    Get full text
    Get full text
    Conference or Workshop Item
  8. 8
  9. 9
  10. 10

    A hybrid adaptive harmony search with modified great deluge algorithm for school timetabling by Arbaoui, Billel

    Published 2025
    “…In Phase 1, heuristic rules refine the time assignment stage to improve an existing construction algorithm. Phase 2 adaptively tunes parameters based on iteration position, solution number, behavioral status, and parameter linkages. …”
    Get full text
    Get full text
    Thesis
  11. 11

    Optimised Crossover Genetic Algorithms for Combinatorial Optimisation Problems by Nazif, Habibeh

    Published 2010
    “…A Genetic Algorithm is successful in generating near -optimal solutions if it is able to produce o®spring during crossover that is better than the parent solutions. …”
    Get full text
    Get full text
    Thesis
  12. 12

    Development of a scheduling tool for constructing a Malaysian school timetable using genetic algorithms / Salihin Farag Shoeeb by Salihin Farag , Shoeeb

    Published 2003
    “…A recent approach to derive a near-optimal solution is to use evolutionary or genetic algorithms. …”
    Get full text
    Get full text
    Thesis
  13. 13

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

    Enhancement of Ant System Algorithm for Course Timetabling Problem by Djamarus, Djasli

    Published 2009
    “…Results of the experiments that were conducted using various data sets showed that the proposed algorithm produced better course schedule solution than the Greedy Algorithm, Genetic Algorithm, and other variants of Ant System Algorithm.…”
    Get full text
    Get full text
    Get full text
    Thesis
  15. 15
  16. 16

    A Hybrid of Ant Colony Optimization Algorithm and Simulated Annealing for Classification Rules by Rizauddin, Saian

    Published 2013
    “…The second proposed algorithm uses SA to optimize the terms selection while constructing a rule. …”
    Get full text
    Get full text
    Get full text
    Get full text
    Thesis
  17. 17

    Simulated annealing algorithm for solving chambering student-case assignment problem by Ghazali, Saadiah, Abdul Rahman, Syariza

    Published 2015
    “…The objective of the study is to minimize the total completion time for all students in solving the given cases.This study employed a minimum cost greedy heuristic in order to construct a feasible initial solution.The search then is preceded with a simulated annealing algorithm for further improvement of solution quality.The analysis of the obtained result has shown that the proposed simulated annealing algorithm has greatly improved the solution constructed by the minimum cost greedy heuristic. …”
    Get full text
    Get full text
    Get full text
    Conference or Workshop Item
  18. 18

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

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

    Integrated optimal control and parameter estimation algorithms for discrete-time nonlinear stochastic dynamical systems by Kek, Sie Long

    Published 2011
    “…Furthermore, the accuracy of the state estimate with the smallest state error covariance is enhanced by using the Kalman filtering theory. This enhancement produces the filtering solution by using the second sub-algorithm. …”
    Get full text
    Get full text
    Thesis