Search Results - (( development problem method algorithm ) OR ( java implementation path 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
    An interactive analytics approach for sustainable and resilient case studies: a machine learning perspective

    An interactive analytics approach for sustainable and resilient case studies: a machine learning perspective by Mousavi, Seyed Mohsen, Sadeghi R., Kiarash, Lee, Lai Soon

    Published 2023
    “…Sustainable development is a problem-solving method that simultaneously accounts for the economic, environmental, and social impacts of actions. …”
    Get full text
    Get full text
    Article
    Save to List
    Saved in:
  6. 6
    Bats echolocation-inspired algorithms for global optimisation problems

    Bats echolocation-inspired algorithms for global optimisation problems by Nafrizuan, Mat Yahya

    Published 2016
    “…The works related to swarm intelligence algorithms include the development of the algorithm itself, its modification and improvisation as well as its application in solving global optimisation problems. …”
    Get full text
    Get full text
    Thesis
    Save to List
    Saved in:
  7. 7
    Efficient Sequential and Parallel Routing Algorithms in Optical Multistage Interconnection Network

    Efficient Sequential and Parallel Routing Algorithms in Optical Multistage Interconnection Network by Abduh Kaid, Monir Abdullah

    Published 2005
    “…The first approach is to develop an efficient sequential algorithm for the window method. …”
    Get full text
    Get full text
    Thesis
    Save to List
    Saved in:
  8. 8
    Shuffled frog leaping algorithm for solving economic load dispatch problem / Mohammad Ariffin Aizat Ezanee

    Shuffled frog leaping algorithm for solving economic load dispatch problem / Mohammad Ariffin Aizat Ezanee by Ezanee, Mohammad Ariffin Aizat

    Published 2015
    “…The proposed SFLA method is developed using MATLAB programming. This SFLA method is tested on IEEE 30 bus system and the results show that it can solve ELD problem by providing minimum cost. …”
    Get full text
    Get full text
    Thesis
    Save to List
    Saved in:
  9. 9
    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
    “…Material and methods: To test the proposed technique, selected approximation algorithms have been developed to small graph instances. …”
    Get full text
    Get full text
    Get full text
    Get full text
    Article
    Save to List
    Saved in:
  10. 10
    Application of Krylov Subspace methods for solving Continuous Power Flow problem in voltage stability analysis of power system

    Application of Krylov Subspace methods for solving Continuous Power Flow problem in voltage stability analysis of power system by Jasni, Jasronita

    Published 2010
    “…These developed algorithms are tested on 14, 118 and 300 IEEE bus systems. …”
    Get full text
    Get full text
    Thesis
    Save to List
    Saved in:
  11. 11
    Using Metaheuristics Algorithms (MHAs) to Optimize Water Supply Operation in Reservoirs: a Review

    Using Metaheuristics Algorithms (MHAs) to Optimize Water Supply Operation in Reservoirs: a Review by Almubaidin M.A.A., Ahmed A.N., Sidek L.B.M., Elshafie A.

    Published 2023
    Review
    Save to List
    Saved in:
  12. 12
    Development of heuristic methods based on genetic algorithm (GA) for solving vehicle routing problem

    Development of heuristic methods based on genetic algorithm (GA) for solving vehicle routing problem by Ismail, Zuhaimy, Nurhadi, Irhamah, Zainuddin, Zaitul Marlizawati

    Published 2008
    “…Based on the proposed heuristic method, we developed a program to optimize the routing problem using the Visual Studio C++ 6.0 programming language.…”
    Get full text
    Get full text
    Monograph
    Save to List
    Saved in:
  13. 13
    A hybrid SP-QPSO algorithm with parameter free adaptive penalty method for constrained global optimization problems

    A hybrid SP-QPSO algorithm with parameter free adaptive penalty method for constrained global optimization problems by Fatemeh, D. B., Loo, C. K., Kanagaraj, G., Ponnambalam, S. G.

    Published 2018
    “…This paper attempts the suitability of newly developed hybrid algorithm, Shuffled Complex Evolution with Quantum Particle Swarm Optimization abbreviated as SP-QPSO, extended specifically designed for solving constrained optimization problems. …”
    Get full text
    Get full text
    Get full text
    Article
    Save to List
    Saved in:
  14. 14
    Overview of metaheuristic: classification of population and trajectory

    Overview of metaheuristic: classification of population and trajectory by Zainul Rashid, Zarina

    Published 2010
    “…Some algorithms can be defined if the developer of the system has problem specific knowledge to the solution. …”
    Get full text
    Get full text
    Monograph
    Save to List
    Saved in:
  15. 15
    Genetic Algorithm for vehicle routing problem / W.Nurfahizul Ifwah W.Alias, Mohd Shaiful Sharipudin and Shamsunarnie Mohamed Zukri.

    Genetic Algorithm for vehicle routing problem / W.Nurfahizul Ifwah W.Alias, Mohd Shaiful Sharipudin and Shamsunarnie Mohamed Zukri. by W.Alias, W.Nurfahizul Ifwah, Sharipudin, Mohd Shaiful, Mohamed Zukri, Shamsunarnie

    Published 2012
    “…The objective of this research is to present a heuristic method, called Genetic Algorithm (GA), to solve the VRP. …”
    Get full text
    Get full text
    Research Reports
    Save to List
    Saved in:
  16. 16
    Fuzzy clustering method and evaluation based on multi criteria decision making technique

    Fuzzy clustering method and evaluation based on multi criteria decision making technique by Sameer, Fadhaa Othman

    Published 2018
    “…This proposed algorithm is developed based on heuristic method named modified binary particle swarm optimization (MBPSO) with kernel fuzzy clustering method as a fitness function. …”
    Get full text
    Get full text
    Get full text
    Thesis
    Save to List
    Saved in:
  17. 17
    An Efficient Genetic Algorithm for Large Scale Vehicle Routing Problem Subject to Precedence Constraints

    An Efficient Genetic Algorithm for Large Scale Vehicle Routing Problem Subject to Precedence Constraints by Noraini, Mohd Razali

    Published 2015
    “…Therefore, metaheuristic method based genetic algorithm has been developed to obtain feasible and optimal solution with less computation time. …”
    Get full text
    Get full text
    Get full text
    Article
    Save to List
    Saved in:
  18. 18
    Enhancement of Ant System Algorithm for Course Timetabling Problem

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

    Published 2009
    “…As a member of the NP Problem, an exact algorithm to solve the course scheduling problem is not available to date. …”
    Get full text
    Get full text
    Get full text
    Thesis
    Save to List
    Saved in:
  19. 19
    Sports tournament scheduling using genetic algorithm / Hafeezur Syakir Abdul Motok@Mohd Ridzuan

    Sports tournament scheduling using genetic algorithm / Hafeezur Syakir Abdul Motok@Mohd Ridzuan by Abdul Motok@Mohd Ridzuan, Hafeezur Syakir

    Published 2020
    “…In this report, a Genetic Algorithm (GA) is applied for solving University sports timetabling problems. …”
    Get full text
    Get full text
    Thesis
    Save to List
    Saved in:
  20. 20
    Augmentation of basic-line-search and quick-simplex-method algorithms to enhance linear programming computational performance

    Augmentation of basic-line-search and quick-simplex-method algorithms to enhance linear programming computational performance by Nor Azlan, Nor Asmaa Alyaa

    Published 2021
    “…The thesis was set to three objectives as follows; to develop a new augmentation algorithm of Simplex method from the existed augmentation studies; to integrate the superiorities of the QSM and BLSA algorithms that can enhance computational performance; to compare the performance of the new augmentation algorithm with the conventional Simplex, QSM and BLSA in reducing iteration number. …”
    Get full text
    Get full text
    Get full text
    Thesis
    Save to List
    Saved in:

Search Tools: