Search Results - (( initial solving based algorithm ) OR ( using codification system algorithm ))

Search alternatives:

Refine Results
  1. 1
    Comparative Analysis of Low Discrepancy Sequence-Based Initialization Approaches Using Population-Based Algorithms for Solving the Global Optimization Problems

    Comparative Analysis of Low Discrepancy Sequence-Based Initialization Approaches Using Population-Based Algorithms for Solving the Global Optimization Problems by Waqas Haider Bangyal, Kashif Nisar, Ag. Asri Bin Ag. Ibrahim, Muhammad Reazul Haque, Joel J. P. C. Rodrigues, Danda B. Rawat

    Published 2021
    “…Metaheuristic algorithms have been widely used to solve diverse kinds of optimization problems. …”
    Get full text
    Get full text
    Get full text
    Get full text
    Get full text
    Article
    Save to List
    Saved in:
  2. 2
    Enhanced Harris's Hawk algorithm for continuous multi-objective optimization problems

    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
    Save to List
    Saved in:
  3. 3
    A firefly algorithm based hybrid method for structural topology optimization

    A firefly algorithm based hybrid method for structural topology optimization by Gebremedhen, H.S., Woldemichael, D.E., Hashim, F.M.

    Published 2020
    “…The lower and upper limit of design variables (0 and 1) were used to find initial material distribution to initialize the firefly algorithm based section of the hybrid algorithm. …”
    Get full text
    Get full text
    Article
    Save to List
    Saved in:
  4. 4
    Solving Assembly Line Balancing Problem Using Genetic Algorithm With Heuristics-Treated Initial Population

    Solving Assembly Line Balancing Problem Using Genetic Algorithm With Heuristics-Treated Initial Population by Chong, Kuan Eng, Omar, Mohamed K, Abu Bakar, Nooh

    Published 2008
    Get full text
    Get full text
    Get full text
    Conference or Workshop Item
    Save to List
    Saved in:
  5. 5
    Simulated Kalman Filter algorithms for solving optimization problems

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

    Published 2019
    “…However, the HKA algorithm has its own flaws. Although it was introduced as a population-based stochastic optimization algorithm, HKA is not exactly a population-based algorithm because it initializes and updates only a single solution. …”
    Get full text
    Get full text
    Thesis
    Save to List
    Saved in:
  6. 6
    Studying the Impact of Initialization for Population-Based Algorithms with Low-Discrepancy Sequences

    Studying the Impact of Initialization for Population-Based Algorithms with Low-Discrepancy Sequences by Adnan Ashraf, Sobia Pervaiz, Waqas Haider Bangyal, Kashif Nisar, Ag. Asri Ag. Ibrahim, Joel J. P. C. Rodrigues, Danda B. Rawat

    Published 2021
    “…To solve different kinds of optimization challenges, meta-heuristic algorithms have been extensively used. …”
    Get full text
    Get full text
    Get full text
    Get full text
    Get full text
    Article
    Save to List
    Saved in:
  7. 7
    An enhanced opposition-based firefly algorithm for solving complex optimization problems

    An enhanced opposition-based firefly algorithm for solving complex optimization problems by Ling, Ai Wong, Hussain Shareef, Azah Mohamed, Ahmad Asrul Ibrahim

    Published 2014
    Get full text
    Get full text
    Get full text
    Article
    Save to List
    Saved in:
  8. 8
    Performance comparison of linear and non-linear great deluge algorithms in solving university course timetabling problems

    Performance comparison of linear and non-linear great deluge algorithms in solving university course timetabling problems by Joe Henry Obit, Yik Junn Kuan, Rayner Alfred

    Published 2017
    “…This research does not focus on hard constraints involved as the initial solution is solved based on Constraint Programming algorithm. …”
    Get full text
    Get full text
    Get full text
    Get full text
    Get full text
    Article
    Save to List
    Saved in:
  9. 9
    Finite impulse response optimizers for solving optimization problems

    Finite impulse response optimizers for solving optimization problems by Tasiransurini, Ab Rahman

    Published 2019
    “…The classification of estimation-based metaheuristic algorithms has been introduced for solving optimization problems. …”
    Get full text
    Get full text
    Thesis
    Save to List
    Saved in:
  10. 10
    Efficiency of heuristic algorithms in solving waste collection vehicle routing problem: a case study

    Efficiency of heuristic algorithms in solving waste collection vehicle routing problem: a case study by Mat, Nur Azriati, Benjamin, Aida Mauziah, Abdul-Rahman, Syariza

    Published 2018
    “…This paper investigated the efficiency of six heuristic algorithms from prior studies in the attempt to solve issues related to waste collection, namely: (i) Nearest Greedy (NG), (ii) Further from Depot (FFD), (iii) Different Initial Customer (DIC), (iv) Savings Approach, (v) Sweep Algorithm, and (vi) Different Initial Customer based on Sweep Algorithm. …”
    Get full text
    Get full text
    Get full text
    Article
    Save to List
    Saved in:
  11. 11
    Efficiency of heuristic algorithms in solving waste collection vehicle routing problem: a case study

    Efficiency of heuristic algorithms in solving waste collection vehicle routing problem: a case study by Mat, Nur Azriati, Benjamin, Aida Mauziah, Abdul-Rahman, Syariza

    Published 2018
    “…This paper investigated the efficiency of six heuristic algorithms from prior studies in the attempt to solve issues related to waste collection, namely: (i) Nearest Greedy (NG), (ii) Further from Depot (FFD), (iii) Different Initial Customer (DIC), (iv) Savings Approach, (v) Sweep Algorithm, and (vi) Different Initial Customer based on Sweep Algorithm. …”
    Get full text
    Get full text
    Get full text
    Article
    Save to List
    Saved in:
  12. 12
    Finite impulse response optimizers for solving optimization problems

    Finite impulse response optimizers for solving optimization problems by Ab Rahman, Tasiransurini

    Published 2019
    “…The classification of estimation-based metaheuristic algorithms has been introduced for solving optimization problems. …”
    Get full text
    Get full text
    Thesis
    Save to List
    Saved in:
  13. 13
    A variant fisher and Jaikuamr algorithm to solve capacitated vehicle routing problem

    A variant fisher and Jaikuamr algorithm to solve capacitated vehicle routing problem by Sultana, Tanzima, Akhand, Md Aminul Haque, Rahman, M.M. Hafizur

    Published 2017
    “…This study investigates a variant of Fisher and Jaikumar algorithm owning to solve CVRP efficiently. In the proposed method clusters form such a way that each cluster cone contains equal number of nodes. …”
    Get full text
    Get full text
    Get full text
    Get full text
    Proceeding Paper
    Save to List
    Saved in:
  14. 14
    Harmony Search-Based Fuzzy Clustering Algorithms For Image Segmentation

    Harmony Search-Based Fuzzy Clustering Algorithms For Image Segmentation by Alia, Osama Moh’d Radi

    Published 2011
    “…This thesis aims to solve these problems using an efficient metaheuristic algorithm, known as the Harmony Search (HS) algorithm. …”
    Get full text
    Get full text
    Thesis
    Save to List
    Saved in:
  15. 15
    Parallel execution of diagonally implicit Runge-Kutta methods for solving IVPs.

    Parallel execution of diagonally implicit Runge-Kutta methods for solving IVPs. by Ismail, Fudziah, Siri, Zailan, Othman, Mohamad, Suleiman, Mohamed

    Published 2009
    “…In this paper we used DIRK methods which are specifically designed for parallel execution to solve a set of initial value problems. Numerical results based on the sequential and parallel modes are tabulated and compared, which shows the advantage of the algorithms based on the parallel mode.…”
    Get full text
    Get full text
    Article
    Save to List
    Saved in:
  16. 16
    A genetic algorithm for solving single level lotsizing problems

    A genetic algorithm for solving single level lotsizing problems by Zenon, Nasaruddin, Ahmad, Ab. Rahman, Ali, Rosmah

    Published 2003
    “…In this paper a genetic algorithm for solving single level lot-sizing problems is proposed and the results of applying the algorithm toexample problems are discussed. …”
    Get full text
    Get full text
    Article
    Save to List
    Saved in:
  17. 17
    Solving University Examination Timetabling Problem Using Intelligent Water Drops Algorithm

    Solving University Examination Timetabling Problem Using Intelligent Water Drops Algorithm by Aldeeb, BA, Norwawi, NM, Al-Betar, MA, Bin Jali, MZ

    Published 2024
    “…IWD is a recent metaheuristic population-based algorithm belonging to swarm intelligent category which simulate river system. …”
    Proceedings Paper
    Save to List
    Saved in:
  18. 18
    Distance based sweep nearest algorithm to solve capacitated vehicle routing problem

    Distance based sweep nearest algorithm to solve capacitated vehicle routing problem by Akhand, M. A. H, Sultana, Tanzima, Peya, Zahrul Jannat, Rahman, M.M. Hafizur

    Published 2016
    “…Among several methods, Sweep algorithm in 2-phase approach is popular in solving CVRP. …”
    Get full text
    Get full text
    Get full text
    Proceeding Paper
    Save to List
    Saved in:
  19. 19
    An Integrated RRT*SMART-A* Algorithm for solving the Global Path Planning Problem in a Static Environment

    An Integrated RRT*SMART-A* Algorithm for solving the Global Path Planning Problem in a Static Environment by Suwoyo, Heru, Adriansyah, Andi, Andika, Julpri, Ubaidillah, Abu

    Published 2023
    “…The use of sampling-based algorithms such as Rapidly-Exploring Random Tree Star (RRT*) has been widely applied in robot path planning. …”
    Get full text
    Get full text
    Get full text
    Article
    Save to List
    Saved in:
  20. 20
    AN INTEGRATED RRT*SMART-A* ALGORITHM FOR SOLVING THE GLOBAL PATH PLANNING PROBLEM IN A STATIC ENVIRONMENT

    AN INTEGRATED RRT*SMART-A* ALGORITHM FOR SOLVING THE GLOBAL PATH PLANNING PROBLEM IN A STATIC ENVIRONMENT by SUWOYO, HERU, ADRIANSYAH, ANDI, ANDIKA, JULFRI, SHAMSUDIN, ABU UBAIDAH, ZAKARIA, MOHAMAD FAUZI

    Published 2023
    “…The use o = sampling-based algorithms such as Rapidly-Exploring Random Tree Star (RRT*) has been widely applied in robot path planning. …”
    Get full text
    Get full text
    Get full text
    Article
    Save to List
    Saved in:

Search Tools: