Search Results - (( java application customization algorithm ) OR ( waste collection from algorithm ))

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

“…Hence, the total distance for the recyclable waste collection from Depot to each drop-off collection center is 7384 meters.…”
Get full text
Get full text

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.

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

“…Inefficient waste collection often suffers from inefficient such as poor route planning, excessive travel distance and underutilization of vehicle capacity. …”
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

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

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

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

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

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

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

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

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

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

“…The solution proposed from the technique was compared with the present vehicle routes implemented by a waste collection company within the city. …”
Get full text
Get full text

Design of smart waste bin and prediction algorithm for waste management in household area by Yusoff, Siti Hajar, Abdullah Din, Ummi Nur Kamilah, Mansor, Hasmah, Midi, Nur Shahida, Zaini, Syasya Azra

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

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

“…Whereas WCVRP involves, the construction of vehicle routes for collecting waste from customers and discharging their loads at the landfills with the minimum total distance travelled. …”
Get full text
Get full text
Get full text

Truck queuing analysis at landfill sites in a waste collection vehicle routing problem by Benjamin, Aida Mauziah, Ku-Mahamud, Ku Ruhana, Idrus, Zanariah

“…This paper presents an analysis of a truck queuing problem at landfill sites due to a static rest time of truck drivers in a waste collection vehicle routing problem. The analysis is based on a solution of two datasets from a benchmark waste collection problem using the nearest greedy heuristic algorithm.In this problem, all drivers need to have a one-hour rest break during their collection.The rest break can start from 11.00 a.m. to 12.00 p.m. …”
Get full text
Get full text
Get full text

A review of Artificial Intelligence application of sustainable solid waste management practices in Western Asia by Nagimeldin, Olla, Ahmad Tajuddin, Husna, Jami, Mohammed Saedi

“…Over the past few years, Machine-learning algorithms and Artificial intelligence models have demonstrated great ability to optimize and automate critical solid waste and waste management complications. …”
Get full text
Get full text
Get full text

Enhancing obfuscation technique for protecting source code against software reverse engineering by Mahfoudh, Asma

“…The proposed technique can be enhanced in the future to protect games applications and mobile applications that are developed by java; it can improve the software development industry. …”
Get full text
Get full text

Efficient Model for Waste Load and Route Optimization by Achmad, Nopransyah, Tri Basuki, Kurniawan, Misinem, ., Muhammad Izman, Herdiansyah, Edi Surya, Negara

“…The model utilizes machine learning techniques to forecast the quantity of waste collected by GPTs. We have created an optimization algorithm that usesthe forecast outcome from a prior research dataset. …”
Get full text
Get full text
Get full text