Genetic Operators Research Articles

Rescheduling optimisation of sustainable multi-objective fuzzy flexible job shop under uncertain environment

ABSTRACT The fourth industrial revolution has necessitated the integration of sustainability and customer centricity into modern manufacturing systems, thereby emphasising their significance. However, the production process itself is characterised by inherent uncertainties. Hence, this paper primarily focuses on the multi-objective flexible job shop rescheduling problem with uncertain processing time and new job insertions. Two fuzzy constraints are incorporated: fuzzy processing time and fuzzy due date, which aim to model the uncertainty of processing time and ensure flexibility in meeting deadlines. The objective function aims to optimise both customer satisfaction and energy consumption. To address two types of rescheduling problems: time delay caused by fuzzy features and new job insertions, this paper is dedicated to providing a hybrid adaptative rescheduling strategy that combines a satisfaction-driven policy with two specific rescheduling methods. Moreover, an enhanced version of the non-dominated sorting genetic algorithm II (NSGA-II) is developed, incorporating population initialisation rules and multiple genetic operators to obtain solutions of superior quality. Experimental studies have demonstrated the impact of time delay caused by fuzzy features on customer satisfaction. The proposed hybrid adaptative rescheduling strategy and methods exhibit significant improvements in rescheduling plan performance under uncertain environments.

Optimal multivariate mixture: a genetic algorithm approach

AbstractThe Optimal Multivariate Mixture Problem (OMMP) consists of finding an optimal mixture which, starting from a set of elements (items) described by a set of variables (features), is as close as possible to an ideal solution. This problem has numerous applications spanning various fields, including food science, agriculture, chemistry, materials science, medicine, and pharmaceuticals. The OMMP is a class of optimization problems that can be addressed using traditional Operations Research (OR) approaches. However, it can also be effectively tackled using meta-heuristic techniques within Artificial Intelligence (AI). This paper aims to present an Artificial Intelligence perspective. It proposes a Genetic Algorithm (GA) for Optimal Multivariate Mixture (GA-OMM), a novel improved version of a GA whose modified genetic operators prove to improve the exploration efficiency. Here, the algorithm is described in its general framework, and a test case 8-items 5-features is conducted to evaluate efficiency by exploring various combinations of hyperparameters. Test cases are also set up for the previous version, as well as a linear programming (LP) approach. The data experiments indicate that the proposed GA is efficient, converges towards the global optimum, consistently outperforms its predecessor, and delivers highly competitive results. In particular, GA-OMM shows an average fitness of GA-OMMP/LP and standard deviation with an order of magnitude ranging between $$10^{-8}$$ 10 - 8 to $$10^{-4}$$ 10 - 4 . Moreover, it consistently outperforms its predecessor, which exhibits similar values around $$10^{-3}$$ 10 - 3

Cost-aware quantum-inspired genetic algorithm for workflow scheduling in hybrid clouds

Cloud computing delivers a desirable environment for users to run their different kinds of applications in a cloud. Numerous of these applications (tasks), such as bioinformatics, astronomy, biodiversity, and image analysis, are deadline-sensitive. Such tasks must be properly allocated to virtual machines (VMs) to avoid deadline violations, and they should reduce their execution time and cost. Due to the contradictory environment, minimizing the application task's completion time and execution cost is extremely difficult. Thus, we propose a Cost-aware Quantum-inspired Genetic Algorithm (CQGA) to minimize the execution time and cost by meeting the deadline constraints. CQGA is motivated by quantum computing and genetic algorithm. It combines quantum operators (measure, interference, and rotation) with genetic operators (selection, crossover, and mutation). Quantum operators are used for better population diversity, quick convergence, time-saving, and robustness. Genetic operators help to produce new individuals, have good fitness values for individuals, and play a significant role in preserving the evolution quality of the population. In addition, CQGA used a quantum bit as a probabilistic representation because it has higher population diversity attributes than other representations. The simulation outcome exhibits that the proposed algorithm can obtain outstanding convergence performance and reduced maximum cost than benchmark algorithms.

Enhanced-GA supports traffic signal optimizations and protects the urban environment

Much current research on traffic signal optimization often neglects the impact of environmental factors in urban areas. This can result in suboptimal solutions that do not consider the effects of traffic on air pollution and the overall urban environment. To address this issue, this article proposes a solution that combines Enhanced GA with a comprehensive framework for considering environmental factors in traffic signal optimization. By optimizing traffic signal timings and minimizing emissions, the proposed solution aims to reduce congestion and improve urban transportation networks' efficiency while protecting the environment. The proposed approach uses a set of optimization algorithms and assumptions to generate a comprehensive framework for traffic signal optimization. These algorithms and assumptions consider environmental factors such as air quality and the impact of traffic on the local ecosystem. Moreover, this article provided the enhanced genetic algorithm operators and suggested model formulation that could be applied in other research on traffic signal optimization directly to reduce calculation times and increase the efficiency of the novel suggested models

Cost-effective topology optimization of masonry structure reinforcements by a linear static analysis-based GA framework

The paper presents a novel optimization framework aimed at the minimization of seismic retrofitting-related costs for existing unreinforced masonry building structures. The framework provides topology optimization of reinforcements (reinforced plasters) to implement in masonry walls for the accomplishment of seismic safety checks under the reference seismic load combinations. Optimization is carried out by a genetic algorithm (GA) developed in MATLAB®, which controls a 3D finite element equivalent frame model of the masonry structure developed in OpenSees. The GA routine iterates the reinforcement configurations employing specific genetic operators. The feasibility of each candidate retrofitting solution is assessed by performing in-plane shear and flexural safety checks of masonry walls. The framework is finally tested with a case study masonry structure supposed to be made of average-quality or poor-quality masonry. Results will show that the proposed framework can effectively provide the minimization of seismic retrofitting costs for existing masonry structures, giving as output the optimal configuration of the reinforcements within the structural layout.

Scheduling of Container Transportation Vehicles in Surface Coal Mines Based on the GA–GWO Hybrid Algorithm

The coal loading operation of the coal preparation plant of an open pit coal mine causes chaos in coal mine vehicle scheduling due to the unreasonable arrival times of outgoing and container transportation vehicles. To further reduce the length of time that vehicle transportation equipment waits for each other and to reduce the total cost of container transportation, the optimisation model of container transportation vehicle scheduling in an open pit coal mine is constructed to minimise the minimum sum of the shortest time of container reversal and the lowest cost of container transportation. To accurately measure the total cost of container backward transportation, waiting time and unit waiting time cost parameters are introduced, and the total cost of container transportation is measured using the transportation cost and the waiting time cost transformation method. An improved grey wolf algorithm is proposed to speed up the convergence of the algorithm and improve the quality of the solution. When employing the genetic algorithm (GA) and grey wolf optimisation algorithm (GWO) for optimising the scheduling of container transport vehicles in coal mines, it is noted that while the GA can achieve the global optimum, its convergence speed is relatively slow. Conversely, the GWO converges more quickly, but it tends to be trapped in local optima. To accelerate the convergence speed of the algorithm and improve the solution quality, a hybrid GA−GWO algorithm is proposed, which introduces three genetic operations of selection, crossover, and mutation of GA into the GWO algorithm to prevent the algorithm from falling into the local optimum due to the fall; at the same time, it introduces hunting and attacking operations into the elite retention strategy of GA, which improves the stability of the algorithm’s global convergence. Analysis indicates that, compared to SA, GWO, and GA, the hybrid algorithm enhances optimisation speed by 43.1%, 46.2%, and 43.7%, increases optimisation accuracy by 4.12%, 6.1%, and 3.2%, respectively, and reduces the total container reversal time by 35.46, 22, and 31 h. The total cost of container transportation is reduced by 2437 RMB, 3512 RMB, and 1334 RMB, respectively.

Genetic Algorithm Optimization with Selection Operator Decider

AbstractGenetic Algorithm (GA) is a powerful and flexible meta-heuristic tool to deal with the complexity of optimization problems, as they are directly related to real-life situations. The primary goal of an optimization problem could be to obtain a solution with less effort and near-optimal rather than slow, improbable optimal. GAs serve this purpose by broadly exploring the possible solution space and using genetic operators. The performance of GAs can vary significantly depending on the genetic operators. Although each operator type has upsides and downsides, the selection operator greatly influences the GA’s performance. Conventional GAs initialize with predetermined genetic operators and continue with the same throughout all iterations. In this paper, dynamically adjusting the selection operators to the current progress of the iteration will be shown to be a crucial strategy to improve the performance of the GA. This study aims to propose a novel GA capable of harnessing multiple selection operators by a self-deciding operator structure, which is more advantageous at the current iteration. For this, Technique for Order Preference by Similarity to Ideal Solution (TOPSIS), which is known as a simple and effective multi-criteria decision-making method, will be integrated into the GA by a proposed dynamic decision matrix. The proposed Selection Operator Decider Genetic Algorithm (SODGA) has unique properties with varying selection processes and is capable of using TOPSIS as a decider of the operator inside the iterations. The effectiveness of the presented SODGA framework will be analyzed by a Capacitated Vehicle Routing Problems (CVRPs) benchmark set.

Monarch butterfly optimization-based genetic algorithm operators for nonlinear constrained optimization and design of engineering problems

Abstract This paper aims to present a hybrid method to solve nonlinear constrained optimization problems and engineering design problems (EDPs). The hybrid method is a combination of monarch butterfly optimization (MBO) with the cross-over and mutation operators of the genetic algorithm (GA). It is called a hybrid monarch butterfly optimization with genetic algorithm operators (MBO-GAO). Combining MBO and GA operators is meant to overcome the drawbacks of both algorithms while merging their advantages. The self-adaptive cross-over and the real-valued mutation are the GA operators that are used in MBO-GAO. These operators are merged in a distinctive way within MBO processes to improve the variety of solutions in the later stages of the search process, speed up the convergence process, keep the search from getting stuck in local optima, and achieve a balance between the tendencies of exploration and exploitation. In addition, the greedy approach is presented in both the migration operator and the butterfly adjusting operator, which can only accept offspring of the monarch butterfly groups who are fitter than their parents. Finally, popular test problems, including a set of 19 benchmark problems, are used to test the proposed hybrid algorithm, MBO-GAO. The findings obtained provide evidence supporting the higher performance of MBO-GAO compared with other search techniques. Additionally, the performance of the MBO-GAO is examined for several EDPs. The computational results show that the MBO-GAO method exhibits competitiveness and superiority over other optimization algorithms employed for the resolution of EDPs.

A study of jamming resource allocation based on a hyperheuristic framework

There are massive data and rapidly changing battlefield situations in modern electronic warfare, which is a challenge to jamming resource allocation. It is difficult for the existing optimization algorithms to balance optimization capability and calculation speed at the same time. Above all, this study designs a fuzzy multiattribute evaluation model based on behavioral characteristics. The model comprehensively integrates the characteristics of signal behavior, motion behavior, and external intelligence and can effectively deal with unknown threat signals. Then, this study proposes an improved genetic selection electronic warfare operator (EWO) hyperheuristic (GAEWHH) algorithm. As an emergent optimization algorithm, the HH framework has not previously been applied to the problem of jamming resource allocation. This is a two-level algorithm framework that can isolate problem domains. The high level uses an improved genetic algorithm to search the heuristic space, and four EWOs based on the problem domain are designed for the low level to search the solution space. Combining different EWOs can change the population diversity, evolution direction, and algorithm complexity of the GAEWHH algorithm, which improves the algorithm performance to meet battlefield situation requirements. The experiment shows that for large-scale problems, the GAEWHH algorithm is better than the mainstream evolutionary algorithm in terms of optimization capability and better than Google OR-Tools in terms of calculation speed. In this way, the GAEWHH algorithm achieves a balance between optimization capability and calculation speed.

A hybrid algorithm based on the proposed square strategy and NSGA-II for ship pipe route design

Ship pipe route design (SPRD) is a difficult and time-consuming job due to the complexity of the routing space and the large number of pipes. This paper introduces a hybrid optimization algorithm called SQNSGA-II based on the proposed Square strategy and NSGA-II to efficiently solve SPRD problems in complex situations. The details of the hybrid algorithm are introduced, including the principle of the Square strategy, genetic operators and pipe repair operators et al. Additionally, a new method called Intercept Search strategy is proposed for optimizing branch pipe design in complex scenarios. Finally, we conducted three cases of simulation experiments to demonstrate that the proposed algorithm and strategy can efficiently and accurately optimize the design of pipes, highlighting their pipe routing capabilities in complex engineering projects.

Genetic Algorithm Based on Operator Optimization in Illustration Art Design

The current research explores the use of Genetic Algorithm (GA) Based on Operator Optimization in graphic art design, to improve the creative process using computational methods. By improving genetic operators such as crossover and mutation, the technique streamlines the creation of visually appealing artwork, allowing artists to efficiently express their distinctive vision. Through testing and research, the study reveals the effectiveness of this strategy in automating repetitive processes, exploring new creative pathways, and creating audience-resonant artwork. The combination of computational intelligence and creative intuition improves efficiency while also encouraging creativity and experimentation in the realm of graphic art design. The work sheds light on the revolutionary potential of Genetic algorithms (GA) based on Operator Optimization, highlighting areas for future research and development at the interface of technology and artistic effort. The results indicate that a better genetic algorithm (GA) provides efficacy and optimizes the operator in art design using a genetic algorithm.

A Systematic Review of Multi-Objective Evolutionary Algorithms Optimization Frameworks

The study of evolutionary algorithms (EAs) has witnessed an impressive increase during the last decades. The need to explore this area is determined by the growing request for design and the optimization of more and more engineering problems in society, such as highway construction processes, food and agri-technologies processes, resource allocation problems, logistics and transportation systems, microarchitectures, suspension systems optimal design, etc. All of these matters refer to specific highly computational problems with a huge design space, hence the obvious need for evolutionary algorithms and frameworks, or platforms that allow for the implementing and testing of such algorithms and methods. This paper aims to comparatively analyze the existing software platforms and state-of-the-art multi-objective optimization algorithms and make a review of what features exist and what features might be included next as further developments in such tools, from a researcher’s perspective. Additionally, it is essential for a framework to be easily extendable with new types of problems and optimization algorithms, metrics and quality indicators, genetic operators or specific solution representations and results analysis and comparison features. After presenting the most relevant existing features in these types of platforms, we suggest some future steps and the developments we have been working on.

Determination of reinforcement diameters of reinforced concrete deep beams with genetic algorithms

Genetic algorithms, a stochastic research method, emerged by adapting the development process of biological systems to the computer environment. Operations carried out in genetic algorithms are performed on units stored in computer memory, similar to natural populations. Today, many linear or nonlinear methods have been developed for the solution of optimization problems. Since genetic algorithms are heuristic, they may not find the optimum result for a given problem. However, it gives very close to optimum values for problems that cannot be solved by known methods or whose solution time increases exponentially with the solution of the problem. Genetic algorithms are initially applied to nonlinear optimization problems. In this study, a genetic algorithm was applied to the single-span beam, a single-span beam with a gap in its body. While applying to the genetic algorithm the problems developed back-controlled selection, randomly mixed crossover, double-sensitivity mutation operators, and backward-controlled stopping criterion were used. As a result, developed genetic algorithm operators were applied to the too-big-sized beam problems. These beams' dimensions were too big but they weren’t deep beams according to ACI 318-95 rules. Keywords: Deep beams; genetic algorithms; reinforcement diameters; selection Operator.

Cooperative mapping task assignment of heterogeneous multi-UAV using an improved genetic algorithm

A ground station uses heterogeneous unmanned aerial vehicles (UAVs) with varying observation resources (primarily airborne cameras) for oblique photography based on mapping task requirements to obtain access to geographic information. In this paper, a cooperative multi-task allocation model is proposed for heterogeneous UAVs based on area segmentation to approximate real-world mapping applications. Specifically, it considers area mapping task requirements, UAV kinematics constraints, resource constraints (maximum endurance and sensor capabilities), and task number ceiling constraints; and optimises the task sequence based on the objective function that considers UAVs coverage path planning characteristics. However, a general genetic algorithm (GA) could undermine the feasibility of the solution in the population, resulting in an undesirable optimisation effect when performing genetic operations on a large-scale task allocation problem with strong coupling constraints and an obscure encoding relation. An improved double-chromosome encoding GA with a conflict-mediation mechanism is proposed to perform genetic operations on the population while meeting these constraints. The proposed GA ensures the universal excellence of population evolution while significantly improving the population optimisation and convergence performance. The simulation results show that the proposed GA has greater global search ability, stability, and speed compared with existing algorithms.

Research on end-route planning for community group purchasing for vehicles with different energy sources

To address the issue of final delivery route planning in the community group purchase model, this study takes into full consideration logistics vehicles of different energy types. With the goal of minimizing the sum of vehicle operating costs, delivery timeliness costs, goods loss costs, and carbon emissions costs, a multi-objective optimization model for community group purchase final delivery route planning is constructed. An improved genetic algorithm with a hill-climbing algorithm is utilized to enhance adaptive genetic operators, preventing the algorithm from getting stuck in local optima and improving the solution efficiency. Finally, a case study simulation is conducted to validate the feasibility of the model and algorithm. Experimental results indicate that currently, among the three types of vehicles, fuel logistics vehicles still have an advantage in terms of vehicle usage cost. Electric logistics vehicles exhibit the poorest performance with the highest cost per hundred kilometers, but their sole advantage lies in their high energy release efficiency, enabling optimal low-carbon vehicle performance. Battery-swapping logistics vehicles perform the best in terms of carbon emissions, combining the advantages of both fuel-based and electric logistics vehicles. Therefore, battery-swapping logistics vehicles are a favorable choice for replacing fuel-based logistics vehicles in the future, offering promising prospects for future development.

An Efficient Image Cryptosystem Utilizing Difference Matrix and Genetic Algorithm.

Aiming at addressing the security and efficiency challenges during image transmission, an efficient image cryptosystem utilizing difference matrix and genetic algorithm is proposed in this paper. A difference matrix is a typical combinatorial structure that exhibits properties of discretization and approximate uniformity. It can serve as a pseudo-random sequence, offering various scrambling techniques while occupying a small storage space. The genetic algorithm generates multiple ciphertext images with strong randomness through local crossover and mutation operations, then obtains high-quality ciphertext images through multiple iterations using the optimal preservation strategy. The whole encryption process is divided into three stages: first, the difference matrix is generated; second, it is utilized for initial encryption to ensure that the resulting ciphertext image has relatively good initial randomness; finally, multiple rounds of local genetic operations are used to optimize the output. The proposed cryptosystem is demonstrated to be effective and robust through simulation experiments and statistical analyses, highlighting its superiority over other existing algorithms.

A hybrid genetic programming algorithm for the distributed assembly scheduling problems with transportation and sequence-dependent setup times

This paper investigates a distributed assembly permutation flow-shop scheduling problem with transportation and sequence-dependent set-up times (DAPFSP-TSDST). A hybrid genetic programming (HGP) algorithm is proposed to optimize the makespan of the assembly stage, which inherits the merits of genetic programming (GP) and neighbourhood search operators. In HGP, a hybrid problem-specific initialization heuristic is developed to make populations more diverse. Multiple neighbourhood search operators are employed as the leaf nodes, which are vital for the success of GP. A product shift strategy is proposed to strengthen its exploitability. In addition, a simulated annealing criterion is adopted to make the HGP explore more thoroughly. Finally, statistical and computational experiments are carried out on the benchmark instances. The results exhaustively identify the notable competitiveness of the HGP algorithm in coping with the DAPFSP-TSDST.

Economic optimization of fresh logistics pick-up routing problems with time windows based on gray prediction

The rapid development of modern cold chain logistics technology has greatly expanded the sales market of agricultural products in rural areas. However, due to the uncertainty of agricultural product harvesting, relying on the experience values provided by farmers for vehicle scheduling can easily lead to low utilization of vehicle capacity during the pickup process and generate more transportation cost. Therefore, this article adopts a non-linear improved grey prediction method based on data transformation to estimate the pickup demand of fresh agricultural products, and then establishes a mathematical model that considers the fixed vehicle usage cost, the damage cost caused by non-linear fresh fruit and vegetable transportation damage and decay rate, the cooling cost generated by refrigerated transportation, and the time window penalty cost. In order to solve the model, a hybrid simulated annealing algorithm integrating genetic operators was designed to solve this problem. This hybrid algorithm combines local search strategies such as the selection operator without repeated strings and the crossover operator that preserves the best substring to improve the algorithm’s solving performance. Numerical experiments were conducted through a set of benchmark examples, and the results showed that the proposed algorithm can adapt to problem instances of different scales. In 50 customer examples, the difference between the algorithm and the standard value in this paper is 2.30%, which is 7.29% higher than C&S. Finally, the effectiveness of the grey prediction freight path optimization model was verified through a practical case simulation analysis, achieving a logistics cost savings of 9.73%.

Antibacterial insights into alternariol and its derivative alternariol monomethyl ether produced by a marine fungus.

Alternaria alternata FB1 is a marine fungus identified as a candidate for plastic degradation in our previous study. This fungus has been recently shown to produce secondary metabolites with significant antimicrobial activity against various pathogens, including methicillin-resistant Staphylococcus aureus (MRSA) and the notorious aquaculture pathogen Vibrio anguillarum. The antibacterial compounds were purified and identified as alternariol (AOH) and its derivative, alternariol monomethyl ether (AME). We found that AOH and AME primarily inhibited pathogenic bacteria (MRSA or V. anguillarum) by disordering cell division and some other key physiological and biochemical processes. We further demonstrated that AOH could effectively inhibit the unwinding activity of MRSA topoisomerases, which are closely related to cell division and are the potential action target of AOH. The antibacterial activities of AOH and AME were verified by using zebrafish as the in vivo model. Notably, AOH and AME did not significantly affect the viability of normal human liver cells at concentrations that effectively inhibited MRSA or V. anguillarum. Finally, we developed the genetic operation system of A. alternata FB1 and blocked the biosynthesis of AME by knocking out omtI (encoding an O-methyl transferase), which facilitated A. alternata FB1 to only produce AOH. The development of this system in the marine fungus will accelerate the discovery of novel natural products and further bioactivity study.IMPORTANCEMore and more scientific reports indicate that alternariol (AOH) and its derivative alternariol monomethyl ether (AME) exhibit antibacterial activities. However, limited exploration of their detailed antibacterial mechanisms has been performed. In the present study, the antibacterial mechanisms of AOH and AME produced by the marine fungus Alternaria alternata FB1 were disclosed in vitro and in vivo. Given their low toxicity on the normal human liver cell line under the concentrations exhibiting significant antibacterial activity against different pathogens, AOH and AME are proposed to be good candidates for developing promising antibiotics against methicillin-resistant Staphylococcus aureus and Vibrio anguillarum. We also succeeded in blocking the biosynthesis of AME, which facilitated us to easily obtain pure AOH. Moreover, based on our previous results, A. alternata FB1 was shown to enable polyethylene degradation.

Research on Wireless Multimedia Big Data Transmission Model Based on Non-linear Algebraic Equation with the Adaptive Scheduling Algorithm

With the rapid development of computer technology, image processing and automatic book recognition has become a very important and practical field, and this discipline has a broad prospect and great potential. The digital vision system is a multi-plane information analysis method based on the human brain, which is applied to library identification problems by studying several regular changes in the distribution of objects themselves in two-dimensional space and three-dimensional position, in order to improve book quality and reduce costs. In addition, digital reading devices have become an essential part of people's daily learning life, and multimedia retrieval methods have also undergone radical changes, image processing is becoming more and more complex, and algorithms must become more efficient and reliable as the amount of computing increases to a certain level, so as to adapt to this fast and powerful data storage and query needs. Therefore, the trend is to improve the speed and reliability of computer systems. In this research, we provide a nonlinear model of optimal allocation employing an ant colony management strategy, a genetic operator, and an adaptive scheduling algorithm based on topology (dB) to discover the best scheduling scheme and test its feasibility via simulation. It proposes a viable idea for tackling the practical wireless multimedia massive data transmission model problem by applying the method to the real-time processing process in other sectors with high importance and resilience.