Search Results - (( solution construction waste algorithm ) OR ( program implementation case algorithm ))

Search alternatives:

Refine Results
  1. 1
    A greedy heuristics multiple criteria model for solving multi-landfill site selection and plant propagation algorithm for improving waste collection vehicle routing solutions

    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
    Save to List
    Saved in:
  2. 2
    Enhanced Heuristic Algorithms with A Vehicle Travel Speed Model for Time-Dependent Vehicle Routing: A Waste Collection Problem

    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
    Save to List
    Saved in:
  3. 3
    Enhanced heuristic algorithms with a vehicle travel speed model for time-dependent vehcile routing: A waste collection problem

    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
    Save to List
    Saved in:
  4. 4
    Nearest greedy for solving the waste collection vehicle routing problem: A case study

    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
    Save to List
    Saved in:
  5. 5
    Using GA and KMP algorithm to implement an approach to learning through intelligent framework documentation

    Using GA and KMP algorithm to implement an approach to learning through intelligent framework documentation by Mat Jani H., Lee S.P.

    Published 2023
    Conference paper
    Save to List
    Saved in:
  6. 6
    An improved algorithm in test case generation from UML activity diagram using activity path

    An improved algorithm in test case generation from UML activity diagram using activity path by Hashim, Nor Laily, Salman, Yasir D.

    Published 2011
    “…This paper proposed an improved algorithm to automatically generate test cases directly from UML activity diagram using an activity graph.This algorithm has been implemented as a prototype using UML activity diagrams as inputs to generate test cases.These generated test cases are generated automatically are compared to test cases that are generated manually in order to evaluate the algorithm’s usability and reliability.The result shows that the test cases generated by the developed test case generator program are the same as the one manually derived.…”
    Get full text
    Get full text
    Get full text
    Conference or Workshop Item
    Save to List
    Saved in:
  7. 7
    An improved partial comparison optimization for utilizing landfill facilities in a waste collection vehicle routing problem

    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
    Save to List
    Saved in:
  8. 8
    Pairwise testing tools based on hill climbing algorithm (PTCA)

    Pairwise testing tools based on hill climbing algorithm (PTCA) by Lim, Seng Kee

    Published 2014
    “…The actual implementation of the algorithm which is in Java programming language, the program is implemented on Net Bean 7.0.1. …”
    Get full text
    Get full text
    Undergraduates Project Papers
    Save to List
    Saved in:
  9. 9
    Automatic marking system for programming subject

    Automatic marking system for programming subject by Chan, Jin Yee

    Published 2023
    “…This project is a web application designed for lecturer that teaching programming subject to automatically mark programming algorithm exercise. …”
    Get full text
    Get full text
    Final Year Project / Dissertation / Thesis
    Save to List
    Saved in:
  10. 10
    Simulation of shortest path using a-star algorithm / Nurul Hani Nortaja

    Simulation of shortest path using a-star algorithm / Nurul Hani Nortaja by Nurul Hani , Nortaja

    Published 2004
    “…It has been applied in many practical applications. For most of the cases of the shortest route finding, the Dijkstra's algorithm is known to be an optimal search algorithm. …”
    Get full text
    Get full text
    Thesis
    Save to List
    Saved in:
  11. 11
    Case Slicing Technique for Feature Selection

    Case Slicing Technique for Feature Selection by A. Shiba, Omar A.

    Published 2004
    “…Case Slicing Technique (CST) helps in identifying the subset of features used in computing the similarity measures needed by classification algorithms. …”
    Get full text
    Get full text
    Thesis
    Save to List
    Saved in:
  12. 12
    Implementing case-based reasoning approach to framework documentation

    Implementing case-based reasoning approach to framework documentation by Hajar M.J., Lee S.P.

    Published 2023
    Conference paper
    Save to List
    Saved in:
  13. 13
    A study on the VLSI partitions: the implementation of Fiduccia-Mattheyses algorithm / Burhanuddin Omar

    A study on the VLSI partitions: the implementation of Fiduccia-Mattheyses algorithm / Burhanuddin Omar by Omar, Burhanuddin

    Published 1997
    Get full text
    Get full text
    Thesis
    Save to List
    Saved in:
  14. 14
    Thalassaemia detection using CBR Algorithm via mobile device

    Thalassaemia detection using CBR Algorithm via mobile device by Nur Faezah, Omar

    Published 2011
    “…The results show that the Case-Based Reasoning model has a great potential to be implemented in diagnosing Thalassaemia cases.…”
    Get full text
    Get full text
    Undergraduates Project Papers
    Save to List
    Saved in:
  15. 15
    Low-level hybridization scripting language with dynamic parameterization in PSO-GA / Suraya Masrom

    Low-level hybridization scripting language with dynamic parameterization in PSO-GA / Suraya Masrom by Masrom, Suraya

    Published 2015
    “…However, in many cases, implementing the suitable hybrid algorithms for a given optimization problem is a considerably difficult, which in most cases, is time consuming. …”
    Get full text
    Get full text
    Thesis
    Save to List
    Saved in:
  16. 16
    Low-level hybridization scripting language with dynamic parameterization in PSO-GA / Suraya Masrom

    Low-level hybridization scripting language with dynamic parameterization in PSO-GA / Suraya Masrom by Masrom, Suraya

    Published 2015
    “…However, in many cases, implementing the suitable hybrid algorithms for a given optimization problem is a considerably difficult, which in most cases, is time consuming. …”
    Get full text
    Get full text
    Book Section
    Save to List
    Saved in:
  17. 17
    Implementation of Dijkstra Algorithm with React Native to Determine Covid-19 Distribution

    Implementation of Dijkstra Algorithm with React Native to Determine Covid-19 Distribution by Rosyid Ridlo, Al Hakim, Purwono, Purwono, Yanuar Zulardiansyah, Arief, Agung, Pangestu, Muhammad Haikal, Satria, Eko, Ariyanto

    Published 2022
    “…Information technology developed to determine the shortest distance for Covid-19 cases around us needs to be developed. This research implements Dijkstra's Algorithm written in the React Native programming language to build a Covid-19 tracking application. …”
    Get full text
    Get full text
    Get full text
    Get full text
    Article
    Save to List
    Saved in:
  18. 18
    Implementation of Galerkin's method and modal analysis for unforced vibration response of a tractor suspension model

    Implementation of Galerkin's method and modal analysis for unforced vibration response of a tractor suspension model by Shamshiri, Ramin, Wan Ismail, Wan Ishak

    Published 2014
    “…In order to develop a stand-alone algorithm implementable in any programming environment, Galerkin’s method was applied over smaller elements of time domain. …”
    Get full text
    Get full text
    Get full text
    Article
    Save to List
    Saved in:
  19. 19
    Plagiarism Detection System for Java Programming Assignments by Using Greedy String-Tilling Algorithm

    Plagiarism Detection System for Java Programming Assignments by Using Greedy String-Tilling Algorithm by Norulazmi, Kasim

    Published 2008
    “…The prototype system, known as Java Plagiarism Detection System (JPDS) implements the Greedy-String-Tiling algorithm to detect similarities among tokens in a Java source code files. …”
    Get full text
    Get full text
    Get full text
    Thesis
    Save to List
    Saved in:
  20. 20
    A novel N-input voting algorithm for X-by-wire fault-tolerant systems

    A novel N-input voting algorithm for X-by-wire fault-tolerant systems by Karimi, Abbas, Zarafshan, Faraneh, Syed Mohamed, Syed Abdul Rahman Al-Haddad, Ramli, Abdul Rahman

    Published 2014
    “…These systems include N-modular redundant (NMR) hardware systems and diversely designed software systems based on N-version programming (NVP). Depending on the characteristics of the application and the type of selected voter, the voting algorithms can be implemented for either hardware or software systems. …”
    Get full text
    Get full text
    Get full text
    Article
    Save to List
    Saved in:

Search Tools: