Search Results - (( based solving method algorithm ) OR ( sequence optimization method algorithm ))

Refine Results
  1. 1
  2. 2

    An assembly sequence planning approach with a rule-based multi-state gravitational search algorithm by Ibrahim, I., Ibrahim, Z., Ahmad, Hamzah, Jusof, M.F.M., Yusof, Z.M., Nawawi, S.W., Mubin, M.

    Published 2015
    “…In this paper, an approach based on a new variant of the gravitational search algorithm (GSA) called the rule-based multi-state gravitational search algorithm (RBMSGSA) is used to solve the assembly sequence planning problem. …”
    Get full text
    Get full text
    Get full text
    Article
  3. 3

    An Assembly Sequence Planning Approach with a Rule-based Multi-state Gravitational Search Algorithm by Ismail, Ibrahim, Zuwairie, Ibrahim, Hamzah, Ahmad, Mohd Falfazli, Mat Jusof, Zulkifli, Md. Yusof, Sophan Wahyudi, Nawawi, Marizan, Mubin

    Published 2015
    “…In this paper, an approach based on a new variant of the gravitational search algorithm (GSA) called the rule-based multi-state gravitational search algorithm (RBMSGSA) is used to solve the assembly sequence planning problem. …”
    Get full text
    Get full text
    Get full text
    Article
  4. 4
  5. 5

    Development of cell formation algorithm and model for cellular manufacturing system by Nouri, Hossein

    Published 2011
    “…In addition, one of the main challenges has been development of efficient algorithm for solving aforementioned model to find exact feasible optimal solution. …”
    Get full text
    Get full text
    Thesis
  6. 6

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

    Computational Technique for an Efficient Classification of Protein Sequences With Distance-Based Sequence Encoding Algorithm by Iqbal, M.J., Faye, I., Said, A.M.D., Samir, B.B.

    Published 2017
    “…In this article, we have proposed a distance-based sequence encoding algorithm that captures the sequence's statistical characteristics along with amino acids sequence order information. …”
    Get full text
    Get full text
    Article
  8. 8
  9. 9
  10. 10

    Particle swarm optimization with partial search to solve traveling salesman problem by Akhand, M.A.H., Akter, Shahina, Rahman, S. Sazzadur, Rahman, M.M. Hafizur

    Published 2012
    “…PSO has found as an efficient method for solving function optimization problems, and recently it also studied to solve combinatorial problems such as Traveling Salesman Problem (TSP). …”
    Get full text
    Get full text
    Proceeding Paper
  11. 11

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

    Published 2009
    “…The transformation results in an equivalent mixed discrete optimization problem. The transformed problemis then decomposed into a bi-level optimization problem, which is solved using a combination of an efficient discrete filled function method identified earlier and a computational optimal control technique based on the concept of control parameterization. …”
    Get full text
    Get full text
    Get full text
    Thesis
  12. 12

    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
    “…In this study, particle swarm optimization (PSO) and population-based ant colony optimization (P-ACO) are employed to design DNA sequences with different lengths and the results obtained are compared. …”
    Get full text
    Get full text
    Get full text
    Conference or Workshop Item
  13. 13
  14. 14
  15. 15

    Velocity tentative PSO: An optimal velocity implementation based particle swarm optimization to solve traveling salesman problem by M. A. H., Akhand, Shahina, Akter, M. A., Rashid

    Published 2015
    “…This paper introduces an effective Particle Swarm Optimization (PSO) based algorithm for solving Traveling Salesman Problem (TSP). …”
    Get full text
    Get full text
    Article
  16. 16

    Vector evaluated particle swarm optimization approach to solve assembly sequence planning problem by A. Mukred, Jameel A., A. Rahim, Ruzairi, Mohamad, Elmy Johana, Salh, Adeeb, Ashyap, Adel Y. I., Abdullah, Qazwan, AL-Fadhali, Najib, Al-Ameri, S., Al-Ashwal, Rania

    Published 2022
    “…Meta-heuristic method is able to escape the local optima. Simulated Annealing (SA) is used where search is done in sequence basis and to solve optimization problems. …”
    Get full text
    Get full text
    Article
  17. 17

    Global and local convergence of a filter line search method for nonlinear programming. by Chin, Choong Ming, Abdul Rashid, Abdul Halim, Nor, Khaled Mohamed

    Published 2007
    “…The proposed methods solve a sequence of quadratic programming subproblems via line search techniques to induce global convergence. …”
    Get full text
    Get full text
    Article
  18. 18

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

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

    Published 2013
    “…The problem was initially tackled by “exact methods” such as the branch and bound method, which is based on the exhaustive enumeration of a restricted region of solutions containing exact optimal solutions. …”
    Get full text
    Get full text
    Get full text
    Thesis
  20. 20

    Technical report: genetic algorithm for solving capacitated vehicle routing problem / Mohd Faris Mohd Zaki and Muhammad Ammar Zulqornain Abdul Rashid by Mohd Zaki, Mohd Faris, Abdul Rashid, Muhammad Ammar Zulqornain

    Published 2017
    “…Since it is difficult to solve this problem directly, we used Genetic Al­gorithm for Capacitated Vehicle Routing Problem (CVRP) as to get the optimized route with minimum distance travel without exceeding capacity constraint. …”
    Get full text
    Get full text
    Student Project