Search Results - (( initial solving _ algorithm ) OR ( using codification using algorithm ))

Search alternatives:

Refine Results
  1. 1
    Search algorithms for path planning problems in harsh wireless sensor network environment

    Search algorithms for path planning problems in harsh wireless sensor network environment by Hong, Siaw Swin

    Published 2017
    “…Each algorithm solves its respective problem with Enhanced D* solving long initial delay in dynamic environment, NBN solves harsh conditions with limited computational power, and FWN optimized the result of TSP path planning problem with minimal computational effort. …”
    Get full text
    Get full text
    Thesis
    Save to List
    Saved in:
  2. 2
    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:
  3. 3
    Hybrid tabu search – strawberry algorithm for multidimensional knapsack problem

    Hybrid tabu search – strawberry algorithm for multidimensional knapsack problem by Wong, Jerng Foong

    Published 2022
    “…In 2011, a new metaheuristic known as Strawberry algorithm (SBA) was initiated. Since then, it has been vastly applied to solve engineering problems. …”
    Get full text
    Get full text
    Get full text
    Thesis
    Save to List
    Saved in:
  4. 4
    The Determination of Pile Capacity Using Artificial Neural-net: An Optimization Approach

    The Determination of Pile Capacity Using Artificial Neural-net: An Optimization Approach by Ab. Malik, Rosely, Jamil S., Mohamed

    Published 2001
    “…Using the developed algorithm, the safety measures involved are such as reliability index and the probability of failure; instead of only factor of safety if conventional deterministic approach is used. …”
    Get full text
    Get full text
    Article
    Save to List
    Saved in:
  5. 5
    Multistage optimal homotopy asymptotic method for solving initial-value problems

    Multistage optimal homotopy asymptotic method for solving initial-value problems by Anakira, N. R., Alomari, A. K., Jameela, Ali, Hashim, Ishak

    Published 2016
    “…In this paper, a new approximate analytical algorithm namely multistage optimal homotopy asymptotic method (MOHAM) is presented for the first time to obtain approximate analytical solutions for linear, nonlinear and system of initial value problems (IVPs).This algorithm depends on the standard optimal homotopy asymptotic method (OHAM), in which it is treated as an algorithm in a sequence of subinterval. …”
    Get full text
    Get full text
    Get full text
    Article
    Save to List
    Saved in:
  6. 6
    Shooting method with root finding to solve boundary value problems / Aryani Rima Matakim

    Shooting method with root finding to solve boundary value problems / Aryani Rima Matakim by Matakim, Aryani Rima

    Published 2025
    “…The shooting method is an effective numerical approach for solving boundary value problems (BVPs) by converting it into initial value problems (IVPs). …”
    Get full text
    Get full text
    Thesis
    Save to List
    Saved in:
  7. 7
    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
    “…A two-step enhanced non-dominated sorting HHMO (2SENDSHHMO) algorithm has been proposed to solve this problem. …”
    Get full text
    Get full text
    Get full text
    Get full text
    Thesis
    Save to List
    Saved in:
  8. 8
    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:
  9. 9
    Hybrid of firefly algorithm and pattern search for solving optimization problems

    Hybrid of firefly algorithm and pattern search for solving optimization problems by Wahid, Fazli, Ghazali, Rozaida

    Published 2018
    “…Firefly algorithm (FA) is a newly introduced meta-heuristic, nature-inspired, stochastic algorithm for solving various types of optimization problems. …”
    Get full text
    Get full text
    Article
    Save to List
    Saved in:
  10. 10
    Formulating and solving stochastic truck and trailer routing problems using meta-heuristic algorithms / Seyedmehdi Mirmohammadsadeghi

    Formulating and solving stochastic truck and trailer routing problems using meta-heuristic algorithms / Seyedmehdi Mirmohammadsadeghi by Seyedmehdi, Mirmohammadsadeghi

    Published 2015
    “…Therefore, multi-point simulated annealing (M-SA), memetic algorithm (MA) and tabu search (TS) algorithms are applied to solve the TTRPSD. …”
    Get full text
    Get full text
    Get full text
    Thesis
    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
    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:
  13. 13
    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:
  14. 14
    New uniform order eigh hybrid third derivative block method for solving second order initial value problems

    New uniform order eigh hybrid third derivative block method for solving second order initial value problems by Adeyeye, Oluwaseun, Omar, Zurni

    Published 2016
    “…Hence, not only this article presents a new block method that can be adopted when solving real life problems modelled as second order IVPs, it also gives a more convenient algorithm for developing hybrid block methods.…”
    Get full text
    Get full text
    Get full text
    Article
    Save to List
    Saved in:
  15. 15
    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:
  16. 16
    A Hybrid ant colony optimization algorithm for solving a highly constrained nurse rostering problem

    A Hybrid ant colony optimization algorithm for solving a highly constrained nurse rostering problem by Ramli, Razamin, Abd Rahman, Rosshairy, Rohim, Nurdalila

    Published 2019
    “…The hybridization with the hill climbing is aiming at fine-tuning the initial solution or roster generated by the ACO algorithm to achieve better rosters. …”
    Get full text
    Get full text
    Get full text
    Article
    Save to List
    Saved in:
  17. 17
    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:
  18. 18
    Partial examination assignment approaches for solving examination timetabling problems

    Partial examination assignment approaches for solving examination timetabling problems by Mandal, Ashis Kumar

    Published 2016
    “…However, these traditional approaches bias toward the initial timetable where the improvement algorithms (sometimes) are affected and unable to produce a quality timetable. …”
    Get full text
    Get full text
    Thesis
    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
    “…Thus, RRT*-Smart, a further development of RRT*, is considered ideal for solving RRT* problems. Unlike RRT*, RRT*-Smart applies a path optimization by removing the redundant nodes from the initial path when it is gained. …”
    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
    “…Thus, RRT*-Smart, a further development of RRT*, is considered ideal for solving RRT* problems. Unlike RRT*, RRT*-Smart applies a path optimization by removing the redundant nodes from the initial path when it is gained. …”
    Get full text
    Get full text
    Get full text
    Article
    Save to List
    Saved in:

Search Tools: