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

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

“…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

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

“…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

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

“…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

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

“…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

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

“…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

Enhanced Harris's Hawk algorithm for continuous multi-objective optimization problems by Yasear, Shaymah Akram

“…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

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

Get full text
Get full text
Get full text

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

“…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

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

“…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

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

“…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

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

“…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

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

“…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

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

“…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

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

“…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

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

“…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

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

“…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

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

“…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

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

“…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

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

“…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

AN INTEGRATED RRT*SMART-A* ALGORITHM FOR SOLVING THE GLOBAL PATH PLANNING PROBLEM IN A STATIC ENVIRONMENT by Suwayo, Heri, Adrishah, Andi, Andika, Juleri, Shamdudin, Abu Ubaidah, Zakaria, Mohamad Fauzi

“…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