Co-operation in the Parallel Memetic Algorithm
نویسندگان
چکیده
منابع مشابه
A Memetic Algorithm for Parallel Machine Scheduling
This paper focuses on the problem of scheduling a set of independent jobs with setup times and job splitting, on a set of identical parallel machines such that total tardiness is minimized. In this study, it is assumed that a job can be split into sub-jobs and these sub-jobs can be processed independently on parallel machines. Because the problem is NP-hard, a memetic algorithm (MA) is proposed...
متن کاملThe Compact Memetic Algorithm
Optimization by probabilistic modeling is a growing research field in evolutionary computation. An example is the compact genetic algorithm (cGA), in which the population of a genetic algorithm (GA) is represented as a probability distribution over the set of solutions. Both cGA algorithm and the order-one behavior of a simple GA with uniform crossover are operationally equivalent. The cGA is m...
متن کاملMulti-GPU Parallel Memetic Algorithm for Capacitated Vehicle Routing Problem
The goal of this paper is to propose and test a new memetic algorithm for the capacitated vehicle routing problem in parallel computing environment. In this paper we consider a simple variation of the vehicle routing problem in which the only parameter is the capacity of the vehicle and each client only needs one package. We analyze the efficiency of the algorithm using the hierarchical Paralle...
متن کاملA Parallel Memetic Algorithm for Solving Optimization Problems
In this paper we examine 10 different functions in order (a) to test specific parameter of a parallel execution of memetic algorithms and (b) to evaluate the general computational behavior of MAs. The available theoretical analysis on memetic algorithms does not offer a tool which could help in a generalized adjustment of control parameters, leaving the choice of the proper operators, parameter...
متن کاملCo-operation of Processes in Parallel Simulated Annealing
The co-operation of parallel simulated annealing processes to solve the vehicle routing problem with time windows (VRPTW) is considered. The objective is to investigate how the number of parallel processes and the frequency of processes co-operation influence the accuracy of solutions to the VRPTW. The accuracy of solutions is measured by their proximity to the best known solution.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: International Journal of Parallel Programming
سال: 2014
ISSN: 0885-7458,1573-7640
DOI: 10.1007/s10766-014-0343-4