Meta–Heuristic methods

The proposed algorithm utilizes the migration method to identify local extremes and then relocates the population to explore new solution spaces for further evolution. The MIMEM algorithm is evaluated on the iMOPSE benchmark dataset, and the results demonstrate that it outperforms.

8p visystrom 22-11-2023 8 3   Download

Part 1 book "Production scheduling" includes content: Statement of production scheduling, basic concepts and methods in production scheduling, metaheuristics and scheduling; genetic algorithms and scheduling, constraint propagation and scheduling, simulation approach.

182p oursky03 21-08-2023 9 5   Download

A new multispectral InGaZnO (IGZO) thin-film phototransistor (TF PT) based on a graded band-gap (GBG) SiGe capping layer with metallic nanoparticles (MNPs) is proposed. An accurate drain-current model is developed to investigate the device performances, where the optical characteristics under different light excitations (530 nm, 820 nm, and 1550 nm) are analyzed using the 3-D Finite-difference time-domain method (FDTD).

11p viberbers 09-08-2023 9 3   Download

The study "Constrained optimization using swarm intelligence integrated with Deb’s feasibility rules developed in Python" utilizes Particle Swarm Optimization (PSO) and Deb’s feasibility rules to construct a method for constrained optimization named as frPSO. PSO is a capable swarm intelligence based metaheuristic and Deb’s feasibility rules is an effective constraint-handling method.

5p runordie2 06-06-2022 4 0   Download

This study used 1,538 data samples from Goldman Osteometric Dataset which consisted of femur, humerus and tibia parts. Based on the feature selection results, the Optimized BPNN outperformed other methods for all datasets.

27p spiritedaway36 28-11-2021 14 2   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

Optimization is the key to solving many problems in computational biology. Global optimization methods, which provide a robust methodology, and metaheuristics in particular have proven to be the most efficient methods for many applications. Despite their utility, there is a limited availability of metaheuristic tools.

9p vikentucky2711 26-11-2020 6 0   Download

This study aims at developing a metaheuristic based image thresholding method via the employments of the HistoryBased Adaptive Differential Evolution with Linear population size reduction algorithm (LSHADE) and the Otsu objective function. The LSHADE algorithm is used to determine an appropriate set of threshold levels that maximizes the separation between clusters of pixels. Experimental results with four applications demonstrate the usefulness of the newly developed tool.

5p caygaocaolon8 07-11-2020 10 1   Download

This article aims at developing an open tool for performing CPM based project scheduling and visualization as well as resource leveling. The success-history based parameter adaptation for Differential Evolution with linear population size reduction, denoted as LSHADE, is used for optimizing project schedules with the focus on minimizing resource fluctuations.

6p viputrajaya2711 22-06-2020 22 0   Download

The problem is modeled as two-stage stochastic program and a metaheuristic algorithm based on the adaptive large neighborhood search (ALNS) is proposed. Extensive computational experiments based on the CAB and TR data sets are conducted. Results show the high efficiency of the proposed solution method.

12p toritori 11-05-2020 6 0   Download

The proposed approach is based on a modified genetic algorithm, which generates an initial population with heuristic solutions obtained from the well-known (LKH) heuristic algorithm for the TSP together with the solution of a mathematical model for the shortest path problem. In addition, two recombination methods and a mutation operator are considered. Computational experiments on benchmark instances show that the proposed algorithm can obtain high-quality solutions within short computing times.

18p toritori 11-05-2020 17 0   Download

This study proposes a hybrid heuristic method based on the Greedy Randomized Adaptive Search Procedure (GRASP) metaheuristic and the Clarke and Wright Savings algorithm, to solve a VRPLC with several loading and routing constraints that have not been considered simultaneously before. Experimental results show that the proposed procedure produces competitive solutions in short processing times. Lastly, the impact of the added operational constraints is also analyzed.

26p toritori 11-05-2020 14 1   Download

This paper presents an efficient design of non-uniform cosine modulated filter banks (CMFB) using canonic signed digit (CSD) coefficients. CMFB has got an easy and efficient design approach. Non-uniform decomposition can be easily obtained by merging the appropriate filters of a uniform filter bank. Only the prototype filter needs to be designed and optimized. In this paper, the prototype filter is designed using window method, weighted Chebyshev approximation and weighted constrained least square approximation. The coefficients are quantized into CSD, using a look-up-table.

11p trinhthamhodang1 16-11-2019 20 0   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 study, we consider a variant of the Bilevel Uncapacitated Facility Location Problem (BLUFLP), in which the clients choose suppliers based on their own preferences. We propose and compare three metaheuristic approaches for solving this problem: Particle Swarm Optimization (PSO), Simulated Annealing (SA), and a combination of Reduced and Basic Variable Neighborhood Search Method (VNS).

18p vinguyentuongdanh 19-12-2018 16 0   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

In this paper the Bandwidth Multicoloring Problem (BMCP) and the Bandwidth Coloring Problem (BCP) are considered. The problems are solved by two genetic algorithms (GAs) which use the integer encoding and standard genetic operators adapted to the problems. In both proposed implementations, all individuals are feasible by default, so search is directed into the promising regions. The first proposed method named GA1 is a constructive metaheuristic that construct solution, while the second named GA2 is an improving metaheuristic used to improve an existing solution.

22p vinguyentuongdanh 19-12-2018 20 0   Download

Metaheuristics are general frameworks used to build heuristic algorithms for hard optimization problems. In this paper, an overview of promising and widely used metaheuristic methods in solving different variants of Berth Allocation Problem is presented.

25p danhnguyentuongvi27 19-12-2018 11 0   Download

Generally speaking, scheduling is the procedure of mapping a set of tasks or jobs (studied objects) to a set of target resources efficiently. It is an important tool in manufacturing and engineering, where it can have a major impact on the productivity of a process. More specifically, as a part of a larger planning and scheduling process, production scheduling is essential for the proper functioning of a manufacturing enterprise. Its primary goal is to maximize throughput and optimize resource utilization, while at the same time minimizing operating costs.

242p cucdai_1 14-10-2012 84 14   Download