Search Results - (( waste collection _ algorithm ) OR ( java application optimized algorithm ))

Refine Results
  1. 1
  2. 2

    Performance evaluation of real-time multiprocessor scheduling algorithms by Alhussian, H., Zakaria, N., Abdulkadir, S.J., Fageeri, S.O.

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

    Route Optimization System by Zulkifli, Abdul Hayy

    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
  4. 4
  5. 5
  6. 6

    Backtracking search algorithm in CVRP models for efficient solid waste collection and route optimization by Akhtar M., Hannan M.A., Begum R.A., Basri H., Scavino E.

    Published 2023
    “…Bins; Budget control; Carbon dioxide; Cost reduction; Costs; Crashworthiness; Efficiency; Environmental impact; Fuels; Learning algorithms; Optimization; Solid wastes; Vehicle routing; Backtracking search algorithms; Capacitated vehicle routing problem; Environmental emissions; Optimization modeling; Route optimization; Solid waste collection; Threshold waste level; Waste collection; Waste management; fuel; carbon dioxide; solid waste; algorithm; fuel consumption; modeling; optimization; solid waste; threshold; waste management; algorithm; Article; backtracking search algorithm; capacitated vehicle routing problem model; carbon footprint; controlled study; environmental impact assessment; feasibility study; limit of quantitation; measurement precision; process model; process optimization; solid waste collection; solid waste management; motor vehicle; procedures; solid waste; theoretical model; waste disposal; Algorithms; Carbon Dioxide; Models, Theoretical; Motor Vehicles; Refuse Disposal; Solid Waste…”
    Article
  7. 7

    Capacitated vehicle-routing problem model for scheduled solid waste collection and route optimization using PSO algorithm by Hannan M.A., Akhtar M., Begum R.A., Basri H., Hussain A., Scavino E.

    Published 2023
    “…Costs; Efficiency; Routing algorithms; Scheduling; Solid wastes; Vehicle routing; Capacitated vehicle routing problem; Modified particle swarm optimization; Optimized models; Route optimization; Solid waste collection; Threshold waste level; Travel distance; Waste collection; Particle swarm optimization (PSO); fuel; algorithm; numerical model; optimization; routing; solid waste; transport vehicle; waste disposal; algorithm; Article; capacitated vehicle routing problem model; controlled study; cost; decision making; environmental impact; motor vehicle; nonbiological model; particle swarm optimization algorithm; priority journal; problem solving; process optimization; socioeconomics; solid waste management; travel; validation process; economics; solid waste; waste management; Algorithms; Costs and Cost Analysis; Solid Waste; Waste Management…”
    Article
  8. 8
  9. 9

    Optimising a waste management system using the Artificial Bee Colony (ABC) algorithm by Mohamad Fadzil, Nur Hamisha Helanie

    Published 2025
    “…This study proposed the application of the Artificial Bee Colony (ABC) algorithm to address the Capacitated Vehicle Routing Problem (CVRP) in a real-world waste collection scenario. …”
    Get full text
    Get full text
    Student Project
  10. 10
  11. 11
  12. 12

    Computer Lab Timetabling Using Genetic Algorithm Case Study - Unit ICT by Abdullah, Amran

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

    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
    “…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
  15. 15

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

    Smart Routing For Solid Waste Collection by Ngiam, John Tze

    Published 2023
    “…The system will provide waste collection companies and garbage truck drivers with a user�friendly platform for optimizing routes. …”
    Get full text
    Get full text
    Get full text
    Final Year Project Report / IMRAD
  17. 17

    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 problem is referred to as Time-Dependent Vehicle Routing Problem (TD-VRP) in previous literature.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.However, in this paper the static speed that was considered in both algorithms were improved by introducing dynamic travel speeds to construct vehicle routes for the waste collection drivers. …”
    Get full text
    Get full text
    Get full text
    Article
  18. 18

    A case study of minimising travel time for waste management problem with limited picking capacity in Taman Seremban 3 / Nur Yasmin Izzatul Zaid, Norezwannim Ibrahim and Nur Umairah... by Zaid, Nur Yasmin Izzatul, Ibrahim, Norezwannim, Zainol Hamizi, Nur Umairah

    Published 2024
    “…Finally, the study will determine the minimum travel time for a garbage truck to collect waste in Taman Seremban 3. Using the Dijkstra's algorithm in Python, the minimum travel time for the garbage truck to collect waste in Taman Seremban 3 was 2.55 hours. …”
    Get full text
    Get full text
    Student Project
  19. 19

    Efficiency of heuristic algorithms in solving waste collection vehicle routing problem: a case study by Mat, Nur Azriati, Benjamin, Aida Mauziah, Abdul-Rahman, Syariza

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

    Efficiency of heuristic algorithms in solving waste collection vehicle routing problem: a case study by Mat, Nur Azriati, Benjamin, Aida Mauziah, Abdul-Rahman, Syariza

    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