Search Results - (( total solution machine 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
    A genetic algorithm on single machine family scheduling problem to minimise total weighted completion time

    A genetic algorithm on single machine family scheduling problem to minimise total weighted completion time by Nazif, Habibeh, Lee, Lai Soon

    Published 2009
    “…The computational results indicate the effectiveness of the proposed algorithm in generating better quality solutions compared to other algorithms. …”
    Get full text
    Get full text
    Article
    Save to List
    Saved in:
  5. 5
    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:
  6. 6
    Development of cell formation algorithm and model for cellular manufacturing system

    Development of cell formation algorithm and model for cellular manufacturing system by Nouri, Hossein

    Published 2011
    “…Therefore, for this proposes good benchmarked algorithm, bacteria foraging algorithm is selected and developed to solve multiobjective cell formation model and traced constraints satisfaction handling to produce feasible optimal solution. …”
    Get full text
    Get full text
    Thesis
    Save to List
    Saved in:
  7. 7
    Optimised Crossover Genetic Algorithms for Combinatorial Optimisation Problems

    Optimised Crossover Genetic Algorithms for Combinatorial Optimisation Problems by Nazif, Habibeh

    Published 2010
    “…A Genetic Algorithm is successful in generating near -optimal solutions if it is able to produce o®spring during crossover that is better than the parent solutions. …”
    Get full text
    Get full text
    Thesis
    Save to List
    Saved in:
  8. 8
    A genetic algorithm to minimise the maximum lateness on a single machine family scheduling problem

    A genetic algorithm to minimise the maximum lateness on a single machine family scheduling problem by Lee, Lai Soon, Nazif, Habibeh

    Published 2009
    “…Various techniques are also introduced to further enhance the solution quality. The OCGA is compared with other well known local search method namely dynamic length tabu search, randomised steepest descent method, and other variants of genetic algorithms using extensive data sets collected from the literatures. …”
    Get full text
    Conference or Workshop Item
    Save to List
    Saved in:
  9. 9
    Optimization of drilling path using the bees algorithm

    Optimization of drilling path using the bees algorithm by Kamaruddin, Shafie, Rosdi, Mohamad Naqiuddin, Sukindar, Nor Aiman

    Published 2021
    Get full text
    Get full text
    Get full text
    Article
    Save to List
    Saved in:
  10. 10
    Genetic algorithms for single machine family scheduling problems with maximum lateness and completion time

    Genetic algorithms for single machine family scheduling problems with maximum lateness and completion time by Lee, Lai Soon, Habibeh, Nazif

    Published 2010
    Get full text
    Working Paper
    Save to List
    Saved in:
  11. 11
    Optimization of multi-holes drilling path using particle swarm optimization

    Optimization of multi-holes drilling path using particle swarm optimization by Najwa Wahida, Zainal Abidin

    Published 2022
    “…Then, a validation experiment was conducted by implementing the PSO generated tool path against the commercial CAD-CAM path. In this stage, the machining time was measured. The results from the computational experiment indicated that the proposed PSO algorithm came out with the best solution in 10 out of the 15 test problems. …”
    Get full text
    Get full text
    Thesis
    Save to List
    Saved in:
  12. 12
    Interacted Multiple Ant Colonies for Search Stagnation Problem

    Interacted Multiple Ant Colonies for Search Stagnation Problem by Aljanabi, Alaa Ismael

    Published 2010
    “…Ant Colony Optimization (ACO) is a successful application of swarm intelligence. ACO algorithms generate a good solution at the early stages of the algorithm execution but unfortunately let all ants speedily converge to an unimproved solution. …”
    Get full text
    Get full text
    Get full text
    Thesis
    Save to List
    Saved in:
  13. 13
    Hybrid flow shop scheduling with energy consumption in machine shop using moth flame optimization

    Hybrid flow shop scheduling with energy consumption in machine shop using moth flame optimization by M. F. F., Ab Rashid, Ahmad Nasser, Mohd Rose, N. M. Zuki, N. M.

    Published 2022
    “…The objectives were to optimize makespan and total energy consumption in the machine schedule. …”
    Get full text
    Get full text
    Get full text
    Get full text
    Conference or Workshop Item
    Save to List
    Saved in:
  14. 14
    Development of Machine Learning Algorithm for Acquiring Machining Data in Turning Process

    Development of Machine Learning Algorithm for Acquiring Machining Data in Turning Process by Ali Al-Assadi, Hayder M. A.

    Published 2004
    “…Artificial Neural Network (ANN) was selected from Machine Learning Algorithms to be the learning algorithm. …”
    Get full text
    Get full text
    Thesis
    Save to List
    Saved in:
  15. 15
    Simulated Kalman Filter algorithms for solving optimization problems

    Simulated Kalman Filter algorithms for solving optimization problems by Nor Hidayati, Abdul Aziz

    Published 2019
    “…The proposed population-based SKF algorithm and the single solution-based SKF algorithm use the scalar model of discrete Kalman filter algorithm as the search strategy to overcome these flaws. …”
    Get full text
    Get full text
    Thesis
    Save to List
    Saved in:
  16. 16
    The solution of 2048 puzzle game using A* algorithm / Zafhira Ismail

    The solution of 2048 puzzle game using A* algorithm / Zafhira Ismail by Ismail, Zafhira

    Published 2017
    Get full text
    Get full text
    Thesis
    Save to List
    Saved in:
  17. 17
    A branch and bound and simulated annealing approach for job shop scheduling

    A branch and bound and simulated annealing approach for job shop scheduling by Tan, Hui Woon, Salim, Sutinah

    Published 2004
    “…The objective is to schedule the jobs on the machines so that the total completion time is minimized. …”
    Get full text
    Get full text
    Article
    Save to List
    Saved in:
  18. 18
    Effect of adopting different dispatching rules on the mean flow time in a two machine batch-shop problem

    Effect of adopting different dispatching rules on the mean flow time in a two machine batch-shop problem by Abdelraheem Elhaj, Hazir Farouk

    Published 2005
    “…Ali Allahverdi, 1998 obtained the optimal solutions for minimizing mean flow time in a two-machine flow shop with Sequence-independent set up times by using three heuristic algorithms. …”
    Get full text
    Get full text
    Get full text
    Thesis
    Save to List
    Saved in:
  19. 19
    Obstacle Avoidance by Steering and Braking with Minimum Total Vehicle Force

    Obstacle Avoidance by Steering and Braking with Minimum Total Vehicle Force by Phuman Singh, Amrik Singh, Nishihara, Osamu

    Published 2016
    Get full text
    Get full text
    Get full text
    Get full text
    Conference or Workshop Item
    Save to List
    Saved in:
  20. 20
    A new framework for multi-partition finite state machine low power design based on genetic algorithm

    A new framework for multi-partition finite state machine low power design based on genetic algorithm by Masoumidezfouli, Seyedhossein

    Published 2018
    “…Many researchers use a variety of algorithms to optimize a solution. Among these methods is the genetic algorithm (GA)-based optimization, that technique shows a high performance to reduce FSM power consumption. …”
    Get full text
    Get full text
    Thesis
    Save to List
    Saved in:

Search Tools: