Search Results - (( initial solutions waste algorithm ) OR ( parallel distribution function algorithm ))

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

Subjects:

Parallel algorithms for numerical simulations of EHD ion-drag micropump on distributed parallel computing systems by Shakeel Ahmed, Kamboh

“…To implement the parallel algorithms a distributed parallel computing laboratory using easily available low cost computers is setup. …”
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

High performance visualization of human tumor growth software by Alias, Norma, Mohd. Said, Norfarizan, Khalid, Siti Nur Hidayah, Sin, Dolly Tien Ching, Phang, Tau Ing

“…The platform for high performance computing of the parallel algorithms run on a distributed parallel computer system. …”
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

High performance simulation for brain tumors growth using parabolic equation on heterogeneous parallel computer systems by Pheng, H. S., Alias, Norma, Mohd. Said, Norfarizan

“…This paper focuses on the implementation of parallel algorithm for the simulation of brain tumours growth using one dimensional parabolic equation, design on a distributed parallel computer system. …”
Get full text
Get full text

Topology-aware hypergraph based approach to optimize scheduling of parallel applications onto distributed parallel architectures by Koohi, Sina Zangbari

“…The first step lies at the modelling of parallel applications running on heterogeneous parallel computers. …”
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

High performance simulation for brain tumours growth using parabolic equation on heterogeneous parallel computer system by Pheng H. S., Norma Alias, Norfarizan Mohd Said

“…This paper focuses on the implementation of parallel algorithm for the simulation of brain tumours growth using one dimensional parabolic equation, design on a distributed parallel computer system. …”
Get full text
Get full text
Get full text

WCDMA teletraffic performance improvement via power resource optimization using distributed parallel genetic algorithm by Prajindra S.K., Tiong S.K., Johnny Koh S.P., Yap D.F.W.

“…The algorithm works by finding the minimum transmitter power with the help of Distributed Parallel Genetic Algorithm (DPGA) employed on an offload microcontroller system to form optimal beam coverage to reduce power usage of adaptive antenna at WCDMA base station. …”

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

A critical analysis of simulators in grid by Dakkak, Omar, Che Mohamed Arif, Ahmad Suki, Awang Nor, Shahrudin

“…In parallel and distributed computing environment such as "The Grid", anticipating the behavior of the resources and tasks based on certain scheduling algorithm is a great challenging.Thus, studying and improving these types of environments becomes very difficult. …”
Get full text
Get full text
Get full text

Implementation of Parallel K-Means Algorithm to Estimate Adhesion Failure in Warm Mix Asphalt by Akhtar, M.N., Ahmed, W., Kakar, M.R., Bakar, E.A., Othman, A.R., Bueno, M.

“…The results showed that the PKIP algorithm decreases the execution time up to 30 to 46 if compared with the sequential k means algorithm when implemented using multiprocessing and distributed computing. …”
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

Distributed parallel deep learning with a hybrid backpropagation-particle swarm optimization for community detection in large complex networks by Shing, Chiang Ta, Mohammed Al-Andoli, Mohammed Nasser, Wooi, Ping Cheah

“…In addition, a distributed environment is set up to conduct parallel optimization of the proposed method so that multi-local optimizations could be performed simultaneously. …”
Get full text
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

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

Automatic generic process migration system in linux by Zarrabi, Amirreza

“…A fexible interface to the underlying checkpoint/ restart subsystem is designed which permits users to specify the migration mechanism according to process constraints. A migration algorithm is designed which attempts to exploit the unique features of the basic migration algorithms to form a generic algorithm. …”
Get full text
Get full text