Search Results - (( solution construction waste algorithm ) OR ( parallel visualisation using algorithm ))

  • Showing 1 - 11 results of 11
Refine Results
  1. 1

    A case study : 2D Vs 3D parallel differential equation toward tumor cell detection on multi-core parallel computing atmosphere by Islam, Md. Rajibul, Alias, Norma

    Published 2010
    “…In order to detect tumour cells, 2D and 3D Partial Differential Equations (PDE) are considered and compared by using Multi-Core parallel computing atmosphere with visualisation, communication and data analysis. …”
    Get full text
    Get full text
    Get full text
    Article
  2. 2

    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

    Published 2023
    “…Then, a multiple criteria greedy heuristic model was proposed to construct WCVRP solutions and to find a new landfill site(s) with the minimum total operational costs. …”
    Get full text
    Get full text
    Get full text
    Thesis
  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
    “…However, in this paper the static speed that was considered in both algorithms were improved by introducing dynamic travel speeds to construct vehicle routes for the waste collection drivers. …”
    Get full text
    Get full text
    Article
  4. 4

    Agro-ento bioinformation: towards the edge of reality by Syed Hassan, Syed Tajuddin

    Published 2002
    “…The primers, which entrain processes, both natural and man-induced, include mechanisms such as protocols, algorithms, visualisations, and structural and visual designs. …”
    Get full text
    Get full text
    Inaugural Lecture
  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

    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

    Published 2017
    “…This paper presents a real case study pertaining to an issue related to waste collection in the northern part of Malaysia by using a constructive heuristic algorithm known as the Nearest Greedy (NG) technique. …”
    Get full text
    Get full text
    Article
  7. 7
  8. 8
  9. 9

    An improved partial comparison optimization for utilizing landfill facilities in a waste collection vehicle routing problem by Fazlini, Hashim

    Published 2025
    “…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
    Thesis
  10. 10

    A 'snowflake' geometrical representation for optimised degree six 3-modified chordal ring networks by Chien, Stephen Lim Een, Raja Maamor Shah, Raja Noor Farah Azura, Othman, Mohamed

    Published 2016
    “…The results of this research are important in developing a routing algorithm for CHR6o3.…”
    Get full text
    Get full text
    Conference or Workshop Item
  11. 11