Search Results - (( solution using stepping algorithm ) OR ( java implication based algorithm ))
Search alternatives:
- stepping algorithm »
- implication based »
- java implication »
- solution using »
- using stepping »
-
1
Optimal design of step – cone pulley problem using the bees algorithm
Published 2021“…The Bees Algorithm is used in this study to find the optimum solution for stepped-cone pulley design and found better results compared to other optimization algorithms.…”
Get full text
Get full text
Get full text
Get full text
Book Chapter -
2
An improved electromagnetism-like mechanism algorithm for the optimization of maximum power point tracking / Tan Jian Ding
Published 2017“…The Electromagnetism-Like Mechanism algorithm (EM) is a meta-heuristic algorithm designed to search for global optimum solutions using bounded variables. …”
Get full text
Get full text
Get full text
Thesis -
3
Algorithm As A Problem Solving Technique For Teaching And Learning Of The Malay Language
Published 2019“…Computational thinking or CT refers to the thought processes involved in expressing solutions as computational steps or algorithms that can be carried out by a computer. …”
Get full text
Get full text
Get full text
Article -
4
Algorithm as a problem solving technique for teaching and learning of the Malay language
Published 2019“…Computational thinking or CT refers to the thought processes involved in expressing solutions as computational steps or algorithms that can be carried out by a computer. …”
Get full text
Get full text
Get full text
Article -
5
A Kalman-Filter-Based Sine-Cosine Algorithm
Published 2019“…The Kalman gain is utilized to introduce a dynamic step size of a search agent in the SKF algorithm. …”
Get full text
Get full text
Get full text
Conference or Workshop Item -
6
Novel Adaptive Bacterial Foraging Algorithms for Global Optimisation with Application to Modelling of a TRS
Published 2015“…On the contrary, if a small step size is used, an optimal solution may be achieved, but at a very slow pace, thus affecting the speed of convergence. …”
Get full text
Get full text
Article -
7
Solving ump examination timetabling problem using dynamic exploration step counting hill climbing algorithm
Published 2022“…Then, the initial solution is improved using our enhanced algorithm called dynamic exploration step counting hill climbing (DESCHC). …”
Get full text
Get full text
Thesis -
8
-
9
-
10
A negotiation algorithm for decision-making in the construction domain
Published 2023Conference Paper -
11
A multiobjective simulated Kalman filter optimization algorithm
Published 2018“…The Kalman gain is utilized to introduce a dynamic step size of a search agent in the SKF algorithm. …”
Get full text
Get full text
Get full text
Conference or Workshop Item -
12
An improved bat algorithm with artificial neural networks for classification problems
Published 2016“…However, Bat suffers from large step lengths that sometimes make it to converge to sub-optimal solution. …”
Get full text
Get full text
Get full text
Get full text
Thesis -
13
Enhancing harmony search parameters based on step and linear function for bus driver scheduling and rostering problems
Published 2018“…Optimization is a major challenge in numerous practical world problems.According to the “No Free Lunch (NFL)” theorem,there is no existing single optimizer algorithm that is able to resolve all issues in an effective and efficient manner.It is varied and need to be solved according to the specific capabilities inherent to certain algorithms making it hard to foresee the algorithm that is best suited for each problem.As a result,the heuristic technique is adopted for this research as it has been identified as a potentially suitable algorithm.Alternative heuristic algorithms are also suggested to obtain optimal solutions with reasonable computational effort.However,the heuristic approach failed to produce a solution that nears optimum when the complexity of a problem increases;therefore a type of nature-inspired algorithm known as meta-euristics which utilises an intelligent searching mechanism over a population is considered and consequently used.The meta-heuristic approach is widely used to substitute heuristic terms and is broadly applied to address problems with regards to driver scheduling.However,this meta-heuristic technique is still unable to address the fairness issue in the scheduling and rostering problems.Hence,this research proposes a strategy to adopt an amendment of the harmony search algorithm in order to address the fairness issue which in turn will escalate the level of fairness in driver scheduling and rostering.The harmony search algorithm is classified as a meta-heuristics algorithm that is capable of solving hard and combinatorial or discrete optimisation problems.In this respect,the three main operators in harmony search,namely the Harmony Memory Consideration Rate (HMCR),Pitch Adjustment Rate (PAR) and Bandwidth (BW) play a vital role in balancing local exploitation and global exploration.These parameters influence the overall performance of the HS algorithm,and therefore it is crucial to fine-tune them. …”
Get full text
Get full text
Get full text
Thesis -
14
Numerical algorithm of block method for general second order ODEs using variable step size
Published 2017“…Consequently, a direct block multistep method with utilization of variable step size strategy is proposed. This method was developed for computing the solution at four points simultaneously and the derivation based on numerical integration as well as using interpolation approach. …”
Get full text
Get full text
Get full text
Article -
15
Parallel block methods for solving higher order ordinary differential equations directly
Published 1999“…A new parallel algorithm for solving systems of ODEs using variable step size and order is also developed. …”
Get full text
Get full text
Thesis -
16
Numerical algorithm of block method for general second order ODEs using variable step size
Published 2017“…Consequently, a direct block multistep method with utilization of variable step size strategy is proposed. This method was developed for computing the solution at four points simultaneously and the derivation based on numerical integration as well as using interpolation approach. …”
Get full text
Get full text
Get full text
Article -
17
Enhanced Intelligent Water Drops Algorithm for University Examination Timetabling Problems
Published 2024“…(iii) It is a constructive-based meta-heuristic algorithm which means, the solution is incrementally constructed (step by step) until the complete solution is obtained (Noferesti and Shah-Hosseini, 2012). …”
thesis::doctoral thesis -
18
Kinetic Parameter Estimation in Alkylation of Benzene with 1-Decene through Hybrid Particle Swarm Optimization
Published 2012“…Afterwards, the solution obtained using PSO algorithm is given as initial guesses to the Levenberg–Marquardt algorithm to determine the improved optimal solution. …”
Get full text
Get full text
Final Year Project -
19
Block multistep methods for solving first order retarded and neutral delay differential equations
Published 2015“…The proposed methods have shown to have a convergence when the numerical solution approaches to the exact solution as the step size h tends to zero. …”
Get full text
Get full text
Thesis -
20
Variable order step size algorithm for solving second order ODEs
Published 2019“…Previous multi step method using a divided difference formulation for solving higher order ordinary differential equations (ODEs) requires calculating the integration co-efficients at every step. …”
Get full text
Get full text
Book Section
