Search Results - (( using solution new 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
    A New Approach To The Solution Of Economic Dispatch Using Genetic Algorithm

    A New Approach To The Solution Of Economic Dispatch Using Genetic Algorithm by Al-Shetwi, Ali Q., Alomoush, Muwaffaq I.

    Published 2016
    “…The main idea of this paper focuses on the application of genetic algorithm in order to identify the best solution to an economic dispatch problem by using a new approach depending on Bmn coefficients and arithmetic crossover of the genetic algorithm. …”
    Get full text
    Get full text
    Get full text
    Article
    Save to List
    Saved in:
  6. 6
    Loss reduction in distribution networks using new network reconfiguration algorithm

    Loss reduction in distribution networks using new network reconfiguration algorithm by Kashem, M.A., Moghavvemi, M., Mohamed, A., Jasmon, G.B.

    Published 1996
    Get full text
    Article
    Save to List
    Saved in:
  7. 7
    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
    “…Results show that these new sequential and parallel algorithms run faster than the standard sequential and parallel FDTD algorithms. …”
    Get full text
    Get full text
    Thesis
    Save to List
    Saved in:
  8. 8
    Enhancement of Ant System Algorithm for Course Timetabling Problem

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

    Published 2009
    “…Results of the experiments that were conducted using various data sets showed that the proposed algorithm produced better course schedule solution than the Greedy Algorithm, Genetic Algorithm, and other variants of Ant System Algorithm.…”
    Get full text
    Get full text
    Get full text
    Thesis
    Save to List
    Saved in:
  9. 9
    Opposition-based Whale Optimization Algorithm

    Opposition-based Whale Optimization Algorithm by Alamri, Hammoudeh S., Alsariera, Yazan A., Kamal Z., Zamli

    Published 2018
    “…In order to improve solution accuracy and reliability, this paper proposes a new algorithm based on WOA. …”
    Get full text
    Get full text
    Get full text
    Article
    Save to List
    Saved in:
  10. 10
    A New Hybrid Gravitational Search- Black Hole Algorithm

    A New Hybrid Gravitational Search- Black Hole Algorithm by Suad Khairi, Mohammed, Zuwairie, Ibrahim, Hamdan, Daniyal, Nor Azlina, Ab. Aziz

    Published 2016
    “…This paper studies the solution of optimization problems using a new hybrid population-based algorithm. …”
    Get full text
    Get full text
    Get full text
    Conference or Workshop Item
    Save to List
    Saved in:
  11. 11
    Seed disperser ant algorithm for optimization / Chang Wen Liang

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

    Published 2018
    “…These binary variables are used to locally search for optimum solution. SDAA is developed using the concept of male ants performing nuptial flights to generate new superior colonies. …”
    Get full text
    Get full text
    Get full text
    Thesis
    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
    “…Genetic Algorithm gives a pool of solutions rather than just one. …”
    Get full text
    Get full text
    Monograph
    Save to List
    Saved in:
  13. 13
    An algorithm for positive solution of boundary value problems of nonlinear fractional differential equations by Adomian decomposition method

    An algorithm for positive solution of boundary value problems of nonlinear fractional differential equations by Adomian decomposition method by A. I., Md. Ismail, Hytham. A., Alkresheh

    Published 2016
    “…In the proposed algorithm the boundary conditions are used to convert the nonlinear fractional differential equations to an equivalent integral equation and then a recursion scheme is used to obtain the analytical solution components without the use of undetermined coefficients. …”
    Get full text
    Get full text
    Get full text
    Article
    Save to List
    Saved in:
  14. 14
    A hybrid multi-objective optimisation for energy efficiency and better coverage in underwater wireless sensor networks / Salmah Fattah

    A hybrid multi-objective optimisation for energy efficiency and better coverage in underwater wireless sensor networks / Salmah Fattah by Salmah , Fattah

    Published 2022
    “…The algorithm introduces the fuzzy Pareto dominance concept to compare two solutions and uses the scalar decomposition method when one solution cannot dominate the other in terms of the fuzzy dominance level. …”
    Get full text
    Get full text
    Get full text
    Thesis
    Save to List
    Saved in:
  15. 15
    A hybrid multi-objective optimisation for energy efficiency and better coverage in underwater wireless sensor networks

    A hybrid multi-objective optimisation for energy efficiency and better coverage in underwater wireless sensor networks by Salmah Fattah

    Published 2022
    “…The algorithm introduces the fuzzy Pareto dominance concept to compare two solutions and uses the scalar decomposition method when one solution cannot dominate the other in terms of the fuzzy dominance level. …”
    Get full text
    Get full text
    Get full text
    Thesis
    Save to List
    Saved in:
  16. 16
    Development of optimization Alghorithm for uncertain non-linear dynamical system

    Development of optimization Alghorithm for uncertain non-linear dynamical system by Abdul Aziz, Mohd. Ismail, Yaacob, Nazeeruddin, Mohd. Said, Norfarizan, Hamzah, Nor Hazadura

    Published 2004
    “…The new algorithms also boast faster contractions. Both new algorithms performed better than DISOPE. …”
    Get full text
    Get full text
    Monograph
    Save to List
    Saved in:
  17. 17
    Enhanced algorithms for three-dimensional object interpreter

    Enhanced algorithms for three-dimensional object interpreter by Haron, Habibollah

    Published 2004
    “…Besides reducing the number of image regularities used and new method to solve the linear system, this study has proposed better solutions in terms of an enhanced thinning algorithm, a modified Freeman chain code algorithm as picture description language, and a new computational comer detection algorithm.…”
    Get full text
    Get full text
    Get full text
    Thesis
    Save to List
    Saved in:
  18. 18
    Comparison between Genetic Algorithm and Prey-Predator Algorithm.

    Comparison between Genetic Algorithm and Prey-Predator Algorithm. by Ong, Hong Choon

    “…The use of metaheuristic algorithms to different problems becomes very common after the introduction of genetic algorithm in 1975. …”
    Get full text
    Monograph
    Save to List
    Saved in:
  19. 19
    Harmony search algorithm for curriculum-based course timetabling problem

    Harmony search algorithm for curriculum-based course timetabling problem by Wahid, Juliana, Mohd Hussin, Naimah

    Published 2013
    “…In this paper, harmony search algorithm is applied to curriculum-based course timetabling.The implementation, specifically the process of improvisation consists of memory consideration, random consideration and pitch adjustment.In memory consideration, the value of the course number for new solution was selected from all other course number located in the same column of the Harmony Memory.This research used the highest occurrence of the course number to be scheduled in a new harmony.The remaining courses that have not been scheduled by memory consideration will go through random consideration, i.e. will select any feasible location available to be scheduled in the new harmony solution. …”
    Get full text
    Get full text
    Get full text
    Article
    Save to List
    Saved in:
  20. 20
    Harmony search algorithm for curriculum-based course timetabling problem

    Harmony search algorithm for curriculum-based course timetabling problem by Wahid, Juliana, Mohd Hussin, Naimah

    Published 2013
    “…However, the algorithm produced results that were not comparatively better than those previously known as best solution.With proper modification in terms of the approach in this algorithm would make the algorithm perform better on curriculum-based course timetabling.…”
    Get full text
    Get full text
    Get full text
    Conference or Workshop Item
    Save to List
    Saved in:

Search Tools: