Search Results - (( java implementation path algorithm ) OR ( problem using six 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
    Partitional clustering algorithms for highly similar and sparseness y-short tandem repeat data / Ali Seman

    Partitional clustering algorithms for highly similar and sparseness y-short tandem repeat data / Ali Seman by Seman, Ali

    Published 2013
    “…Six Y-STR data sets were used as a benchmark to evaluate the performances of the algorithm against the other eight partitional clustering algorithms. …”
    Get full text
    Get full text
    Thesis
    Save to List
    Saved in:
  6. 6
    Rule-Based Multi-State Gravitational Search Algorithm for Discrete Optimization Problem

    Rule-Based Multi-State Gravitational Search Algorithm for Discrete Optimization Problem by Ismail, Ibrahim, Zuwairie, Ibrahim, Zulkifli, Md. Yusof

    Published 2015
    “…To evaluate the performances of the proposed algorithm and the BGSA, several experiments using six sets of selected benchmarks instances of traveling salesman problem (TSP) are conducted. …”
    Get full text
    Get full text
    Get full text
    Get full text
    Conference or Workshop Item
    Save to List
    Saved in:
  7. 7
    Solving economic dispatch with valve point loading effect using grey wolf optimizer algorithm / Farah Asyikin Amir Mahmud

    Solving economic dispatch with valve point loading effect using grey wolf optimizer algorithm / Farah Asyikin Amir Mahmud by Amir Mahmud, Farah Asyikin

    Published 2019
    Get full text
    Get full text
    Thesis
    Save to List
    Saved in:
  8. 8
    Multi-Objective Search Group Algorithm for engineering design problems

    Multi-Objective Search Group Algorithm for engineering design problems by Huy, T.H.B., Nallagownden, P., Truong, K.H., Kannan, R., Vo, D.N., Ho, N.

    Published 2022
    “…The statistical results are compared to the outcomes of other well-regarded algorithms using the same performance metrics. The comparative results show that MOGSA is robust and superior in handling a wide variety of multi-objective problems. …”
    Get full text
    Get full text
    Article
    Save to List
    Saved in:
  9. 9
    Economic emission load dispatch by using shuffled frog leaping algorithm / Muhammad Amirul Naim Rosli

    Economic emission load dispatch by using shuffled frog leaping algorithm / Muhammad Amirul Naim Rosli by Rosli, Muhammad Amirul Naim

    Published 2015
    “…To test this algorithm, a standard IEEE 30-bus, six generator unit is used as the test system. …”
    Get full text
    Get full text
    Thesis
    Save to List
    Saved in:
  10. 10
    An Application of Cuckoo Search Algorithm for Solving Optimal Chiller Loading Problem for Energy Conservation

    An Application of Cuckoo Search Algorithm for Solving Optimal Chiller Loading Problem for Energy Conservation by M. H., Sulaiman, Muhammad Ikram, Mohd Rashid, Mohd Rusllim, Mohamed, Omar, Aliman, Hamdan, Daniyal

    Published 2014
    “…On the other hand, CSA is a one of well-known swarm intelligence techniques that has been used to solve many optimization problems. In order to show the effectiveness of CSA in solving OCL problem, a case study with six-chiller system is considered. …”
    Get full text
    Conference or Workshop Item
    Save to List
    Saved in:
  11. 11
    Assessment of integrated assembly sequence planning and line balancing optimization using metaheuristic algorithms

    Assessment of integrated assembly sequence planning and line balancing optimization using metaheuristic algorithms by Mohd Fadzil Faisae, Ab Rashid, Ullah, Wasif, Muhammad Ammar, Nik Mu’tasim

    Published 2024
    “…Moreover, the number of test problems used in these works was restricted to only three problems. …”
    Get full text
    Get full text
    Get full text
    Get full text
    Conference or Workshop Item
    Save to List
    Saved in:
  12. 12
    Studying the Effect of Training Levenberg Marquardt Neural Network by Using Hybrid Meta-Heuristic Algorithms

    Studying the Effect of Training Levenberg Marquardt Neural Network by Using Hybrid Meta-Heuristic Algorithms by Abubakar, A., Khan, A., Nawi, N.M., Rehman, M.Z., Teh, Y.W., Chiroma, H., Herawan, T.

    Published 2016
    Get full text
    Get full text
    Article
    Save to List
    Saved in:
  13. 13
    Credit scoring for Cooperative of financial services using logistic regression estimated by genetic algorithm

    Credit scoring for Cooperative of financial services using logistic regression estimated by genetic algorithm by Mustafa, Mamat, Sukono, Firman, Asep, Sholahuddin

    Published 2014
    “…To anticipate the risk of default (credit risk), to prospective debtors applying for credit risk analysis was performed using credit scoring. In this paper the analysis of credit scoring is done using logistic regression model, which is estimated using genetic algorithms. …”
    Get full text
    Get full text
    Article
    Save to List
    Saved in:
  14. 14
    Studying the effect of training Levenberg Marquardt neural network by using hybrid meta-heuristic algorithms

    Studying the effect of training Levenberg Marquardt neural network by using hybrid meta-heuristic algorithms by Abubakar, Adamu, Khan, Abdullah, Nawi, Nazri Mohd, Rehman, M. Z., Teh , Ying Wah, Chiroma , Haruna, Herawan, Tutut

    Published 2016
    Get full text
    Get full text
    Get full text
    Get full text
    Article
    Save to List
    Saved in:
  15. 15
    Simulated annealing for solving economic dispatch problem / Wan Khairulizuan Wan Ismail

    Simulated annealing for solving economic dispatch problem / Wan Khairulizuan Wan Ismail by Wan Ismail, Wan Khairulizuan

    Published 2010
    “…SA algorithm used in this study was implemented by using MATLAB 7.8.0 (R2009a). …”
    Get full text
    Get full text
    Thesis
    Save to List
    Saved in:
  16. 16
    Fast Finite Difference Time Domain Algorithms for Solving Antenna Application Problem

    Fast Finite Difference Time Domain Algorithms for Solving Antenna Application Problem by Hasan, Mohammad Khatim

    Published 2008
    “…These new parallel and sequential finite difference time domain (FDTD) algorithms yield from O(h2), ordinary O(h4) and weighted average O(h4) centered difference discretization using direct-domain and temporary-domain are used to solve problems mentioned above. …”
    Get full text
    Get full text
    Thesis
    Save to List
    Saved in:
  17. 17
    Beta Distribution Weighted Fuzzy C-Ordered-Means Clustering

    Beta Distribution Weighted Fuzzy C-Ordered-Means Clustering by Hengda, Wang, Mohamad Mohsin, Mohamad Farhan, Mohd Pozi, Muhammad Syafiq

    Published 2024
    “…Experiments were conducted on six UCI datasets to validate the effectiveness of the BDFCOM, comparing its performance against seven other clustering algorithms using six evaluation indices. …”
    Get full text
    Get full text
    Get full text
    Get full text
    Article
    Save to List
    Saved in:
  18. 18
    An enhanced version of black hole algorithm via levy flight for optimization and data lustering problems

    An enhanced version of black hole algorithm via levy flight for optimization and data lustering problems by Haneen, Abd Wahab, Noraziah, Ahmad, Alsewari, Abdulrahman A., Sinan, Q. Salih

    Published 2019
    “…Recently, nature-inspired algorithms have been proposed and utilized for solving the optimization problems in general, and data clustering problem in particular. …”
    Get full text
    Get full text
    Get full text
    Article
    Save to List
    Saved in:
  19. 19
    Optimal allocation of thermal generating units through shuffled frog leaping algorithm / Amirul Hakim Mohd Jamil

    Optimal allocation of thermal generating units through shuffled frog leaping algorithm / Amirul Hakim Mohd Jamil by Mohd Jamil, Amirul Hakim

    Published 2016
    “…This thesis presents the solution of economic load dispatch problem with valvepoint effect using Shuffled Frog Leaping Algorithm (SFLA). …”
    Get full text
    Get full text
    Thesis
    Save to List
    Saved in:
  20. 20
    Ant colony optimization in dynamic environments

    Ant colony optimization in dynamic environments by Chen, Fei Huang

    Published 2010
    “…In order to achieve this objective, six ant algorithms namely Ant System (AS), Ant Colony System (ACS), Best-Worst Ant System (BWAS), Elitist Ant System (EAS), Max-Min Ant System (MMAS) and Rank-Based Ant System (RBAS) were implemented to solve a dynamic optimization problem in the form of the dynamic Traveling Salesman Problem (TSP). …”
    Get full text
    Get full text
    Get full text
    Thesis
    Save to List
    Saved in:

Search Tools: