Search Results - (( process problem based algorithm ) OR ( java application reoptimize algorithm ))

Refine Results
  1. 1

    Development of Simulated Annealing Based Scheduling Algorithm for Two Machines Flow Shop Problem by M., Muziana, Kamal Z., Zamli

    Published 2015
    “…Viewing as optimization problem and focusing on two machines, this research aims to develop a new Simulated Annealing based scheduling algorithm, called SA2M, for flow shop problem. …”
    Get full text
    Get full text
    Get full text
    Conference or Workshop Item
  2. 2

    Enhanced gravitational search algorithm for nano-process parameter optimization problem / Norlina Mohd Sabri by Mohd Sabri, Norlina

    Published 2020
    “…Based on the capabilities of the metaheuristic algorithms, this research is proposing the enhanced Gravitational Search Algorithm (eGSA) to solve the nano-process parameter optimization problem. …”
    Get full text
    Get full text
    Thesis
  3. 3

    A hybrid kidney algorithm strategy for combinatorial interaction testing problem by Ameen Ali, Mohammed Ba Homaid

    Published 2022
    “…In addition, the hybrid metaheuristic-based CIT strategies require more execution time than their own original algorithm-based strategies. …”
    Get full text
    Get full text
    Thesis
  4. 4

    Biogeography based optimization (BBO) algorithm to minimise non-productive time during hole-making process by Tamjidy, Mehran, Paslar, Shahla, Baharudin, B. T. Hang Tuah, Tang, Sai Hong, Mohd Ariffin, Mohd Khairol Anuar

    Published 2015
    “…This paper presents an evolutionary optimization algorithm based on geographic distribution of biological organism to deal with hole-making process problem. …”
    Get full text
    Get full text
    Get full text
    Article
  5. 5
  6. 6

    Enhanced Harris's Hawk algorithm for continuous multi-objective optimization problems by Yasear, Shaymah Akram

    Published 2020
    “…This indicates the capability of the algorithm in exploring the search space. The 2S-ENDSHHMO algorithm can be used to improve the search process of other MOSI-based algorithms and can be applied to solve MOPs in applications such as structural design and signal processing.…”
    Get full text
    Get full text
    Get full text
    Get full text
    Thesis
  7. 7

    Simulated Kalman Filter algorithms for solving optimization problems by Nor Hidayati, Abdul Aziz

    Published 2019
    “…Applications and improvements to the HKA algorithm suggest that optimization algorithm based on estimation principle has a huge potential in solving a wide variety of optimization problems. …”
    Get full text
    Get full text
    Thesis
  8. 8

    Process Sequencing Modeled as TSP with Precedence Constraints - A Genetic Algorithm Approach by N. M., Razali

    Published 2014
    “…The process sequencing problem can be modeled as the travelling salesman problem with precedence constraints (TSPPC). …”
    Get full text
    Get full text
    Get full text
    Article
  9. 9

    Multiple case-based retrieval for university course timetabling problem by Hong, Siaw Theng

    Published 2016
    “…The algorithm was running on timetabling tests, comparing to classic Case-based retrieval and Genetic Algorithm for a wider comparison. …”
    Get full text
    Get full text
    Thesis
  10. 10
  11. 11
  12. 12

    DEVELOPMENT OF A MULTI-OBJECTIVE OPTIMZATION FRAMEWORK FOR INDUSTRIAL PROCESSES by GANESAN, TIMOTHY

    Published 2014
    “…Thus, this work focuses on industrial MO problems encountered in process engineering with more than two objectives. …”
    Get full text
    Get full text
    Thesis
  13. 13
  14. 14

    Graph processing hardware accelerator for shortest path algorithms in nanometer very large-scale integration interconnect routing by Ch'ng, Heng Sun

    Published 2007
    “…This thesis proposes a graph processing hardware accelerator for shortest path algorithms applied in nanometer VLSI interconnect routing problems. …”
    Get full text
    Get full text
    Get full text
    Thesis
  15. 15

    An improved pheromone-based kohonen self-organising map in clustering and visualising balanced and imbalanced datasets by Azlin, Ahmad, Rubiyah, Yusof, Nor Saradatul Akmar, Zulkifli, Mohd Najib, Ismail

    Published 2021
    “…Therefore, this research proposed an improved pheromone- based PKSOM algorithm known as iPKSOM to solve the mentioned problem. …”
    Get full text
    Get full text
    Get full text
    Article
  16. 16

    Monkey Algorithm for Packing Circles with Binary Variables by Torres-Escobar, R., Marmolejo-Saucedo, J.A., Litvinchev, I., Vasant, P.

    Published 2019
    “…The algorithm consists of five main routines: the climb process, watch-jump process, repairing process, cooperation process and somersault process. …”
    Get full text
    Get full text
    Article
  17. 17

    Monkey Algorithm for Packing Circles with Binary Variables by Torres-Escobar, R., Marmolejo-Saucedo, J.A., Litvinchev, I., Vasant, P.

    Published 2019
    “…The algorithm consists of five main routines: the climb process, watch-jump process, repairing process, cooperation process and somersault process. …”
    Get full text
    Get full text
    Article
  18. 18

    WCBP: A new water cycle based back propagation algorithm for data classification by Mohd. Nawi, Nazri, Khan, Abdullah, Firdaus, Naim, M. Z., Rehman, Siming, Insaf Ali

    Published 2016
    “…The performance of the proposed Water Cycle based Back-Propagation (WCBP) algorithm is compared with the conventional BPNN, ABC-BP and ABC-LM algorithms on selected benchmark classification problems from UCI Machine Learning Repository. …”
    Get full text
    Get full text
    Article
  19. 19
  20. 20

    Investigation of evolutionary multi-objective algorithms in solving view selection problem / Seyed Hamid Talebian by Talebian, Seyed Hamid

    Published 2013
    “…As a comparative study, the performance of the algorithms was evaluated based on various standard metrics. …”
    Get full text
    Get full text
    Thesis