Search Results - (( waste pollination algorithm ) OR ( waste collection algorithm ))

Performance properties optimization of triaxial ceramic-palm oil fuel ash by employing Taguchi design and flower pollination algorithm by Zainudin, Azlan

“…The combustion of wasted palm oil materials leads to the formation of Palm Oil Fuel Ash (POFA). …”
Get full text
Get full text
Get full text
Get full text

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.

“…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…”

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.

“…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…”

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

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

Dijkstra’s Algorithm for optimal recyclable waste collection system in Port Dickson / Nur Jazlina Mohd Iszairi, Aina Zulaika Md Ramli and Nursabrina Saifulbahri by Mohd Iszairi, Nur Jazlina, Md Ramli, Aina Zulaika, Saifulbahri, Nursabrina

“…Irregular waste collection services are among key challenges for establishing waste recycling. …”
Get full text
Get full text

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

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

Metaheuristics for the waste collection vehicle routing problem with time windows by Benjamin, Aida Mauziah, Beasley, J. E.

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

Smart Routing For Solid Waste Collection by Ngiam, John Tze

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

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

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

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

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

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

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

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

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

Metaheuristics with disposal facility positioning for the waste collection VRP with time windows by Benjamin, Aida Mauziah, Beasley, J. E.

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

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

“…The critical issue for better waste management is waste collection and sorting. …”

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

“…Problem statement: Southern Waste Management environment (SWM environment) is a company responsible for the collection and disposal of solid waste for the city of Johor Bahru, a city with over one million populations. …”
Get full text
Get full text
Get full text

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

“…Southern Waste Management environment (SWM environment) is a company responsible for the collection and disposal of solid waste for the city of Johor Bahru, a city with over one million populations. …”
Get full text
Get full text
Get full text

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.

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

Finding An Alternative Routing For Solid Waste Management by Manoharam, Gaeithry

“…Globally, waste collection process represents 74% of operating costs, yet it has been given minor attention. …”
Get full text
Get full text

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

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

Nearest greedy for solving the waste collection vehicle routing problem: A case study by Mat, Nur Azriati, Benjamin, Aida Mauziah, Abdul-Rahman, Syariza, Wibowo, Antoni

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