Search Results - (( solution using greedy algorithm ) OR ( java application based algorithm ))

Search alternatives:

Refine Results
  1. 1
    Optimizing the placement of fire department in Kulim using greedy heuristic and simplex method / Muhammad Abu Syah Mohd Suzaly

    Optimizing the placement of fire department in Kulim using greedy heuristic and simplex method / Muhammad Abu Syah Mohd Suzaly by Mohd Suzaly, Muhammad Abu Syah

    Published 2023
    “…The first method is greedy heuristic method. Greedy heuristics is a type of optimization algorithm that makes decisions based on locally optimal solutions. …”
    Get full text
    Get full text
    Thesis
    Save to List
    Saved in:
  2. 2
    Comparison between alpha beta pruning algorithm and greedy algorithm in designing winning strategies in the game of checkers / Christy Jr Tan

    Comparison between alpha beta pruning algorithm and greedy algorithm in designing winning strategies in the game of checkers / Christy Jr Tan by Jr Tan, Christy

    Published 2007
    “…The algorithm is useful in some of the game search available today. …”
    Get full text
    Get full text
    Student Project
    Save to List
    Saved in:
  3. 3
    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
    “…Nonetheless, different study areas generated different outputs based on the area's geographical conditions. The WCVRP solutions using PPA are comparable with other best-known solutions on the benchmark problem in terms of total distance travelled and the number of vehicles used. …”
    Get full text
    Get full text
    Get full text
    Thesis
    Save to List
    Saved in:
  4. 4
    Simulated annealing algorithm for solving chambering student-case assignment problem

    Simulated annealing algorithm for solving chambering student-case assignment problem by Ghazali, Saadiah, Abdul Rahman, Syariza

    Published 2015
    “…The objective of the study is to minimize the total completion time for all students in solving the given cases.This study employed a minimum cost greedy heuristic in order to construct a feasible initial solution.The search then is preceded with a simulated annealing algorithm for further improvement of solution quality.The analysis of the obtained result has shown that the proposed simulated annealing algorithm has greatly improved the solution constructed by the minimum cost greedy heuristic. …”
    Get full text
    Get full text
    Get full text
    Conference or Workshop Item
    Save to List
    Saved in:
  5. 5
    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:
  6. 6
    Routing problem in rectangular mesh network using shortest path based Greedy method

    Routing problem in rectangular mesh network using shortest path based Greedy method by Noraziah, Adzhar, Shaharuddin, Salleh, Yuhani, Yusof, Muhammad Azrin, Ahmad

    Published 2019
    “…This paper presents a complete routing algorithm which can further refine the solution by using Dijkstra's based greedy method. …”
    Get full text
    Get full text
    Get full text
    Conference or Workshop Item
    Save to List
    Saved in:
  7. 7
    Routing problem in rectangular mesh network using Dijkstra’s based Greedy method

    Routing problem in rectangular mesh network using Dijkstra’s based Greedy method by Noraziah, Adzhar, Shaharuddin, Salleh, Yuhani, Yusof, Muhammad Azrin, Ahmad

    Published 2018
    “…This paper presents a complete routing algorithm which can further refine the solution by using Dijkstra’s based greedy method. …”
    Get full text
    Get full text
    Get full text
    Conference or Workshop Item
    Save to List
    Saved in:
  8. 8
    Optimizing boarding school schedule using graph coloring: case study of Sekolah Menengah Sultan Abdul Halim / Nur Farhana Mohd Asri

    Optimizing boarding school schedule using graph coloring: case study of Sekolah Menengah Sultan Abdul Halim / Nur Farhana Mohd Asri by Mohd Asri, Nur Farhana

    Published 2022
    Get full text
    Get full text
    Research Reports
    Save to List
    Saved in:
  9. 9
    A variable combinatorial test suite strategy based on modified greedy algorithm

    A variable combinatorial test suite strategy based on modified greedy algorithm by Homaid, Ameen A. Ba, Alsewari, Abdulrahman A.

    Published 2015
    Get full text
    Get full text
    Get full text
    Conference or Workshop Item
    Save to List
    Saved in:
  10. 10
    Compiler-based prefetching algorithm for recursive data structure

    Compiler-based prefetching algorithm for recursive data structure by Anuar, Nurulhaini

    Published 2007
    “…This best algorithm consists of greedy prefetching and prefetch array algorithms. …”
    Get full text
    Get full text
    Get full text
    Thesis
    Save to List
    Saved in:
  11. 11
    Routing problem in rectangular mesh network using shortest path based Greedy method

    Routing problem in rectangular mesh network using shortest path based Greedy method by Noraziah, Adzhar, Shaharuddin, Salleh, Yuhani, Yusof, Muhammad Azrin, Ahmad

    Published 2019
    “…This paper presents a complete routing algorithm which can further refine the solution by using Dijkstra's based greedy method. …”
    Get full text
    Get full text
    Get full text
    Conference or Workshop Item
    Save to List
    Saved in:
  12. 12
    Developing a college room allocation system using heuristic algorithm / Raziha Bidin

    Developing a college room allocation system using heuristic algorithm / Raziha Bidin by Bidin, Raziha

    Published 2010
    Get full text
    Get full text
    Thesis
    Save to List
    Saved in:
  13. 13
    Optimizing schedule of boarding school using vertex and edge coloring approach / Nurhuda Ismail, Siti Sarah Raseli and Nur Farhana Mohd Asri

    Optimizing schedule of boarding school using vertex and edge coloring approach / Nurhuda Ismail, Siti Sarah Raseli and Nur Farhana Mohd Asri by Ismail, Nurhuda, Raseli, Siti Sarah, Mohd Asri, Nur Farhana

    Published 2021
    Get full text
    Get full text
    Get full text
    Article
    Save to List
    Saved in:
  14. 14
    Greedyzero-based scheduling algorithm to route in optical low stage interconnection networks

    Greedyzero-based scheduling algorithm to route in optical low stage interconnection networks by Moudi, Mehrnaz

    Published 2012
    “…The GreedyZero algorithm has been presented in the Low Stage Interconnection Network. …”
    Get full text
    Get full text
    Thesis
    Save to List
    Saved in:
  15. 15
    Enhancement of Ant System Algorithm for Course Timetabling Problem

    Enhancement of Ant System Algorithm for Course Timetabling Problem by Djamarus, Djasli

    Published 2009
    “…Results of the experiments that were conducted using various data sets showed that the proposed algorithm produced better course schedule solution than the Greedy Algorithm, Genetic Algorithm, and other variants of Ant System Algorithm.…”
    Get full text
    Get full text
    Get full text
    Thesis
    Save to List
    Saved in:
  16. 16
    Hybrid tabu search – strawberry algorithm for multidimensional knapsack problem

    Hybrid tabu search – strawberry algorithm for multidimensional knapsack problem by Wong, Jerng Foong

    Published 2022
    “…Multidimensional Knapsack Problem (MKP) has been widely used to model real-life combinatorial problems. It is also used extensively in experiments to test the performances of metaheuristic algorithms and their hybrids. …”
    Get full text
    Get full text
    Get full text
    Thesis
    Save to List
    Saved in:
  17. 17
    Optimal Sensing for Opportunistic Spectrum Access in Cognitive Radio

    Optimal Sensing for Opportunistic Spectrum Access in Cognitive Radio by Armi, Nasrullah, M Saad, M Naufal, Yusoff, Mohd Zuki, Arshad, Muhammad

    Published 2010
    “…The derivation of greedy approach proves that sensing problem can be solved either optimally or approximate the optimal solution. …”
    Get full text
    Get full text
    Article
    Save to List
    Saved in:
  18. 18
    RSA Encryption & Decryption using JAVA

    RSA Encryption & Decryption using JAVA by Ramli, Marliyana

    Published 2006
    “…The implementation of this project will be based on Rapid Application Design Methodology (RAD) and will be more focusing on research and finding, ideas and the implementation of the algorithm, and finally running and testing the algorithm. …”
    Get full text
    Get full text
    Final Year Project
    Save to List
    Saved in:
  19. 19
    Approximate maximum clique algorithm (AMCA): A clever technique for solving the maximum clique problem through near optimal algorithm for minimum vertex cover problem

    Approximate maximum clique algorithm (AMCA): A clever technique for solving the maximum clique problem through near optimal algorithm for minimum vertex cover problem by Fayaz, Muhammad, Arshad,, Shakeel, Shah,, Abdul Salam, Shah, Asadullah

    Published 2018
    “…The algorithms that were used for experiments are Maximum Degree Greedy (MDG). …”
    Get full text
    Get full text
    Get full text
    Get full text
    Article
    Save to List
    Saved in:
  20. 20
    Integration Of Travel Time Zone For Optimal Siting Of Emergency Facilities

    Integration Of Travel Time Zone For Optimal Siting Of Emergency Facilities by Indriasari, Vini

    Published 2008
    “…Fire stations in Jakarta Selatan were chosen for simulation. Two algorithms, Greedy Adding (Add) and Greedy Adding with Travel Time Evaluation (GAT), were applied to solve the optimization problem of the MSAP. …”
    Get full text
    Get full text
    Thesis
    Save to List
    Saved in:

Search Tools: