Search Results - (( developing special optimization 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
    Swarm intelligence optimization algorithms: a review

    Swarm intelligence optimization algorithms: a review by Odili, Julius Beneoluchi, M. N. M., Kahar, Noraziah, Ahmad

    Published 2018
    “…This paper presents a review of some recently developed swarm intelligence algorithms that have been successfully applied to solve a number of optimization problems with special emphasis on their application areas, strengths and observable weaknesses. …”
    Get full text
    Get full text
    Get full text
    Article
    Save to List
    Saved in:
  6. 6
    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:
  7. 7
    Quantum Particle Swarm Optimization Technique for Load Balancing in Cloud Computing

    Quantum Particle Swarm Optimization Technique for Load Balancing in Cloud Computing by Elrasheed Ismail, Sultan

    Published 2013
    “…Then they are assigned to the machines according to the assignment algorithm for job combinations, which is a special integer partition algorithm. …”
    Get full text
    Thesis
    Save to List
    Saved in:
  8. 8
    Seed disperser ant algorithm for optimization / Chang Wen Liang

    Seed disperser ant algorithm for optimization / Chang Wen Liang by Chang , Wen Liang

    Published 2018
    “…The Seed Disperser Ant Algorithm (SDAA) is developed based on the evolution or expansion process of Seed Disperser Ant (Aphaenogaster senilis) colony. …”
    Get full text
    Get full text
    Get full text
    Thesis
    Save to List
    Saved in:
  9. 9
    Wideband patch antenna design using selective particle swarm optimization

    Wideband patch antenna design using selective particle swarm optimization by Md, Moniruzzaman, Islam, Md Rafiqul, Kamaruzzaman, Sopian, Zaidi, Saleem H

    Published 2012
    “…An application of this algorithm is developed for wideband patch antenna optimization. …”
    Get full text
    Get full text
    Get full text
    Article
    Save to List
    Saved in:
  10. 10
    Ant colony optimization (ACO) algorithm for CNC route problem

    Ant colony optimization (ACO) algorithm for CNC route problem by Wan Nur Farhanah , Wan Zakaria

    Published 2012
    “…This project is about to develop a software which applying ACO algorithm in order to calculate the shortest path available that can reduce the time taken to drill the entire hole of PCB. …”
    Get full text
    Get full text
    Undergraduates Project Papers
    Save to List
    Saved in:
  11. 11
    EFFICIENCY IMPROVEMENT OF FLAT PLATE SOLAR COLLECTOR USING SEARCH GROUP ALGORITHM

    EFFICIENCY IMPROVEMENT OF FLAT PLATE SOLAR COLLECTOR USING SEARCH GROUP ALGORITHM by ABD RASHID, NURSABRINA

    Published 2019
    “…This document proposes new optimization technique, the Search Group Algorithm (SGA), to optimize the efficiency of flat plate solar collector.…”
    Get full text
    Get full text
    Final Year Project
    Save to List
    Saved in:
  12. 12
    Alternative method for economic dispatch utilizing grey wolf optimizer

    Alternative method for economic dispatch utilizing grey wolf optimizer by Wong, Lo Ing

    Published 2015
    “…Although several optimization methodologies have been developed for solving ED problems, the complexity of the task reveals the necessity for development of efficient algorithms to accurately locate the optimum solution. …”
    Get full text
    Get full text
    Thesis
    Save to List
    Saved in:
  13. 13
    Data Analysis and Machine Learning Algorithms Evaluation for Bioliq AI-based Predictive Tool

    Data Analysis and Machine Learning Algorithms Evaluation for Bioliq AI-based Predictive Tool by Samuel Simbine, Augusto

    Published 2019
    “…This final year project identified relevant parameters through literature research, analysis and expert interview, and evaluated different machine learning algorithms and identified linear regression as the most applicable and efficient with its R-square of 0.8015, qualifying it to be used for the development of a hybrid model for the AI-based tool for predictive process optimization for chemical plants.…”
    Get full text
    Get full text
    Final Year Project
    Save to List
    Saved in:
  14. 14
    Mathematical formulation of tabu search in combinatorial optimization

    Mathematical formulation of tabu search in combinatorial optimization by Ismail, Zuhaimy

    Published 2008
    Get full text
    Get full text
    Monograph
    Save to List
    Saved in:
  15. 15
    Performance improvement for infiltration rate prediction using hybridized Adaptive Neuro-Fuzzy Inferences System (ANFIS) with optimization algorithms

    Performance improvement for infiltration rate prediction using hybridized Adaptive Neuro-Fuzzy Inferences System (ANFIS) with optimization algorithms by Ehteram M., Yenn Teo F., Najah Ahmed A., Dashti Latif S., Feng Huang Y., Abozweita O., Al-Ansari N., El-Shafie A.

    Published 2023
    Article
    Save to List
    Saved in:
  16. 16
    Application of Taylor-Newton homotopy method for solving electrical engineering design problem

    Application of Taylor-Newton homotopy method for solving electrical engineering design problem by Hasan, Talib Hashim, Azram, Mohammad, Daoud, Jamal Ibrahim

    Published 2010
    Get full text
    Get full text
    Get full text
    Proceeding Paper
    Save to List
    Saved in:
  17. 17
    CSC649 - Special Topics in Computer Science / College of Computing, Informatics and Media

    CSC649 - Special Topics in Computer Science / College of Computing, Informatics and Media by UiTM, College of Computing, Informatics and Media

    Published 2022
    “…The course will cover specialized technology and described in terms of frameworks and problem formulations, standard models, methods, computational tools, algorithms, as well as methodologies to evaluate the system and select optimal models. …”
    Get full text
    Get full text
    Get full text
    Teaching Resource
    Save to List
    Saved in:
  18. 18
    CSC649: Special Topics in Computer Science / College of Computing, Informatics and Mathematics

    CSC649: Special Topics in Computer Science / College of Computing, Informatics and Mathematics by UiTM, College of Computing, Informatics and Mathematics

    Published 2018
    “…The course will cover specialized technology and described in terms of frameworks and problem formulations, standard models, methods, computational tools, algorithms, as well as methodologies to evaluate the system and select optimal models. …”
    Get full text
    Get full text
    Get full text
    Teaching Resource
    Save to List
    Saved in:
  19. 19
    Optimizing solar streetlight systems for sustainable urban and community development

    Optimizing solar streetlight systems for sustainable urban and community development by Jun, L. W., Zabri, Siti Normi, Mohd Kassim, N. S., Mohamad, Sarah Yasmin

    Published 2025
    “…Additionally, a smart LED control algorithm was developed to minimize energy consumption by dynamically adjusting light output based on demand and availability of stored energy. …”
    Get full text
    Get full text
    Get full text
    Get full text
    Article
    Save to List
    Saved in:
  20. 20
    An Improved-Time Polynomial-Space Exact Algorithm For TSP In Degree-5 Graphs

    An Improved-Time Polynomial-Space Exact Algorithm For TSP In Degree-5 Graphs by Md Yunos, Norhazwani, Shurbevski, Aleksandar, Nagamochi, Hiroshi

    Published 2017
    “…The Traveling Salesman Problem (TSP) is one of the most well-known NP-hard optimization problems. Following a recent trend of research which focuses on developing algorithms for special types of TSP instances, namely graphs of limited degree, in an attempt to reduce a part of the time and space complexity, we present a polynomial-space branching algorithm for the TSP in an n-vertex graph with degree at most 5, and show that it has a running time of O∗(2.3500n), which improves the previous best known time bound of O∗(2.4723n) given by the authors (the 12th International Symposium on Operations Research and Its Application (ISORA 2015), pp.45–58, 2015). …”
    Get full text
    Get full text
    Get full text
    Get full text
    Article
    Save to List
    Saved in:

Search Tools: