the capacitated clustering problem (ccp) is one of the most importantcombinational optimization problems that nowadays has many real applications inindustrial and service problems. in the ccp, a given n nodes with known demandsmust be partitioned into k distinct clusters in which each cluster is detailed by anode acting as a cluster center of this cluster. the objective is to minimize the sumof...

the recent years have witnessed an increasing attention to the methods of multiple attribute decision making in solving the problems of the real world due to their shorter time of calculation and easy application. one of these methods is the ‘permutation method’ which has a strong logic in connection with ranking issues, but when the number of alternatives increases, solving problems through th...

barrel vaults are attractive space structures that cover large area without intermediate supports. in this paper, the charged search system (css) optimization algorithm is employed for optimal design of barrel vaults. this method utilizes the governing laws of coulomb and gauss from electrostatics and the newtonian law of mechanics. the results demonstrate the efficiency of the discrete css alg...

protection systems have vital role in network reliability in short circuit mode and proper operating for relays. current transformer often in transient and saturation under short circuit mode causes mal-operation of relays which will have undesirable effects. therefore, proper and quick identification of current transformer saturation is so important. in this paper, an artificial neural network...

Nowadays, with extending applications of bi-layer metallic sheets in different industrial sectors, accurate specification of each layer is very prominent to achieve desired properties. In order to predict behavior of sheets under different forming modes and determining rupture limit and necking, the concept of Forming Limit Diagram (FLD) is used. Optimization problem with objective functions an...

In this paper we propose a new approach in genetic algorithm called distributed hierarchical genetic algorithm (DHGA) for optimization and pattern matching. It is eventually a hybrid technique combining the advantages of both distributed and hierarchical processes in exploring the search space. The search is initially distributed over the space and then in each subspace the algorithm works in a...

This work combines pattern search optimization with a statistical emulator based on Treed Gaussian Processes (TGP) to create a new hybrid algorithm. The goal is to use the global probabilistic view provided by TGP to inform the local pattern search and form a more intelligent optimization algorithm. We also propose ways in which the emulator can be used to gain information about the objective f...

This article introduces two swarm intelligent algorithms, a group search optimizer (GSO) and an artificial fish swarm algorithm (AFSA). A single intelligent algorithm always has both merits in its specific formulation and deficiencies due to its inherent limitations. Therefore, we propose a mixture of these algorithms to create a new hybrid optimization algorithm known as the group search-artif...

A family of comparison-based exact pattern matching algorithms is described. They utilize multi-dimensional arrays in order to process more than one adjacent text window in each iteration of the search cycle. This approach leads to a lower average time complexity by the cost of space. The algorithms of this family perform well for short patterns and middle size alphabets. In such case the shift...

An improved algorithm for integer pel motion estimation based on the block matching algorithm (BMA) is presented for use in a block-based video coding system. To achieve enhanced motion estimation performance, we propose an adaptive search pattern length for each iteration of the current macro block (MB). In addition, search patterns that must be checked are determined using directional informa...