Search Results - (( variable solution via 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

    Mine blast algorithm for optimization of truss structures with discrete variables by Sadollah, Ali, Bahreininejad, A., Eskandar, Hadi, Abd Shukor, Mohd Hamdi

    Published 2012
    “…The efficiency of the proposed optimizer is tested via the optimization of several truss structures with discrete variables and its performance is compared with several well-known metaheuristic algorithms. …”
    Get full text
    Article
  6. 6

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

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

    On the optimal control of the steel annealing processes as a two-stage hybrid systems via PSO algorithms by Arumugam, M.S., Murthy, G.R., Loo, C.K.

    Published 2009
    “…The heating and soaking furnaces of the steel annealing line form the two-stage hybrid systems. Three algorithms including particle swarm optimisation (PSO) with globally and locally tuned parameters (GLBest PSO), a parameter free PSO algorithm (pf-PSO) and a PSO-like algorithm via extrapolated PSO (ePSO) are considered to solve this optimal control problem for the two-stage steel annealing processes (SAP). …”
    Get full text
    Get full text
    Article
  10. 10

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

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

    Metaheuristics for the waste collection vehicle routing problem with time windows, driver rest period and multiple disposal facilities by Benjamin, Aida Mauziah, Beasley, J. E.

    Published 2010
    “…A procedure that attempts to fully utilise a vehicle is used to obtain an initial solution, with this initial solution being improved using an interchange procedure.We present two metaheuristic algorithms using tabu search and variable neighbourhood search that are based around the neighbour sets.We also present a metaheuristic based on variable neighbourhood tabu search, where the variable neighbourhood is searched via tabu search.Computational results are presented for publicly available waste collection problems involving up to 2092 customers and 19 waste disposal facilities, which indicate that our algorithms produce better quality solutions than previous work presented in the literature.…”
    Get full text
    Get full text
    Get full text
    Article
  14. 14

    Metaheuristics for the waste collection vehicle routing problem with time windows by Benjamin, Aida Mauziah, Beasley, J. E.

    Published 2010
    “…In this problem there is a set of customers which waste is collected by vehicles.Vehicles can visit waste disposal facilities during their working day to empty collected waste and hence continue to collect from customers.The vehicles start and end their routes at a single depot empty.We take into consideration time windows associated with customers, disposal facilities and the depot.Here, we also have a driver rest period.The problem is solved using a number of metaheuristic algorithms namely tabu search (TS) and variable neighbourhood search (VNS).More over, we also present a combined metaheuristic algorithm based on variable neighbourhood tabu search (VNTS).Where the variable neighbourhood is searched via tabu search.Computational experiments on ten publicly available waste collection benchmark problems involving up to 2092 customers and 19 waste disposal facilities indicates that the proposed algorithms are able to find better quality solutions than previous work presented in literature within reasonable computation times.…”
    Get full text
    Get full text
    Conference or Workshop Item
  15. 15
  16. 16
  17. 17
  18. 18

    An ensemble of neural network and modified grey wolf optimizer for stock prediction by Das, Debashish

    Published 2019
    “…Additionally, the research restricts the number of variables through feature selection to enhance the performance of the algorithm. …”
    Get full text
    Get full text
    Thesis
  19. 19

    SecPath: Energy efficient path reconstruction in wireless sensor network using iterative smoothing by Abd, Wamidh Jwdat

    Published 2019
    “…To achieve energy efficiency, it compresses the packet information by using GZIP tools in JAVA. SecPath is evaluated with several variations using 400 nodes in WSN deployments as well as large-scale simulations. …”
    Get full text
    Get full text
    Thesis
  20. 20

    Solving ordinary differential equations using block multistep method by Mehrkanoon, Siamak

    Published 2011
    “…Subsequently, a variable block method is proposed to solve first and higher order IVPs of ODEs using variable step size and order strategy. …”
    Get full text
    Get full text
    Thesis