Search Results - (( evolution optimization path algorithm ) OR ( problem representation path algorithm ))

Refine Results
  1. 1

    Hybrid genetic algorithm with multi-parents recombination for job shop scheduling problems / Ong Chung Sin by Ong, Chung Sin

    Published 2013
    “…Job Shop Scheduling Problem (JSSP) is one of the well-known hard combinatorial scheduling problems and one of the most computationally difficult combinatorial optimization problems considered to date. …”
    Get full text
    Get full text
    Get full text
    Thesis
  2. 2

    The Development Of A Robust Algorithm For Uav Path Planning In 3d Environment by Kok, Kai Yit

    Published 2016
    “…Significant research has been conducted on Unmanned Aerial Vehicle (UAV) path planning using evolutionary algorithms, such as Particle Swarm Optimization (PSO), Genetic Algorithm (GA), Differential Evolution (DE), and Biogeographic-Based Optimization (BBO). …”
    Get full text
    Get full text
    Thesis
  3. 3

    Development of an improved GWO algorithm for solving optimal paths in complex vertical farms with multi-robot multi-tasking by Shen, Jiazheng, Hong, Tang Sai, Fan, Luxin, Zhao, Ruixin, Mohd Ariffin, Mohd Khairol Anuar, As’arry, Azizan

    Published 2024
    “…The EPDE-GWO algorithm is compared with Genetic Algorithm (GA), Simulated Annealing (SA), Dung Beetle Optimizer (DBO), and Particle Swarm Optimization (PSO). …”
    Get full text
    Get full text
    Get full text
    Article
  4. 4

    Mobile robot path planning using hybrid genetic algorithm and traversability vectors method by Loo, C.K., Rajeswari, M., Wong, E.K., RaoTask, M.V.C.

    Published 2004
    “…Recent advances in robotics and machine intelligence have led to the application of modern optimization method such as the genetic algorithm (GA), to solve the path-planning problem. …”
    Get full text
    Get full text
    Get full text
    Article
  5. 5
  6. 6

    Finding minimum path by using Genetic Algorithm (GA)/ Siti Zuraifah Hashim by Hashim, Siti Zuraifah

    Published 2007
    “…Roadways and telephone systems are the examples of them. Genetic Algorithms (GA), pioneered by John Holland, applies the principle of evolution found in nature to the problem of finding an optimal solution. …”
    Get full text
    Get full text
    Thesis
  7. 7

    Optimization Of Two-Dimensional Dual Beam Scanning System Using Genetic Algorithms by Koh, Johnny Siaw Paw

    Published 2008
    “…This thesis presents a new approach to optimize the performance of a dual beam optical scanning system in terms of its scanning combinations and speed, using Genetic Algorithm (GA). The problem has been decomposed into two sub problems; task segregation, where the scanning tasks need to be segregated and assigned for each scanner head, and path planning where the best combinatorial paths for each scanner are determined in order to minimize the total motion of scanning time. …”
    Get full text
    Get full text
    Thesis
  8. 8
  9. 9

    Differential evolution optimization for constrained routing in Wireless Mesh Networks by Sanni, Mistura Laide, Hassan Abdalla Hashim, Aisha, Hassan, Wan Haslina, Ahmed, Gharib Subhi Mahmoud, Anwar, Farhat, Zakaria, Omar

    Published 2014
    “…This solution addresses efficient and optimal routing path construction for cost and quality metrics of the application. …”
    Get full text
    Get full text
    Get full text
    Proceeding Paper
  10. 10

    Path planning algorithm for a car like robot based on Coronoi Diagram Method by Inun, Haidie

    Published 2013
    “…The algorithm is based on Voronoi diagram method for the environment representation combined with Dijkstra’s algorithm to find the shortest path. …”
    Get full text
    Get full text
    Get full text
    Get full text
    Thesis
  11. 11

    Whale Optimisation Freeman Chain Code (WO-FCC) extraction algorithm for handwritten character recognition by Muhammad Arif, Mohamad, Jamaludin, Sallim, Kohbalan, Moorthy

    Published 2021
    “…Freeman chaincode (FCC) is utilised as a data representations of handwritten text images. Nevertheless, the representations of FCC depends on the length of the path and the branching of the character’s nodes. …”
    Get full text
    Get full text
    Get full text
    Conference or Workshop Item
  12. 12

    Path optimization using genetic algorithm in laser scanning system by Chen, Chai Phing, Koh, Johnny Siaw Paw, Aris, Ishak, Fong, Albert Yu Chooi, Tiong, Sieh Kiong

    Published 2008
    “…The GA would base on the real-number representation, namely Real-Coded Genetic Algorithm (RCGA). …”
    Get full text
    Get full text
    Conference or Workshop Item
  13. 13

    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
    “…The integrated algorithms use two genetic representations for the individual solution entire sub-chromosomes. …”
    Get full text
    Get full text
    Thesis
  14. 14

    Vehicle routing problem using genetic algorithm / Shamini Nagaratnam by Shamini , Nagaratnam

    Published 2006
    “…This dissertation studies and explores the potential of using Genetic Algorithms to find the shortest path in Vehicle Routing Problem. …”
    Get full text
    Get full text
    Get full text
    Thesis
  15. 15

    Literature Review of Optimization Techniques for Chatter Suppression In Machining by A. R., Yusoff, Mohamed Reza Zalani, Mohamed Suffian, Mohd Yusof, Taib

    Published 2011
    “…Various algorithms can be applied in the optimization of machining problems; however, Differential Evolution is the most appropriate for use in chatter suppression, being less time consuming, locally optimal, and more robust than both Genetic Algorithms, despite their wide applications, and Sequential Quadratic Programming, which is a famous conventional algorithm.…”
    Get full text
    Get full text
    Get full text
    Article
  16. 16

    Problem Solving by Yahaya, Azizi

    Published 2010
    “…There key steps of problem solving are problem identification, problem definition and representation, strategy construction, organization of information, allocation of resources, monitoring, and evaluation. …”
    Get full text
    Get full text
    Article
  17. 17
  18. 18

    Comparative analysis of spiral dynamic algorithm and artificial bee colony optimization for position control of flexible link manipulators by Nor Maniha, Abdul Ghani, Nizaruddin, M. Nasir, Azrul Azim, Abdullah Hashim

    Published 2024
    “…By integrating the ABC algorithm into the manipulator's control system, the goal is to enhance its ability to plan paths and optimize trajectories. …”
    Get full text
    Get full text
    Get full text
    Article
  19. 19

    Design, development and performance optimization of a new artificial intelligent controlled multiple-beam optical scanning module by Koh, Johnny Siaw Paw, Aris, Ishak, Ramachandaramurthy, Vigna Kumaran, Bashi, Sinan Mahmod, Marhaban, Mohammad Hamiruce

    Published 2006
    “…This research presents a new approach to optimise the performance of a multiple-beam optical scanning system in terms of its marking combinations and speed, using Genetic Algorithm (GA). The problem has been decomposed into two sub problems; task segregation, where the marking tasks need to be segregated and assigned for each scanner head and path planning where the best combinatorial paths for each scanner are determined in order to minimise the total motion of marking time. …”
    Get full text
    Get full text
    Get full text
    Article
  20. 20

    Design, development and performance optimization of a new artificial intelligent controlled multiple-beam optical scanning module by Koh J.S.P., Aris I.B., Ramachandaramurthy V.K., Bashi S.M., Marhaban M.H.

    Published 2023
    “…This research presents a new approach to optimise the performance of a multiple-beam optical scanning system in terms of its marking combinations and speed, using Genetic Algorithm (GA). The problem has been decomposed into two sub problems; task segregation, where the marking tasks need to be segregated and assigned for each scanner head and path planning where the best combinatorial paths for each scanner are determined in order to minimise the total motion of marking time. …”
    Article