Parallel Genetic Algorithm Research Articles

A new hybrid parallel genetic algorithm for multi-destination path planning problem

This paper proposes a new parallel approach of multi objective genetic algorithm for path planning problem. The main contribution of this work is to reduce the population size that effect in decreasing processing times of finding the optimum path for multi destination problem. This is achieved by combining the local population of island parallel approach and global population of global parallel approach. Various experiments have been conducted to evaluate the new hybrid parallel genetic algorithm (HPGA) in solving multi-objective path planning problems. Three different test areas with 2 destinations were used to assess the performance of HPGA. Furthermore, this work compares HPGA and sequential genetic algorithm (SeqGA), as well as compared to other existing parallel genetic algorithm (GA) methods. From experimental results show that proposed HPGA outperform others, in term of processing time i.e., up to 3.6 times speedup faster, and lowest GA parameter values. This proposed HPGA can be utilized to design robots with fast and consistent path planning, especially with various obstecles.

Modelling of flue gas injection and collaborative optimization of multi-injection parameters for efficient coal-based carbon sequestration combined with BP neural network parallel genetic algorithms

Cooperative equalization among the injection parameters can control the economic objective function to ensure the efficiency of gas-mixture-enhanced coalbed methane recovery (GM-ECBM). This study first proposed and validated a refined thermal-hydro-mechanical-chemical (THMC) coupling model with a convenient permeability model. Based on GM-ECBM numerical calculation results under different combinations of injection parameters, different types of cost-income objective functions, including different costs and incomes, were optimized by parallelly applying a genetic algorithm and backpropagation neural network (GA-BP). Using the recovery rate as the index, a small inter-well distance and a large injection pressure can increase the optimal CO2 proportion. The effectiveness of enhancing the injection temperature was significantly correlated with both inter-well distance and the injection pressure. Cooperative equalization among the injection parameters can explain different viewpoints of different scholars on the temperature effect. Large Henry’s law constants resulted in low carbon sequestration and coalbed methane (CH4) production but did not affect the optimal CO2 proportion. High carbon sequestration and CH4 prices corresponded to small inter-well distances and large injection pressure. Based on the objective function, the optimal inter-well distance and the injection temperature were 175–220 m and 305.5–311.5 K, respectively. The volumetric adsorption-induced expansion coefficient (VAEC) of CO2 determined the optimal CO2 proportion, the optimization feasibility of the injection scheme, and the applicability of GM-ECBM.

A priority-based self-guided serial–parallel genetic algorithm for low-dose computed tomography

Computed tomography (CT) is a non-destructive evaluation technique to know the internal structure of the objects under scan. It has numerous applications in engineering as well as in the medical field. The prime objective of this manuscript is to reduce the radiation dose to the object under scanning and to reconstruct the low-noise CT images, even in limited-view projections data scenarios. The present manuscript proposes a novel priority-based self-guided serial-parallel hybrid genetic algorithm for low-dose CT reconstruction. The current algorithm combines serial and parallel processing elements to reduce the loss of diversity in the population and increase the convergence rate. The proposed algorithm uses a novel priority-based self-guided competition operator. It consists of two approaches for maintaining exploration and exploitation tradeoffs. Here, the first approach uses serial processing, whereas the second approach uses parallel processing. The algorithm also uses priority-based hybrid crossover (PHCO) and adaptive priority-based mutation operator (PMO) to generate the most suitable offspring in every generation. Experimental results reveal that the presented algorithm produces satisfactory results with limited-view projections. The presented algorithm also outperforms other limited-view CT reconstruction algorithms.

An MPI-based parallel genetic algorithm for multiple geographical feature label placement based on the hybrid of fixed-sliding models

ABSTRACT Multiple Geographical Feature Label Placement (MGFLP) has been a fundamental problem in geographic information visualization for decades. Moreover, the nature of label positioning has proven to be an Nondeterministic polynomial-time hard (NP-hard) problem. Although advances in computer technology and robust approaches have addressed the problem of label positioning, the lengthy running time of MGFLP has not been a major focus of recent studies. Based on a hybrid of the fixed-position and sliding models, a Message Passing Interface (MPI) parallel genetic algorithm is proposed in the present study for MGFLP to label mixed types of geographical features. To evaluate the quality of label placement, a quality function is defined based on four quality metrics: label-feature conflict; label-label conflict; label association with the corresponding feature; label position priority for all three types of features. The experimental results show that the proposed algorithm outperforms the DDEGA, DDEGA-NM, and Parallel-MS in both label placement quality and computation time efficiency. Across three datasets, compared to Parallel-MS, running times decreased from 118.45 to 8.34, 45.98 to 3.51, and 20.01 to 0.43 min, with further reductions in label-label and label-feature conflicts.

Determining the swarm parameters of gases considering ion kinetics by parallel genetic algorithm on GPU platform

In this work, a convenient and efficient method is proposed to determine swarm parameters considering ion kinetics from pulsed Townsend (PT) measurements. First, a physical model was presented to describe the development of PT discharge considering electron detachment and ion conversion reactions. A numerical solution to the model was also proposed. In order to assess the precision of our calculations, we presented the calculated electronic and ionic transients derived from our model for different cases. Then, a genetic algorithm (GA) was proposed to find a set of swarm parameters, under which the deviation between the simulated current waveform and the actual measured current waveform is minimum. It is time-consuming to simulate a single waveform, and since a large number of waveforms need to be simulated in the GA, graphic processing unit-based parallel computing is used to improve computing efficiency. Finally, the swarm parameters of dry air considering electron detachment and ion conversion processes using the method were obtained and they are in good agreement with those in references.

Dynamic Model Inference of Gene Regulatory Network based on Hybrid Parallel Genetic Algorithm and Threshold Qualification Method

Gene regulation is the process by which various substances in cells regulate the behaviour of gene expression, thereby controlling almost all cellular activities. Therefore, studying gene regulation not only helps to uncover the internal laws governing life processes but also plays a crucial role in predicting, diagnosing, treating, and designing drugs for genetic diseases. By utilizing multi-source biological information such as gene expression profiles, transcription factor information, and protein interaction data, a network model can be developed to depict the regulatory relationships between genes, facilitating further research. To address the limitations of traditional gene regulatory network construction methods, a novel dynamic model has been created by combining hybrid genetics and threshold restriction. This model comprises two parts: solution space reduction and parameter fitting. During solution space reduction, singular value decomposition is employed to define a mathematically feasible gene regulatory network, reducing unnecessary calculations. Subsequently, the control genes of each gene are constrained within a certain range using threshold limitation, enhancing computational efficiency while adhering to bioinformatics principles. In the parameter fitting phase, parallel genetic algorithms are utilized to expediently optimize the entire solution space. The mountain climbing method is then applied to solve problems meticulously within a limited scope, improving calculation accuracy. In this study, this approach was applied to establish genetic regulatory systems for complex skin melanoma and type 2 diabetes. Through comparison with actual networks, the validity of the method was confirmed. Compared to traditional genetic and particle swarm optimization methods, the effectiveness of the proposed method was verified. This paper models the intricate mechanism of gene regulation and elucidates the regulatory process involving genes, proteins, and small biological molecules in greater detail than other models, aligning more closely with intracellular dynamics laws.

Mechanical strength distribution in Geminid meteoroids derived via fireball modeling

Context. Geminids are the most active annual meteor shower observed on Earth. Their parent is an active asteroid, (3200) Phaethon, which is a target of the planned DESTINY+ mission of the Japan Aerospace Exploration Agency (JAXA). The exact physical nature of (3200) Phaethon and Geminids is still debated. Aims. This paper is devoted to fragmentation modeling of bright Geminid fireballs, which should reveal information about the structure of centimeter-sized Geminid meteoroids. These fireballs were observed by the European Fireball Network (EN) over the past few years. We aim to describe their disintegration cascade in the atmosphere and their mechanical properties, and to derive their precise initial masses and velocities. Methods. We used a semi-empirical fragmentation model that employs an automatic procedure based on parallel genetic algorithms to determine the aerodynamic pressures at which a meteoroid and its parts fragment. This serves as a proxy for the mechanical strength of the body and its subsequent fragments. It enabled us to derive the minimum, median, and maximum mechanical strength and the strength distribution inside the meteoroid and reveal its internal structure. Results. We find that the Geminids begin to crumble at pressures 1–100 kPa, with the strongest parts reaching pressures of between 0.4 and 1.55 MPa before fragmenting. Knowing the spectral type of (3200) Phaethon (a B-type asteroid, part of the C complex), we conclude that the Geminids are made of compact and coherent carbonaceous material. We also find that the minimum aerodynamic pressure that causes the fragmentation of Geminids increases with increasing entry mass of Geminids. In contrast, the median aerodynamic pressure decreases as their entry mass increases. The spectra of all the observed Geminid fireballs show normal content and little variation in terms of sodium.

Spatial multi‐objective optimization of primary healthcare facilities: A case study in Singapore

AbstractPrimary healthcare plays a pivotal role in enhancing health conditions. In Singapore, such services are predominantly manifested through the implementation of the Community Health Assistance Scheme (CHAS). CHAS is an initiative aimed at providing fundamental preventive and therapeutic services, especially for those seniors and low‐income adults with chronic diseases. In spite of considerable efforts in policy and research in this domain, there is a dearth of studies focusing on the spatial optimization of these primary healthcare services. In this study, an innovative multi‐objective medical service facility siting model has been developed based on coarse‐grained parallel genetic algorithm to address the intricate challenges associated with the optimization of locations for CHAS clinics. The proposed optimization model aims to simultaneously maximize accessibility, minimize inequity, and minimize the number of clinics. The successful application of this model in the siting of CHAS clinics in Singapore demonstrates its effectiveness in enhancing residents' access to healthcare services. Apart from its novel academic contributions to the field of spatial optimization of primary healthcare facilities in general, we have also discussed the inherent limitations and identified certain aspects as the future directions of this research.

Dynamic repositioning in bike-sharing systems with uncertain demand: An improved rolling horizon framework

The bike-sharing system (BSS) serves as a vital shared mobility mechanism, providing first- and last-mile services in urban transportation. However, one ongoing challenge in the BSS is the spatiotemporal imbalance caused by fluctuating user demand. To address this issue, this paper studies a dynamic bike repositioning problem under scenario-based demand to achieve a balance in inventory levels for electronic fences. Specifically, a multi-period two-stage stochastic model is proposed to make the trade-off between operational costs and service quality. The model incorporates a vehicle no-return (VNR) strategy, which allows vehicles to remain at the last station at the end of each period, awaiting the next repositioning task. To solve the model, an improved rolling horizon framework is introduced to effectively handle the temporal dimension complexity of the multi-period problem. Then a customized hybrid heuristic algorithm based on parallel genetic algorithm and variable neighborhood search is developed to obtain high-quality solutions. To validate the effectiveness and applicability of the proposed method, small-scale and practical-scale numerical experiments are specifically conducted based on real-world BSS data from Beijing, China. The results demonstrate the proposed method (i) creates a substantial reduction in the number of unmet demands when multiple scenarios potentially occur compared to the determined model, (ii) yields an average reduction of 29.04% in operational costs compared to the scheme without the VNR strategy, (iii) overcomes the short-sightedness inherent in the conventional single-period rolling horizon approach, exhibiting closer to optimal performance, and (iv) is superior to baseline approaches in terms of solution quality and efficiency.

Optimal allocation of enterprise marketing resources based on hybrid parallel genetic algorithm and simulated annealing algorithm

Abstract Aiming at minimizing the use of marketing resources, this article establishes the mathematical model of marketing resources allocation, designs the algorithm of marketing resources allocation, and compares the examples. An improved heuristic algorithm considering tilt angle matching is proposed and used as a local search algorithm for enterprise marketing resources. We design an innovative optimization strategy that incorporates the concept of tilt angle matching to enhance the local search efficiency of enterprise marketing resource allocation. In addition, we have introduced a novel parallel grouping genetic algorithm (PGGA), which utilizes grouping coding and exon crossover to further enhance the search and optimization efficiency of the solution. PGGA is improved by using adaptive parameters to form IPGGA, which improves the efficiency and convergence speed of enterprise marketing resource allocation. The annealing function of the simulated annealing algorithm is improved, and a model is constructed to solve the problem of enterprise marketing resource allocation. Simulated annealing algorithm is introduced to solve the problem of marketing resource allocation, and the framework of simulated annealing algorithm is analyzed. To solve the problem of fast decay rate of simulated annealing algorithm, Doppler effect function is used to optimize the algorithm. This article mainly uses qualitative and quantitative analysis methods to conduct in-depth research on enterprise marketing resource allocation. It focuses on the planning and allocation of enterprise marketing resources. Through IPGGA-ISAA research and analysis of all kinds of data of enterprise marketing resources, the present situation, efficiency, and main problems of enterprise marketing resources allocation are discussed and analyzed more deeply. Compared with other algorithms, IPGGA-ISAA can better analyze the causes of problems and provide better marketing resource allocation schemes for enterprises.

Optimization of Adaptive Active Support Parameters for Large Deformation Prestressed Anchor Ropes in Soft Rock Tunnels Using Genetic Algorithm Based Computer Applications

The large deformation of soft rock tunnel is an important problem to be solved urgently with the development of engineering technology. In order to improve the application effect of prestressed anchor cable adaptive active support system, this paper puts forward an optimization method based on adaptive genetic algorithm, reviews the research status of prestressed anchor support in soft rock tunnel, and analyzes and evaluates the existing methods. This paper introduces the construction process of AGA model, establishes the problem description model and genetic optimization algorithm selection model, and constructs the adaptive active support model of prestressed anchor cable. The model adopts an optimization algorithm with a total of 100 iterations. The Simple Genetic Algorithm and Parallel Genetic Algorithm are selected to evaluate the anchoring force, the control effect of surrounding rock displacement, the erosion of supporting structure and the construction time by comparative test. The test results show that AGA has a good effect on the anchoring force, the minimum anchoring force is 457 kN, and the displacement of surrounding rock is controlled within 1.21-1.59mm, which has a good influence on the quality of supporting structure and the construction completion time. Finally, the application of AGA model in parameter optimization of prestressed anchor cable in soft rock tunnel is summarized, and the future research direction is put forward.

Biased random-key genetic algorithm for the job sequencing and tool switching problem with non-identical parallel machines

We address the job sequencing and tool switching problem associated with non-identical parallel machines – a variation of the well-known sequencing and switching problem (SSP) better adapted to reflect the challenges in modern production environments. The NP-hard problem is approached by considering two isolated objective functions: the minimization of the makespan and the minimization of the total flow time. We present two versions of a parallel biased random-key genetic algorithm hybridized with tailored local search procedures that are organized using variable neighborhood descent. The proposed methods are compared with state-of-the-art methods by considering 640 benchmark instances from literature. For both objective functions considered, the proposed methods consistently outperform the compared methods. All known optimal values for both objectives are achieved, and a substantial gap is reported for all instance groups when compared with the best previously published solution values.

Markov-based reliability model for a mixed redundant system and parallel genetic algorithm with knowledge archives for a redundancy allocation problem

Markov-based reliability model for a mixed redundant system and parallel genetic algorithm with knowledge archives for a redundancy allocation problem

Reliability evaluation and optimization design method of piezoelectric actuator vibration suppression system

As an effective means of structural vibration suppression, piezoelectric actuator vibration suppression system(PAVSS) has been gradually applied in structural vibration control. However, the performance degradation or failure of piezoelectric actuator under long service life will lead to the degradation of service reliability of PAVSS, so the scheme obtained by deterministic optimization method is difficult to ensure the service reliability. Aiming at the reliability evaluation and optimal design of PAVSS in service, the failure mechanism considering of the performance degradation or failure of piezoelectric actuator is analyzed, and the reliability evaluation method based on nested sampling and weighted statistics is constructed, which solves the reliability evaluation problem of PAVSS with the characteristics of load-sharing and redundancy. A reliability-based optimization method based on master-slave parallel genetic algorithm is proposed to optimize the position and angle of the actuators. At last, the feasibility and effectiveness of the proposed method are proved by an example, which not only provides a theoretical basis for the high reliability design of PAVSS in service, but also provides a new solution for the engineering problem of structural vibration control.

Comparison of Parallel Genetic Algorithm and Particle Swarm Optimization for Parameter Calibration in Hydrological Simulation

ABSTRACT Parameter calibration is an important part of hydrological simulation and affects the final simulation results. In this paper, we introduce heuristic optimization algorithms, genetic algorithm (GA) to cope with the complexity of the parameter calibration problem, and use particle swarm optimization algorithm (PSO) as a comparison. For large-scale hydrological simulations, we use a multilevel parallel parameter calibration framework to make full use of processor resources, and accelerate the process of solving high-dimensional parameter calibration. Further, we test and apply the experiments on domestic supercomputers. The results of parameter calibration with GA and PSO can basically reach the ideal value of 0.65 and above, with PSO achieving a speedup of 58.52 on TianHe-2 supercomputer. The experimental results indicate that using a parallel implementation on multicore CPUs makes high-dimensional parameter calibration in large-scale hydrological simulation possible. Moreover, our comparison of the two algorithms shows that the GA obtains better calibration results, and the PSO has a more pronounced acceleration effect.

Parallel-Computing-Based Calibration for Microscopic Traffic Simulation Model

Microscopic traffic simulation is vital to assess the performances of various traffic operation and management schemes. Microscopic traffic simulation is usually not parameter-free, and it relies on independent parameters to predict traffic evolution. Thus, parameter calibration is indispensable to conveying trustworthy simulation results. Heuristic algorithms are widely used for parameter calibration. Its logic is for achieving iterative optimization through continuous trial-and-error simulations. This process is time-consuming and usually takes several hours, making the calibration unable to meet the requirements of speed and efficiency. In recent years, parallel computing technology has been gradually applied in the engineering realm, which makes rapid calibration possible. Following the three steps of parallel framework selection, algorithm bottleneck identification, and subtask load balancing, this paper designs and implements the parallelization of genetic algorithm and particle swarm optimization (PSO) calibration algorithms. Finally, the proposed parallel framework is applied to simulation parameter calibration of a section of a 5 km long highway in Australia, and the effectiveness of parallel computing is evaluated from the two dimensions of reduction in calibration computational time and scalability. The results show that the proposed parallel calibration algorithm can shorten the 5 h calibration process to less than 1 h, reducing the calibration time by 80%. The parallel PSO calibration algorithm has better scalability, and its acceleration effect is better when more processors are used.

Cluster-MLP: An Active Learning Genetic Algorithm Framework for Accelerated Discovery of Global Minimum Configurations of Pure and Alloyed Nanoclusters.

Structural characterization of nanoclusters is one of the major challenges in nanocluster modeling owing to the multitude of possible configurations of arrangement of cluster atoms. The genetic algorithm (GA), a class of evolutionary algorithms based on the principles of natural evolution, is a commonly employed search method for locating the global minimum configuration of nanoclusters. Although a GA search at the DFT level is required for the accurate description of a potential energy surface to arrive at the correct global minimum configuration of nanoclusters, computationally expensive DFT evaluation of the significantly larger number of cluster geometries limits its practicability. Recently, machine learning potentials (MLP) that are learned from DFT calculations gained significant attention as computationally cheap alternative options that provide DFT level accuracy. As the accuracy of the MLP predictions is dependent on the quality and quantity of the training DFT data, active learning (AL) strategies have gained significant momentum to bypass the need of large and representative training data. In this application note, we present Cluster-MLP, an on-the-fly active learning genetic algorithm framework that employs the Flare++ machine learning potential (MLP) for accelerating the GA search for global minima of pure and alloyed nanoclusters. We have used a modified version the Birmingham parallel genetic algorithm (BPGA) for the nanocluster GA search which is then incorporated into distributed evolutionary algorithms in Python (DEAP), an evolutionary computational framework for fast prototyping or technical experiments. We have shown that the incorporation of the AL framework in the BPGA significantly reduced the computationally expensive DFT calculations. Moreover, we have shown that both the AL-GA and DFT-GA predict the same global minima for all the clusters we tested.

Simulation model of an intelligent transportation system for the “smart city” with adaptive control of traffic lights based on fuzzy clustering

This article presents a new simulation model of an intelligent transportation system (ITS) for the “smart city” with adaptive traffic light control. The proposed transportation model, implemented in the AnyLogic, allows us to study the behavior of interacting agents: vehicles (V) and pedestrians (P) within the framework of a multi-agent ITS of the “Manhattan Lattice” type. The spatial dynamics of agents in such an ITS is described using the systems of finite-difference equations with the variable structure, considering the controlling impact of the “smart traffic lights.” Various methods of traffic light control aimed at maximizing the total traffic of the ITS output flow have been studied, in particular, by forming the required duration phases with the use of a genetic optimization algorithm, with a local (“weakly adaptive”) switching control and based on the proposed fuzzy clustering algorithm. The possibilities of optimizing the characteristics of systems for individual control of the behavior of traffic lights under various scenarios, in particular, for the ITS with spatially homogeneous and periodic characteristics, are investigated. To determine the best values of individual parameters of traffic light control systems, such as the phases’ durations, the radius of observation of traffic and pedestrian flows, threshold coefficients, the number of clusters, etc., the previously proposed parallel real-coded genetic optimization algorithm (RCGA type) is used. The proposed method of adaptive control of traffic lights based on fuzzy clustering demonstrates greater efficiency in comparison with the known methods of collective impact and local (“weakly adaptive”) control. The results of the work can be considered a component of the decision-making system in the management of urban services.

A novel approach and hybrid parallel algorithms for solving the fixed charge transportation problem

This article is dedicated to the efficient resolution of the fixed charge transport problem (FCTP) with the goal of identifying optimal solutions within reduced timeframes. FCTP is a combinatorial and NP-complete problem known for its exponential time complexity relative to problem size. Metaheuristic methods, including genetic algorithms, represent effective techniques for obtaining high-quality FCTP solutions. Consequently, the integration of parallel algorithms emerges as a strategy for expediting problem-solving. The proposed approach, referred to as the parallel genetic algorithm (PGA), entails the application of a genetic algorithm across multiple parallel architectures to tackle the FCTP problem. The primary aim is to explore fresh solutions for the fixed charge transportation problem using genetic algorithms while concurrently optimizing the time required to achieve these solutions through parallelism. The FCTP problem is fundamentally a linear programming challenge, revolving around the determination of optimal shipment quantities from numerous source locations to multiple destinations with the overarching objective of minimizing overall transportation costs. This necessitates consideration of constraints tied to product availability at the sources and demand dynamics at the destinations. In this study, a pioneering approach to addressing the Fixed Charge Transportation Problem (FCTP) using parallel genetic algorithms (PGA) is unveiled. The research introduces two distinct parallel algorithms: The Master-Slave Approach (MS-GA) and the Coarse-Grained Approach (CG-GA). Additionally, investigation into the hybridization of these approaches has led to the development of the NMS-CG-GA approach. The numerical results reveal that our parallelism-based approaches significantly improve the performance of genetic algorithms. Specifically, the Master-Slave (MS-GA) approach demonstrates its advantages in solving smaller instances of the FCTP problem, while the Coarse-Grained (CG-GA) approach exhibits greater effectiveness for larger problem instances. The conclusion reached is that the novel hybrid parallel genetic algorithm approach (NMS-CG-GA) outperforms its predecessors, yielding outstanding results, particularly across diverse FCTP problem instances.

Optimization of BESS placement, technology selection, and operation in microgrids for minimizing energy losses and CO2 emissions: A hybrid approach

This research paper addresses the issue of placement, technology selection and operation of BESS energy storage systems (BESS) in microgrids under a variable distributed generation (DG) and energy demand scenario for an average year of operation. To address this issue, a mixed-integer nonlinear programming (MINLP) model was formulated. The model considers two different objective functions, which are optimized using a mono-objective approach: (i) total energy losses and (ii) total CO2 emissions. The MINLP model was solved using a master–slave methodology based on metaheuristic algorithms. In the master stage, the Chu & Beasley parallel genetic algorithm (PCBGA) was used to solve the BESS placement and technology selection problem, while in the slave stage, the vortex search algorithm (VSA) was used to solve the BESS operation problem. A matrix-based successive approximation power flow was also used in this stage to determine the objective functions and evaluate the technical and operational constraints defined in the mathematical model. To verify the results, the 33-node test system was adjusted to the generation and demand characteristics of the city of Medellín. In addition, the proposed methodology was compared with two optimization techniques used in the master stage, namely the Parallel Monte Carlo (PMC) method and the Parallel Particle Swarm Optimizer (PPSO). Simulation results obtained using MATLAB software for the test scenario showed that the CBGA-VSA methodology outperformed the other techniques in terms of solution quality, repeatability and processing times to minimize total annual operating costs.