In textile industry, marker planning is one of the main operations in the cutting fabric stage. Marker packing is usually used to maximize cloth exploitation and minimize its waste. In this research, a method is used based on new found meta-heuristic imperialist competitive algorithm (ICA) and Bottom-Left-Fill Algorithm (BLF) to achieve optimal marker packing. Function of the proposed method wa...

Hongyuan Gao*,Shibo Zhang,Ming Diao, and Yanan Du College of Information and Communication Engineering Harbin Engineering University Harbin, P. R. China [email protected], [email protected], diaoming@ hrbeu.edu.cn,[email protected] Abstract—It is a classical integer optimization difficulty to design optimal selection scheme in cooperative relay networks considering co-channel interfer...

optimizing the database queries is one of hard research problems. exhaustive search techniques like dynamic programming is suitable for queries with a few relations, but by increasing the number of relations in query, much use of memory and processing is needed, and the use of these methods is not suitable, so we have to use random and evolutionary methods. the use of evolutionary methods, beca...

Binary optimization problems are in the most case the NP-hard problems that call to satisfy an objective function with or without constraints. Various optimization problems can be formulated in binary expression whither they can be resolved in easier way. Optimization literature supplies a large number of approaches to find solutions to binary hard problems. However, most population-based algor...

This paper describes the so-called Differential Ant-Stigmergy Algorithm (DASA), which is an extension of the Ant-Colony Optimization for continuous domain. A performance study of the DASA on a benchmark of real-parameter optimization problems is presented. The DASA is compared with a number of evolutionary optimization algorithms including covariance matrix adaptation evolutionary strategy, dif...

It is well-known that, given inorder traversal along with one of the preorder or postorder traversals of a binary tree, the tree can be determined uniquely. Several algorithms have been proposed to reconstruct a binary tree from its inorder and preorder traversals. There is one study to reconstruct a binary tree from its inorder and postorder traversals, and this algorithm takes running time of...

This article presents a new system for automatically constructing and training radial basis function networks based on original evolutionary computing methods. This system, called Genetic Algorithm Radial Basis Function Networks (GARBFN), is based on two cooperating genetic algorithms. The first algorithm uses a new binary coding, called basic architecture coding, to get the neural architecture...

The optimization of input variables (typically feeding trajectories over time) in fed-batch fermentations has gained special attention, given the economic impact and the complexity of the problem. Evolutionary Computation (EC) has been a source of algorithms that have shown good performance in this task. In this chapter, Differential Evolution (DE) is proposed to tackle this problem and quite p...

This paper describes the application of Evolutionary Algorithms (EAs) to the optimisation of a simplified supply chain in an integrated production-inventory-distribution system. The performance of four EAs (Genetic Algorithm (GA), Evolutionary Programming (EP), Evolution Strategies (ES) and Differential Evolution (DE)) was evaluated with numerical sumulations. Results were also compared with ot...