Search Results - (( using evolutionary path algorithm ) OR ( sequence optimisation based algorithm ))

Refine Results
  1. 1
  2. 2

    Optimisation of energy efficient Assembly Sequence Planning using Moth-Flame Optimisation alghorithm by Muhammad Arif, Abdullah

    Published 2019
    “…For optimisation purpose, this research proposed a relatively new algorithm called the Moth-Flame Optimisation (MFO). …”
    Get full text
    Get full text
    Thesis
  3. 3

    Intergrated multi-objective optimisation of assembly sequence planning and assembly line balancing using particle swarm optimisation by M. F. F., Ab Rashid

    Published 2013
    “…The aim of this research is to establish a methodology and algorithm for integrating ASP and ALB optimisation using Particle Swarm Optimisation. …”
    Get full text
    Get full text
    Thesis
  4. 4

    An elitist-flower pollination-based strategy for constructing sequence and sequence-less t-way test suite by Abdullah, Nasser, Kamal Z., Zamli, Alsewari, Abdulrahman A., Ahmed, Bestoun S.

    Published 2018
    “…If t-way strategies are to be adopted in such a system, there is also a need to support test data generation based on sequence of interactions. In line with such a need, this paper presents a unified strategy based on the new meta-heuristic algorithm, called the elitist flower pollination algorithm (eFPA), for sequence and sequence-less coverage. …”
    Get full text
    Get full text
    Get full text
    Article
  5. 5

    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
  6. 6
  7. 7

    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
    “…In literature, ACS has been employed to solve DNA sequence design problem. The DNA sequence design problem was modelled based on a finite state machine in which the nodes represent the DNA bases {A, C, T, G}. …”
    Get full text
    Get full text
    Get full text
    Article
  8. 8
  9. 9

    An improved particle swarm optimization algorithm for data classification by Waqas Haider Bangyal, Kashif Nisar, Tariq Rahim Soomro, Ag Asri Ag Ibrahim, Ghulam Ali Mallah, Nafees Ul Hassan, Najeeb Ur Rehman

    Published 2023
    “…Particle Swarm Optimization (PSO) is a metaheuristic algorithm based on swarm intelligence, widely used to solve global optimisation problems throughout the real world. …”
    Get full text
    Get full text
    Get full text
    Article
  10. 10
  11. 11

    Linear-PSO with binary search algorithm for DNA Motif Discovery / Hazaruddin Harun by Harun, Hazaruddin

    Published 2015
    “…Particle Swarm Optimisation (PSO) was selected as the base algorithm that needs improvement and integration with other techniques. …”
    Get full text
    Get full text
    Book Section
  12. 12
  13. 13

    Meta-heuristic approaches for reservoir optimisation operation and investigation of climate change impact at Klang gate dam by Lai, Vivien Mei Yen

    Published 2023
    “…Consequently, seeking managing of reservoir optimisation operations had always been at the forefront and to improve managing, algorithms have had been presented over the past few decades, beginning with conventional algorithms, followed by heuristic algorithms, and finally, the meta-heuristic algorithms (MHAs). …”
    Get full text
    Get full text
    Final Year Project / Dissertation / Thesis
  14. 14
  15. 15

    Linear-pso with binary search algorithm for DNA motif discovery / Hazaruddin Harun by Harun, Hazaruddin

    Published 2015
    “…Particle Swarm Optimisation (PSG) was selected as the base algorithm that needs improvement and integration with other techniques. …”
    Get full text
    Get full text
    Thesis
  16. 16
  17. 17

    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
  18. 18
  19. 19

    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
  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