Search Results - (( based solving waste algorithm ) OR ( using optimization method algorithm ))

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

“…Based on the proposed heuristic method, we developed a program to optimize the routing problem using the Visual Studio C++ 6.0 programming language.…”
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

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

“…The model reliability describes the second sub-objective, which is to determine the feasible operating window of the MEC using multiple-objective optimization based on the nonlinear convex method using gradient descent algorithm as the objective function in maximizing the percentage efficiency of the MEC after validating the mathematical model. …”
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

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

“…Second, the Plant Propagation Algorithm (PPA) has never been considered to solve WCVRP. …”
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

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.

Application of genetic algorithm methods to optimize flowshop sequencing problem by Mohd Fadil, Md Sairi

“…Genetic algorithm method was one of the methods that were widely used in solving optimization problem. …”
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

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

Sizing optimization of large-scale grid connected photovoltaic system using dolphin echolocation algorithm / Muhammad Zakyizzuddin Rosselan by Rosselan, Muhammad Zakyizzuddin

“…Later, an Iterative-based Sizing Algorithm (ISA) was developed to determine the optimal sizing solution which was later used as benchmark for sizing algorithms using optimization methods. …”
Get full text
Get full text

An improved method using fuzzy system based on hybrid boahs for phishing attack detection by Noor Syahirah, Nordin

“…Moreover, Butterfly Optimization Algorithm and Harmony Search Algorithm were combined as optimization method led to a new method named BOAHS. …”
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

Wind farm reactive power optimization by using imperialist competitive algorithm by Soheilirad, Mohammadsoroush, Hizam, Hashim, Farzan, Payam, Hojabri, Mojgan, Fallah, Seyedeh Narjes, Soheilirad, G.

“…In this paper a new evolutionary computing method based on imperialist competitive algorithm (ICA) is used for optimization of the reactive power in a wind farm. …”
Get full text
Get full text

SA-EVPS ALGORITHM FOR DISCRETE SIZE OPTIMIZATION OF THE 582-BAR SPATIAL TRUSS STRUCTURE by Paknahad, M., Hosseini, P., Hakim, S.J.S

“…Nowadays, approximate optimization methods are widely used. This study utilized the Self Adaptive Enhanced Vibrating Particle System (SA-EVPS) algorithm as an approximate optimization method, since the EVPS algorithm requires experimental parameters. …”
Get full text
Get full text

VLSI floor planning optimization using genetic algorithm and cross entropy method / Angeline Teoh Szu Fern by Angeline Teoh, Szu Fern

“…Two methods of optimization are used for CBLL. They are Cross Entropy and also Genetic Algorithm. …”
Get full text
Get full text

Wind Farm Reactive Power Optimization by Using Imperialist Competitive Algorithm by Soheilirad, M., Hizam, H., Farzan, P., Hojabri, Mojgan, Fallah, S. N., Soheilirad, G.

“…In this paper a new evolutionary computing method based on imperialist competitive algorithm (ICA) is used for optimization of the reactive power in a wind farm. …”
Get full text
Get full text
Get full text

Firefly algorithm for optimal sizing of Standalone Photovoltaic System / Nurizzati Abdul Aziz by Abdul Aziz, Nurizzati

“…Therefore, optimization methods are often used in the sizing algorithms for such systems. …”
Get full text
Get full text

Firefly algorithm for optimal sizing of stand-alone photovoltaic system / Nur Izzati Abdul Aziz by Abdul Aziz, Nur Izzati

“…Therefore, optimization methods are often used in the sizing algorithms for such systems. …”
Get full text
Get full text