Catalogue Search | MBRL
Are you sure you want to remove the book from the shelf?
{{itemTitle}}
59,668
result(s) for
"Heuristic"
Sort by:
Nature inspired meta heuristic algorithms for optimization problems
Optimization and decision making problems in various fields of engineering have a major impact in this current era. Processing time and utilizing memory is very high for the currently available data. This is due to its size and the need for scaling from zettabyte to yottabyte. Some problems need to find solutions and there are other types of issues that need to improve their current best solution. Modelling and implementing a new heuristic algorithm may be time consuming but has some strong primary motivation - like a minimal improvement in the solution itself can reduce the computational cost. The solution thus obtained was better. In both these situations, designing heuristics and meta-heuristics algorithm has proved it’s worth. Hyper heuristic solutions will be needed to compute solutions in a much better time and space complexities. It creates a solution by combining heuristics to generate automated search space from which generalized solutions can be tuned out. This paper provides in-depth knowledge on nature-inspired computing models, meta-heuristic models, hybrid meta heuristic models and hyper heuristic model. This work’s major contribution is on building a hyper heuristics approach from a meta-heuristic algorithm for any general problem domain. Various traditional algorithms and new generation meta heuristic algorithms has also been explained for giving readers a better understanding.
Journal Article
Performance comparison of heuristic algorithms for task scheduling in IaaS cloud computing environment
Cloud computing infrastructure is suitable for meeting computational needs of large task sizes. Optimal scheduling of tasks in cloud computing environment has been proved to be an NP-complete problem, hence the need for the application of heuristic methods. Several heuristic algorithms have been developed and used in addressing this problem, but choosing the appropriate algorithm for solving task assignment problem of a particular nature is difficult since the methods are developed under different assumptions. Therefore, six rule based heuristic algorithms are implemented and used to schedule autonomous tasks in homogeneous and heterogeneous environments with the aim of comparing their performance in terms of cost, degree of imbalance, makespan and throughput. First Come First Serve (FCFS), Minimum Completion Time (MCT), Minimum Execution Time (MET), Max-min, Min-min and Sufferage are the heuristic algorithms considered for the performance comparison and analysis of task scheduling in cloud computing.
Journal Article
Black-winged kite algorithm: a nature-inspired meta-heuristic for solving benchmark functions and engineering problems
This paper innovatively proposes the Black Kite Algorithm (BKA), a meta-heuristic optimization algorithm inspired by the migratory and predatory behavior of the black kite. The BKA integrates the Cauchy mutation strategy and the Leader strategy to enhance the global search capability and the convergence speed of the algorithm. This novel combination achieves a good balance between exploring global solutions and utilizing local information. Against the standard test function sets of CEC-2022 and CEC-2017, as well as other complex functions, BKA attained the best performance in 66.7, 72.4 and 77.8% of the cases, respectively. The effectiveness of the algorithm is validated through detailed convergence analysis and statistical comparisons. Moreover, its application in solving five practical engineering design problems demonstrates its practical potential in addressing constrained challenges in the real world and indicates that it has significant competitive strength in comparison with existing optimization techniques. In summary, the BKA has proven its practical value and advantages in solving a variety of complex optimization problems due to its excellent performance. The source code of BKA is publicly available at
https://www.mathworks.com/matlabcentral/fileexchange/161401-black-winged-kite-algorithm-bka
.
Journal Article
Novel meta-heuristic bald eagle search optimisation algorithm
This study proposes a bald eagle search (BES) algorithm, which is a novel, nature-inspired meta-heuristic optimisation algorithm that mimics the hunting strategy or intelligent social behaviour of bald eagles as they search for fish. Hunting by BES is divided into three stages. In the first stage (selecting space), an eagle selects the space with the most number of prey. In the second stage (searching in space), the eagle moves inside the selected space to search for prey. In the third stage (swooping), the eagle swings from the best position identified in the second stage and determines the best point to hunt. Swooping starts from the best point and all other movements are directed towards this point. BES is tested by adopting a three-part evaluation methodology that (1) describes the benchmarking of the optimisation problem to evaluate the algorithm performance, (2) compares the algorithm performance with that of other intelligent computation techniques and parameter settings and (3) evaluates the algorithm based on mean, standard deviation, best point and Wilcoxon signed-rank test statistic of the function values. Optimisation results and discussion confirm that the BES algorithm competes well with advanced meta-heuristic algorithms and conventional methods.
Journal Article
Metaheuristics for maritime operations
'Metaheuristic Algorithms in Maritime Operations' focuses on the seaside and port side problems regarding the maritime transportation. The book reviews and introduces the most important problems regarding the shipping network design, long-term and short-term scheduling and planning problems in both bulk and container shipping as well as liquid maritime transportation. Application of meta heuristic algorithm is important for these problems, as most of them are hard and time-consuming to be solved optimally.
Book
Adaptive network based fuzzy inference system (ANFIS) training approaches: a comprehensive survey
In the structure of ANFIS, there are two different parameter groups: premise and consequence. Training ANFIS means determination of these parameters using an optimization algorithm. In the first ANFIS model developed by Jang, a hybrid learning approach was proposed for training. In this approach, while premise parameters are determined by using gradient descent (GD), consequence parameters are found out with least squares estimation (LSE) method. Since ANFIS has been developed, it is used in modelling and identification of numerous systems and successful results have been achieved. The selection of optimization method utilized in training is very important to get effective results with ANFIS. It is seen that derivate based (GD, LSE etc.) and non-derivative based (heuristic algorithms such us GA, PSO, ABC etc.) algorithms are used in ANFIS training. Nevertheless, it has been observed that there is a trend toward heuristic based ANFIS training algorithms for better performance recently. At the same time, it seems to be proposed in derivative and heuristic based hybrid algorithms. Within the scope of this study, the heuristic and hybrid approaches utilized in ANFIS training are examined in order to guide researchers in their study. In addition, the final status in ANFIS training is evaluated and it is aimed to shed light on further studies related to ANFIS training.
Journal Article