Search Results - (( parallel optimization path algorithm ) OR ( using optimization max algorithm ))

Refine Results
  1. 1

    Tool path generation of contour parallel based on ant colony optimisation by Abdullah, Haslina, Ramli, Rizauddin, Abd Wahab, Dzuraidah, Abu Qudeiri, Jaber

    Published 2016
    “…An Ant Colony Optimisation (ACO) method is used to optimize the tool path length because of its capability to find the shortest tool path length. …”
    Get full text
    Get full text
    Article
  2. 2
  3. 3

    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
  4. 4
  5. 5
  6. 6

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

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

    An optimal tasks scheduling algorithm based on QoS in cloud computing network by Alhakimi, Mohammed Ameen Mohammed Abdo

    Published 2017
    “…This study presents an optimal task scheduling algorithm by enhancing Max-Min and TS algorithm. …”
    Get full text
    Get full text
    Thesis
  9. 9

    Maximum 2-satisfiability in radial basis function neural network by Shehab Abdulhabib Alzaeemi, Saratha Sathasivam, Mohd Shareduwan Mohd Kasihmuddin, Mohd. Asyraf Mansor

    Published 2020
    “…This paper presents a new paradigm in using MAX2SAT by implementing in Radial Basis Function Neural Network (RBFNN). …”
    Get full text
    Get full text
    Get full text
    Article
  10. 10
  11. 11
  12. 12

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

    Restoration planning strategy of transmission system based on optimal energizing time of sectionalizing islands / Dian Najihah Abu Talib by Dian Najihah , Abu Talib

    Published 2019
    “…There are two discrete optimization techniques used in this work, which are the Artificial Bee Colony algorithm and Evolutionary Programming. …”
    Get full text
    Get full text
    Get full text
    Thesis
  15. 15

    OPTIMIZED MIN-MIN TASK SCHEDULING ALGORITHM FOR SCIENTIFIC WORKFLOWS IN A CLOUD ENVIRONMENT by Murad S.S., Badeel R., Alsandi N.S.A., Alshaaya R.F., Ahmed R.A., Muhammed A., Derahman M.

    Published 2023
    “…To achieve this, we propose a new noble mechanism called Optimized Min-Min (OMin-Min) algorithm, inspired by the Min-Min algorithm. …”
    Review
  16. 16

    Performance comparison of differential evolution and particle swarm optimization in constrained optimization by Iwan, Mahmud, Akmeliawati, Rini, Faisal, Tarig, Al-Assadi, Hayder M.A.A.

    Published 2012
    “…This paper presents a comparative study for min-max constrained optimization using PSO and DE. Here, the constrained optimization is represented by some selected standard benchmark functions. …”
    Get full text
    Get full text
    Get full text
    Article
  17. 17

    Improvement of Centralized Routing and Scheduling Using Cross-Layer Design and Multi-Slot Assignment in Wimax Mesh Networks by Al-Humairi, Ali Zuhair Abdulameer

    Published 2009
    “…This thesis proposes an optimized strategy namely cross-layer design in routing algorithms used find the best route for all SSs and scheduling algorithms, used to assign a time slot for each possible node transmission. …”
    Get full text
    Get full text
    Thesis
  18. 18

    Prediction and multi-criteria-based schemes for seamless handover mechanism in mobile WiMAX networks by Mubarak, Mohammed Awadh Ahmed Ben

    Published 2013
    “…Finally, the FuzSAHO decision algorithim is optimized for real-time application, by using a new handover criteria, namely queue length besides RSSI and MS velocity. …”
    Get full text
    Get full text
    Thesis
  19. 19

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

    Ant colony optimization in dynamic environments by Chen, Fei Huang

    Published 2010
    “…Apart from the size of the optimization problem, how the swapping interval affects the dynamic optimization by the ant algorithms is also investigated. …”
    Get full text
    Get full text
    Get full text
    Thesis