In this paper we propose a parallel memetic algorithm which combines population-based method with guided local search (GLS) procedure. In the proposed algorithm, a GLS procedure is applied to each solution generated by genetic operations. The performance of proposed method compared with parallel genetic approaches (i.e. global model, migration model for GA). The parallel implementation is based...

This paper proposes a new algorithm of a simulated annealing (SA): Parallel Simulated Annealing using Genetic Crossover (PSA/GAc). The proposed algorithm consists of several processes, and in each process SA is operated. The genetic crossover is used to exchange information between solutions at fixed intervals. While SA requires high computational costs, particularly in continuous problems, thi...

Parallel genetic algorithms techniques have been used in a variety of computer engineering and science areas. This paper presents a parallel genetic algorithm to solve the geometrically constrained site layout problem that involves coordinating the use of limited space to accommodate temporary facilities subject to geometric constraints. The algorithm is parallelized based on a message passing ...

In this paper, we present a task scheduling heuristic, based on a parallel genetic algorithm (PGA). The algorithm schedules parallel programs, represented as directed acyclic graphs (DAGs), onto multi-processor systems with dynamic interconnection networks (DIN). It combines PGA with list scheduling approach and takes into account inter-processor communication cost, link contention in the DIN a...

in the research, six degrees of freedom hexapod parallel machine tool is studied and investigated. jacobian matrix is developed by cinematic relations differentiation and using weighted coefficient method, dimensional analysis operation is carried out on jacobian matrix. geometric parameters of cartesian robot workspace are optimized, considering a minimum allowable rotation about three axes, a...

Membrane computing is a branch of natural computing. Several studies have recently attempted to utilize the structure of membrane computing to improve intelligent algorithms. These studies have applied communication rules in membrane models to facilitate information exchange between membranes, thereby improving the performance of those algorithms. However, parallel membrane computing has not ye...

evolutionary algorithms are some of the most crucial random approaches tosolve the problems, but sometimes generate low quality solutions. on the otherhand, learning automata are adaptive decision-making devices, operating onunknown random environments, so it seems that if evolutionary and learningautomaton based algorithms are operated simultaneously, the quality of results willincrease sharpl...

determining the optimal location of wells with the aid of an automated search algorithm is a significant and difficult step in the reservoir development process. it is a computationally intensive task due to the large number of simulation runs required. therefore,the key issue to such automatic optimization is development of algorithms that can find acceptable solutions with a minimum number of...

one main group of a transportation network is a discrete hub covering problem that seeks to minimize the total transportation cost. this paper presents a multi-product and multi-mode hub covering model, in which the transportation time depends on travelling mode between each pair of hubs. indeed, the nature of products is considered different and hub capacity constraint is also applied. due to ...