Search Results - (( initial solution waste algorithm ) OR ( a distribution function 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

“…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). …”
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

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

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

“…This technique has been widely used to devise initial solutions for issues concerning vehicle routing. …”
Get full text
Get full text

An internet of things based for smart recycle waste classification / Akmal Md Nasir by Md Nasir, Akmal

“…With a high accuracy rate for waste classification, the ResNet algorithm proved to be effective. …”
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

Cr(VI) adsorption from aqueous solution by an agricultural waste based carbon by Khan, T., Isa, M.H., Ul Mustafa, M.R., Yeek-Chia, H., Baloo, L., Binti Abd Manan, T.S., Saeed, M.O.

Get full text
Get full text

An empirical study of density and distribution functions for ant swarm optimized rough reducts by Pratiwi, Lustiana, Choo, Yun Huoy, Draman @ Muda, Azah Kamilah

“…However, the description and comparison of both functions are very limited. Hence, this paper compares the solution vector of ACO is represented by both density and distribution function to search for a better solution and to specify a probability functions for every particle (ant), and generate components of solution vector, which satisfy Gaussian distributions. …”
Get full text
Get full text
Get full text

Embedded parallel distributed artificial intelligent processors for adaptive beam forming in WCDMA system by Krishnan P.S., Kiong T.S., Koh J., Yap D.

“…In this paper, an embedded parallel and distributed genetic algorithm (EPDGA) with dynamic parameter setting on a multiprocessor system is proposed. …”

Levy tunicate swarm algorithm for solving numerical and real-world optimization problems by J. J., Jui, M. A., Ahmad, M. I. M., Rashid

“…The proposed Levy Tunicate Swarm Algorithm (LTSA) is a novel metaheuristic algorithm that integrates the Levy distribution into a new metaheuristic algorithm called Tunicate Swarm Algorithm (TSA) to solve numerical and real-world optimization problems. …”
Get full text
Get full text
Get full text

Firefly analytical hierarchy algorithm for optimal allocation and sizing of distributed generation in radial distribution network by Bujal, Noor Ropidah

“…There is a need to achieve optimality in allocating and sizing of DG in the distribution system network. …”
Get full text
Get full text
Get full text
Get full text

A review of the optimal allocation of distributed generation: Objectives, constraints, methods, and algorithms by Pesaran H.A M., Huy P.D., Ramachandaramurthy V.K.

Levy slime mould algorithm for solving numerical and engineering optimization problems by J. J., Jui, M. A., Ahmad, M. I. M., Rashid

“…The proposed Levy Slime Mould Algorithm (LSMA) is a novel metaheuristic algorithm that integrates the Levy distribution into a new metaheuristic called Slime Mould Algorithm (SMA) for solving numerical and engineering problems. …”
Get full text
Get full text
Get full text

Multi-Objective Hybrid Algorithm For The Classification Of Imbalanced Datasets by Saeed, Sana

“…Thereafter, a multi-objective hybrid algorithm (MOHA), an extension of the self-adaptive hybrid algorithm is proposed and tested on the established multi-objective (MO) test functions. …”
Get full text
Get full text

Distributed generation allocation to reduce losses and improve voltage profile genetic algorithm: article by Abdol Azis, Hazriq Syahmie

“…This paper presents a method for the optimal allocation of Distributed generation in distribution systems. …”
Get full text
Get full text

A Comparative Performance Analysis of Gaussian Distribution Functions in Ant Swarm Optimized Rough Reducts by Pratiwi, Lustiana, Choo, Yun Huoy, Draman @ Muda, Azah Kamilah

“…Solution vector of ACO is presented by implementing density and distribution function to search for a better solution and to specify a probability functions for every particle (ant). …”
Get full text
Get full text

Offline study on loss optimization in distribution networks using Artificial Bee Colony (ABC) algorithm: article / Deezex Noor Ainizaa Abdullah by Abdullah, Deezex Noor Ainizaa

“…The study involves the development of Artificial Bee Colony (ABC) algorithm to implement loss minimization in a distribution system. …”
Get full text
Get full text

Offline study on loss optimization in distribution networks using Artificial Bee Colony (ABC) algorithm / Deezex Noor Ainizaa Abdullah by Abdullah, Deezex Noor Ainizaa

“…The study involves the development of Artificial Bee Colony (ABC) algorithm to implement loss minimization in a distribution system. …”
Get full text
Get full text