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

Refine Results
  1. 1

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

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

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

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

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

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

    Published 2015
    “…Here, firstly, two experimental tests have been carried out to show the validity and consistency of the applied algorithms for solving TTRPSDTW. …”
    Get full text
    Get full text
    Get full text
    Thesis
  10. 10

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

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

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

    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
    “…Constructive and clustering are the two popular approaches to solve CVRP. A constructive approach creates routes and attempts to minimize the cost at the same time. …”
    Get full text
    Get full text
    Get full text
    Get full text
    Proceeding Paper
  14. 14

    A modified flower pollination algorithm and carnivorous plant algorithm for solving engineering optimization problem by Ong, Kok Meng

    Published 2021
    “…In this study, two metaheuristic algorithms, namely, modified flower pollination algorithm (MFPA) and carnivorous plant algorithm (CPA), were proposed. …”
    Get full text
    Get full text
    Get full text
    Get full text
    Thesis
  15. 15

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

    Enhancement on the modified artificial bee colony algorithm to optimize the vehicle routing problem with time windows by Sankor, Salah Mortada Shahen

    Published 2022
    “…The Artificial Bee Colony (ABC) is a popular swarm intelligence algorithm for COP. In this study, existing Modified ABC (MABC) algorithm is revised to solve the VRPTW. …”
    Get full text
    Get full text
    Thesis
  17. 17

    Modified Sumudu Transform Analytical Approximate Methods For Solving Boundary Value Problems by Al-Nemrat, Asem Mustafa Moh’ad

    Published 2019
    “…In addition, for the STVIM method, a new algorithm has been proposed to solve various kinds of linear and nonlinear second-order two-point BVPs. …”
    Get full text
    Get full text
    Thesis
  18. 18

    Modified Sumudu Transform Analytical Approximate Methods For Solving Boundary Value Problems by Al-Nemrat, Asem Mustafa Moh’ad

    Published 2019
    “…In addition, for the STVIM method, a new algorithm has been proposed to solve various kinds of linear and nonlinear second-order two-point BVPs. …”
    Get full text
    Get full text
    Thesis
  19. 19
  20. 20