Search Results - (( using set path algorithm ) OR ( sequence optimization based algorithm ))

Search alternatives:

Refine Results
  1. 1
    An enhanced swap sequence-based particle swarm optimization algorithm to solve TSP

    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
    “…The proposed algorithm is found to provide better solutions with shorter paths when applied to TSP as compared to swap sequence based PSO. …”
    Get full text
    Get full text
    Get full text
    Get full text
    Get full text
    Article
    Save to List
    Saved in:
  2. 2
    Simulated kalman filter with modified measurement, substitution mutation and hamming distance calculation for solving traveling salesman problem

    Simulated kalman filter with modified measurement, substitution mutation and hamming distance calculation for solving traveling salesman problem by Suhazri Amrin, Rahmad, Zuwairie, Ibrahim, Zulkifli, Md. Yusof

    Published 2022
    “…Purpose – The purpose of the research is to solve Travelling Salesman Problem (TSP) using Simulated Kalman Filter (SKF) algorithm and single-solution SKF (ssSKF) algorithm based on numerical ordering technique. …”
    Get full text
    Get full text
    Get full text
    Get full text
    Conference or Workshop Item
    Save to List
    Saved in:
  3. 3
    DNA sequence design for direct-proportional length-based DNA computing: Particle swarm optimization vs population based ant colony optimization

    DNA sequence design for direct-proportional length-based DNA computing: Particle swarm optimization vs population based ant colony optimization by Zulkifli, Md. Yusof, Muhammad Arif, Abdul Rahim, Sophan Wahyudi, Nawawi, Kamal, Khalil, Zuwairie, Ibrahim

    Published 2012
    “…It can be concluded that the P-ACO algorithm can obtain relatively a better set of DNA sequences for DNA computing with length constraints.…”
    Get full text
    Get full text
    Get full text
    Conference or Workshop Item
    Save to List
    Saved in:
  4. 4
    Time series data intelligent clustering algorithm for landslide displacement prediction

    Time series data intelligent clustering algorithm for landslide displacement prediction by Han, Liu, Shang, Tao, Shu, Jisen, Khan Chowdhury, Ahmed Jalal

    Published 2018
    “…Clustering calculation of time series data set is carried out by using hierarchical clustering algorithm according to bending path. …”
    Get full text
    Get full text
    Get full text
    Get full text
    Get full text
    Article
    Save to List
    Saved in:
  5. 5
    Artificial Bee Colony for Minimizing the Energy Consumption in Mobile Ad Hoc Network

    Artificial Bee Colony for Minimizing the Energy Consumption in Mobile Ad Hoc Network by Tareq, M., Abed, S.A., Sundararajan, E.A.

    Published 2019
    “…This type of network consists of sets of mobile nodes that do not require a fixed infrastructure such as an access point or base station. …”
    Get full text
    Get full text
    Article
    Save to List
    Saved in:
  6. 6
    Hybrid genetic algorithm with multi-parents recombination for job shop scheduling problems / Ong Chung Sin

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

    Published 2013
    “…This mechanism is restricted to search the possible solutions in a critical path. Modification on the path by using neighborhood search significantly reduces the total length of the makespan. …”
    Get full text
    Get full text
    Get full text
    Thesis
    Save to List
    Saved in:
  7. 7
    Comparison of DSR, AODV and DSDV routing protocols in mobile ad-hoc networks: A survey

    Comparison of DSR, AODV and DSDV routing protocols in mobile ad-hoc networks: A survey by Abdala, Tarek Mosbah, Dasalla, Valeriano A., Daud, Nasarudin

    Published 2014
    “…A mobile ad hoc network (MANET) is a collection of mobile nodes that is connected through a wireless medium forming rapidly changing topologies.Mantes are infrastructure less and can be set up anytime, anywhere.We have conducted survey of protocol properties of various MANET routing algorithms and analyzed them.The routing algorithms considered are classified into three categories proactive (table driven) , reactive (on demand) and Hybrid protocol.The algorithms considered are Dynamic Source Routing (DSR), Ad-hoc On-Demand Distance Vector Routing (AODV) and Destination sequence Vector (DSDV) have been proposed to solve the multi hop routing problem in Ad-hoc networks.The comparison among three routing protocols are based on the various protocol property parameters such as Routing overhead, packet delivery ratio, end-to-end delay, path optimality, and throughput are some metrics commonly used in the comparisons.…”
    Get full text
    Get full text
    Get full text
    Conference or Workshop Item
    Save to List
    Saved in:
  8. 8
    Comparative Analysis of Low Discrepancy Sequence-Based Initialization Approaches Using Population-Based Algorithms for Solving the Global Optimization Problems

    Comparative Analysis of Low Discrepancy Sequence-Based Initialization Approaches Using Population-Based Algorithms for Solving the Global Optimization Problems by Waqas Haider Bangyal, Kashif Nisar, Ag. Asri Bin Ag. Ibrahim, Muhammad Reazul Haque, Joel J. P. C. Rodrigues, Danda B. Rawat

    Published 2021
    “…These algorithms can influence the convergence to find an efficient optimal solution. …”
    Get full text
    Get full text
    Get full text
    Get full text
    Get full text
    Article
    Save to List
    Saved in:
  9. 9
    Product assembly and disassembly sequence optimization based on genetic algorithm and design for assembly methodologies

    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
    Save to List
    Saved in:
  10. 10
    A filtering algorithm for efficient retrieving of DNA sequence

    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
    Save to List
    Saved in:
  11. 11
    Product assembly sequence optimization based on genetic algorithm

    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
    Save to List
    Saved in:
  12. 12
    Efficient Entropy-Based Decoding Algorithms For Higher-Order Hidden Markov Model

    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
    Save to List
    Saved in:
  13. 13
    Sequence t-way test generation using the barnacles mating optimizer algorithm

    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
    Save to List
    Saved in:
  14. 14
    Sequence and sequence-less t-way test suite generation strategy based on the elitist flower pollination algorithm

    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
    Save to List
    Saved in:
  15. 15
    An Assembly Sequence Planning Approach with a Multi-State Particle Swarm Optimization

    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
    Save to List
    Saved in:
  16. 16
    MINIMIZATION OF MACHINING PROCESS SEQUENCE BASED ON ANT COLONY ALGORITHM AND CONVENTIONAL METHOD

    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
    Save to List
    Saved in:
  17. 17
    MINIMIZATION OF MACHINING PROCESS SEQUENCE BASED ON ANT COLONY ALGORITHM AND CONVENTIONAL METHOD

    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
    Save to List
    Saved in:
  18. 18
    MINIMIZATION OF MACHINING PROCESS SEQUENCE BASED ON ANT COLONY ALGORITHM AND CONVENTIONAL METHOD

    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
    Save to List
    Saved in:
  19. 19
    MINIMIZATION OF MACHINING PROCESS SEQUENCE BASED ON ANT COLONY ALGORITHM AND CONVENTIONAL METHOD

    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
    Save to List
    Saved in:
  20. 20
    BASE: a bacteria foraging algorithm for cell formation with sequence data

    BASE: a bacteria foraging algorithm for cell formation with sequence data by Nouri, Hossein, Tang, Sai Hong, Baharudin, B. T. Hang Tuah, Mohd Ariffin, Mohd Khairol Anuar

    Published 2010
    “…In addition, a newly developed BFA-based optimization algorithm for CF based on operation sequences is discussed. …”
    Get full text
    Get full text
    Get full text
    Article
    Save to List
    Saved in:

Search Tools: