Search Results - (( java implementation some algorithm ) OR ( using solving waste algorithm ))
Search alternatives:
- java implementation »
- implementation some »
- waste algorithm »
- some algorithm »
- using solving »
- solving waste »
-
1
Plagiarism Detection System for Java Programming Assignments by Using Greedy String-Tilling Algorithm
Published 2008“…The prototype system, known as Java Plagiarism Detection System (JPDS) implements the Greedy-String-Tiling algorithm to detect similarities among tokens in a Java source code files. …”
Get full text
Get full text
Get full text
Thesis -
2
-
3
Ant colony optimization for solving solid waste collection scheduling problems
Published 2009“…Formulating this real life problem into vehicle routing problem with stochastic demand model and using some designed algorithms to minimize operation cost of solid waste management. …”
Get full text
Get full text
Get full text
Article -
4
Ant Colony Optimization for Solving Solid Waste Collection Scheduling Problems
Published 2009“…Formulating this real life problem into vehicle routing problem with stochastic demand model and using some designed algorithms to minimize operation cost of solid waste management. …”
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“…First, previous models focused only on a single landfill site based on the highest score without considering the operational costs criterion in solving LSSP. Second, the Plant Propagation Algorithm (PPA) has never been considered to solve WCVRP. …”
Get full text
Get full text
Get full text
Thesis -
7
Enhanced Heuristic Algorithms with A Vehicle Travel Speed Model for Time-Dependent Vehicle Routing: A Waste Collection Problem
Published 2018“…The benchmark problem consisted of ten sub problems, involving up to 2092 customers. Previous studies solved the benchmark problem using DIC and CIS algorithms with the assumption that the vehicles are travelling with a static speed when collecting the waste. …”
Get full text
Get full text
Article -
8
Enhanced heuristic algorithms with a vehicle travel speed model for time-dependent vehcile routing: A waste collection problem
Published 2018“…This paper proposes a vehicle travel speed model to enhance two heuristic algoritihms from previous studies, namely current initial solution (CIS) and different initial customer (DIC).Both algorithms are used to solve a real-life waste collection vehicle routing benchmark problem with dynamic travel speeds. …”
Get full text
Get full text
Get full text
Article -
9
Design and Implementation of Data-at-Rest Encryption for Hadoop
Published 2017“…It is shown that the implementation of AES encryption algorithm is capable to secure data stored in HDFS to some extent.…”
Get full text
Get full text
Conference or Workshop Item -
10
Design and Implementation of Data-at-Rest Encryption for Hadoop
Published 2017“…It is shown that the implementation of AES encryption algorithm is capable to secure data stored in HDFS to some extent.…”
Get full text
Get full text
Conference or Workshop Item -
11
Web-based clustering tool using fuzzy k-mean algorithm / Ahmad Zuladzlan Zulkifly
Published 2019“…This project will use fuzzy k-means clustering algorithm to cluster the data because it is easy to implement and have many advantages. …”
Get full text
Get full text
Thesis -
12
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 -
13
Faculty timetabling using genetic algorithm
Published 2011“…Faculty Timetabling using Genetic Algorithm (FTGA) is an application that generate optimum timetable for faculty.The target user of this application is faculty staff who responsible in generate timetable.The problem statement of the project is many clashing exist in the timetable.Faculty staff needs to solve the clashing manually.This will waste time and it is a problem for staff to solve the clashing.By implement GA,clashing will be reduced.The objective of the project is to develop aprototype in scheduling application for generates an optimum timetable for a faculty.Genetic algorithm will be implemented.The scope of FTGA is Faculty of Computer Systems & Software Engineering (FCSSE).The methodology use in this project is prototype model.The testing result show 95 out of 100 test cases achieved the maximum fitness value which means there is no clashing in the timetable.The maximum generation is set to 15 generation.Population for each generation is 3 populations.Percentage of FTGA solve the problem is 95%.…”
Get full text
Get full text
Undergraduates Project Papers -
14
-
15
Fuzzy modeling using Bat Algorithm optimization for classification
Published 2018“…A Sazonov Engine which is a fuzzy java engine is use to apply Bat Algorithm in the experiment. …”
Get full text
Get full text
Get full text
Undergraduates Project Papers -
16
Implementation of RIO in UMJaNetSim / Chan Chin We
Published 2004“…In this project, I will do some research on the recent TCP congestion control and avoidance mechanisms and implement one of the mechanisms into the Java Network Simulator (JaNetSim). …”
Get full text
Get full text
Thesis -
17
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 -
18
Comparison of performances of Jaya Algorithm and Cuckoo Search algorithm using benchmark functions
Published 2022“…This paper aims to compare the performance of two metaheuristic algorithms which are Jaya Algorithm (JA) and Cuckoo Search (CS) using some common benchmark functions. …”
Get full text
Get full text
Get full text
Get full text
Conference or Workshop Item -
19
Metaheuristics with disposal facility positioning for the waste collection VRP with time windows
Published 2013“…This paper improves heuristic algorithms presented in Benjamin and Beasley (Comput Oper Res 37(12):2270–2280, 2010) for solving the waste collection vehicle routing problem with time windows, particularly the real life waste collection benchmark problems from Kim et al.…”
Get full text
Get full text
Article -
20