Search Results - (( using location problems algorithm ) OR ( java simulation optimization algorithm ))

Refine Results
  1. 1
  2. 2

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

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

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

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

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

    Enhanced cell-based algorithm with dynamic radius in solving capacitated multi-source weber problem by Nurhazwani, Ahmad Razak

    Published 2021
    “…Second, initial facility configuration was determined using fixed and dynamic radius. Third, Alternating Transportation Problem (ATL) was applied to find a new location. …”
    Get full text
    Get full text
    Thesis
  8. 8

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

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

    Multi-objective harmony search algorithm for capacitated location-routing problem of reverse logistics using fuzzy membership approach by Misni, Farahanim, Soon, Lee Lai, Jaini, Nor Izzati

    Published 2024
    “…Location-routing problem is a problem that integrates both facility location problem and vehicle routing problem. …”
    Get full text
    Get full text
    Get full text
    Conference or Workshop Item
  11. 11

    Restaurant locator using Djikstra Algorithm / Mohamad Aliff Hakimi Lukman Hakim by Lukman Hakim, Mohamad Aliff Hakimi

    Published 2017
    “…In network theory, it’s known as the shortest-path problem, and Dijkstra’s algorithm is usually used to solve it. …”
    Get full text
    Get full text
    Thesis
  12. 12
  13. 13

    Solving vehicle routing problem by using improved K-nearest neighbor algorithm for best solution by Mohammed, Mazin Abed, Abd Ghani, Mohd Khanapi, Hamed, Raed Ibraheem, A. Mostafa, Salama, Ahmed Ibrahim, Dheyaa, Jameel, Humam Khaled, Alallah, Ahmed Hamed

    Published 2017
    “…Approach: The approach has been presented based on two phases: firstly, the algorithms have been adapted to solve the research problem, where its procedure is different than the common algorithm. …”
    Get full text
    Get full text
    Get full text
    Article
  14. 14

    Evaluating the effectiveness of integrated benders decomposition algorithm and epsilon constraint method for multi-objective facility location problem under demand uncertainty by Rahimi, Iman, Tang, Sai Hong, Ahmadi, Abdollah, Ahmad, Siti Azfanizam, Lee, Lai Soon, Sharaf, Adel M.

    Published 2017
    “…One of the most challenging issues in multi-objective problems is finding Pareto optimal points. This paper describes an algorithm based on Benders Decomposition Algorithm (BDA) which tries to find Pareto solutions. …”
    Get full text
    Get full text
    Get full text
    Article
  15. 15

    Comparison of anonymous tracker algorithms / Nur Shafikah Mat Daud by Mat Daud, Nur Shafikah

    Published 2014
    “…Then, time processing and accuracy which one is the best of algorithms will be determine. The research is provide useful significance that able to detect identity of user allow as anonymous and able to detect location of user through IP Address. …”
    Get full text
    Get full text
    Thesis
  16. 16

    A New Hybrid Approach Based On Discrete Differential Evolution Algorithm To Enhancement Solutions Of Quadratic Assignment Problem by Asaad Shakir, Hameed, Mohd Aboobaider, Burhanuddin, Mutar, Modhi Lafta, Ngo, Hea Choon

    Published 2020
    “…Even though the use of several mathematical formulations is employed for FLP, Quadratic Assignment Problem (QAP) is one of the most commonly used. …”
    Get full text
    Get full text
    Get full text
    Article
  17. 17

    Mobile robot navigation using GPS to solve target location achieving problem / Saiful Zaimy Yahaya, Rozan Boudville and Mohamad Faizal Abdul Rahman by Yahaya, Saiful Zaimy, Boudville, Rozan, Abdul Rahman, Mohamad Faizal

    Published 2010
    “…Navigation is very crucial due to the robot ability to adapt and sustain to its environment and find it path to the target location. This research proposed mobile robot navigation using GPS to cope for the navigation problem in reaching the target location. …”
    Get full text
    Get full text
    Research Reports
  18. 18

    Using artificial intelligence search in solving the camera placement problem by Altahir, A.A., Asirvadam, V.S., Hamid, N.H.B., Sebastian, P.

    Published 2022
    “…Two case studies are used to evaluate those algorithms, and the camera placement problem is formulated as a coverage maximization problem. …”
    Get full text
    Get full text
    Book
  19. 19

    Mathematical models and optimization algorithms for low-carbon Location-Inventory-Routing Problem with uncertainty by Liu, Lihua

    Published 2024
    “…This thesis considers the low carbon Location-Inventory-Routing Problem (LIRP) by addressing the challenges of demand uncertainty through the application of stochastic and fuzzy methods. …”
    Get full text
    Get full text
    Get full text
    Thesis
  20. 20