Search Results - (( based constructive approach algorithm ) OR ( sequence optimization based algorithm ))

Refine Results
  1. 1

    Makespan algorithms and heuristic for internet-based collaborative manufacturing process using bottleneck approach by Bareduan, Sallehahmad, Hasan, Sulaiman

    Published 2010
    “…It was shown that using bottleneck-based analysis, effective makespan algorithms and constructive heuristic can be developed to solve for near-optimal scheduling sequence. …”
    Get full text
    Get full text
    Get full text
    Article
  2. 2

    Topology-aware hypergraph based approach to optimize scheduling of parallel applications onto distributed parallel architectures by Koohi, Sina Zangbari

    Published 2020
    “…For these reasons, to improve the time and accuracy of the coverage in population-based meta-heuristics and their utilization in HPAs, this thesis presents a novel optimization algorithm called the Raccoon Optimization Algorithm (ROA). …”
    Get full text
    Get full text
    Thesis
  3. 3

    Ant system with heuristics for capacitated vehicle routing problem by Tan, Wen Fang

    Published 2013
    “…The ASH algorithm is basically applied with its probabilistic decision rule and pheromone feedback to construct the sequences of customers to be visited in the CVRP solution. …”
    Get full text
    Get full text
    Thesis
  4. 4

    Methodology to develop heuristic for re-entrant flow shop with two potential dominant machines using bottleneck approach by Bareduan, Salleh Ahmad, Hasan, Sulaiman

    Published 2012
    “…Using these correction factors, a constructive heuristic was developed to solve for near-optimal scheduling sequence. …”
    Get full text
    Get full text
    Article
  5. 5

    Hybrid optimal path traceback system development for optimization DNA sequences alignment by Ahmad Sabri, Nur Dalilah

    Published 2012
    “…In theoretical design, the proved of concept for the proposed design is calculated based on mathematical equation which defined by Smith-Waterman algorithm. …”
    Get full text
    Get full text
    Student Project
  6. 6

    Hybrid optimal path traceback system development for optimizing DNA sequences alignment: article by Ahmad Sabri, Nur Dalilah

    Published 2012
    “…In theoretical design, the proved of concept for the proposed design is calculated based on mathematical equation which defined by Smith-Waterman algorithm. …”
    Get full text
    Get full text
    Article
  7. 7

    Computational methods for self-assembly of DNA nanostructures / Ong Hui San by Ong, Hui San

    Published 2016
    “…Several approaches have been adopted including development of an autonomous tool that incorporated evolutionary optimization algorithm in constructing these heterogeneous DNA shapes and the application of heuristic through undirected graph theory as an annotation schema to produce the connectivity maps. …”
    Get full text
    Get full text
    Thesis
  8. 8

    Global Algorithms for Nonlinear Discrete Optimization and Discrete-Valued Optimal Control Problems by Woon, Siew Fang

    Published 2009
    “…Due to the high complexity of these problems, metaheuristic based global optimization techniques are usually required. …”
    Get full text
    Get full text
    Get full text
    Thesis
  9. 9

    An enhanced swap sequence-based particle swarm optimization algorithm to solve TSP by Bibi Aamirah Shafaa Emambocus, Muhammed Basheer Jasser, Muzaffar Hamzah, Aida Mustapha, Angela Amphawan

    Published 2021
    “…To improve the performance of the swap sequence based PSO, this paper introduces an Enhanced Swap Sequence based PSO (Enhanced SSPSO) algorithm by integrating the strategies of the Expanded PSO (XPSO) in the swap sequence based PSO. …”
    Get full text
    Get full text
    Get full text
    Get full text
    Get full text
    Article
  10. 10

    Multiple and solid data background scheme for testing static single cell faults on SRAM memories by Zakaria, Nor Azura

    Published 2013
    “…Therefore, the purpose of this thesis is to introduce a Data Background (DB) scheme to generate an optimal March Test Algorithm (MTA) for detecting faults of memory that are undetectable using existing algorithms. …”
    Get full text
    Get full text
    Thesis
  11. 11
  12. 12

    Product assembly and disassembly sequence optimization based on genetic algorithm and design for assembly methodologies by Yasin, Azman, Puteh, Nurnasran, Daud, Ruslizam

    Published 2009
    “…In this paper, an Artificial Intelligence (AI) technique, namely Genetic Algorithm (GA) is proposed to optimize product components assembly and disassembly sequences.The proposed methodology is developed and tested on an industrial product made of plastics with no integrated assembly and permanent joint parts.GA method is applied to determine the accuracy and optimum results based on 20 assembly and disassembly sequence solutions that was generated by the Design for Assembly methodology.The results indicated that GA based approach is able to obtain a near optimal solution for assembly and disassembly sequences.…”
    Get full text
    Get full text
    Get full text
    Conference or Workshop Item
  13. 13

    A filtering algorithm for efficient retrieving of DNA sequence by Abdul Rahman, Mohd Nordin, Mohd. Saman, Md. Yazid, Ahmad, Aziz, Md. Tap, Abu Osman

    Published 2009
    “…The algorithm filtered the expected irrelevant DNA sequences in database from being computed for dynamic programming based optimal alignment process. …”
    Get full text
    Get full text
    Get full text
    Article
  14. 14

    Product assembly sequence optimization based on genetic algorithm by Yasin, Azman, Puteh, Nurnasran, Daud, Ruslizam, Omar, Mazni, Syed-Abdullah, Sharifah Lailee

    Published 2010
    “…Genetic algorithm (GA) is a search technique used in computing to find approximate solution to optimization and search problem based on the theory of natural selection. …”
    Get full text
    Get full text
    Get full text
    Article
  15. 15

    Efficient Entropy-Based Decoding Algorithms For Higher-Order Hidden Markov Model by Chan, Chin Tiong

    Published 2019
    “…The required memory of this algorithm is also time independent. In addition, the optimal state sequence obtained by the EVRA algorithm is the same as that obtained by the classical Viterbi algorithm for HHMM.…”
    Get full text
    Get full text
    Thesis
  16. 16

    Graphical user interface test case generation for android apps using Q-learning / Husam N. S. Yasin by Husam , N. S. Yasin

    Published 2021
    “…The computation time complexity of the Q-Learning-based test coverage algorithm was also analyzed. …”
    Get full text
    Get full text
    Get full text
    Thesis
  17. 17

    Sequence t-way test generation using the barnacles mating optimizer algorithm by Kamal Z., Zamli, Kader, Md. Abdul

    Published 2021
    “…More precisely, we focus on the generation of test cases due to the ordering of inputs (or sequence) using the newly developed Barnacles Mating Optimizer (BMO) Algorithm. …”
    Get full text
    Get full text
    Get full text
    Get full text
    Conference or Workshop Item
  18. 18

    Sequence and sequence-less t-way test suite generation strategy based on the elitist flower pollination algorithm by Mohammed Abdullah, Abdullah Nasser

    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. Addressing these aforementioned issues and complementing the existing sequence based strategies such as t-SEQ, Sequence Covering Array Generator and Bee Algorithm, this thesis presents a unified strategy based on the new meta-heuristic algorithm, called the Elitist Flower Pollination Algorithm (eFPA). …”
    Get full text
    Get full text
    Thesis
  19. 19

    An Assembly Sequence Planning Approach with a Multi-State Particle Swarm Optimization by Ismail, Ibrahim, Zuwairie, Ibrahim, Hamzah, Ahmad, Zulkifli, Md. Yusof

    Published 2016
    “…In this paper, an approach based on a new variant of Particle Swarm Optimization Algorithm (PSO) called the multi-state of Particle Swarm Optimization (MSPSO) is used to solve the assembly sequence planning problem. …”
    Get full text
    Get full text
    Get full text
    Book Chapter
  20. 20

    MINIMIZATION OF MACHINING PROCESS SEQUENCE BASED ON ANT COLONY ALGORITHM AND CONVENTIONAL METHOD by ABDULLAH, H., LAW BOON HUI, C., ZAKARIA, M. S.

    Published 2023
    “…Matlab software was used to develop the algorithm based on Ant Colony, which was then used to optimize the process sequence. …”
    Get full text
    Get full text
    Article