Meta–heuristic technique

The performance measures were described in terms of mean squared errors, classification accuracies, sensitivities, specificities, the area under the curve, and receiver operating characteristic curve. It was found that IMGWO outperformed three popular metaheuristic approaches including GWO, genetic algorithm, and particle swarm optimization. Results confirmed the potency of IMGWO as a viable learning technique for an ANN

36p spiritedaway36 28-11-2021 8 1   Download

Complex industrial systems often contain various uncertainties. Hence sophisticated fuzzy optimization (metaheuristics) techniques have become commonplace; and are currently indispensable for e ective design, maintenance and operations of such systems. Unfortunately, such state-of-the-art techniques suffer several drawbacks when applied to largescale problems.

18p nguathienthan9 08-12-2020 19 1   Download

The Multi-stripe Travelling Salesman Problem (Ms-TSP) is an extension of the Travelling Salesman Problem (TSP). In the q-stripe TSP with q ≥ 1, the objective function sums the costs for traveling from one vertex to each of the next q vertices along the tour. To solve medium to large-sized instances, a metaheuristic approach is proposed. The proposed method has two main components, which are construction and improvement phases. The construction phase generates an initial solution using the Greedy Randomized Adaptive Search Procedure (GRASP).

18p nguathienthan9 08-12-2020 13 2   Download

In this article, two new metaheuristic optimization techniques, namely, crow search algorithm and re y algorithm are applied to the well placement optimization problem and their applications to maximize the net pro t value are studied. To study the performance of the re y and crow search algorithm, Eclipse and MATLAB environment are used . The proposed techniques are compared to popular established methods for optimizing well placement. Results show that the re y algorithm is proved to be e cient and e ective compared to other established techniques.

15p nguathienthan9 08-12-2020 14 0   Download

This paper discusses various metaheuristic techniques such as evolutionary approach, Ant colony optimization, simulated annealing, Tabu search and other recent approaches, and their applications to the vicinity of group technology/cell formation (GT/CF) problem in cellular manufacturing. The nobility of this paper is to incorporate various prevailing issues, open problems of meta-heuristic approaches, its usage, comparison, hybridization and its scope of future research in the aforesaid area.

36p toritori 11-05-2020 21 2   Download

Network intrusion detection based on anomaly detection techniques has a significant role in protecting networks and systems against harmful activities. Different metaheuristic techniques have been used for anomaly detector generation. Yet, reported literature has not studied the use of the multi-start metaheuristic method for detector generation. This paper proposes a hybrid approach for anomaly detection in large scale datasets using detectors generated based on multi-start metaheuristic method and genetic algorithms.

11p trinhthamhodang1 16-11-2019 20 0   Download

In this review article, critical assessment of various metaheuristic techniques which utilized in cell formation problem solving is made through extensive literature review. Various existing models for cell formation are argued consequently and directions for future work are presented.

6p cathydoll5 27-02-2019 13 0   Download

Research in the field of vehicle routing is often focused on finding new ideas and concepts in the development of fast and efficient algorithms for an improved solution process. In this first part of the survey, we present an overview of recent literature dealing with adaptive or guided search techniques for problems in vehicle routing.

29p vinguyentuongdanh 19-12-2018 37 3   Download

In this paper, an electromagnetism-like approach (EM) for solving the maximum set splitting problem (MSSP) is applied. Hybrid approach consisting of the movement based on the attraction-repulsion mechanisms combined with the proposed scaling technique directs EM to promising search regions. Fast implementation of the local search procedure additionally improves the efficiency of overall EM system.

11p vinguyentuongdanh 19-12-2018 35 0   Download

A common weakness of local search metaheuristics, such as Simulated Annealing, in solving combinatorial optimisation problems, is the necessity of setting a certain number of parameters. This paper is motivated by the goal of overcoming this drawback by employing "parameter-free" techniques in the context of automatically solving course timetabling problems.

13p vinguyentuongdanh 20-12-2018 18 0   Download

Ant Colony Optimization (ACO) is the best example of how studies aimed at understanding and modeling the behavior of ants and other social insects can provide inspiration for the development of computational algorithms for the solution of difficult mathematical problems. Introduced by Marco Dorigo in his PhD thesis (1992) and initially applied to the travelling salesman problem, the ACO field has experienced a tremendous growth, standing today as an important nature-inspired stochastic metaheuristic for hard optimization problems....

212p japet75 25-02-2013 91 7   Download

Evolutionary computation has been widely used in computer science for decades. Even though it started as far back as the 1960s with simulated evolution, the subject is still evolving. During this time, new metaheuristic optimization approaches, like evolutionary algorithms, genetic algorithms, swarm intelligence, etc., were being developed and new fields of usage in artificial intelligence, machine learning, combinatorial and numerical optimization, etc., were being explored.

326p bi_bi1 11-07-2012 85 18   Download