Search Results - (( parameter evaluation method algorithm ) OR ( initial solving waste 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

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

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

Parameter extraction of photovoltaic module using hybrid evolutionary algorithm by Muhsen D.H., Ghazali A.B., Khatib T.

Taguchi-Grey Relational Analysis Method for Parameter Tuning of Multi-objective Pareto Ant Colony System Algorithm by Muthana, Shatha Abdulhadi, Ku Mahamud, Ku Ruhana

“…The gray relational grade (GRG) performance metric and the Friedman test were used to evaluate the algorithm’s performance. The Taguchi-GRA method that produced the new values for the algorithm’s parameters was shown to be able to provide a better multi-objective generator maintenance scheduling (GMS) solution. …”
Get full text
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

Evaluation of lightning current parameters using measured lightning induced voltage on distribution power lines by Izadi, Mahdi, Ab Kadir, Mohd Zainal Abidin, Osman, Miszaina

“…In this paper, an algorithm had been proposed to evaluate the lightning current parameters using measured voltage from overhead distribution lines based on lightning location obtained from lightning location system. …”
Get full text
Get full text

Inversed Control Parameter in Whale Optimization Algorithm and Grey Wolf Optimizer for Wrapper-Based Feature Selection: A Comparative Study by Li Yu Yab, Li Yu Yab, Wahid, Noorhaniza, A Hamid, Rahayu

“…This comparative study aims to investigate and compare the effectiveness of the inversed control parameter in the proposed methods against the original algorithms in terms of the number of selected features and the classification accuracy. …”
Get full text
Get full text

Inversed Control Parameter in Whale Optimization Algorithm and Grey Wolf Optimizer for Wrapper-Based Feature Selection: A Comparative Study by Li Yu Yab, Li Yu Yab, Wahid, Noorhaniza, A Hamid, Rahayu

“…This comparative study aims to investigate and compare the effectiveness of the inversed control parameter in the proposed methods against the original algorithms in terms of the number of selected features and the classification accuracy. …”
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

Evaluation of Lightning Current Using Inverse Procedure Algorithm. by Ab Kadir, Mohd Zainal Abidin, Izadi, Mahdi, Askari, Mohamad Tolou, Hajikhani, Maryam

“…The proposed method considers on all electromagnetic fields components and can evaluate full shape of current, velocity and constant parameters of current models in contrast with previous studies. …”
Get full text
Get full text

Tree-based contrast subspace mining method by Florence Sia Fui Sze

“…Then, the tree-based method, the genetic algorithm based parameter values identification of tree-based method, and followed by the genetic algorithm based tree-based method, for numerical data sets are developed and evaluated. …”
Get full text
Get full text
Get full text

Evaluation of lightning current parameters using measured lightning induced voltage on distribution power lines by Izadi M., Kadir M.Z.A.A., Osman M.

Evaluating power efficient algorithms for efficiency and carbon emissions in cloud data centers: a review by Uddin, Mueen, Darabidarabkhani, Yasaman, Shah, Asadullah, Memon, Jamshed

“…The three algorithms are evaluated for performance using three parameters; power efficiency, cost effectiveness, and amount of CO2 emissions. …”
Get full text
Get full text
Get full text
Get full text
Get full text

Performance evaluation of symmetric cryptography algorithm for database system / Mariam Azwa Yazid by Yazid, Mariam Azwa

“…Cryptography has been proven to be the best method to secure a database. However there are many types of cryptography algorithm that has been established in the market. …”
Get full text
Get full text

An improved back propagation leaning algorithm using second order methods with gain parameter by Mohd Nawi, Nazri, Mohamed Saufi, Noor Haliza, Budiyono, Avon, Abdul Hamid, Noorhamreeza, Rehman Gillani, Syed Muhammad Zubair, Ramli, Azizul Azhar

“…The results show that the proposed Second Order methods with ‘gain’ performed better than the BP algorithm.…”
Get full text
Get full text