Search Results - (( based optimization based algorithm ) OR ( initial solving waste algorithm ))

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

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

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

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

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

Opposition-based Whale Optimization Algorithm by Alamri, Hammoudeh S., Alsariera, Yazan A., Kamal Z., Zamli

“…In order to improve solution accuracy and reliability, this paper proposes a new algorithm based on WOA. The new algorithm called Opposition-based Whale Optimization (OWOA). …”
Get full text
Get full text
Get full text

Fuzzy adaptive teaching learning-based optimization for solving unconstrained numerical optimization problems by Din, Fakhrud, Khalid, Shah, Fayaz, Muhammad, Gwak, Jeonghwan, Kamal Z., Zamli, Mashwani, Wali Khan

“…To overcome these drawbacks and to achieve an appropriate percentage of exploitation and exploration, this study presents a new modified teaching learning-based optimization algorithm called the fuzzy adaptive teaching learning-based optimization algorithm. …”
Get full text
Get full text
Get full text

Rule-Based Multi-State Gravitational Search Algorithm for Discrete Optimization Problem by Ismail, Ibrahim, Zuwairie, Ibrahim, Zulkifli, Md. Yusof

“…In this study, rule-based multi-state gravitational search algorithm (RBMSGSA) algorithm is proposed to solve discrete combinatorial optimization problems. …”
Get full text
Get full text
Get full text
Get full text

Hybrid firefly and particle swarm optimization algorithm for multi-objective optimal power flow with distributed generation by Khan, Abdullah

“…Finally, a crowding distance and non-dominated-sorting-based multi-objective hybrid firefly & particle swarm optimization (MOHFPSO) algorithm is designed for MOOPF problems. …”
Get full text
Get full text

An enhanced swap sequence-based particle swarm optimization algorithm to solve TSP by Bibi Aamirah Shafaa Emambocus, Muhammed Basheer Jasser, Muzaffar Hamzah, Aida Mustapha, Angela Amphawan

“…To evaluate the proposed algorithm, the solutions to the TSP problem obtained from the proposed algorithm and swap sequence based PSO are compared in terms of the best solution, mean solution, and time taken to converge to the optimal solution. …”
Get full text
Get full text
Get full text
Get full text
Get full text

Metaheuristic multi-hop clustering optimization for energy-efficient wireless sensor network by Vincent Chung, Norah Tuah, Kit Guan Lim, Min Keng Tan, Ismail Saad, Kenneth Tze Kin Teo

“…Based on the performance evaluation, GACS outperforms both Genetic Algorithm (GA)-based cluster optimization algorithm and Cuckoo Search (CS)-based multi-hop optimization algorithm.…”
Get full text
Get full text

Optimization of cost-based hybrid flowshop scheduling using teaching-learning-based optimization algorithm by Ullah, Wasif, Muhammad Ammar, Nik Mu’tasim, Mohd Fadzil Faisae, Ab Rashid

“…This paper investigates the optimization of a CHFS problem using the Teaching Learning-Based Optimization (TLBO) algorithm. …”
Get full text
Get full text
Get full text

Simulated Kalman Filter algorithms for solving optimization problems by Nor Hidayati, Abdul Aziz

“…Applications and improvements to the HKA algorithm suggest that optimization algorithm based on estimation principle has a huge potential in solving a wide variety of optimization problems. …”
Get full text
Get full text

A Multi-State Gravitational Search Algorithm for Combinatorial Optimization Problems by Ismail, Ibrahim, Zuwairie, Ibrahim, Hamzah, Ahmad, Zulkifli, Md. Yusof

“…The binary-based algorithms including the binary gravitational search algorithm (BGSA) were designed to solve discrete optimization problems. …”
Get full text
Get full text
Get full text

On Adopting Parameter Free Optimization Algorithms for Combinatorial Interaction Testing by Kamal Z., Zamli, Alsariera, Yazan A., Nasser, Abdullah B., Alsewari, Abdulrahman A.

“…Although useful, strategies based on the aforementioned optimization algorithms are not without limitation. …”
Get full text
Get full text
Get full text

A hybrid algorithm based on artificial bee colony and artificial rabbits optimization for solving economic dispatch problem by Lee, Wei Wen, Hashim, Mohd Ruzaini

Get full text
Get full text
Get full text