Search Results - (( java application optimized algorithm ) OR ( based solving waste algorithm ))
Search alternatives:
- optimized algorithm »
- java application »
- waste algorithm »
- based solving »
- solving waste »
-
1
Optimization of blood vessel detection in retina images using multithreading and native code for portable devices
Published 2013Get full text
Get full text
Conference or Workshop Item -
2
Performance evaluation of real-time multiprocessor scheduling algorithms
Published 2016“…These results suggests that optimal algorithms may turn to be non-optimal when practically implemented, unlike USG which reveals far less scheduling overhead and hence could be practically implemented in real-world applications. …”
Get full text
Get full text
Conference or Workshop Item -
3
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 -
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
Route Optimization System
Published 2005“…After much research into the many algorithms available, and considering some, including Genetic Algorithm (GA), the author selected Dijkstra's Algorithm (DA). …”
Get full text
Get full text
Final Year Project -
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
-
8
Attribute reduction based scheduling algorithm with enhanced hybrid genetic algorithm and particle swarm optimization for optimal device selection
Published 2022“…Enhance hybrid genetic algorithm and particle Swarm optimization are developed to select the optimal device in either fog or cloud. …”
Get full text
Get full text
Article -
9
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 -
10
-
11
Ant colony optimization algorithm for load balancing in grid computing
Published 2012Get full text
Get full text
Get full text
Monograph -
12
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 -
13
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 -
14
-
15
-
16
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 -
17
Computer Lab Timetabling Using Genetic Algorithm Case Study - Unit ICT
Published 2006“…Genetic Algorithm is one of the most popular optimization solutions used in various applications such as scheduling. …”
Get full text
Get full text
Thesis -
18
-
19
Examination timetabling using genetic algorithm case study: KUiTTHO
Published 2005“…Genetic Algorithm (GA) is one of the most popular optimization solutions. …”
Get full text
Get full text
Thesis -
20
Examination Timetabling Using Genetic Algorithm Case Study : KUiTTHO
Published 2005“…Genetic Algorithm (GA) is one of the most popular optimization solutions. …”
Get full text
Get full text
Get full text
Thesis
