Search Results - (( initial solving waste algorithm ) OR ( parallel optimization _ algorithm ))

Refine Results
  1. 1

    Efficiency of heuristic algorithms in solving waste collection vehicle routing problem: a case study by Mat, Nur Azriati, Benjamin, Aida Mauziah, Abdul-Rahman, Syariza

    Published 2018
    “…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
    Article
  2. 2

    Efficiency of heuristic algorithms in solving waste collection vehicle routing problem: a case study by Mat, Nur Azriati, Benjamin, Aida Mauziah, Abdul-Rahman, Syariza

    Published 2018
    “…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
    Article
  3. 3

    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

    Published 2018
    “…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
    Article
  4. 4

    Parallel metaheuristic algorithm for route planning using CUDA by Looi, Daniel Jun Jie

    Published 2025
    “…Area of Study: Massively Parallel Computing, Combinatorial Optimization Keywords: Parallel Metaheuristic Algorithm, Travelling Salesman Problem, CUDA, GPU, Genetic Algorithm…”
    Get full text
    Get full text
    Final Year Project / Dissertation / Thesis
  5. 5

    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

    Published 2018
    “…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
    Article
  6. 6

    Performance Comparison of Parallel Bees Algorithm on Rosenbrock Function by Hammash, Nayif Mohammed

    Published 2012
    “…This thesis presents the parallel Bees Algorithm as a new approach for optimizing the last results for the Bees Algorithm. …”
    Get full text
    Get full text
    Get full text
    Thesis
  7. 7

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

    Published 2020
    “…Any optimization algorithm is suitable for only a specific domain of optimization problems. …”
    Get full text
    Get full text
    Thesis
  8. 8

    Voting algorithms for large scale fault-tolerant systems by Karimi, Abbas

    Published 2011
    “…To solve this problem and gain benefits of this algorithm, we employed parallel algorithm technique and by using optimal number of processors, we could propose optimal algorithms known as Parallel Average Voting and Parallel Weighted Average Voting which both have optimal time complexity and less calculation cost. …”
    Get full text
    Get full text
    Thesis
  9. 9
  10. 10
  11. 11

    Design and implemtation of a real-time adaptive learning algorithm controller for a 3-DOF parallel manipulator / Mustafa Jabbar Hayyawi by Jabbar Hayyawi, Mustafa

    Published 2016
    “…Performance indices such as workspace, dexterity and stiffness, of the parallel manipulator are studied. The parallel manipulator is optimized based on the performance indices to obtain on the optimal design parameters for achieved maximum performance of the parallel manipulator. …”
    Get full text
    Get full text
    Student Project
  12. 12
  13. 13

    A parallel prevention algorithm for black hole attacks in MANET by Yaakub, Abdul Razak, Ghathwan, Khalil I.

    Published 2015
    “…In this paper, we propose a parallel algorithm for MANETs that optimizes both routing discovery and security in an Ad Hoc On Demand Distance Vector (AODV). …”
    Get full text
    Get full text
    Get full text
    Conference or Workshop Item
  14. 14

    Investigation on the dynamic of computation of semi autonomous evolutionary computation for syntactic optimization of a set of programming codes by Mohammad Sigit Arifianto, Tze, Kenneth Kin Teo, Liau, Chung Fan, Liawas Barukang, Zaturrawiah Ali Omar

    Published 2007
    “…They have to be optimized for parallel execution while some parts still do have sequential execution due to data dependencies, which makes the optimization problem two folds, parallel and serial. …”
    Get full text
    Get full text
    Research Report
  15. 15

    A Parallel new high order iterative algorithm on shared memory multiprocessors parallel computer by Mohamed Othman, Abdul Rahman Abdullah

    Published 2004
    “…In this paper, the parallel implementation of the algorithm with optimal strategy on shared memory multiprocessors (SMP) was presented and discussed. …”
    Get full text
    Get full text
    Get full text
    Article
  16. 16

    A GPGPU Approach to Accelerate Ant Swarm Optimization Rough Reducts (ASORR) Algorithm by Udayanti, Erika Devi, Choo, Yun Huoy, Draman @ Muda, Azah Kamilah, Nugroho, Fajar Agung

    Published 2012
    “…In order to find a reducts, a such applications of rough set uses a discernibility matrix. Ant Swarm Optimization Rough Reducts (ASORR) algorithm is used in rough reducts calculation for identifying significant attribute set optimally. …”
    Get full text
    Get full text
    Conference or Workshop Item
  17. 17

    Using predictive analytics to solve a newsvendor problem / S. Sarifah Radiah Shariff and Hady Hud by Shariff, S. Sarifah Radiah, Hud, Hady

    Published 2023
    “…Secondly, in solving every Machine Learning problem, there is no one algorithm superior to other algorithms. …”
    Get full text
    Get full text
    Book Section
  18. 18

    Probabilistic ensemble fuzzy ARTMAP optimization using hierarchical parallel genetic algorithms by Loo, C.K., Liew, W.S., Seera, M., Lim, Einly

    Published 2015
    “…This was achieved by mitigating convergence in the genetic algorithms by employing a hierarchical parallel architecture. …”
    Get full text
    Get full text
    Get full text
    Article
  19. 19

    Workflow optimization in distributed computing environment for stream-based data processing model / Saima Gulzar Ahmad by Saima Gulzar, Ahmad

    Published 2017
    “…Similarly, when data parallelism is introduced in the algorithm the performance of the algorithm improved further by 12% in latency and 17% in throughput when compared to PDWA algorithm. …”
    Get full text
    Get full text
    Get full text
    Thesis
  20. 20

    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.

    Published 2010
    “…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
    Article