Abstract: Constraint handling is one of the most difficult parts encountered in practical engineering design optimizations. Different kinds of methods were proposed for handling constraints namely, genetic algorithm, self-adaptive penalty approach and other evolutionary algorithms. Particle Swarm Optimization (PSO) efficiently solved most nonlinear optimization problems with inequity constraint...

In this paper, we present a complex distribution network design problem in supply chain system which includes location and inventory decisions. Customers’ demand is generated randomly and each distribution center maintains a certain amount of safety stock in order to achieve a certain service level for the customers it services. Unlike most of past research, our model allows for multiple levels...

In this paper we introduce a method for optimisation of strategic tasks using an approximation algorithm. We propose the mathematical model and algorithm for solving this problem near optimality. An overall motivation for the development of the proposed algorithm is discussed with detailed e ciency analysis. From the end users' perspective the proposed method has practical application because i...

This paper presents a new genetic local search algorithm for the graph coloring problem. The algorithm combines an original crossover based on the notion of union of independent sets and a powerful local search operator (tabu search). This new hybrid algorithm allows us to improve on the best known results of some large instances of the famous Dimacs benchmarks.

The minimization of elements in a non-uniform antenna array is critical in some practical engineering applications such as satellite and mobile communications. However, due to the complexity in the synthesis of an antenna array, the available techniques are not equally successful for reducing the element number of a nonuniform antenna array with as few elements as possible with respect to both ...

This paper describes an automated tabu search based method for drawing general simple graph layouts with straight lines. To our knowledge, this is the first time tabu methods have been applied to graph drawing. We formulated the task as a multi-criteria optimization problem with a number of metrics which are used in a weighted fitness function to measure the aesthetic quality of the graph layou...

This paper presents a meta-heuristic optimization algorithm, Tabu Search (TS), and describes how it can be used to solve a wide variety of chemical engineering problems. Modifications to the original algorithm and constraint handling techniques are described and integrated to extend its applicability. All components of TS are described in detail. Initial values for each key parameter of TS are ...

Given an undirected graph G = (V,E) with vertex set V = {1, ..., n} and edge set E ⊆ V × V . Let w : V → Z be a weighting function that assigns to each vertex i ∈ V a positive integer. The maximum weight clique problem (MWCP) is to determine a clique of maximum weight. This paper introduces a tabu search heuristic whose key features include a combined neighborhood and a dedicated tabu mechanism...

In this paper, we propose an integrated Genetic Algorithm with Hill Climbing to solve the matrix bandwidth minimization problem, which is to reduce bandwidth by permuting rows and columns resulting in the nonzero elements residing in a band as close as possible to the diagonal. Many algorithms for this problem have been developed, including the wellknown CM and GPS algorithms. Recently, Marti e...

Now-a-days different meta-heuristic approaches, their variants and hybrids are being applied for solving Combinatorial Optimization Problems (COP). In this paper Resource Constrained Project Scheduling Problem (RCPSP) has been presented as a COP. This is a common problem for many construction projects. It is highly constrained and is categorized as a NP-hard problem. In our earlier work Simulat...