Search Results - (( problem location based algorithm ) OR ( java application using algorithm ))

Search alternatives:

Refine Results
  1. 1
    Group formation using genetic algorithm

    Group formation using genetic algorithm by Che Ani, Zhamri, Husin, Mohd Zabidin, Yasin, Azman

    Published 2009
    “…Due to the increasing of complexity in software projects, group work is becoming more important in order to ensure quality software products can be delivered on time.Thus, in universities, group work is seen as a good preparation for students to industry because by working in group, it can reduce the individual workload,improve the ability to manage a project and enhance the problem solving skills. However, due to lack of programming skills especially in Java programming language and the inability to have meetings frequently among the group members,most of the students’ software project cannot be delivered successfully.To solve this problem, systematic group formation is one of the initial factors that should be considered to ensure that every group consists of quality individuals who are good in Java programming and also to ensure that every group member in a group are staying closer to each other.In this research, we propose a method for group formation using Genetic Algorithms, where the members for each group will be generated based on the students’ programming skill and location of residential colleges.…”
    Get full text
    Get full text
    Get full text
    Get full text
    Monograph
    Save to List
    Saved in:
  2. 2
    Campus safe: Safeguarding GPS-based Physical Identity and Access Management (PIAM) system with a lightweight Geo-Encryption

    Campus safe: Safeguarding GPS-based Physical Identity and Access Management (PIAM) system with a lightweight Geo-Encryption by Yeo Zi Zian

    Published 2022
    “…Recent industrial solutions to overcome the problem includes using manual registration, using 125kHz proximity card, using mobile application to scan QR code and others. …”
    Get full text
    Get full text
    Get full text
    Academic Exercise
    Save to List
    Saved in:
  3. 3
    Enhanced cell-based algorithm with dynamic radius in solving capacitated multi-source weber problem

    Enhanced cell-based algorithm with dynamic radius in solving capacitated multi-source weber problem by Nurhazwani, Ahmad Razak

    Published 2021
    “…This research finds the location of facilities in a continuous space to meet the demand of customers which minimize the total cost using Enhanced Cell-based Algorithm (ECBA). …”
    Get full text
    Get full text
    Thesis
    Save to List
    Saved in:
  4. 4
    RSA Encryption & Decryption using JAVA

    RSA Encryption & Decryption using JAVA by Ramli, Marliyana

    Published 2006
    “…References and theories to support the research of 'RSA Encryption/Decryption using Java' have been disclosed in Literature Review section. …”
    Get full text
    Get full text
    Final Year Project
    Save to List
    Saved in:
  5. 5
    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
    Get full text
    Get full text
    Get full text
    Thesis
    Save to List
    Saved in:
  6. 6
    Provider independent cryptographic tools

    Provider independent cryptographic tools by Ibrahim, Subariah, Salleh, Mazleena, Abdul Aziz, Shah Rizan

    Published 2003
    Get full text
    Get full text
    Get full text
    Monograph
    Save to List
    Saved in:
  7. 7
    A New Hybrid Approach Based On Discrete Differential Evolution Algorithm To Enhancement Solutions Of Quadratic Assignment Problem

    A New Hybrid Approach Based On Discrete Differential Evolution Algorithm To Enhancement Solutions Of Quadratic Assignment Problem by Asaad Shakir, Hameed, Mohd Aboobaider, Burhanuddin, Mutar, Modhi Lafta, Ngo, Hea Choon

    Published 2020
    “…The primary aim of this study is to propose a hybrid approach which combines Discrete Differential Evolution (DDE) algorithm and Tabu Search (TS) algorithm to enhance solutions of QAP model, to reduce the distances between the locations by finding the best distribution of N facilities to N locations, and to implement hybrid approach based on discrete differential evolution (HDDETS) on many instances of QAP from the benchmark. …”
    Get full text
    Get full text
    Get full text
    Article
    Save to List
    Saved in:
  8. 8
    Solving vehicle routing problem by using improved genetic algorithm for optimal solution

    Solving vehicle routing problem by using improved genetic algorithm for optimal solution by Mohammed M.A., Abd Ghani M.K., Hamed R.I., Mostafa S.A., Ahmad M.S., Ibrahim D.A.

    Published 2023
    Article
    Save to List
    Saved in:
  9. 9
    AUTOMATIC ROUTE FINDER FOR NEW VISITORS

    AUTOMATIC ROUTE FINDER FOR NEW VISITORS by ADNAN, MOHD SHIHAM

    Published 2006
    “…This study is based on Dijkstra's algorithm as the algorithm finds the most effective way to traverse an entire graph. …”
    Get full text
    Get full text
    Final Year Project
    Save to List
    Saved in:
  10. 10
    Location-Based Cryptographic Techniques for Data Protection

    Location-Based Cryptographic Techniques for Data Protection by Mohd Shamsuddin, N.S., Sakinah Ali Pitchay

    Published 2024
    journal::journal article
    Save to List
    Saved in:
  11. 11
    Restaurant locator using Djikstra Algorithm / Mohamad Aliff Hakimi Lukman Hakim

    Restaurant locator using Djikstra Algorithm / Mohamad Aliff Hakimi Lukman Hakim by Lukman Hakim, Mohamad Aliff Hakimi

    Published 2017
    Get full text
    Get full text
    Thesis
    Save to List
    Saved in:
  12. 12
    Shortest Path Trajectory System Based on Dijkstra Algorithm

    Shortest Path Trajectory System Based on Dijkstra Algorithm by Putri, Indah Pratiwi

    Published 2012
    “…In the master project, the researcher discussed the shortest path solution to a single source problem based on Dijkstra algorithm as resolving the basic concepts. …”
    Get full text
    Get full text
    Get full text
    Get full text
    Thesis
    Save to List
    Saved in:
  13. 13
    Differential equation fault location algorithm with harmonic effects in power system

    Differential equation fault location algorithm with harmonic effects in power system by Izatti, Md Amin, Mohd Rafi, Adzman, Haziah, Abdul Hamid, Muhd Hafizi, Idris, Melaty, Amirruddin, Omar, Aliman

    Published 2023
    “…Based on the simulation results, the differential equation continuous wavelet technique (CWT) filter-based algorithm produced an accurate fault location result with a mean average error (MAE) of less than 5%.…”
    Get full text
    Get full text
    Get full text
    Article
    Save to List
    Saved in:
  14. 14
    Hybrid harmony search-simulated annealing algorithm for location-inventory-routing problem in supply chain network design with defect and non-defect items

    Hybrid harmony search-simulated annealing algorithm for location-inventory-routing problem in supply chain network design with defect and non-defect items by Farahanim, Misni, Lai, Soon Lee, Seow, Hsin-Vonn

    Published 2020
    “…This paper considers a location-inventory-routing problem (LIRP) that integrates the strategic, tactical, and operational decision planning in supply chain network design. …”
    Get full text
    Get full text
    Get full text
    Article
    Save to List
    Saved in:
  15. 15
    Opposition-based spiral dynamic algorithm with an application to optimize type-2 fuzzy control for an inverted pendulum system

    Opposition-based spiral dynamic algorithm with an application to optimize type-2 fuzzy control for an inverted pendulum system by Nasir, Ahmad Nor Kasruddin, Abdul Razak, Ahmad Azwan

    Published 2022
    “…Spiral Dynamic Algorithm (SDA) is a group-based optimization algorithm formulated based on the concept of a natural spiral phenomenon on earth. …”
    Get full text
    Get full text
    Get full text
    Get full text
    Article
    Save to List
    Saved in:
  16. 16
    Harmony search algorithm for curriculum-based course timetabling problem

    Harmony search algorithm for curriculum-based course timetabling problem by Wahid, Juliana, Mohd Hussin, Naimah

    Published 2013
    Get full text
    Get full text
    Get full text
    Article
    Save to List
    Saved in:
  17. 17
    Harmony search algorithm for curriculum-based course timetabling problem

    Harmony search algorithm for curriculum-based course timetabling problem by Wahid, Juliana, Mohd Hussin, Naimah

    Published 2013
    Get full text
    Get full text
    Get full text
    Conference or Workshop Item
    Save to List
    Saved in:
  18. 18
    Solving vehicle routing problem by using improved K-nearest neighbor algorithm for best solution

    Solving vehicle routing problem by using improved K-nearest neighbor algorithm for best solution by Mohammed, Mazin Abed, Abd Ghani, Mohd Khanapi, Hamed, Raed Ibraheem, A. Mostafa, Salama, Ahmed Ibrahim, Dheyaa, Jameel, Humam Khaled, Alallah, Ahmed Hamed

    Published 2017
    “…Approach: The approach has been presented based on two phases: firstly, the algorithms have been adapted to solve the research problem, where its procedure is different than the common algorithm. …”
    Get full text
    Get full text
    Get full text
    Article
    Save to List
    Saved in:
  19. 19
    Evaluating the effectiveness of integrated benders decomposition algorithm and epsilon constraint method for multi-objective facility location problem under demand uncertainty

    Evaluating the effectiveness of integrated benders decomposition algorithm and epsilon constraint method for multi-objective facility location problem under demand uncertainty by Rahimi, Iman, Tang, Sai Hong, Ahmadi, Abdollah, Ahmad, Siti Azfanizam, Lee, Lai Soon, Sharaf, Adel M.

    Published 2017
    “…One of the most challenging issues in multi-objective problems is finding Pareto optimal points. This paper describes an algorithm based on Benders Decomposition Algorithm (BDA) which tries to find Pareto solutions. …”
    Get full text
    Get full text
    Get full text
    Article
    Save to List
    Saved in:
  20. 20
    Hybrid firefly and particle swarm optimization algorithm for multi-objective optimal power flow with distributed generation

    Hybrid firefly and particle swarm optimization algorithm for multi-objective optimal power flow with distributed generation by Khan, Abdullah

    Published 2022
    “…Finally, a crowding distance and non-dominated-sorting-based multi-objective hybrid firefly & particle swarm optimization (MOHFPSO) algorithm is designed for MOOPF problems. …”
    Get full text
    Get full text
    Thesis
    Save to List
    Saved in:

Search Tools: