Search Results - (( java implementation path algorithm ) OR ( problem using partial algorithm ))

Search alternatives:

Refine Results
  1. 1
    Heavy Transportation Shortest Route using Dijkstra’s algorithm (HETRO) / Nurul Aqilah Ahmad Nezer

    Heavy Transportation Shortest Route using Dijkstra’s algorithm (HETRO) / Nurul Aqilah Ahmad Nezer by Ahmad Nezer, Nurul Aqilah

    Published 2017
    “…The development tools used in developing this project is NetBeans by using Java for the implementation of the coding. The methodology that used for developing this system is the Dijkstra’s algorithm. …”
    Get full text
    Get full text
    Thesis
    Save to List
    Saved in:
  2. 2
    Embedded system for indoor guidance parking with Dijkstra’s algorithm and ant colony optimization

    Embedded system for indoor guidance parking with Dijkstra’s algorithm and ant colony optimization by Mohammad Ata, Karimeh Ibrahim

    Published 2019
    “…BST inserts the nodes in the way that the Dijkstra’s can find the empty parking in fastest way. Dijkstra’s algorithm initials the paths to finding the shortest path while ACO optimizes the paths. …”
    Get full text
    Get full text
    Thesis
    Save to List
    Saved in:
  3. 3
    Path planning for unmanned aerial vehicle (UAV) using rotated accelerated method in static outdoor environment

    Path planning for unmanned aerial vehicle (UAV) using rotated accelerated method in static outdoor environment by Shaliza Hayati A. Wahab, Nordin Saad, Azali Saudi, Ali Chekima

    Published 2021
    “…In this study, a fast iterative method known as Rotated Successive Over-Relaxation (RSOR) is introduced. The algorithm is implemented in a self-developed 2D Java tool, UAV Planner. …”
    Get full text
    Get full text
    Get full text
    Get full text
    Article
    Save to List
    Saved in:
  4. 4
    Smart appointment organizer for mobile application / Mohd Syafiq Adam

    Smart appointment organizer for mobile application / Mohd Syafiq Adam by Adam, Mohd Syafiq

    Published 2009
    “…The main component of this prototype is the use of Dijkstra algorithm to compute the shortest path from source of appointment to the 6 points of destinations within UiTM Shah Alam. …”
    Get full text
    Get full text
    Thesis
    Save to List
    Saved in:
  5. 5
    Solving Examination Timetabling Problem using Partial Exam Assignment with Great Deluge Algorithm

    Solving Examination Timetabling Problem using Partial Exam Assignment with Great Deluge Algorithm by Ashis Kumar, Mandal, M. N. M., Kahar

    Published 2015
    “…In this approach, exams are ordered based on graph heuristics and only selected exams (partial exams) are scheduled first and then improved using great deluge algorithm. …”
    Get full text
    Get full text
    Conference or Workshop Item
    Save to List
    Saved in:
  6. 6
    Stochastic partially optimized cyclic shift crossover for multi-objective genetic algorithms for the vehicle routing problem with time-windows

    Stochastic partially optimized cyclic shift crossover for multi-objective genetic algorithms for the vehicle routing problem with time-windows by Zakaria, M.N.

    Published 2017
    “…This paper presents a stochastic partially optimized cyclic shift crossover operator for the optimization of the multi-objective vehicle routing problem with time windows using genetic algorithms. …”
    Get full text
    Get full text
    Article
    Save to List
    Saved in:
  7. 7
    A modified partially mapped multiCrossover genetic algorithm for Two-Dimensional Bin Packing Problem

    A modified partially mapped multiCrossover genetic algorithm for Two-Dimensional Bin Packing Problem by Sarabian, Maryam, Lee, Lai Soon

    Published 2010
    “…Our aim was to improve the performance of the MultiCrossover Genetic Algorithm(MXGA)proposed from the literature for solving the problem. …”
    Get full text
    Get full text
    Article
    Save to List
    Saved in:
  8. 8
    Stochastic partially optimized cyclic shift crossover for multi-objective genetic algorithms for the vehicle routing problem with time-windows

    Stochastic partially optimized cyclic shift crossover for multi-objective genetic algorithms for the vehicle routing problem with time-windows by Pierre, D.M., Zakaria, N.

    Published 2017
    “…This paper presents a stochastic partially optimized cyclic shift crossover operator for the optimization of the multi-objective vehicle routing problem with time windows using genetic algorithms. …”
    Get full text
    Get full text
    Article
    Save to List
    Saved in:
  9. 9
    Partial examination assignment approaches for solving examination timetabling problems

    Partial examination assignment approaches for solving examination timetabling problems by Mandal, Ashis Kumar

    Published 2016
    “…The proposed algorithms work by first ordering all examinations using graph heuristics ordering strategies. …”
    Get full text
    Get full text
    Thesis
    Save to List
    Saved in:
  10. 10
    Job shop rescheduling using a hybrid artificial immune system and genetic algorithm model

    Job shop rescheduling using a hybrid artificial immune system and genetic algorithm model by Mohamed Din, Aniza, Ku-Mahamud, Ku Ruhana, Yusof, Yuhanis, Mahmuddin, Massudi

    Published 2012
    “…This paper discusses on developing a hybrid model to tackle the problem of changing environment in the job shop scheduling problem.The main idea is to develop building blocks of partial schedules using the model developed that can be used to provide backup solutions when disturbances occur during production.This model hybridizes genetic algorithm (GA) with artificial immune systems (AIS) techniques to generate these partial schedules.Each partial schedule, also known as antibody, is assigned a fitness value for the selection of final population of best partial schedules. …”
    Get full text
    Get full text
    Conference or Workshop Item
    Save to List
    Saved in:
  11. 11
    Artificial bee colony algorithm with proposed discrete nearest neighborhood algorithm for discrete optimization problems

    Artificial bee colony algorithm with proposed discrete nearest neighborhood algorithm for discrete optimization problems by Rahimi, Amir Masoud, Ramezani-Khansari, Ehsan

    Published 2021
    “…This study seeks to solve this problem using Artificial Bee Colony (ABC) Algorithm along with the proposed Discrete Nearest Neighborhood Algorithm (DNNA). …”
    Get full text
    Get full text
    Get full text
    Article
    Save to List
    Saved in:
  12. 12
    Job shop rescheduling using a hybridization of genetic algorithm and artificial immune systems

    Job shop rescheduling using a hybridization of genetic algorithm and artificial immune systems by Mohamed Din, Aniza, Ku-Mahamud, Ku Ruhana, Yusof, Yuhanis, Mahmuddin, Massudi

    Published 2012
    “…This paper discusses on developing a hybrid model of genetic algorithm and artificial immune systems to tackle the problem of changing environment in the job shop scheduling problem. …”
    Get full text
    Get full text
    Get full text
    Conference or Workshop Item
    Save to List
    Saved in:
  13. 13
    Hybrid artificial bee colony algorithm with branch and bound for two–sided assembly line balancing

    Hybrid artificial bee colony algorithm with branch and bound for two–sided assembly line balancing by Elteriki, Salem Abdulsalam

    Published 2018
    “…However, not many types of research are focused on the study of the 2SALB problem. Recently, the artificial bee colony (ABC) algorithm was used in the solution process where it was considered as a very useful, effective and well-known algorithm. …”
    Get full text
    Get full text
    Get full text
    Get full text
    Thesis
    Save to List
    Saved in:
  14. 14
    Stiff PDE in heat problem : solution using the method of lines with new numerical algorithm

    Stiff PDE in heat problem : solution using the method of lines with new numerical algorithm by Yaacob, Nazeeruddin, Mohamed Murid, Ali Hassan, Wan Abdullah, Wan Rukaida, Hashim, Zulkifly

    Published 2005
    Get full text
    Get full text
    Monograph
    Save to List
    Saved in:
  15. 15
    Binary search algorithm-based maximum power point tracking for photovoltaic system under partial shaded conditions

    Binary search algorithm-based maximum power point tracking for photovoltaic system under partial shaded conditions by Hamdan, Daniyal, Meng, Chung Tiong, Mohd Herwan, Sulaiman

    Published 2018
    “…All three algorithms were examined under 15 different partial shaded test conditions. …”
    Get full text
    Get full text
    Get full text
    Conference or Workshop Item
    Save to List
    Saved in:
  16. 16
    Hybrid moth flame optimization mppt algorithm for accurate real-time tracking under partially shaded photovoltaic system

    Hybrid moth flame optimization mppt algorithm for accurate real-time tracking under partially shaded photovoltaic system by Tiong, Meng Chung

    Published 2021
    “…In addition, with the continuous improvement effort and the possibility of a new-comer algorithm can show superior results on the current problem, a new MFO based MPPT algorithm was proposed. …”
    Get full text
    Get full text
    Thesis
    Save to List
    Saved in:
  17. 17
    Enhanced Adaptive Confidence-Based Q Routing Algorithms For Network Traffic

    Enhanced Adaptive Confidence-Based Q Routing Algorithms For Network Traffic by Yap, Soon Teck

    Published 2004
    “…In CQ Routing Algorithm, the confidence value (C value) can be used to improve the quality of exploration in Q Routing Algorithm. …”
    Get full text
    Get full text
    Thesis
    Save to List
    Saved in:
  18. 18
    Application of Bee Colony Optimization (BCO) in NP-Hard Problems

    Application of Bee Colony Optimization (BCO) in NP-Hard Problems by Kamarudin, Muhammad Sariy Syazwan

    Published 2011
    “…This report presents the first stage of an ongoing research which is the problem solving of highly complex tasks using Bee-Inspired algorithms. …”
    Get full text
    Get full text
    Final Year Project
    Save to List
    Saved in:
  19. 19
    Ball surface representations using partial differential equations

    Ball surface representations using partial differential equations by Kherd, Ahmad Saleh Abdullah

    Published 2015
    “…This algorithm is then tested in positivity preserving of surface and image enlargement problems. …”
    Get full text
    Get full text
    Get full text
    Thesis
    Save to List
    Saved in:
  20. 20
    Addressing examination timetabling problem using a partial exams approach in constructive and improvement

    Addressing examination timetabling problem using a partial exams approach in constructive and improvement by Mandal, Ashis Kumar, Kahar, M. N. M., Kendall, Graham

    Published 2020
    Get full text
    Get full text
    Get full text
    Article
    Save to List
    Saved in:

Search Tools: