Search Results - (( java simulation optimization algorithm ) OR ( using combination annealing algorithm ))

Refine Results
  1. 1

    Efficient Sequential and Parallel Routing Algorithms in Optical Multistage Interconnection Network by Abduh Kaid, Monir Abdullah

    Published 2005
    “…The efficient combination of simulated annealing algorithm with the best heuristic algorithms gave much better result in a very minimal time. …”
    Get full text
    Get full text
    Thesis
  2. 2

    An improved simulated annealing algorithm to avoid crosstalk in optical omega network by Abdullah, Monir, Othman, Mohamed, Johari, Rozita

    Published 2006
    “…It is a good idea to use these two algorithms to improve the performance. …”
    Get full text
    Get full text
    Conference or Workshop Item
  3. 3

    IWDSA: a hybrid Intelligent Water Drops with a Simulated Annealing for the localization improvement in wireless sensor networks by Gumaida, Bassam, Ibrahim, Adamu Abubakar

    Published 2024
    “…The proposed algorithm, named Intelligent Water Drops with Simulated Annealing (IWDSA), combines two powerful optimization methods: Intelligent Water Drops (IWD) and Simulated Annealing (SA). …”
    Get full text
    Get full text
    Get full text
    Article
  4. 4
  5. 5

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

    Published 2011
    “…Global pheromone update is performed after the completion of processing the jobs in order to reduce the pheromone value of resources. 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
  6. 6

    Ant colony optimization algorithm for load balancing in grid computing by Ku-Mahamud, Ku Ruhana, Mohamed Din, Aniza

    Published 2012
    “…The proposed algorithm is known as the enhance ant colony optimization (EACO). …”
    Get full text
    Get full text
    Get full text
    Monograph
  7. 7

    Development of heuristic methods based on genetic algorithm (GA) for solving vehicle routing problem by Ismail, Zuhaimy, Nurhadi, Irhamah, Zainuddin, Zaitul Marlizawati

    Published 2008
    “…This research proposes the enhanced metaheuristic algorithms that exploit the power of Tabu Search, Genetic Algorithm, and Simulated Annealing for solving VRPSD. …”
    Get full text
    Get full text
    Monograph
  8. 8

    A meta-heuristics based input variable selection technique for hybrid electrical energy demand prediction models by ul Islam, B., Baharudin, Z.

    Published 2017
    “…These models are developed by integrating multilayer perceptron neural network and evolutionary optimization techniques. Genetic algorithm and simulated annealing techniques are used to optimize the control parameters of the neural network. …”
    Get full text
    Get full text
    Article
  9. 9

    Simulated annealing for solving economic dispatch problem / Wan Khairulizuan Wan Ismail by Wan Ismail, Wan Khairulizuan

    Published 2010
    “…In the development of the algorithm, transmission losses are first discounted and they are subsequently incorporated in the algorithm through the use of the B-matrix loss formula. …”
    Get full text
    Get full text
    Thesis
  10. 10

    OPTIMIZED MIN-MIN TASK SCHEDULING ALGORITHM FOR SCIENTIFIC WORKFLOWS IN A CLOUD ENVIRONMENT by Murad S.S., Badeel R., Alsandi N.S.A., Alshaaya R.F., Ahmed R.A., Muhammed A., Derahman M.

    Published 2023
    “…To achieve this, we propose a new noble mechanism called Optimized Min-Min (OMin-Min) algorithm, inspired by the Min-Min algorithm. …”
    Review
  11. 11

    Entanglement Distillation Optimization Using Fuzzy Relations for Quantum State Tomography by Ganesan, T., Elamvazuthi, I.

    Published 2023
    “…The entanglement distillation optimization problem is solved using the combined coupled map lattice and dual annealing approach. …”
    Get full text
    Get full text
    Article
  12. 12

    Embedded system for indoor guidance parking with Dijkstra’s algorithm and ant colony optimization by Mohammad Ata, Karimeh Ibrahim

    Published 2019
    “…This study proposes a car parking management system which applies Dijkstra’s algorithm, Ant Colony Optimization (ACO) and Binary Search Tree (BST) in structuring a guidance system for indoor parking. …”
    Get full text
    Get full text
    Thesis
  13. 13

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

    Resource management in grid computing using ant colony optimization by Ku-Mahamud, Ku Ruhana, Mohamed Din, Aniza

    Published 2011
    “…Resources with high pheromone value are selected to process the submitted jobs.Global pheromone update is performed after completion processing the jobs in order to reduce the pheromone value of resources.A simulation environment was developed using Java programming to test the performance of the proposed EACO algorithm against other ant based algorithm, in terms of resource utilization.Experimental results show that EACO produced better grid resource management solution.…”
    Get full text
    Get full text
    Get full text
    Get full text
    Monograph
  15. 15

    A new ant based rule extraction algorithm for web classification by Ku-Mahamud, Ku Ruhana, Saian, Rizauddin

    Published 2011
    “…Using Classifier-based attribute subset selection will reduce more attributes, but sacrifice the performance of the classifier.A hybrid ant colony optimization with simulated annealing algorithm to discover rules from data is proposed.The simulated annealing technique will minimize the problem of low quality discovered rule by an ant in a colony.The best rule for a colony will then be chosen and later the best rule among the colonies will be included in the rule set.The best rule for a colony will then be chosen and later the best rule among the colonies will be included in the rule set.The rule set is arranged in decreasing order of generation.Thirteen data sets which consist of discrete and continuous data were used to evaluate the performance of the proposed algorithm in terms of accuracy, number of rules and number of terms in the rules.Experimental results obtained from the proposed algorithm are comparable to the results of the Ant-Miner algorithm in terms of rule accuracy but are better in terms of rule simplicity.…”
    Get full text
    Get full text
    Get full text
    Get full text
    Monograph
  16. 16

    Implementation of locust inspired scheduling algorithm with huge number of servers for energy efficiency in a cloud datacenter by Azhar, Nur Huwaina

    Published 2019
    “…Cloudsim is used as Discrete Event Simulation tool and Java as coding language to evaluate LACE algorithm. …”
    Get full text
    Get full text
    Thesis
  17. 17
  18. 18
  19. 19

    A Simulated Annealing-Based Hyper-Heuristic For The Flexible Job Shop Scheduling Problem by Kelvin, Lim Ching Wei

    Published 2023
    “…Flexible job shop scheduling problem (FJSP) is a common optimisation problem in the industry. The use of parallel machines allows an operation to be executed on a machine assigned from a set of alternative machines, raising a combination of machine assignment and job sequencing sub-problems. …”
    Get full text
    Get full text
    Thesis
  20. 20

    Implementation of ump course registration system using heuristic method by Wong, Wei Leong

    Published 2012
    “…The Open Registration (OR) system is different from the “Program-based Registration System” which allows students to register their academic subject based on their own study plan.UMP’s students are required to make the combination of the study plan to make sure their timetable is suitable with their favorite time.There are some methods on solving the timetabling such as Tabu Search (Qu et al.,2009),Hill Climbing(Appleby et al., 2011),Simulated Annealing (Kirkpatrick and Vecci,1983)and Great Deluge Algorithm (Dueck,1993)which had been used to solve the College or University timetabling problems.These searching methods fulfilled the automated timetabling system and applied on many systems.These researches will benefit the UMP’s student to view the course information with more specific details and convenience the process course registration online.…”
    Get full text
    Get full text
    Undergraduates Project Papers