Search Results - (( based constructive path algorithm ) OR ( evolution optimisation based algorithm ))

Refine Results
  1. 1
  2. 2

    Performance evaluation and benchmarking of an extended computational model of ant colony system for DNA sequence design by Zuwairie, Ibrahim, Mohd Falfazli, Mat Jusof, Mohd Zaidi, Mohd Tumari

    Published 2014
    “…Ant colony system (ACS) algorithm is one of the biologically inspired algorithms that have been introduced to effectively solve a variety of combinatorial optimisation problems. …”
    Get full text
    Get full text
    Get full text
    Article
  3. 3

    A hybrid sampling-based path planning algorithm for mobile robot navigation in unknown environments by Khaksar, Weria

    Published 2013
    “…The motion planning problem poses the question of how a robot can move from an initial to a final position. Sampling-based motion planning is a class of randomized path planning algorithms with proven completeness. …”
    Get full text
    Get full text
    Thesis
  4. 4

    A competitive co-evolutionary approach for the nurse scheduling problem by Mohamad Nazri, Maizatul Farhana, Mohd Yusoh, Zeratul Izzah, Basiron, Halizah, Daud, Azlina

    Published 2026
    “…The competitive approach further exhibits smoother convergence behaviour across generations, indicating stronger optimisation dynamics and improved robustness. These findings demonstrate that competitive co-evolution provides an effective and practical alternative to static fitness-based evolutionary methods for nurse scheduling, with broader applicability to healthcare scheduling and constraint optimisation problems.…”
    Get full text
    Get full text
    Get full text
    Article
  5. 5
  6. 6

    A generalized laser simulator algorithm for optimal path planning in constraints environment by Aisha, Muhammad

    Published 2022
    “…The suggested algorithm outperforms the competition in terms of improving path cost, smoothness, and search time. …”
    Get full text
    Thesis
  7. 7
  8. 8
  9. 9

    Test case generation from state machine with OCL constraints using search-based techniques / Aneesa Ali Ali Saeed by Aneesa Ali, Ali Saeed

    Published 2017
    “…A model-driven approach was used for generating abstract test cases from the feasible paths. This model driven approach was integrated with the proposed infeasible path detection method which based on analyzing various OCL constructs and operations. …”
    Get full text
    Get full text
    Get full text
    Thesis
  10. 10

    An application of Floyd-Warshall Algortihm in finding shortest path of order picker in warehouse / Saidatul Aisyah Roslan, Siti Norhakimah Mohd Yatim and Siti Sarah Sulaiman by Roslan, Saidatul Aisyah, Mohd Yatim, Siti Norhakimah, Sulaiman, Siti Sarah

    Published 2019
    “…The objectives of this study are to construct the distance matrix and sequence matrix based on the network layout and to find the shortest path to collect the item in the warehouse. …”
    Get full text
    Get full text
    Student Project
  11. 11

    AUTOMATED GUIDED ROBOT (AGR) by Abd Rahim, Mohd Azlan Shah

    Published 2007
    “…Algorithm conversion to C code programming has been done throughout the project for the obstacle avoidance and path planning algorithms based upon the GA platform ofAI.…”
    Get full text
    Get full text
    Final Year Project
  12. 12
  13. 13

    Multi agent quality of service routing based on scheme ant colony optimization algorithm by Baygi, Maassoumeh Javadi

    Published 2014
    “…The proposed scheme has been simulated by OMNET++ and compared with standard AntNet and two well-known standard QoS routings; Widest Shortest Path (WSP) algorithm and Shortest Widest Path (SWP) algorithm. …”
    Get full text
    Get full text
    Thesis
  14. 14

    A hyper-heuristic based strategy for image segmentation using multilevel thresholding by Luqman, Fakhrud Din, Shah Khalid, Kamal Zuhairi Zamli, Aftab Alam

    Published 2025
    “…EMCQ uses four low-level heuristic sets adopted from the teaching learning-based optimisation (TLBO) algorithm, flower pollination algorithm (FPA), genetic algorithm (GA), and Jaya algorithm. …”
    Get full text
    Get full text
    Get full text
    Article
  15. 15

    Optimal QoS aware multiple paths web service composition using heuristic algorithms and data mining techniques by Qtaish, Osama Kayed Taher

    Published 2014
    “…The aim is to solve the above-mentioned problems via an optimization mechanism based upon the combination between runtime path prediction method and heuristic algorithms. …”
    Get full text
    Get full text
    Get full text
    Get full text
    Thesis
  16. 16
  17. 17

    A hyper-heuristic based strategy for image segmentation using multilevel thresholding by Luqman, ., Fakhrud, Din, Shah, Khalid, Kamal Z., Zamli, Alam, Aftab

    Published 2025
    “…EMCQ uses four low-level heuristic sets adopted from the teaching learning-based optimisation (TLBO) algorithm, flower pollination algorithm (FPA), genetic algorithm (GA), and Jaya algorithm. …”
    Get full text
    Get full text
    Get full text
    Article
  18. 18

    Ant colony optimization (ACO) algorithm for CNC route problem by Wan Nur Farhanah , Wan Zakaria

    Published 2012
    “…The GUT will be display the shortest path that should be taken by user and give user authority to manipulate the coordinate based on the requirement.…”
    Get full text
    Get full text
    Undergraduates Project Papers
  19. 19

    Stock market turning points rule-based prediction / Lersak Photong … [et al.] by Photong, Lersak, Sukprasert, Anupong, Boonlua, Sutana, Ampant, Pravi

    Published 2021
    “…Finally, rule-based optimisation techniques such as Particle Swarm Optimization (PSO), Differential Evolution (DE) and Grey Wolf Optimizer (GWO) were used to minimise the amount of time employed in the stock market turning points prediction. …”
    Get full text
    Get full text
    Book Section
  20. 20

    Interference avoidance routing and scheduling using multiple transceivers for IEEE 802.16 mesh network by Qasem, Yaaqob Ali Ahmed

    Published 2010
    “…This algorithm looks for a short path from the subscriber station (SS) node to BS, while the optimal path is achieved when the whole path has the lowest EbMR. …”
    Get full text
    Get full text
    Thesis