Search Results - (( basic permutation generation algorithm ) OR ( java implementation bat algorithm ))

Search alternatives:

  • Showing 1 - 5 results of 5
Refine Results
  1. 1
    Fuzzy modeling using Bat Algorithm optimization for classification

    Fuzzy modeling using Bat Algorithm optimization for classification by Noor Amidah, Ahmad Sultan

    Published 2018
    “…A Sazonov Engine which is a fuzzy java engine is use to apply Bat Algorithm in the experiment. …”
    Get full text
    Get full text
    Get full text
    Undergraduates Project Papers
    Save to List
    Saved in:
  2. 2
    Numerical assessment on makespan minimization by adopting NEH heuristics in permutation flow shop

    Numerical assessment on makespan minimization by adopting NEH heuristics in permutation flow shop by Ziao, C.Z., Kamaruddin, S.

    Published 2015
    “…Throughout the last 30 years, the NEH heuristic developed by Nawaz, Enscore and Ham has been commonly regarded as the best heuristic for minimizing the makespan in permutation flow shops. This heuristic is basically divided into two main stages: generate an initial sequence with decreasing total processing time and insert into the schedule accordingly. …”
    Get full text
    Get full text
    Conference or Workshop Item
    Save to List
    Saved in:
  3. 3
    A new 128-bit block cipher

    A new 128-bit block cipher by Mohd Ali, Fakariah Hani

    Published 2009
    “…It is an involution substitution and permutation encryption network (SPN). This block cipher uses only basic operations, key dependent S-box and XOR IS together so that it can be efficiently implemented on various platforms. …”
    Get full text
    Get full text
    Thesis
    Save to List
    Saved in:
  4. 4
    Hybrid-discrete multi-objective particle swarm optimization for multi-objective job-shop scheduling

    Hybrid-discrete multi-objective particle swarm optimization for multi-objective job-shop scheduling by Anuar, Nurul Izah

    Published 2022
    “…This research first proposes an improved continuous MOPSO to address the rapid clustering problem that exists in the basic PSO algorithm using three improvement strategies: re-initialization of particles, systematic switch of best solutions and mutation on global best selection. …”
    Get full text
    Get full text
    Get full text
    Thesis
    Save to List
    Saved in:
  5. 5
    Bottleneck adjacent matching heuristics for scheduling a re-entrant flow shop with dominant machine problem

    Bottleneck adjacent matching heuristics for scheduling a re-entrant flow shop with dominant machine problem by Sh Ahmad, Sh Salleh

    Published 2009
    “…Third, bottleneck approach was utilised in the study and the analysis using Visual Basic macro programming indicated that this method produced good results. …”
    Get full text
    Get full text
    Get full text
    Get full text
    Thesis
    Save to List
    Saved in:

Search Tools: