Cryptology is a thriving research area of great practical importance. It is a fundamental building block of communications security. Cryptographic techniques currently being utilized in the field of communication. This paper presents an approach for the heuristic search procedures for cryptanalysis and development of enhanced cryptographic techniques. To implement the proposed Tabu search, Gene...

This paper presents a packing algorithm to solve an irregular shape strip packing problem. The polygons are packed in strip material, which limits a bin width but not limits a bin length. The objective of a packing algorithm is to minimize a bin length. This paper proposes a hybrid method of genetic algorithms and tabu search to solve a packing problem. Initially, a hybrid method behaves like r...

We propose an interactive tabu search (ITS) to be used for the development support of a product that fits a human’s feeling. Interactive evolutionary computation (IEC) is one of the technologies used in the development support of products that fit a human’s feeling using a computer and person undergoing a communication. The interactive generic algorithm (IGA) is generally used in the IEC. A maj...

Job Shop Scheduling Problem (JSSP) is an optimization problem in which ideal jobs are assigned to resources at particular times. In recent years many attempts have been made at the solution of JSSP using a various range of tools and techniques such as Branch and Bound and Heuristics algorithms. This paper proposed a new algorithm based on Genetic Algorithm (GA), Tabu Search (TS) and Simulated A...

In this paper, we present two novel memetic algorithms (MAs) for gene selection. Both are synergies of Genetic Algorithm (wrapper methods) and local search methods (filter methods) under a memetic framework. In particular, the first MA is a Wrapper-Filter Feature Selection Algorithm (WFFSA) fine-tunes the population of genetic algorithm (GA) solutions by adding or deleting features based on uni...

Given an undirected graph G = (V,E) with weights on the edges, the maxbisection problem (MBP) is to find a partition of the vertex set V into two subsets V1 and V2 of equal cardinality such that the sum of the weights of the edges crossing V1 and V2 is maximized. Relaxing the equal cardinality constraint leads to the maxcut problem (MCP). In this work, we present a memetic algorithm for MBP whi...

In this paper, three solutions for scheduling problem of the Single-Load and Multi-Load Automated Guided Vehicles (AGVs) in Container Terminals are proposed. The problem is formulated as Constraint Satisfaction and Optimization. When capacity of the vehicles is one container, the problem is a minimum cost flow model. This model is solved by the highest performance Algorithm, i.e. Network Simple...

Optimization implies the minimization or maximization of an objective function. Some problems have several optimum points which all, should be computed. Niching method is presented to do so. However, its efficiency can be improved via combining it with Memetic algorithm. Therefore, in this paper, Memetic method is used to improve this method in terms of convergence rate and diversity. In the pr...