Search Results - (( java implementation plan algorithm ) OR ( waste solution using algorithm ))

Refine Results
  1. 1

    A web-based implementation of k-means algorithms by Lee, Quan

    Published 2022
    “…The project was planned using the Kanban development methodology, and was built using HTML, CSS, JavaScript, Django, NumPy and pandas. …”
    Get full text
    Get full text
    Final Year Project / Dissertation / Thesis
  2. 2

    Smart appointment organizer for mobile application / Mohd Syafiq Adam by Adam, Mohd Syafiq

    Published 2009
    “…The development of this project is based on a framework of 5 main stages: planning, analysis, design, implementation and testing. …”
    Get full text
    Get full text
    Thesis
  3. 3

    Web-based clustering tool using fuzzy k-mean algorithm / Ahmad Zuladzlan Zulkifly by Zulkifly, Ahmad Zuladzlan

    Published 2019
    “…This methodology consist of Requirement and Planning, Design, Construction, Testing and Implementation. …”
    Get full text
    Get full text
    Thesis
  4. 4

    Heavy Transportation Shortest Route using Dijkstra’s algorithm (HETRO) / Nurul Aqilah Ahmad Nezer by Ahmad Nezer, Nurul Aqilah

    Published 2017
    “…The development tools used in developing this project is NetBeans by using Java for the implementation of the coding. The methodology that used for developing this system is the Dijkstra’s algorithm. …”
    Get full text
    Get full text
    Thesis
  5. 5

    Path planning for unmanned aerial vehicle (UAV) using rotated accelerated method in static outdoor environment by Shaliza Hayati A. Wahab, Nordin Saad, Azali Saudi, Ali Chekima

    Published 2021
    “…In this study, a fast iterative method known as Rotated Successive Over-Relaxation (RSOR) is introduced. The algorithm is implemented in a self-developed 2D Java tool, UAV Planner. …”
    Get full text
    Get full text
    Get full text
    Get full text
    Article
  6. 6

    A greedy heuristics multiple criteria model for solving multi-landfill site selection and plant propagation algorithm for improving waste collection vehicle routing solutions by Nur Azriati, Mat

    Published 2023
    “…Nonetheless, different study areas generated different outputs based on the area's geographical conditions. The WCVRP solutions using PPA are comparable with other best-known solutions on the benchmark problem in terms of total distance travelled and the number of vehicles used. …”
    Get full text
    Get full text
    Get full text
    Thesis
  7. 7

    Enhanced Heuristic Algorithms with A Vehicle Travel Speed Model for Time-Dependent Vehicle Routing: A Waste Collection Problem by Mat, Nur Azriati, Benjamin, Aida Mauziah, Abdul-Rahman, Syariza

    Published 2018
    “…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
    Article
  8. 8

    Implementation of RIO in UMJaNetSim / Chan Chin We by 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
  9. 9

    Songs Search Using Human Humming Voice by Abdul Rahman, Mohamad Ariff

    Published 2007
    “…The scopes for this project are human humming voice, voice capture in WA V format, songs database, and MIDI file comparing algorithm. Methodologies used in this system are based on system analysis and design methodology comprising planning, analysis, design and implementation. …”
    Get full text
    Get full text
    Final Year Project
  10. 10

    Enhanced heuristic algorithms with a vehicle travel speed model for time-dependent vehcile routing: A waste collection problem by Mat, Nur Azriati, Benjamin, Aida Mauziah, Abdul-Rahman, Syariza

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

    Ant Colony Optimization for Solving Solid Waste Collection Scheduling Problems by Ismail, Zuhaimy, Loh, Ser Lee

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

    Ant colony optimization for solving solid waste collection scheduling problems by Ismail, Zuhaimy, Loh, S. L.

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

    Waste management using machine learning and deep learning algorithms by Sami, Khan Nasik, Amin, Zian Md Afique, Hassan, Raini

    Published 2020
    “…For our research we did the comparisons between three Machine Learning algorithms, namely Support Vector Machine (SVM), Random Forest, and Decision Tree, and one Deep Learning algorithm called Convolutional Neural Network (CNN), to find the optimal algorithm that best fits for the waste classification solution. …”
    Get full text
    Get full text
    Get full text
    Get full text
    Get full text
    Article
  14. 14
  15. 15

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

    An improved partial comparison optimization for utilizing landfill facilities in a waste collection vehicle routing problem by Fazlini, Hashim

    Published 2025
    “…The Waste Collection Vehicle Routing Problem (WCVRP) involves optimizing vehicle routes to minimize travel distance, carbon dioxide (CO₂) emissions, and the number of vehicles used. …”
    Get full text
    Get full text
    Get full text
    Get full text
    Thesis
  18. 18

    An internet of things based for smart recycle waste classification / Akmal Md Nasir by Md Nasir, Akmal

    Published 2023
    “…To accurately categorise waste into the categories of metal, paper, plastic, and maybe other waste types, the system uses an image classification model based on the ResNet algorithm. …”
    Get full text
    Get full text
    Thesis
  19. 19

    ESS-IoT: The Smart Waste Management System for General Household by Wong S.Y., Han H., Cheng K.M., Koo A.C., Yussof S.

    Published 2024
    “…On the other hand, the waste classification is implemented using two classification algorithms: Random Forest (RF) prediction model and Convolutional Neural Network (CNN) prediction model. …”
    Article
  20. 20

    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