Search Results - (( solution construction waste algorithm ) OR ( program segmentation mining algorithm ))

  • Showing 1 - 8 results of 8
Refine Results
  1. 1
  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

    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
  5. 5

    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
  6. 6

    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
  7. 7

    Validation of deep convolutional neural network for age estimation in children using mandibular premolars on digital panoramic dental imaging / Norhasmira Mohammad by Mohammad, Norhasmira

    Published 2022
    “…The semi-automated dental staging system developed in this study is based on the Malay children’s population and uses a brain-inspired learning algorithm termed "deep learning". The methodology is comprised of four major steps: image preprocessing, which adheres to the inclusion criteria for panoramic dental radiographs, segmentation, and classification of mandibular premolars according to Demirjian's staging system using the Dynamic Programming-Active Contour (DP-AC) method and Deep Convolutional Neural Network (DCNN), respectively, and statistical analysis. …”
    Get full text
    Get full text
    Thesis
  8. 8