Search Results - (( initial solving waste algorithm ) OR ( parallel optimization sensor 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

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

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

Get full text
Get full text

Simulated kalman filter (SKF) based image template matching for distance measurement by using stereo vision system by Nurnajmin Qasrina Ann, Ayop Azmi

“…Stereo vision sensor consists of two stereo cameras, mounted parallel in stationary position. …”
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

Single-objective and multi-objective optimization algorithms based on sperm fertilization procedure / Hisham Ahmad Theeb Shehadeh by Hisham Ahmad, Theeb Shehadeh

“…The obtained results are compared with the results of four algorithms. These algorithms are Genetic Algorithms (GA), Parallel Genetic Algorithm (PGA), Particle Swarm Optimization (PSO) and Accelerated Particle Swarm Optimization (APSO). …”
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.

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

Performance monitoring algorithm for optimizing electrical power generated by using photovoltaic system by Pradeep, M.V.K., Balbir, S.M.S., Norani, M.M.

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

“…The improved PCO incorporates a Nearest Greedy (NG) algorithm for initial solution construction, dynamic parameter adjustment, and two additional neighborhood operators. …”
Get full text
Get full text
Get full text
Get full text

Development of a fuzzy multi-objective mathematical model for hazardous waste location-routing problem by Hassani, Omid Boyer

“…To solve the model a (fast elitist Non-Dominated Sorting Genetic Algorithm (NSGAII)) and also the (weighted sum method (WSM)) were used and their results were compared to each other. …”
Get full text
Get full text

Estimation of core size distribution of magnetic nanoparticles using high-Tc SQUID magnetometer and particle swarm optimizer-based inversion technique by Mohd Mawardi, Saari, Mohd Herwan, Sulaiman, Kiwa, Toshihiko

“…In this work, the core size estimation technique of magnetic nanoparticles (MNPs) using the static magnetization curve obtained from a high-Tc SQUID magnetometer and a metaheuristic inversion technique based on the Particle Swarm Optimizer (PSO) algorithm is presented. The high-Tc SQUID magnetometer is constructed from a high-Tc SQUID sensor coupled by a flux transformer to sense the modulated magnetization signal from a sample. …”
Get full text
Get full text
Get full text

Mixed convection boundary layer flow embedded in porous medium with nanofluids by Mat Yasin, Mohd Hafizi

“…Shooting method from MAPLE is used to solve the problem. This well-known technique is an iterative algorithm which attempts to identify appropriate initial conditions for a related initial value problem (IVP) that provides the solution to the original boundary value problem (BVP). …”
Get full text
Get full text

Online teleoperation of writing manipulator through graphics processing unit based accelerated stereo vision by Abu Raid, Fadi Imad Osman

“…These algorithms are then parallelized using Compute Unified Device Architecture CUDA C language to run on Graphics Processing Unit GPU for hardware acceleration. …”
Get full text
Get full text

Combustion modeling of municipal waste combustor by Hussain, Ahmad, Ani, Farid Nasir, Darus, Amer Nordin, Adnan, Mohammed Fadzil, Surjosatyo, Adi, Mustafa, Azeman, Salema, Arshad A.

“…The differential equations were discretized by the Finite Volume Method and were solved by the SIMPLE algorithm. The k-ε turbulence model was employed. …”
Get full text
Get full text

DC-based PV-powered home energy system by Sabry, Ahmad H.

“…A controller based on an algorithm of one time maximum power point (MPP) is proposed to mitigate those losses. …”
Get full text
Get full text

Optimization of Microbial Electrolysis Cell for Sago Mill Wastewater Derived Biohydrogen via Modeling and Artificial Neural Network by Mohamad Afiq, Mohd Asrul

“…Model validity describes the first sub-objective, which is to solve the complexity of the nonlinear interaction of multiple MEC input variables related to the hydrogen production rate response using artificial neural networks (ANN) before validating the mathematical modeling results by comparing experimental data with the predicted substrate concentration profile and hydrogen production rate profile based on the re-estimated input values of the model parameters using single-objective optimization based on the nonlinear convex method using gradient descent algorithm. …”
Get full text
Get full text
Get full text