Parallelisation of genetic algorithms for the 2-page crossing number problem

Genetic algorithms have been applied to solve the 2-page crossing number problem successfully, but since they work with one global population, the search time and space are limited. Parallelisation provides an attractive prospect to improve the efficiency and solution quality of genetic algorithms. This paper investigates the complexity of parallel genetic algorithms (PGAs) based on two evaluation measures: Computation-time to Communication-time and Population-size to Chromosomesize. Moreover, the paper unifies the framework of PGA models with the function PGA (subpopulation size; cluster size, migration period; topology), and explores the performance of PGAs for the 2-page crossing number problem

Implementation of Standard Genetic Algorithm on MIMD machines

Genetic Algorithms (GAs) have been implemented on a number of multiprocessor machines. In many cases the GA has been adapted to the hardware structure of the system. This paper describes the implementation of a standard genetic algorithm on several MIMD multiprocessor systems. It discusses the data dependencies of the different parts of the algorithm and the changes necessary to adapt the serial version to the parallel versions. Timing measurements and speedups are given for a common problem implemented on all machines

NERV: A Parallel Processor for Standard Genetic Algorithms

This paper describes the implementation of a standard genetic algorithm (GA) on the MIMD multiprocessor system NERV. It discusses the special features of the NERV hardware which can be utilized for an efficient implementation of a GA without changing the structure of the algorithm

Complex and dynamic population structures: synthesis, open questions, and future directions

The population structure of an evolutionary algorithm influences the dissemination and mixing of advantageous alleles, and therefore affects search performance. Much recent attention has focused on the analysis of complex population structures, characterized by heterogeneous connectivity distributions, non-trivial clustering properties, and degree-degree correlations. Here, we synthesize the results of these recent studies, discuss their limitations, and highlight several open questions regarding (1) unsolved theoretical issues and (2) the practical utility of complex population structures for evolutionary search. In addition, we will discuss an alternative complex population structure that is known to significantly influence dynamical processes, but has yet to be explored for evolutionary optimization. We then shift our attention toward dynamic population structures, which have received markedly less attention than their static counterparts. We will discuss the strengths and limitations of extant techniques and present open theoretical and experimental questions and directions for future research. In particular, we will focus on the prospects of "active linking,” wherein edges are dynamically rewired according to the genotypic or phenotypic properties of individuals, or according to the success of prior inter-individual interaction

A tutorial for competent memetic algorithms: Model, taxonomy and design issues

The combination of evolutionary algorithms with local search was named "memetic algorithms" (MAs) (Moscato, 1989). These methods are inspired by models of natural systems that combine the evolutionary adaptation of a population with individual learning within the lifetimes of its members. Additionally, MAs are inspired by Richard Dawkin's concept of a meme, which represents a unit of cultural evolution that can exhibit local refinement (Dawkins, 1976). In the case of MA's, "memes" refer to the strategies (e.g., local refinement, perturbation, or constructive methods, etc.) that are employed to improve individuals. In this paper, we review some works on the application of MAs to well-known combinatorial optimization problems, and place them in a framework defined by a general syntactic model. This model provides us with a classification scheme based on a computable index D, which facilitates algorithmic comparisons and suggests areas for future research. Also, by having an abstract model for this class of metaheuristics, it is possible to explore their design space and better understand their behavior from a theoretical standpoint. We illustrate the theoretical and practical relevance of this model and taxonomy for MAs in the context of a discussion of important design issues that must be addressed to produce effective and efficient MAs

Performance Analysis of Simulation-based Multi-objective Optimization of Bridge Construction Processes Using High Performance Computing

Bridges constitute a crucial component of urban highways due to the complexity and uncertain nature of their construction process. Simulation is an alternative method of analyzing and planning the construction processes, especially the ones with repetitive and cyclic nature, and it helps managers to make appropriate decisions. Furthermore, there is an inverse relationship between the cost and time of a project and finding a proper trade-off between these two key elements using optimization methods is important. Thus, the integration of simulation models with optimization techniques leads to an advancement in the decision making process. In addition, the large number of resources required in complex and large scale bridge construction projects results in a very large search space. Therefore, there is a need for using parallel computing in order to reduce the computational time of the simulation-based optimization. Most of the construction simulation tools need an integration platform to be combined with optimization techniques. Also, these simulation tools are not usually compatible with Linux environment which is used in most of the massive parallel computing systems or clusters. In this research, an integrated simulation-based optimization framework is proposed within one platform to alleviate those limitations. A master-slave (or global) parallel Genetic Algorithm (GA) is used as a parallel computing technique to decrease the computation time and to efficiently use the full capacity of the computer. In addition, sensitivity analysis is applied to identify the promising configuration for GA and analyzing the impact of GA parameters on the overall performance of the specific simulation-based optimization problem used in this research. Finally, a case study is implemented and tested on a server machine as well as a cluster to explore the feasibility of the proposed approach. The results of this research showed better performance of the proposed framework in comparison with other GA optimization techniques from the points of view of the quality of the optimum solutions and the computation time. Also, acceptable improvements in the computation time were achieved for both deterministic and probabilistic simulation models using master-salve parallel paradigm (8.32 and 20.3 times speedups were achieved using 12 cores, respectively). Moreover, performing the proposed framework on multiple nodes using a cluster system led to 31% saving on the computation time on average. Furthermore, the GA was tuned using sensitivity analyses which resulted in the best parameters (500 generations, population size of 200 and 0.7 as the crossover probability)

An Object-Oriented Programming Environment for Parallel Genetic Algorithms

This thesis investigates an object-oriented programming environment for building parallel applications based on genetic algorithms (GAs). It describes the design of the Genetic Algorithms Manipulation Environment (GAME), which focuses on three major software development requirements: flexibility, expandability and portability. Flexibility is provided by GAME through a set of libraries containing pre-defined and parameterised components such as genetic operators and algorithms. Expandability is offered by GAME'S object-oriented design. It allows applications, algorithms and genetic operators to be easily modified and adapted to satisfy diverse problem's requirements. Lastly, portability is achieved through the use of the standard C++ language, and by isolating machine and operating system dependencies into low-level modules, which are hidden from the application developer by GAME'S application programming interfaces. The development of GAME is central to the Programming Environment for Applications of PArallel GENetic Algorithms project (PAPAGENA). This is the principal European Community (ESPRIT III) funded parallel genetic algorithms project. It has two main goals: to provide a general-purpose tool kit, supporting the development and analysis of large-scale parallel genetic algorithms (PGAs) applications, and to demonstrate the potential of applying evolutionary computing in diverse problem domains. The research reported in this thesis is divided in two parts: i) the analysis of GA models and the study of existing GA programming environments from an application developer perspective; ii) the description of a general-purpose programming environment designed to help with the development of GA and PGA-based computer programs. The studies carried out in the first part provide the necessary understanding of GAs' structure and operation to outline the requirements for the development of complex computer programs. The second part presents GAME as the result of combining development requirements, relevant features of existing environments and innovative ideas, into a powerful programming environment. The system is described in terms of its abstract data structures and sub-systems that allow the representation of problems independently of any particular GA model. GAME's programming model is also presented as general-purpose object-oriented framework for programming coarse-grained parallel applications. GAME has a modular architecture comprising five modules: the Virtual Machine, the Parallel Execution Module, the Genetic Libraries, the Monitoring Control Module, and the Graphic User Interface. GAME's genetic-oriented abstract data structures, and the Virtual Machine, isolates genetic operators and algorithms from low-level operations such as memory management, exception handling, etc. The Parallel Execution Module supports GAME's object- oriented parallel programming model. It defines an application programming interface and a runtime library that allow the same parallel application, created within the environment, to run on different hardware and operating system platforms. The Genetic Libraries outline a hierarchy of components implemented as parameterised versions of standard and custom genetic operators, algorithms and applications. The Monitoring Control Module supports dynamic control and monitoring of simulations, whereas the Graphic User Interface defines a basic framework and graphic 'widgets' for displaying and entering data. This thesis describes the design philosophy and rationale behind these modules, covering in more detail the Virtual Machine, the Parallel Execution Module and the Genetic Libraries. The assessment discusses the system's ability to satisfy the main requirements of GA and PGA software development, as well as the features that distinguish GAME from other programming environments

Genetic-based unit commitment algorithm

The National Energy Policy Act of 1992 allows open access to transmission lines. The electric utility industry is in the transition from operating in a monopolistic environment to one that is less regulated. For an electric utility to operate in this new environment, a new algorithm is needed to optimally schedule generating units in the needed response time of an electric power broker. Past methods of unit commitment scheduling are either too computationally slow or do not produce optimal unit commitment schedules. Unit commitment scheduling is the problem of determining the optimal set of generating units within a power system to be used during the next one to seven days. Mathematically, unit commitment scheduling is a mixed integer problem typically with thousands of variables and a large, complex set of constraints;This dissertation investigates applying a genetic algorithm to the unit commitment scheduling problem. Genetic algorithms are an optimization technique based on the operations observed in natural selection and genetics. The resulting algorithm of this research has three attributes that make it very attractive for unit commitment scheduling. The first attribute is the algorithm can consistently find good unit commitment schedules in a reasonable amount of computation time. The second attribute is the algorithm can produce multiple unit commitment schedules in one execution. The last attribute is that the algorithm performance increases with the addition of true costed constraints. Results are given for three different utilities for 24 and 48 hour unit commitment schedules and are compared to DYNAMICS