Search Results - (( java implementation path algorithm ) OR ( problem representative _ 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
    Hybrid multiobjective genetic algorithm for integrated dynamic scheduling and routing of jobs and automated guided vehicles in flexible manufacturing systems

    Hybrid multiobjective genetic algorithm for integrated dynamic scheduling and routing of jobs and automated guided vehicles in flexible manufacturing systems by Umar, Umar Ali

    Published 2014
    “…Routing AGVs was proved to be NP-Complete and scheduling of jobs was also proved to be NP hard problems. The running time of any deterministic algorithms solving these types of problems increases very rapidly with the size of the problem, which can be many years with any computational resources available presently. …”
    Get full text
    Get full text
    Thesis
    Save to List
    Saved in:
  6. 6
    An Experiment of Ant Algorithms : Case Study of Kota Kinabalu Central Town

    An Experiment of Ant Algorithms : Case Study of Kota Kinabalu Central Town by Nor Rafidah, Mohamad

    Published 2005
    “…Shortest path is one of the optimization problems that are difficult to solve. There are many algorithms that used to solve this problem. …”
    Get full text
    Get full text
    Get full text
    Thesis
    Save to List
    Saved in:
  7. 7
    A Preliminary Study On Firefly Algorithm Approach For Travelling Salesman Problem

    A Preliminary Study On Firefly Algorithm Approach For Travelling Salesman Problem by Ismail, Mohd Muzafar, Che Hasan, Mohd Hanif, Mohamad @ Ab Rahman, Syahrul Hisham, Jaafar, Hazriq Izzuan

    Published 2013
    “…Each firefly in Firefly Algorithm represents a candidate solution of the Travelling Salesman Problem. …”
    Get full text
    Get full text
    Conference or Workshop Item
    Save to List
    Saved in:
  8. 8
    Distance evaluated simulated kalman filter with state encoding for combinatorial optimization problems

    Distance evaluated simulated kalman filter with state encoding for combinatorial optimization problems by Yusof, Zulkifli Md., Ibrahim, Zuwairie, Adam, Asrul, Azmi, Kamil Zakwan Mohd, Ab. Rahman, Tasiransurini, Muhammad, Badaruddin, Ab. Aziz, Nor Azlina, Abd Aziz, Nor Hidayati, Mokhtar, Norrima, Shapiai, Mohd Ibrahim, Muhammad, Mohd Saberi

    Published 2018
    “…These three combinatorial SKF algorithms use binary encoding to represent the solution to a combinatorial optimization problem. …”
    Get full text
    Get full text
    Article
    Save to List
    Saved in:
  9. 9
    A Preliminary Study on Camera Auto Calibration Problem Using Bat Algorithm

    A Preliminary Study on Camera Auto Calibration Problem Using Bat Algorithm by Mohd Annuar, Khalil Azha, Selamat, Nur Asmiza, Jaafar, Hazriq Izzuan, Mohamad, Syahrul Hisham

    Published 2013
    “…Each bat in Bat Algorithm represents a candidate solution for the problem and each dimension in the search space of the Bat Algorithm represents a parameter of intrinsic parameters: skew, focal length, and magnification factor. …”
    Get full text
    Get full text
    Conference or Workshop Item
    Save to List
    Saved in:
  10. 10
    Propositional satisfiability algorithm to find minimal reducts for data mining

    Propositional satisfiability algorithm to find minimal reducts for data mining by Bakar, A.A., Sulaiman, M.N., Othman, M., Selamat, M.H.

    Published 2002
    “…A branch and bound algorithm is presented to solve the proposed SAT problem. …”
    Get full text
    Get full text
    Article
    Save to List
    Saved in:
  11. 11
    Magnetic Optimization Algorithm Approach For Travelling Salesman Problem

    Magnetic Optimization Algorithm Approach For Travelling Salesman Problem by Ismail, Mohd Muzafar, Zakaria, Muhammad Iqbal, Zainal Abidin, Amar Faiz, Mad Juliani, Juwita, Lit, Asrani, Mirjalili, Seyedali, Nordin, Nur Anis, Mohamed Saaid, Muhammad Faiz

    Published 2012
    “…In this implementation, each magnetic agent or particle in Magnetic Optimization Algorithm represents a candidate solution of the Travelling Salesman Problem. …”
    Get full text
    Get full text
    Conference or Workshop Item
    Save to List
    Saved in:
  12. 12
    Distance evaluated simulated kalman filter with state encoding for combinatorial optimization problems

    Distance evaluated simulated kalman filter with state encoding for combinatorial optimization problems by Zuwairie, Ibrahim, Zulkifli, Md. Yusof, Asrul, Adam, Kamil Zakwan, Mohd Azmi, Tasiransurini, Ab Rahman, Badaruddin, Muhammad, Nor Azlina, Ab. Aziz, Norrima, Mokhtar, Mohd Ibrahim, Shapiai, Mohd Saberi, Mohamad

    Published 2018
    “…The SKF algorithm only capable to solve numerical optimization problems which involve continuous search space. …”
    Get full text
    Get full text
    Get full text
    Get full text
    Article
    Save to List
    Saved in:
  13. 13
    A study on the parameter selection of bat algorithm in in optimizing parameters in camera auto calibration problem

    A study on the parameter selection of bat algorithm in in optimizing parameters in camera auto calibration problem by Mohd Said, Rahaini, A Aziz, Khairul Azha, Zainal Abidin, Amar Faiz, Mat Jizat, Jessnor Arif, Mohd Khairuddin, Ismail, Widiyanto, Sigit, Abdul Waduth, Mohamed Faisal

    Published 2022
    “…Each bat in the Bat Algorithm represents a potential solution to the issue, and each dimension in the Bat Algorithm's search space represents one of the basic parameters: skew, focal length, and magnification factor. …”
    Get full text
    Get full text
    Get full text
    Article
    Save to List
    Saved in:
  14. 14
    A simulation software for DNA computing algorithms implementation

    A simulation software for DNA computing algorithms implementation by Muhammad, M.S., Masra, S.M.W., Kipli, K., Zamhari, N.

    Published 2010
    “…The capturing of gel electrophoresis image represents the output of a DNA computing algorithm. …”
    Get full text
    Get full text
    Get full text
    Article
    Save to List
    Saved in:
  15. 15
    Conflict-free automated guided vehicles routing using multi-objective genetic algorithm

    Conflict-free automated guided vehicles routing using multi-objective genetic algorithm by Umar, Ali Umar, Mohd Ariffin, Mohd Khairol Anuar, Ismail, Napsiah, Tang, Sai Hong

    Published 2013
    “…The problem is represented using one sub-chromosome for dispatching represented with random keys and the remaining sub-chromosomes for routing represented with priority-based encoding. …”
    Get full text
    Get full text
    Get full text
    Article
    Save to List
    Saved in:
  16. 16
    Curve Reconstruction By Metaheuristics Algorithms On Cubic Rational Bézier Function

    Curve Reconstruction By Metaheuristics Algorithms On Cubic Rational Bézier Function by Mohamed, Najihah

    Published 2019
    “…The optimisation technique consists of exact algorithm, and approximate algorithm. The approximate algorithm is a good technique to be highlighted since it is a feasible way to develop an easier, more convenient curve fitting method, that will save great computation, solve a large scale problem and produce a better quality end result. …”
    Get full text
    Get full text
    Thesis
    Save to List
    Saved in:
  17. 17
    A novel solution to traveling salesman problem using fuzzy sets, gravitational search algorithm, and genetic algorithm

    A novel solution to traveling salesman problem using fuzzy sets, gravitational search algorithm, and genetic algorithm by Abarghouei, Amir Atapour

    Published 2010
    “…TSP is a representative of a large class of problems known as the combinatorial optimization problems. …”
    Get full text
    Get full text
    Thesis
    Save to List
    Saved in:
  18. 18
    A quantum algorithm for minimal spanning tree

    A quantum algorithm for minimal spanning tree by Aghaei, Mohammad Reza Soltan, Ahmad Zukarnain, Zuriati, Mamat, Ali, Zainuddin, Hishamuddin

    Published 2008
    “…Quantum computing algorithms are considered for several problems in graph theory. …”
    Get full text
    Get full text
    Conference or Workshop Item
    Save to List
    Saved in:
  19. 19
    A Preliminary Study on Solving Knight’s Tour Problem Using Binary Magnetic Optimization Algorithm

    A Preliminary Study on Solving Knight’s Tour Problem Using Binary Magnetic Optimization Algorithm by Ismail, Mohd Muzafar, Shair, Ezreen Farina, Mohd Nor, Arfah Syahida, Mohd Shaari Azyze, Nur Latif Azyze, Mohd Karis, Safirin, Jaafar, Hazriq Izzuan, Mohamad, Syahrul Hisham

    Published 2013
    “…This paper proposes a model using Binary Magnetic Optimization Algorithm to solve the problem. Each particle represents a possible solution of the problem. …”
    Get full text
    Get full text
    Conference or Workshop Item
    Save to List
    Saved in:
  20. 20
    A comprehensive comparison of evolutionary optimization limited by number of evaluations against time constraints

    A comprehensive comparison of evolutionary optimization limited by number of evaluations against time constraints by Jia, Hui Ong, Teo, Jason Tze Wi

    Published 2016
    “…A comprehensive and latest global optimization benchmark test suite is used in the form of the CEC 2015 Global Optimization Competition’s 15 scalable test problems. The first experiment is to test the performance of these algorithms in expensive benchmark optimization problems that limit the number of fitness evaluations to 50N where N represents the number of optimization dimensions. …”
    Get full text
    Get full text
    Get full text
    Get full text
    Article
    Save to List
    Saved in:

Search Tools: