Search Results - (( java implementation path algorithm ) OR ( parameter solution search algorithm ))

Refine Results
  1. 1

    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
  2. 2
  3. 3

    Pendulum-like algorithm as a local search technique by Abed I.A., Koh S.P., Sahari K.S.M., Tiong S.K., Younis H.A.-K., Abed A.A.

    Published 2023
    “…Aluminum; Approximation algorithms; Local search (optimization); Optimization; Pendulums; Problem solving; attraction; Global solutions; Local search; Local search techniques; Optimization problems; repulsion; Repulsion mechanisms; simple harmonic; Parameter estimation…”
    Conference Paper
  4. 4

    Refinement of Tuned Mass Damper parameters on machine support structure using dynamic Cuckoo Search algorithm by Ahmad Muinuddin, Mahmood, Zamri, Mohamed, Rosmazi, Rosli

    Published 2025
    “…This study proposes the use of a dynamic Cuckoo Search (CS) algorithm, a nature-inspired optimization method, to enhance the accuracy of TMD parameters when external factors, such as excitation frequency or structural properties, change. …”
    Get full text
    Get full text
    Get full text
    Conference or Workshop Item
  5. 5
  6. 6

    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
  7. 7

    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
  8. 8

    A harmony search-based learning algorithm for epileptic seizure prediction by Kee, Huong Lai, Zainuddin, Zarita, Ong, Pauline

    Published 2016
    “…In this work, the harmony search algorithm is employed to find the optimal solution for both synaptic weight values and bias terms in the learning of wavelet neural network. …”
    Get full text
    Get full text
    Article
  9. 9

    Heterogenous adaptive ant colony optimization with 3-opt local search for the travelling salesman problem by Tuani Ibrahim, Ahamed Fayeez, Keedwell, Edward, Collett, Matthew

    Published 2020
    “…One method to mitigate this is to introduce adaptivity into the algorithm to discover good parameter settings during the search. …”
    Get full text
    Get full text
    Get full text
    Get full text
    Article
  10. 10

    A Multidimensional Search Space Using Interactive Genetic Algorithm by Farooq, H., Zakaria, M.N., Hassan, M.F., Sulaiman, Suziah

    Published 2010
    “…This paper applied an Interactive Genetic Algorithm (IGA) technique to design an visualization environment for search space. …”
    Get full text
    Get full text
    Get full text
    Conference or Workshop Item
  11. 11

    A modified crow search algorithm with niching technique for numerical optimization by Islam, J., Vasant, P.M., Negash, B.M., Watada, J.

    Published 2019
    “…The search agent of the primitive crow search algorithm does not always follow the best solution obtained so far. …”
    Get full text
    Get full text
    Conference or Workshop Item
  12. 12

    A modified crow search algorithm with niching technique for numerical optimization by Islam, J., Vasant, P.M., Negash, B.M., Watada, J.

    Published 2019
    “…The search agent of the primitive crow search algorithm does not always follow the best solution obtained so far. …”
    Get full text
    Get full text
    Conference or Workshop Item
  13. 13

    Enhancing Harmony Search Parameters Based On Step And Linear Function For Bus Driver Scheduling And Rostering Problems by Mansor, Nur Farraliza

    Published 2018
    “…Optimization is a major challenge in numerous practical world problems.According to the “No Free Lunch (NFL)” theorem,there is no existing single optimizer algorithm that is able to resolve all issues in an effective and efficient manner.It is varied and need to be solved according to the specific capabilities inherent to certain algorithms making it hard to foresee the algorithm that is best suited for each problem.As a result,the heuristic technique is adopted for this research as it has been identified as a potentially suitable algorithm.Alternative heuristic algorithms are also suggested to obtain optimal solutions with reasonable computational effort.However,the heuristic approach failed to produce a solution that nears optimum when the complexity of a problem increases;therefore a type of nature-inspired algorithm known as meta-euristics which utilises an intelligent searching mechanism over a population is considered and consequently used.The meta-heuristic approach is widely used to substitute heuristic terms and is broadly applied to address problems with regards to driver scheduling.However,this meta-heuristic technique is still unable to address the fairness issue in the scheduling and rostering problems.Hence,this research proposes a strategy to adopt an amendment of the harmony search algorithm in order to address the fairness issue which in turn will escalate the level of fairness in driver scheduling and rostering.The harmony search algorithm is classified as a meta-heuristics algorithm that is capable of solving hard and combinatorial or discrete optimisation problems.In this respect,the three main operators in harmony search,namely the Harmony Memory Consideration Rate (HMCR),Pitch Adjustment Rate (PAR) and Bandwidth (BW) play a vital role in balancing local exploitation and global exploration.These parameters influence the overall performance of the HS algorithm,and therefore it is crucial to fine-tune them. …”
    Get full text
    Get full text
    Get full text
    Get full text
    Thesis
  14. 14

    Taguchi-Grey Relational Analysis Method for Parameter Tuning of Multi-objective Pareto Ant Colony System Algorithm by Muthana, Shatha Abdulhadi, Ku Mahamud, Ku Ruhana

    Published 2023
    “…In any metaheuristic, the parameter values strongly affect the efficiency of an algorithm’s search. …”
    Get full text
    Get full text
    Get full text
    Article
  15. 15

    Hybrid of firefly algorithm and pattern search for solving optimization problems by Wahid, Fazli, Ghazali, Rozaida

    Published 2018
    “…In the final stage, the optimized values obtained from the FA during its maximum number of iteration are given as inputs to the pattern search algorithm. The pattern search is an optimization algorithm that further optimizes the values obtained in the maximum iterations of standard FA. …”
    Get full text
    Get full text
    Article
  16. 16

    Performance evaluation of Black Hole Algorithm, Gravitational Search Algorithm and Particle Swarm Optimization by Zuwairie, Ibrahim, Mohamad Nizam, Aliman, Fardila, Naim, Sophan Wahyudi, Nawawi, Shahdan, Sudin

    Published 2015
    “…In this paper, performance of BH algorithm will be analyzed and reviewed for continuous search space using CEC2014 benchmark dataset against Gravitational Search Algorithm (GSA) and Particle Swarm Optimization (PSO). …”
    Get full text
    Get full text
    Get full text
    Article
  17. 17

    Finite impulse response optimizers for solving optimization problems by Tasiransurini, Ab Rahman

    Published 2019
    “…Selecting optimal parameters’ values may improve an algorithm’s performance. …”
    Get full text
    Get full text
    Thesis
  18. 18

    Finite impulse response optimizers for solving optimization problems by Ab Rahman, Tasiransurini

    Published 2019
    “…Selecting optimal parameters’ values may improve an algorithm’s performance. …”
    Get full text
    Get full text
    Thesis
  19. 19

    Enhanced Harris's Hawk algorithm for continuous multi-objective optimization problems by Yasear, Shaymah Akram

    Published 2020
    “…The algorithm includes (i) a population update strategy which improves the movement of hawks in the search space, (ii) a parameter adjusting strategy to control the transition between exploration and exploitation, and (iii) a population generating method in producing the initial candidate solutions. …”
    Get full text
    Get full text
    Get full text
    Get full text
    Thesis
  20. 20

    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