This correspondence presents a novel hybrid wrapper and filter feature selection algorithm for a classification problem using a memetic framework. It incorporates a filter ranking method in the traditional genetic algorithm to improve classification performance and accelerate the search in identifying the core feature subsets. Particularly, the method adds or deletes a feature from a candidate ...

Economic load dispatch (ELD) is an important optimization task in power system. It is the process of allocating generation among the committed units such that the constraints imposed are satisfied and the energy requirements are minimized. There are three criteria in solving the economic load dispatch problem. They are minimizing the total generator operating cost, total emission cost and sched...

The flexible job shop scheduling problem (FJSP) is a generalization of the classical job shop scheduling problem that allows to process operations on one machine out of a set of alternative machines. The FJSP is an NP-hard problem consisting of two sub-problems, which are the assignment and the scheduling problems. In this paper, we propose how to solve the FJSP by hybrid metaheuristics-based c...

In this communication Simulated Annealing and Genetic Algorithms, are applied to the graph partitioning problem. These techniques mimic processes in statistical mechanics and biology, respectively, and are the most popular meta-heuristics or general-purpose optimization strategies. A hybrid algorithm for circuit partitioning, which uses tabu search to improve the simulated annealing meta-heuris...

The Traveling Salesman Problem (TSP) is widely studied problems in combinatorial optimization. Many researches were made for that type of problem. This problem is known to be the NPhard problems that cannot be solve by conventional mathematical approach. It is also a sub problem of many areas. Different approaches are performing on it as a general test bench to find solution for NP-had problem....

Three heuristic algorithms: simulated annealing, genetic algorithm, and Tabu search were compared to molecular docking procedure using 3 protein-ligand systems. Statistical analysis of the results indicated that the Tabu search showed the best performance in terms of locating solutions close to the crystallographic ligand conformation. From the comparisons, a hybrid search algorithm was propose...

Determining amino acid sequences of protein molecules is one of the most important issues in molecular biology. These sequences determine protein structure and functionality. Unfortunately, direct biochemical methods for reading amino acid sequences can be used for reading short sequences only. This is the reason, which makes peptide assembly algorithms an important complement of these methods....