Hybrid Genetic Algorithm Research Articles

A hybrid intrusion detection approach based on message queuing telemetry transport (MQTT) protocol in industrial internet of things

AbstractThe number of attacks against Industrial Internet of Things (IIoT) devices has increased over the past years, particularly on widely used communication protocols like Message Queuing Telemetry Transfer (MQTT). The fast increase in IIoT applications brings both critical challenges and technical gaps in cybersecurity. On the other hand, traditional cyber‐attack detection approaches scrap to address and support the run‐time responsibilities of IIoT environments. This study presents a hybrid Genetic Algorithm and Random Forest (GA_RF) method for detecting cyber‐attacks in Industrial Control Machines (ICS) that use MQTT protocol in the IIoT environment. This architecture integrates ICS with edge devices and cloud servers, using a GA_RF algorithm to detect anomalies in data collected by sensors. Normal data is processed locally and then sent to the cloud for storage and return, ensuring continuous monitoring and security. Also, the MQTT‐IOT‐IDS2020 dataset as a real test case was applied for prediction of the proposed GA_RF method with compare to some other powerful machine and deep learning models. The experimental results show that the proposed GA_RF method has an optimum accuracy of 99.87%–100% for detecting cyber‐attacks. This hybrid algorithm also achieved 0–0.0015 in Mean Absolute Error (MAE) and 100% in Precision, Recall, and F‐score factors. This result led to the proposed architecture, which connects the ICS to a server while running GA_RF on the IIoT environment. In conclusion, this study indicates the effectiveness of GA_RF and aims to improve security by using the MQTT protocol in IIoT.

Optimizing Cluster Head Selection through improved Memetic Algorithm and Blockchain Technology for Securing WSN

Optimizing Cluster Head Selection through improved Memetic Algorithm and Blockchain Technology for Securing WSN

A hybrid dynamic memetic algorithm for the influence maximization problem in social networks

A hybrid dynamic memetic algorithm for the influence maximization problem in social networks

A double-layer Q-learning driven memetic algorithm for integrated scheduling of procurement, production and maintenance with distributed resources

The existing research on integrated production scheduling typically focuses on activities related to both production and post-production (e.g., operation and maintenance), with limited consideration for simultaneously integrating pre-production activities (e.g., raw material procurement). However, achieving the equilibrium between the manufacturer and the demander for intelligent manufacturing systems requires the optimal scheduling solution that integrates both pre-production and post-production activities. Inspired by this, we investigate a novel integrated scheduling problem that concurrently considers raw material procurement, production scheduling and equipment maintenance (abbreviated as SIPPM). A mixed-integer linear programming model is developed to simultaneously minimize the total costs for the manufacturer and the demander. Furthermore, a double-layer Q-learning driven memetic algorithm (DQMA) is proposed to solve the SIPPM. In DQMA, a well-tailored three-layer hybrid encoding method is presented for chromosome representation. The global search of DQMA employs three crossover and three mutation operators. Moreover, a knowledge-based local search operator with six methods, guided by an effective double-layer Q-learning structure, is devised to enhance local exploitation capabilities. The superiority of DQMA is verified through comparison with three popular multi-objective optimization algorithms on 108 newly established benchmark instances. The proposed integrated scheduling mode is proven to be more effective than two separated scheduling modes without considering raw material procurement.

Real time patient scheduling orchestration for improving key performance indicators in a hospital emergency department

Healthcare systems worldwide are increasingly subject to in-depth analysis. Problems in healthcare systems are of concern to the general public. For example, overcrowding in emergency departments creates several issues including longer waiting times, more frequent medical errors, a longer length of stay and worsened performance indicators. Overcrowding situations reduce the availability of staff and material resources, and therefore deteriorate the quality of care. The main cause of the overcrowding in emergency departments is the permanent interferences between the scheduled patients, unscheduled patients and urgent and unscheduled patients arriving at the emergency department. The objective of the present study is to develop an innovative decision support system that minimizes these interferences, while taking into account the perturbations that can occur throughout the day. The research’s ultimate goal is to improve the performance indicators via two processes: the first is a memetic algorithm based on a four dimensional hypercube genetic algorithm and local search techniques, and the second is based on a multi-agent system which dynamically orchestrates the patient pathway (given by the scheduling algorithm). In order to test and validate our approach, experiments are designed with real data from the adult emergency department at Lille University Medical Center. Simulations showed that with our approach we were able to reduce the waiting time of patients by 28.12%.

A learning-based memetic algorithm for a cooperative task allocation problem of multiple unmanned aerial vehicles in smart agriculture

Smart agriculture aligns with the principles of sustainable development, making it a crucial direction for the future agriculture. This study focuses on a cooperative plant protection task allocation problem (CPPTAP) of multiple unmanned aerial vehicles (UAVs) with a common deadline in smart agriculture. CPPTAP permits multiple UAVs to conduct pesticide spraying on the same field. The completion time for each task fluctuates due to the cooperation among UAVs. We present a mathematical model and learning-based memetic algorithm (L-MA) to maximize the total area of the fields to be sprayed. In the evolutionary stage, mutation and repair operators based on value information are applied to balance the exploration and exploitation, while a problem-specific local search strategy is designed to enhance exploitation capability. A knowledge-based UAV allocation method (KUAM) is employed to maximize UAV utilization efficiency and minimize conflicts. Throughout the search process, Q-learning is utilized to assist the aforementioned operators and make decisions on the number of cooperative UAVs on fields. The effectiveness of L-MA is validated by comparing it against other state-of-the-art algorithms. The results demonstrate that L-MA outperforms the compared algorithms at a considerable margin in a statistical sense.

A self-adaptive memetic algorithm with Q-learning for solving the multi-AGVs dispatching problem

In this paper, we address the problem of dispatching multiple automated guided vehicles (AGVs) in an actual production workshop, aiming to minimize the transportation cost. To solve this problem, a self-adaptive memetic algorithm with Q-learning (Q-SAMA) is proposed. An improved nearest-neighbor task division heuristic is used for generating premium solutions. Additionally, a Q-learning is integrated to select appropriate neighborhood operators, thereby enhancing the algorithm's exploration ability. To prevent the algorithm from falling into a local optimum, the restart strategy is offered. In order to adapt Q-SAMA to different stages in the search process, the traditional crossover and mutation probabilities are no longer used. Instead, a self-adaptive probability is obtained based on the population's degree of concentration, and the sparsity relationship among individuals' fitness. Finally, experimental results validate the effectiveness of the proposed method. It is able to yield better results compared with other five state-of-the-art algorithms.

Vibration-based damage detection of beams using Hybrid Genetic Algorithm with combined l0 and l1 regularization

Vibration-based damage detection is an effective way of identifying beam damages before they become severe and potentially catastrophic. This paper introduces a novel and robust method for detecting multiple cracks in beams using a Hybrid Genetic Algorithm (HGA). The objective function of the proposed method, based on dynamic properties, can be employed with partial modal information and is enhanced by including the initial residuals between numerical and experimental models along with combined l0 and l1 regularization. This enhancement mitigates the impact of limited modal data, experimental noise, and modeling inaccuracies. Additionally, a method of selecting an appropriate regularization parameter by analyzing residual and solution norm curves is presented. The performance of the proposed method is evaluated and verified using both numerical simulations and experimental studies on a steel cantilever beam under four damage scenarios. In the experimental study, natural frequencies and mode shapes were determined under ambient vibration conditions using Enhanced Frequency Domain Decomposition (EFDD) and the Stochastic Subspace Identification (SSI) method. Finite element models of the beam were developed in ABAQUS software for numerical analysis, and a comparative study of numerical and experimental data was conducted. The proposed approach successfully identifies, locates and quantifies single and multiple damages in the beam, demonstrating its reliability and effectiveness, particularly in scenarios with limited modal data and significant experimental noise.

DMD digital lithography optimization based on a hybrid genetic algorithm and improved exposure model

An efficient method to optimize digital micromirror device (DMD) lithography was proposed using a hybrid genetic algorithm integrated with an improved exposure model. The improved exposure model significantly refines traditional approaches by incorporating advanced parameters not previously considered, including the cross-transfer coefficient, detailed light source functions, and impulse response functions. These enhancements provide a comprehensive assessment of the entire optical imaging system’s impact on lithography quality and more accurately simulate the interactions of light with the photoresist. The hybrid method combines the robust optimization capabilities of genetic algorithms (GA) with this sophisticated exposure model, facilitating precise micromirror configurations and optimizing light distribution for specific lithographic patterns. This integration results in substantial improvements in lithographic precision, with improvements of up to 84% for hexagonal star patterns, 83% for arrow patterns, and 85% for embedded figure patterns. These advancements enhance imaging quality, reduce optical proximity distortions, and improve overall lithography performance, offering crucial insights into the precision and efficiency improvement of microelectronics fabrication processes.

Integration of Distributed Generations and electric vehicles in the distribution system

Power quality challenges are a major problem these days because of the significant increase in load demand and the existence of various reasons for disruptions in the distribution system. A voltage sag or a decrease in the magnitude of the line voltage can be brought on by rapid fluctuations in load or distribution system issues. Enhancing the grid current profile, reducing grid voltage sag, and improving other performances can all be achieved through the combination of electric vehicles with distribution generation systems. In this paper, the integration of Distributed Generation with Electric Vehicles in the distribution system has been done to enhance system performances such as true power loss index, imaginary power loss index, voltage deviation index, short circuit current index, cost function, and environmental impact reduction index for 16 bus distribution system in constant impedance, constant current, and constant power load models, or ZIP load models through proper location, sizing, coordinated controlling, and types of Distributed Generation and Electric Vehicle pairs for both charging and discharging modes by adopting Hybrid Genetic Algorithm - Monte Carlo Simulation optimization methodologies. This study's primary goal is to determine the optimal distribution generation and electric vehicle pairing to improve the aforementioned parameters, which will assist researchers in their future planning. Researchers, industry professionals, scientists, and individuals working with Distributed Generation and Electric vehicles in the smart grid will find this statement to be of great use.

Three multi-objective memetic algorithms for observation scheduling problem of active-imaging agile earth observation satellites

Three multi-objective memetic algorithms for observation scheduling problem of active-imaging agile earth observation satellites

A memetic algorithm for improved joint route selection and split-level management in next-generation wireless communications

The complexity of next-generation wireless communications, especially Beyond 5G and 6G communication systems, will be handled by artificial intelligence-based management paradigms. The joint selection of routes and functional split levels involves critical decisions that network infrastructure providers need to make to support requests from virtual Mobile Network Operators (vMNOs). These decisions comprise the assignment and configuration of physical network resources, which must comply with the specific quality of service restrictions of each vMNO request. Recent work defined a detailed mathematical model for this complex challenge, its formulation as a constrained, discrete optimization problem, and the first algorithmic approaches. It was also found that an evolutionary algorithm delivers higher-quality solutions than an ad-hoc heuristic, and faster running times compared to a well-known commercial solver. This paper introduces a memetic algorithm that exploits the strengths of the former evolutionary method while incorporating several key innovations: a domain-specific recombination operator; a specialized repairing procedure; an enhanced fitness evaluation scheme; and a multiobjective archiving strategy that preserves promising solution trade-offs. We conduct a comprehensive evaluation of the performance and behavior of this proposal, as well as the contribution of each specific design component. The results highlight that our memetic algorithm consistently outperforms previous approaches from the literature, providing better trade-offs in terms of solution quality and the rate at which vMNO requests are successfully fulfilled.

A Hybrid Genetic Algorithm Approach based on Patient Classification to Optimize Home Health Care Scheduling and Routing

This study aims to solve the multi-objective problem of home healthcare scheduling and routing. The former’s objectives are to upgrade the travel distance, the workload balance, and the waiting time of caregivers. A novel approach was proposed based on patient and caregiver clustering with the K-means++ algorithm in the first step and a hybrid genetic algorithm to optimize the global operation in the second step. The problem was solved regarding the deterministic and the uncertain aspect. The uncertain parameter investigated is the number of patients. A numeric study was conducted to prove the performance of the recommended approach using the Solomon Benchmark.

Multi-Objective Optimization of Pick-Up and Delivery Operations in Bike-Sharing Systems Using a Hybrid Genetic Algorithm

Multi-Objective Optimization of Pick-Up and Delivery Operations in Bike-Sharing Systems Using a Hybrid Genetic Algorithm

Energy-Efficient Satellite Range Scheduling Using a Reinforcement Learning-Based Memetic Algorithm

Energy-Efficient Satellite Range Scheduling Using a Reinforcement Learning-Based Memetic Algorithm

Hga-lstm: LSTM architecture and hyperparameter search by hybrid GA for air pollution prediction

Hga-lstm: LSTM architecture and hyperparameter search by hybrid GA for air pollution prediction

A hybrid genetic tabu search algorithm for distributed job-shop scheduling problems

The distributed job-shop scheduling problem (DJSP) is an extension of the traditional job-shop scheduling problem, which are composed of two sub-problems, assigning jobs to suitable factories and deciding the operation sequence on machines. To evaluate the performance of algorithms for solving DJSP, several famous benchmark instances have been proposed, and most of these instances have not been solved so far. This paper proposes a hybrid genetic tabu search algorithm (HGTSA) for solving DJSP. The proposed HGTSA combines the global search ability of the genetic algorithm (GA) and the local search ability of the tabu search (TS) well. In GA part, a crossover operation and a mutation operation are devised based on the critical factory. The two operations can effectively improve the discreteness of the population. In TS part, a tabu search procedure is performed on the critical factory. The procedure can effectively enhance the local search ability of HGTSA. For evaluating the performance of HGTSA, it has been compared with five classical algorithms on 240 benchmark instances. The computational results show the efficiency and effectiveness of HGTSA for solving DJSP. In particular, the proposed HGTSA updates the upper bounds for 235 out of these difficult instances.

Round-trip multimodal transportation routes planning for foldable vehicle racks

ABSTRACT Over the past decade, the expansion of China’s auto exports and pulp imports has presented challenges to the international shipping sector. This study examines the features inherent in the novel paradigm employed by COSCO Shipping Specialized Carriers. Specifically, it involves the transportation of Foldable Vehicle Racks (FVRs) using multipurpose pulp carriers on the outbound trip, and the conveyance of pulp alongside empty FVRs on the return voyage. Building upon this foundation, we propose a dual-objective route planning model and construct a round-trip multimodal transportation network. Subsequently, we calculate the optimal scheme, encompassing shipping routes, changeover nodes, and transport modes, using a hybrid genetic and ant colony algorithm. The paper scrutinizes the computational results, validates the effectiveness of the hybrid algorithm, and analyzes the scheme variations across different parameter scenarios, along with conducting a sensitivity analysis. The optimal solution calculated in this paper is found to reduce transit time by 24.77% while improving logistics benefits by 4.11% compared to the firm’s existing shipping schedule. Furthermore, we explore alternative optimal logistics routes in various parameter variation scenarios and considering benefit-time preferences. Eventually, six managerial insights are proposed for the sustainable development of COSCO’s FVR and pulp business based on the experimental results.

Rolling optimal scheduling for urban parcel crowdsourced delivery with new order insertion

The rapid development of mobile information technology has introduced numerous new solutions for delivery companies to enhance profits. One such solution employed by some companies is crowdsourced delivery. In this paper, we focus on rolling optimal scheduling for urban parcel crowdsourced delivery by utilizing private cars that will be in passing with the incorporation of new order insertion. The bonus incentive strategy is introduced to enhance the delivery probability of private car drivers. A static model and a rolling optimization model to maximize profits and the number of parcels delivered by private cars are established. To address the NP-hard problem, a hybrid genetic algorithm and insertion algorithm are designed. Numerical experiments are carried out to verify the proposed method in different scenarios, including the scattered network, clustered network, Dalian network, and Foursquare network. The computational results demonstrate that the method enhances the matching ratio and increases profits. Utilizing private cars that will be in passing for urban parcel delivery reduces the need for dedicated vehicles, mitigating traffic growth and alleviating traffic congestion. Increasing the private car-parcel ratio improves profits and the matching ratio while reducing traffic growth. Raising the incentive coefficient for bonuses increases the matching ratio and detour distance, but profits first increase and then decrease, and delivery distance by dedicated vehicles decreases. Our research findings offer a more rational basis for green urban parcel delivery decision-making by companies.

Global Path Planning for Articulated Steering Tractor Based on Multi-Objective Hybrid Algorithm.

With the development of smart agriculture, autopilot technology is being used more and more widely in agriculture. Because most of the current global path planning only considers the shortest path, it is difficult to meet the articulated steering tractor operation needs in the orchard environment and address other issues, so this paper proposes a hybrid algorithm of an improved bidirectional search A* algorithm and improved differential evolution genetic algorithm(AGADE). First, the integrated priority function and search method of the traditional A* algorithm are improved by adding weight influence to the integrated priority, and the search method is changed to a bidirectional search. Second, the genetic algorithm fitness function and search strategy are improved; the fitness function is set as the path tree row center offset factor; the smoothing factor and safety coefficient are set; and the search strategy adopts differential evolution for cross mutation. Finally, the shortest path obtained by the improved bidirectional search A* algorithm is used as the initial population of an improved differential evolution genetic algorithm, optimized iteratively, and the optimal path is obtained by adding kinematic constraints through a cubic B-spline curve smoothing path. The convergence of the AGADE hybrid algorithm and GA algorithm on four different maps, path length, and trajectory curve are compared and analyzed through simulation tests. The convergence speed of the AGADE hybrid algorithm on four different complexity maps is improved by 92.8%, 64.5%, 50.0%, and 71.2% respectively. The path length is slightly increased compared with the GA algorithm, but the path trajectory curve is located in the center of the tree row, with fewer turns, and it meets the articulated steering tractor operation needs in the orchard environment, proving that the improved hybrid algorithm is effective.