Search Results - (( adoption _ differences evolution algorithm ) OR ( adoption a discrete optimization algorithm ))

Refine Results
  1. 1

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

    Published 2022
    “…In order to establish an efficient mapping between the particle’s position in the continuous MOPSO and the scheduling solution in the JSP, this research proposes the JSP to be adopted within a discrete MOPSO through a modified solution representation using the permutation-based representation and a modified setup of the particle’s position and velocity. …”
    Get full text
    Get full text
    Get full text
    Get full text
    Thesis
  2. 2

    Optimal design of low-voltage distribution networks for CO2 emission minimisation. Part II: Discrete optimisation of radial networks and comparison with alternative design strategi... by Gan, Chin Kim

    Published 2011
    “…The implementation of the network design algorithm is illustrated for a realistic large low-voltage urban network in a UK framework. …”
    Get full text
    Get full text
    Get full text
    Article
  3. 3

    Optimal input features selection of wavelet-based EEG signals using GA by Mohd. Daud, Salwani, Yunus, Jasmy

    Published 2004
    “…We present a method of selecting optimal input features from wavelet coefficients of electroencephalogram (EEG) signals. …”
    Get full text
    Conference or Workshop Item
  4. 4

    Intergrated multi-objective optimisation of assembly sequence planning and assembly line balancing using particle swarm optimisation by M. F. F., Ab Rashid

    Published 2013
    “…The MODPSO uses the Pareto-based approach to deal with the multi-objective problem and adopts a discrete procedure instead of standard mathematical operators to update its position and velocity. …”
    Get full text
    Get full text
    Thesis
  5. 5

    Design Of Perturbative Hyper-Heuristics For Combinatorial Optimisation by Choong, Shin Siang

    Published 2019
    “…Combinatorial optimisation is an area which seeks to identify optimal solution(s) from a discrete solution search space. …”
    Get full text
    Get full text
    Thesis
  6. 6

    A new hybrid GA−ACO−PSO algorithm for solving various engineering design problems by Tam, Jun Hui, Ong, Zhi Chao, Ismail, Zubaidah, Ang, Bee Chin, Khoo, Shin Yee

    Published 2019
    “…The intention of this hybridization is to further enhance the exploratory and exploitative search capabilities involving simple concepts. The proposed algorithm adopts the combined discrete and continuous probability distribution scheme of ant colony optimization (ACO) to specifically assist genetic algorithm in the aspect of exploratory search. …”
    Get full text
    Get full text
    Article
  7. 7
  8. 8

    Evacuation routing optimizer (EROP) / Azlinah Mohamed … [et al.] by Mohamed, Azlinah, Yusoff, Marina, Ariffin, Junaidah, Shamsudin, Siti Maryam

    Published 2011
    “…For EVAP, discrete particle position is proposed to support the implementation of discrete particle swarm optimization called myDPSOVAP-A. …”
    Get full text
    Get full text
    Research Reports
  9. 9

    Enhancing Harmony Search Parameters Based On Step And Linear Function For Bus Driver Scheduling And Rostering Problems by Mansor, Nur Farraliza

    Published 2018
    “…Optimization is a major challenge in numerous practical world problems.According to the “No Free Lunch (NFL)” theorem,there is no existing single optimizer algorithm that is able to resolve all issues in an effective and efficient manner.It is varied and need to be solved according to the specific capabilities inherent to certain algorithms making it hard to foresee the algorithm that is best suited for each problem.As a result,the heuristic technique is adopted for this research as it has been identified as a potentially suitable algorithm.Alternative heuristic algorithms are also suggested to obtain optimal solutions with reasonable computational effort.However,the heuristic approach failed to produce a solution that nears optimum when the complexity of a problem increases;therefore a type of nature-inspired algorithm known as meta-euristics which utilises an intelligent searching mechanism over a population is considered and consequently used.The meta-heuristic approach is widely used to substitute heuristic terms and is broadly applied to address problems with regards to driver scheduling.However,this meta-heuristic technique is still unable to address the fairness issue in the scheduling and rostering problems.Hence,this research proposes a strategy to adopt an amendment of the harmony search algorithm in order to address the fairness issue which in turn will escalate the level of fairness in driver scheduling and rostering.The harmony search algorithm is classified as a meta-heuristics algorithm that is capable of solving hard and combinatorial or discrete optimisation problems.In this respect,the three main operators in harmony search,namely the Harmony Memory Consideration Rate (HMCR),Pitch Adjustment Rate (PAR) and Bandwidth (BW) play a vital role in balancing local exploitation and global exploration.These parameters influence the overall performance of the HS algorithm,and therefore it is crucial to fine-tune them. …”
    Get full text
    Get full text
    Get full text
    Get full text
    Thesis
  10. 10

    Designing substitution boxes based on chaotic map and globalized firefly algorithm by Ahmed, Hussam Alddin Shihab

    Published 2019
    “…The obtained result was compared with a previous S-boxes based on optimization algorithms. …”
    Get full text
    Get full text
    Thesis
  11. 11
  12. 12

    Recent Evolutionary Algorithm Variants for Combinatorial Optimization Problem by Anniza, Hamdan, San Nah, Sze, Say Leng, Goh, Kang Leng, Chiew, Wei King, Tiong

    Published 2023
    “…Research works published from the year 2018 to 2022 are identified in terms of problem representation and evolutionary strategies adopted. The mechanisms and strategies used in evolutionary algorithms to address different types of combinatorial optimization problems are discovered. …”
    Get full text
    Get full text
    Get full text
    Get full text
    Article
  13. 13

    A comparative study for parameter selection in online auctions by Gan, Kim Soon

    Published 2009
    “…In this work, three different models of genetic algorithms are considered. …”
    Get full text
    Get full text
    Get full text
    Thesis
  14. 14

    Deep Reinforcement Learning For Control by Bakar, Nurul Asyikin Abu

    Published 2021
    “…The complete project is carried out in the CARLA simulator to determine how to operate in discrete action space using Deep Reinforcement Learning (DRL) algorithms. …”
    Get full text
    Get full text
    Monograph
  15. 15

    Modelling of optimized hybrid debris flow using airborne laser scanning data in Malaysia by Lay, Usman Salihu

    Published 2019
    “…The general objective of the study was the development of optimized hybrid debris flow models using airborne laser scanning data and Machine learning algorithms in Malaysia. …”
    Get full text
    Get full text
    Thesis
  16. 16

    A hyper-heuristic based strategy for image segmentation using multilevel thresholding by Luqman, Fakhrud Din, Shah Khalid, Kamal Zuhairi Zamli, Aftab Alam

    Published 2025
    “…EMCQ uses four low-level heuristic sets adopted from the teaching learning-based optimisation (TLBO) algorithm, flower pollination algorithm (FPA), genetic algorithm (GA), and Jaya algorithm. …”
    Get full text
    Get full text
    Get full text
    Article
  17. 17

    Gradient-based mutation manta ray foraging optimization (gbm-mrfo) for solving constrained real-world problems by Ahmad Azwan, Abdul Razak, Ahmad Nor Kasruddin, Nasir

    Published 2022
    “…MRFO is a recently new introduced algorithm that consists of strategy of foraging adopted by Manta Ray while Gradient-based Mutation (GbM) is a feasibility-and solution repair strategy adopted from ϵ-Matrix-Adaptation Evolution Strategy (ϵ-MAES). …”
    Get full text
    Get full text
    Get full text
    Conference or Workshop Item
  18. 18

    Channel quality indicator for long term evolution system based on adaptive threshold feedback compression scheme by Abdulhasan, Muntadher Qasim

    Published 2014
    “…The percentage difference is 2.1%,compared with the full feedback method, with only 0.5% degradation. …”
    Get full text
    Get full text
    Thesis
  19. 19

    A hyper-heuristic based strategy for image segmentation using multilevel thresholding by Luqman, ., Fakhrud, Din, Shah, Khalid, Kamal Z., Zamli, Alam, Aftab

    Published 2025
    “…EMCQ uses four low-level heuristic sets adopted from the teaching learning-based optimisation (TLBO) algorithm, flower pollination algorithm (FPA), genetic algorithm (GA), and Jaya algorithm. …”
    Get full text
    Get full text
    Get full text
    Article
  20. 20

    Nonlinear dynamic system identification and control via self-regulating modular neural network by Kiong, L.C., Rajeswari, M., Rao, M.V.C.

    Published 2003
    “…In order to avoid an over-fitting problem, the SGMN deploys a Redundant Experts Removal Algorithm to remove the redundant local experts from the network. …”
    Get full text
    Get full text
    Article