Search Results - (( problem solving ((waste algorithm) OR (based algorithm)) ) OR ( java implication _ algorithm ))

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

Using predictive analytics to solve a newsvendor problem / S. Sarifah Radiah Shariff and Hady Hud by Shariff, S. Sarifah Radiah, Hud, Hady

“…Secondly, in solving every Machine Learning problem, there is no one algorithm superior to other algorithms. …”
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

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

Development of heuristic methods based on genetic algorithm (GA) for solving vehicle routing problem by Ismail, Zuhaimy, Nurhadi, Irhamah, Zainuddin, Zaitul Marlizawati

“…This research explored and developed new heuristics based on GA for solving VRPSD. New algorithms, journal papers and computerized system were also developed. …”
Get full text
Get full text

Solving the vehicle routing problem with stochastic demands via hybrid genetic algorithm-tabu search by Ismail, Zuhaimy, Irhamah, Irhamah

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

Mathematical formulation of tabu search in combinatorial optimization by Ismail, Zuhaimy

“…Tabu Search (TS) is a heuristic method based on the use of prohibition-based techniques and basic heuristics algorithms like local search. …”
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.

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

Integrated immune-commensal-evolutionary programming for economic dispatch and distributed generation installation / Mohd Helmi Mansor by Mansor, Mohd Helmi

“…Consequently, the performance of the proposed MOICEP algorithm is outstanding when compared with MOEP and MOAIS in solving the integrated ED-DG problems under several scenarios. …”
Get full text
Get full text

Classification model for water quality using machine learning techniques by Azilawati, Rozaimee, Azrul Amri, Jamal, Azwa, Abdul Aziz

“…Generally, wastewater is harmful to our lives, and bringing scientific models in solving this problem is obligatory.…”
Get full text
Get full text

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

“…To integrate this constraint, an enhanced Partial Comparison Optimization (PCO) algorithm is proposed. PCO is a single-solution-based metaheuristic previously shown to be effective in solving Vehicle Routing Problems (VRP). …”
Get full text
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.

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

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

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

Controlling Algorithm for Energy-Consumption, Radio Bandwidth and Signal Strength Deploying Single Fitness Function to Solve Coverage Area Problems by Marsal, Kalid Abdlkader, Abdullah, Ismail, Waidah Ismail, Khairi Abdul Rahim

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

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

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

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

Combustion modelling of an industrial municipal waste combustor in Malaysia by Hussain, Ahmad, Ani, Farid Nasir, Sulaiman, Norzalia, Adnan, Mohammed Fadzil

“…Disposal of Municipal Solid Waste (MSW) in Malaysia by open incineration is increasingly becoming a problem. …”
Get full text
Get full text
Get full text