PDoublePop: An implementation of parallel genetic algorithm for function optimization

Abstract A software for the implementation of parallel genetic algorithms is presented in this article. The underlying genetic algorithm is aimed to locate the global minimum of a multidimensional function inside a rectangular hyperbox. The proposed software named PDoublePop implements a client–server model for parallel genetic algorithms with advanced features for the local genetic algorithms such as: an enhanced stopping rule, an advanced mutation scheme and periodical application of a local search procedure. The user may code the objective function either in C++ or in Fortran77. The method is tested on a series of well-known test functions and the results are reported. Program summary Program title: PDoublePop Catalogue identifier: AFBJ_v1_0 Program summary URL: http://cpc.cs.qub.ac.uk/summaries/AFBJ_v1_0.html Program obtainable from: CPC Program Library, Queen’s University, Belfast, N. Ireland Licensing provisions: GNU GPL v3 No. of lines in distributed program, including test data, etc.: 26048 No. of bytes in distributed program, including test data, etc.: 161286 Distribution format: tar.gz Programming language: GNU-C++, GNU-C, GNU Fortran - 77, MPI. Computer: The tool has been tested on Linux and FreeBSD. The tool is designed to be portable in all systems running the GNU C++ compiler, with Open MPI or LAM MPI. Operating system: Any running the GNU C++ compiler. Has the code been vectorised or parallelized?: Yes RAM: 200KB Classification: 4.9, 4.12, 6.5. Nature of problem: A series of problems in science and engineering usually can be formulated as a problem of minimizing a function of many variables. The so called local optimization techniques are frequently trapped in local minima, that it sub optimal solutions. For that reason researchers should use more advanced methods that aim to estimate the global minimum of the function. Solution method: A stopping rule and a periodical application of local search are utilized in conjunction with parallel genetic algorithms in order to solve optimization problems. The parallelization is performed using the MPI programming interface. Running time: Depending on the objective function.

[1]  Soroosh Sorooshian,et al.  Multi-objective global optimization for hydrologic models , 1998 .

[2]  M. J. D. Powell,et al.  A tolerant algorithm for linearly constrained optimization calculations , 1989, Math. Program..

[3]  J. Tersoff,et al.  New empirical approach for the structure and energy of covalent systems. , 1988, Physical review. B, Condensed matter.

[4]  David J. Evans,et al.  Volumetric segmentation of brain images using parallel genetic algorithms , 2002, IEEE Transactions on Medical Imaging.

[5]  T. Devi Prasad,et al.  Multiobjective Genetic Algorithms for Design of Water Distribution Networks , 2004 .

[6]  Hojjat Adeli,et al.  Bilevel Parallel Genetic Algorithms for Optimization of Large Steel Structures , 2001 .

[7]  S. Sorooshian,et al.  Effective and efficient global optimization for conceptual rainfall‐runoff models , 1992 .

[8]  Panos M. Pardalos,et al.  Optimization methods for computing global minima of nonconvex potential energy functions , 1994, J. Glob. Optim..

[9]  Zwe-Lee Gaing,et al.  Particle swarm optimization to solving the economic dispatch considering the generator constraints , 2003 .

[10]  David E. Goldberg,et al.  Genetic algorithms and Machine Learning , 1988, Machine Learning.

[11]  Ioannis G. Tsoulos,et al.  Modifications of real code genetic algorithm for global optimization , 2008, Appl. Math. Comput..

[12]  Zbigniew Michalewicz,et al.  Genetic Algorithms + Data Structures = Evolution Programs , 1996, Springer Berlin Heidelberg.

[13]  M. M. Ali,et al.  Integrated crossover rules in real coded genetic algorithms , 2007, Eur. J. Oper. Res..

[14]  Yaroslav D. Sergeyev,et al.  Algorithm 829: Software for generation of classes of test functions with known local and global minima for global optimization , 2003, TOMS.

[15]  H. Scheraga,et al.  Global optimization of clusters, crystals, and biomolecules. , 1999, Science.

[16]  Greg Burns,et al.  LAM: An Open Cluster Environment for MPI , 2002 .