Search Results - (( java simulation optimization algorithm ) OR ( based solving waste algorithm ))
Search alternatives:
- java simulation »
- waste algorithm »
- based solving »
- solving waste »
-
1
Attribute reduction based scheduling algorithm with enhanced hybrid genetic algorithm and particle swarm optimization for optimal device selection
Published 2022“…The simulation is implemented with iFogSim and java programming language. …”
Get full text
Get full text
Article -
2
Enhancement of Ant Colony Optimization for Grid Job Scheduling and Load Balancing
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
Ant colony optimization algorithm for load balancing in grid computing
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
Efficiency of heuristic algorithms in solving waste collection vehicle routing problem: a case study
Published 2018“…This paper investigated the efficiency of six heuristic algorithms from prior studies in the attempt to solve issues related to waste collection, namely: (i) Nearest Greedy (NG), (ii) Further from Depot (FFD), (iii) Different Initial Customer (DIC), (iv) Savings Approach, (v) Sweep Algorithm, and (vi) Different Initial Customer based on Sweep Algorithm. …”
Get full text
Get full text
Get full text
Article -
5
Efficiency of heuristic algorithms in solving waste collection vehicle routing problem: a case study
Published 2018“…This paper investigated the efficiency of six heuristic algorithms from prior studies in the attempt to solve issues related to waste collection, namely: (i) Nearest Greedy (NG), (ii) Further from Depot (FFD), (iii) Different Initial Customer (DIC), (iv) Savings Approach, (v) Sweep Algorithm, and (vi) Different Initial Customer based on Sweep Algorithm. …”
Get full text
Get full text
Get full text
Article -
6
A greedy heuristics multiple criteria model for solving multi-landfill site selection and plant propagation algorithm for improving waste collection vehicle routing solutions
Published 2023“…Second, the Plant Propagation Algorithm (PPA) has never been considered to solve WCVRP. …”
Get full text
Get full text
Get full text
Thesis -
7
OPTIMIZED MIN-MIN TASK SCHEDULING ALGORITHM FOR SCIENTIFIC WORKFLOWS IN A CLOUD ENVIRONMENT
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 -
8
Using predictive analytics to solve a newsvendor problem / S. Sarifah Radiah Shariff and Hady Hud
Published 2023“…Secondly, in solving every Machine Learning problem, there is no one algorithm superior to other algorithms. …”
Get full text
Get full text
Book Section -
9
Embedded system for indoor guidance parking with Dijkstra’s algorithm and ant colony optimization
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 -
10
Features selection for intrusion detection system using hybridize PSO-SVM
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 -
11
-
12
Resource management in grid computing using ant colony optimization
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 -
13
Metaheuristics for the waste collection vehicle routing problem with time windows
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 -
14
Implementation of locust inspired scheduling algorithm with huge number of servers for energy efficiency in a cloud datacenter
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 -
15
Development of heuristic methods based on genetic algorithm (GA) for solving vehicle routing problem
Published 2008“…This research explored and developed new heuristics based on GA for solving VRPSD. New algorithms, journal papers and computerized system were also developed. …”
Get full text
Get full text
Monograph -
16
-
17
Metaheuristics for the waste collection vehicle routing problem with time windows, driver rest period and multiple disposal facilities
Published 2010“…In this problem there is a set of waste disposal facilities, a set of customers at which waste is collected and an unlimited number of homogeneous vehicles based at a single depot.Empty vehicles leave the depot and collect waste from customers, emptying themselves at the waste disposal facilities as and when necessary.Vehicles return to the depot empty.We take into consideration time windows associated with customers, disposal facilities and the depot. …”
Get full text
Get full text
Get full text
Article -
18
Mathematical formulation of tabu search in combinatorial optimization
Published 2008“…Tabu Search (TS) is a heuristic method based on the use of prohibition-based techniques and basic heuristics algorithms like local search. …”
Get full text
Get full text
Monograph -
19
An improved partial comparison optimization for utilizing landfill facilities in a waste collection vehicle routing problem
Published 2025“…To integrate this constraint, an enhanced Partial Comparison Optimization (PCO) algorithm is proposed. PCO is a single-solution-based metaheuristic previously shown to be effective in solving Vehicle Routing Problems (VRP). …”
Get full text
Get full text
Get full text
Get full text
Thesis -
20
Integrated immune-commensal-evolutionary programming for economic dispatch and distributed generation installation / Mohd Helmi Mansor
Published 2020“…Consequently, the performance of the proposed MOICEP algorithm is outstanding when compared with MOEP and MOAIS in solving the integrated ED-DG problems under several scenarios. …”
Get full text
Get full text
Thesis
