Search Results - (( using optimization search algorithm ) OR ( using optimization max algorithm ))

Search alternatives:

Refine Results
  1. 1
    A comparative performance analysis of computational intelligence techniques to solve the asymmetric travelling salesman problem

    A comparative performance analysis of computational intelligence techniques to solve the asymmetric travelling salesman problem by Odili, Julius Beneoluchi, Noraziah, Ahmad, Zarina, M.

    Published 2021
    “…The comparative algorithms in this study employ different techniques in their search for solutions to ATSP: the African Buffalo Optimization employs the modified Karp–Steele mechanism, Model-Induced Max-Min Ant Colony Optimization (MIMM-ACO) employs the path construction with patching technique, Cooperative Genetic Ant System uses natural selection and ordering; Randomized Insertion Algorithm uses the random insertion approach, and the Improved Extremal Optimization uses the grid search strategy. …”
    Get full text
    Get full text
    Get full text
    Article
    Save to List
    Saved in:
  2. 2
    Reactive max-min ant system: An experimental analysis of the combination with K-OPT local searches

    Reactive max-min ant system: An experimental analysis of the combination with K-OPT local searches by Sagban, Rafid, Ku-Mahamud, Ku Ruhana, Abu Bakar, Muhamad Shahbani

    Published 2015
    “…The exploration versus exploitation dilemma rises in ACO search.Reactive max-min ant system algorithm is a recent proposition to automate the exploration and exploitation.It memorizes the search regions in terms of reactive heuristics to be harnessed after restart, which is to avoid the arbitrary exploration later.This paper examined the assumption that local heuristics are useless when combined with local search especially when it applied for combinatorial optimization problems with rugged fitness landscape.Results showed that coupling reactive heuristics with k-Opt local search algorithms produces higher quality solutions and more robust search than max-min ant system algorithm.Well-known combinatorial optimization problems are used in experiments, i.e. traveling salesman and quadratic assignment problems. …”
    Get full text
    Get full text
    Get full text
    Conference or Workshop Item
    Save to List
    Saved in:
  3. 3
    A new strategy to improve the search performance of Max-Min Ant Aystem Algorithm when solving the Quadratic Assignment Problems

    A new strategy to improve the search performance of Max-Min Ant Aystem Algorithm when solving the Quadratic Assignment Problems by Phen, Chiak See

    Published 2010
    Get full text
    Working Paper
    Save to List
    Saved in:
  4. 4
    Ant colony optimization in dynamic environments

    Ant colony optimization in dynamic environments by Chen, Fei Huang

    Published 2010
    “…The last objective of this thesis is to optimize the parameter settings of the best performing ant algorithm with local search. …”
    Get full text
    Get full text
    Get full text
    Thesis
    Save to List
    Saved in:
  5. 5
    An exploration technique for the interacted multiple ant colonies optimization framework

    An exploration technique for the interacted multiple ant colonies optimization framework by Aljanaby A., Ku-Mahamud K.R., Norwawi N.Md.

    Published 2024
    Conference Paper
    Save to List
    Saved in:
  6. 6
    Reactive approach for automating exploration and exploitation in ant colony optimization

    Reactive approach for automating exploration and exploitation in ant colony optimization by Allwawi, Rafid Sagban Abbood

    Published 2016
    “…Ant colony optimization (ACO) algorithms can be used to solve nondeterministic polynomial hard problems. …”
    Get full text
    Get full text
    Get full text
    Thesis
    Save to List
    Saved in:
  7. 7
    Interacted Multiple Ant Colonies for Search Stagnation Problem

    Interacted Multiple Ant Colonies for Search Stagnation Problem by Aljanabi, Alaa Ismael

    Published 2010
    “…In particular, it proposes the use of multiple interacted ant colonies as a new algorithmic framework. …”
    Get full text
    Get full text
    Get full text
    Thesis
    Save to List
    Saved in:
  8. 8
    Reactive memory model for ant colony optimization and its application to TSP

    Reactive memory model for ant colony optimization and its application to TSP by Sagban, Rafid, Ku-Mahamud, Ku Ruhana, Abu Bakar, Muhamad Shahbani

    Published 2014
    “…The exploration and exploitation are the main mechanisms in controlling search within the ACO. Reactive search is a framework for automating the exploration and exploitation in stochastic algorithms.Restarting the search with the aid of memorizing the search history is the soul of reaction.It is to increase the exploration only when needed.This paper proposes a reactive memory model to overcome the limitation of the random exploration after restart because of losing the previous history of search.The proposed model is utilized to record the previous search regions to be used as reference for ants after restart. …”
    Get full text
    Get full text
    Get full text
    Conference or Workshop Item
    Save to List
    Saved in:
  9. 9
    Training size optimization with reduced complexity in cell-free massive MIMO system

    Training size optimization with reduced complexity in cell-free massive MIMO system by Ullah, Sayeid M. Sahid, Mahyiddin, Wan Amirul Wan Mohd, Zakaria, Nur Azira, Latef, Tarik Abdul, Noordin, Kamarul Ariffin, Dimyati, Kaharudin

    Published 2019
    “…In addition, we proposed and compared the performance of different training size optimization algorithms, namely exhaustive search optimization, bisection optimization and min–max optimization, with each method has different level of calculation complexities. …”
    Get full text
    Get full text
    Article
    Save to List
    Saved in:
  10. 10
    A new minimum pheromone threshold strategy (MPTS) for max-min ant system

    A new minimum pheromone threshold strategy (MPTS) for max-min ant system by Wong, Kuan Yew, See, Phen Chiak

    Published 2009
    “…Among others is the ant colony optimization (ACO) algorithm, which was inspired by the foraging behavior of ants. …”
    Get full text
    Get full text
    Article
    Save to List
    Saved in:
  11. 11
    An Exploration Technique for the Interacted Multiple Ant Colonies Optimization Framework

    An Exploration Technique for the Interacted Multiple Ant Colonies Optimization Framework by Aljanaby, A, Ku-Mahamud, KR, Norwawi, NM

    Published 2024
    “…These colonies are working cooperatively to solve an optimization problem using some interaction technique. …”
    Proceedings Paper
    Save to List
    Saved in:
  12. 12
    An adaptive QOS scheduling algorithm in service oriented grid and cloud environment / Ang Tan Fong

    An adaptive QOS scheduling algorithm in service oriented grid and cloud environment / Ang Tan Fong by Ang, Tan Fong

    Published 2011
    “…Subsequently, an Adaptive Scheduling Algorithm (ASA) that uses benchmarking is proposed to enhance the HSA. …”
    Get full text
    Get full text
    Get full text
    Get full text
    Get full text
    Thesis
    Save to List
    Saved in:
  13. 13
    Social spider optimisation algorithm for dimension reduction of electroencephalogram signals in human emotion recognition

    Social spider optimisation algorithm for dimension reduction of electroencephalogram signals in human emotion recognition by Al-Qammaz, Abdullah Yousef, Ahmad, Farzana Kabir, Yusof, Yuhanis

    Published 2018
    “…Due to some limitations of current heuristics and evolutionary algorithms, this paper proposed a new swarm based algorithm for feature selection method called Social Spider Optimization (SSO-FS). …”
    Get full text
    Get full text
    Get full text
    Article
    Save to List
    Saved in:
  14. 14
    Optimizing B-tree search performance of big data sets / Mohsen Marjani

    Optimizing B-tree search performance of big data sets / Mohsen Marjani by Mohsen , Marjani

    Published 2017
    “…This study proposes an optimized B-tree search method to improve the execution time of the search tasks and to optimize the performance of the B-tree search process. …”
    Get full text
    Get full text
    Get full text
    Thesis
    Save to List
    Saved in:
  15. 15
    Explaining recreationist responsible behaviour : a case of scuba diving / Ong Tah Fat

    Explaining recreationist responsible behaviour : a case of scuba diving / Ong Tah Fat by Ong, Tah Fat

    Published 2012
    “…Subsequently, an Adaptive Scheduling Algorithm (ASA) that uses benchmarking is proposed to enhance the HSA. …”
    Get full text
    Get full text
    Get full text
    Thesis
    Save to List
    Saved in:
  16. 16
    An exploration technique for the interacted multiple ant colonies optimization framework

    An exploration technique for the interacted multiple ant colonies optimization framework by Aljanaby, Alaa, Ku-Mahamud, Ku Ruhana, Md. Norwawi, Norita

    Published 2010
    “…These colonies are working coopereatively to solve an optimization problem using some interaction technique. …”
    Get full text
    Get full text
    Get full text
    Conference or Workshop Item
    Save to List
    Saved in:
  17. 17
    The effect of pre-processing techniques and optimal parameters on BPNN for data classification

    The effect of pre-processing techniques and optimal parameters on BPNN for data classification by HUSSEIN, AMEER SALEH

    Published 2015
    Get full text
    Get full text
    Get full text
    Get full text
    Thesis
    Save to List
    Saved in:
  18. 18
    Fractal coding of bio-metric image for face authentication

    Fractal coding of bio-metric image for face authentication by Ahadullah, Md

    Published 2021
    “…In BPBM, the thesis contributes to search space reduction by converting eight-bit pixels to two-bit pixels using the central pixel value of blocks and the related eight-neighbors. …”
    Get full text
    Get full text
    Thesis
    Save to List
    Saved in:
  19. 19
    Lysine and methionine production from agro-waste submerged fermentation using locally isolated lactic acid bacteria

    Lysine and methionine production from agro-waste submerged fermentation using locally isolated lactic acid bacteria by Muhamad Nor, Norfarina

    Published 2016
    “…Data gathered from the RSM model were then applied in ANN study. The optimal configuration of the ANN model was found to be 4-5-2 with the explanation of incremental back propagation (IBP) algorithm in a combination of a sigmoidal transfer function (output) and linear hidden layer. …”
    Get full text
    Get full text
    Get full text
    Thesis
    Save to List
    Saved in:
  20. 20
    An improvement of stochastic gradient descent approach for mean-variance portfolio optimization problem

    An improvement of stochastic gradient descent approach for mean-variance portfolio optimization problem by S. W. Su, Stephanie, Kek, Sie Long

    Published 2021
    “…Furthermore, the applicability of SGD, Adam, AdaMax, Nadam, AMSGrad, and AdamSE algorithms in solving the mean-variance portfolio optimization problem is validated.…”
    Get full text
    Get full text
    Get full text
    Article
    Save to List
    Saved in:

Search Tools: