Search Results - (( using waste collection algorithm ) OR ( java adaptation optimization algorithm ))
Search alternatives:
- adaptation optimization »
- collection algorithm »
- waste collection »
- java adaptation »
-
1
Parallel distributed genetic algorithm development based on microcontrollers framework
Published 2023Conference paper -
2
-
3
Dijkstra’s Algorithm for optimal recyclable waste collection system in Port Dickson / Nur Jazlina Mohd Iszairi, Aina Zulaika Md Ramli and Nursabrina Saifulbahri
Published 2023“…The data are collected from Google Map and are applied in Excel Solver using the Dijkstra’s Algorithm. …”
Get full text
Get full text
Student Project -
4
Optimising a waste management system using the Artificial Bee Colony (ABC) algorithm
Published 2025Get full text
Get full text
Student Project -
5
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...
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 -
6
Enhanced Heuristic Algorithms with A Vehicle Travel Speed Model for Time-Dependent Vehicle Routing: A Waste Collection Problem
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 -
7
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 -
8
Smart Routing For Solid Waste Collection
Published 2023“…The current method of waste collection, used by both private and government agencies, is to conduct a real-time study of citizens' habits and movements before formulating a route plan. …”
Get full text
Get full text
Get full text
Final Year Project Report / IMRAD -
9
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 -
10
ESS-IoT: The Smart Waste Management System for General Household
Published 2024“…The critical issue for better waste management is waste collection and sorting. …”
Article -
11
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 -
12
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 -
13
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 -
14
Metaheuristics for the waste collection vehicle routing problem with time windows, driver rest period and multiple disposal facilities
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 -
15
Finding An Alternative Routing For Solid Waste Management
Published 2020“…In this research, Dijkstra Algorithm and Travelling Salesman Problem (TSP) using GIS Software 10.1 were used to optimize the route from Seberang Perai Industrial area to Ampang Jajar waste transfer station. …”
Get full text
Get full text
Thesis -
16
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“…This research focuses on two solid waste management (SWM) problems, particularly the landfill site selection problem (LSSP) and the waste collection vehicle routing problem (WCVRP). …”
Get full text
Get full text
Get full text
Thesis -
17
Nearest greedy for solving the waste collection vehicle routing problem: A case study
Published 2017“…This paper presents a real case study pertaining to an issue related to waste collection in the northern part of Malaysia by using a constructive heuristic algorithm known as the Nearest Greedy (NG) technique. …”
Get full text
Get full text
Article -
18
An improved partial comparison optimization for utilizing landfill facilities in a waste collection vehicle routing problem
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 -
19
Design of smart waste bin and prediction algorithm for waste management in household area
Published 2018“…The limitation to this study is that the amount of smart waste bin should be replicated more so that all data for waste weight is directly collected from the smart waste bin.…”
Get full text
Get full text
Get full text
Get full text
Article -
20
Using predictive analytics to solve a newsvendor problem / S. Sarifah Radiah Shariff and Hady Hud
Published 2023“…Firstly, an algorithm with good performance metrics over a small data set collection may obtain worse results when the data set collection is extended. …”
Get full text
Get full text
Book Section
