Search

Physiological signals commonly suffer from contamination by various types of noise, ones of the most foremost are baseline wander (BLW) and power line interference (PLI). The removal of these interferences is a crucial in biomedical signal processing and diseases diagnosis. This paper introduces a digital fractional notch filter derived from the corresponding anti-notch one and specifically designed for the removal of BLW and PLI from physiological signals. The salient feature of the proposed filter is its capability to eliminate any frequency range only by adjusting the single parameter ν which defines the central frequency of the anti-notch filter. The performance of the filter is closely linked to the fractional order α and the number of samples L used in approximating the ideal fractional filter. Genetic algorithms were employed to determine the optimal values for these parameters (α, L). The proposed filter has been implemented on noisy ECG, EEG, and EMG signals, exhibiting its efficiency in removing unwanted noise. Comparative analysis with existing BLW and PLI removal techniques indicates that the proposed filter outperforms them based on the evaluation metrics employed. [ABSTRACT FROM AUTHOR]

Traditional geometry optimization of elevator fairings is only based on computational fluid dynamics simulations to find optimal structure parameters, and a large volume of data generated during the elevator operation is not utilized to optimize elevator fairings collaboratively. This paper proposes a digital twin-driven design framework to design the elevator fairing of the next generation. A digital twin model corresponding to the real elevator is first established via a computing platform, and a multi-objective optimization method like neighborhood cultivation genetic algorithms is employed to optimize the elevator fairing design. The effectiveness of the digital twin-driven design framework is demonstrated by the elevator fairing design, and the results show that compared with the unoptimized elevator fairing, the air drag and the lateral force are lowered by 18.1% and 11.2%, respectively, and the turbulence coefficient decreases from 0.478 to 0.451 after optimizing the elevator fairing. [ABSTRACT FROM AUTHOR]

As the increasing trend of global consumption of waste electrical and electronic equipment (WEEE), the recycling of WEEE has been thought highly of. In order to solve the problems of high economic cost, environmental detrimental caused by improper recycling, ignorance of social benefits of recycling, uncertain recycling amount and single recycling channel in recycling process of WEEE, this paper proposes a sustainable multi-objective WEEE double recycling channel fuzzy programming model based on triple bottom line (TBL) theory. First of all, TBL is used to develop sustainable multi-objective recycling models concerning economy, environment and society. Secondly, the model is fuzzed. This process includes two steps: the first step is to take WEEE recycling quantity as a triangular fuzzy parameter, and use fuzzy chance constraint method to transform fuzzy constraint into an equivalent clear condition; the second step is to fuzzify suboptimal objective in the model by defining objective membership degree, and transform multi-objective optimization problem into a single-objective optimization problem based on the maximum satisfaction. Finally, taking a recycling enterprise in Shantou, China, as an example, genetic algorithm (GA) and particle swarm optimization (PSO) are comparatively used to solve a calculation case related to the model and the contribution of the model is verified by comparing economic cost, environmental impact and social benefits of the dual recycling channels. [ABSTRACT FROM AUTHOR]

As the carrier of enterprise water resources management disclosure, water information disclosure is a means of expression of enterprises' environmental responsibility. First, a corporate water information disclosure quality evaluation index system and evaluation method are established, and with the help of the projection tracing method of accelerated genetic algorithm, 27 paper companies in China are selected as a sample and the disclosure quality level is analyzed empirically. Then, the analysis is carried out in terms of three changes in vertical trends, horizontal trends and changes in laws, regulations and policies, and the results show that Chinese paper and paper product enterprises have low quality of water information disclosure, weak disclosure content and low voluntary disclosure. Finally, feasible suggestions are made based on the evaluation of disclosure issues. [ABSTRACT FROM AUTHOR]

With the increasing volume of data on the web, distributed file systems such as HDFS are widely used to provide efficient, fast and reliable access to the ever-growing volumes of data. Parameter tuning, a core performance management task, directly affects the performance of storage systems. However, large, non-linear, discrete and non-digital storage system configuration parameters significantly increase the storage system parameter tuning burden. Traditional manual tuning methods rely on a lot of a priori knowledge and have high tuning costs. In this paper, we propose a Smart gambler (SG) algorithm based on a simulated environment and Hill Climbing to reduce the probability of falling into a local optimum. In comparative experiments on publicly available datasets, SG achieves an average improvement of 3.14 % and 5.02 % in the highest tuning value over search algorithms such as Genetic Algorithm and an average time saving of 32.1 % and 50.6 % in tuning time for both workloads, respectively. [ABSTRACT FROM AUTHOR]

Traffic congestion in urban areas presents significant challenges, adversely affecting economic productivity, public health, and overall quality of life. Efficient coordination of traffic signals emerges as a crucial strategy to mitigate these impacts. This paper introduces an innovative approach to traffic management by leveraging Q-learning and Genetic Algorithms (GAs) to optimize traffic light schedules, aiming to reduce vehicle waiting times at intersections. The approach proposed in this study is implemented in a sophisticated simulation environment, facilitated by the python-traffic simulator platform, leveraging real-time data. Uniquely, in this paper, Q-Learning implementation incorporates a novel yet redundant random shuffling of action values in the value determination process, which differs from standard Q-learning approaches. Through a comparative analysis, we evaluated the performance of these advanced methodologies against the default traffic light control behavior. The proposed algorithm demonstrated a substantial improvement, reducing average vehicle waiting time. The research thoroughly assesses the performance of simulation outcomes under various scenarios, examining episodes in batches of 20, 50 and 100. The method exhibits notable improvements over traditional traffic control algorithms. It reduces the average wait time by approximately 12.54% compared to the default fixed cycle method. Also showcases a significant reduction in the average wait time by approximately 10.39% with the second method (longest queue first). In comparison to the third method (search algorithm) the proposed method demonstrates an appreciable decrease in the average wait time by approximately 6.09%. These findings underscore the potential of applying machine learning and evolutionary computation techniques to enhance traffic flow efficiency, suggesting a scalable solution for urban traffic management challenges. [ABSTRACT FROM AUTHOR]

Roll force prediction plays a significant role in rolling schedule and optimization. For a specific steel grade, the roll force can be determined by the aid of several factors: rolling speed, initial thickness, ratio of thickness reduction, the starting temperature of the strip, and the friction coefficient in the contact region. Roll force prediction mathematical models are sometimes rare and inaccurate. This paper presents a new approach to predict roll separating force using semi-supervised support vector regression (SSSVR). The parameters affecting the sensitivity of the SSSVR were optimized using the genetic algorithm to maximize the r-squared accuracy score. The intelligent system is evaluated using two quality metrics: the root mean square error (RMSE) and the mean absolute error calculated between the measured force from the industrial rolling field and the predicted force using the proposed system from one side, and the measured force and the calculated force from another side. Obtained results show the improvement while using the intelligent predictive system. The reduction in RMSE was achieved by the proposed system by 66.9% and 32.1% for oval and round shape passes, respectively in comparison to the conventional calculation method. [ABSTRACT FROM AUTHOR]

In a seminal paper in 2013, Witt showed that the (1+1) Evolutionary Algorithm with standard bit mutation needs time (1 + o (1)) n ln n / p 1 to find the optimum of any linear function, as long as the probability p 1 to flip exactly one bit is Θ (1) . In this paper we investigate how this result generalizes if standard bit mutation is replaced by an arbitrary unbiased mutation operator. This situation is notably different, since the stochastic domination argument used for the lower bound by Witt no longer holds. In particular, starting closer to the optimum is not necessarily an advantage, and OneMax is no longer the easiest function for arbitrary starting positions. Nevertheless, we show that Witt's result carries over if p 1 is not too small, with different constraints for upper and lower bounds, and if the number of flipped bits has bounded expectation χ . Notably, this includes some of the heavy-tail mutation operators used in fast genetic algorithms, but not all of them. We also give examples showing that algorithms with unbounded χ have qualitatively different trajectories close to the optimum. [ABSTRACT FROM AUTHOR]

Since electric vehicles (EVs) have definite benefits over gasoline vehicles, the vehicle market could be dominated by EVs in the future. This paper focuses on the new valet charging service to send staffs to replace users for charging their EVs, which can largely reduce charging anxiety. In this study, the location of charging stations and the allocation of charging demands to charging stations are optimized simultaneously due to the interaction of these decisions. The queueing behavior at the charging station is incorporated into the model, and the average charging waiting time is derived. We construct a mixed integer nonlinear optimization model based on the characteristics of valet charge service and an infinite-source queuing model. The objective is to minimize a total cost of the construction of charging facilities and valet charge service launching (i.e., charging staffs' road service, round-trip time, and the charging waiting time). The planning problem for valet charging service in this paper contributes to the existing literature on self-charging way where the users of EVs drive at charging stations to recharge their EVs by themselves. An improved genetic algorithm is developed to obtain deployment and operation plans for large-scale instances constructed based a real case in Shanghai. The improved genetic algorithm shows high performance in convergence and solution quality, which provide the service providers an efficient decision support tool. Meaningful managerial insights are also provided, which can help the service provider make better cost-effective design of charging location and allocation plans. For example, the charging station location decisions are not as much as sensitive to critical variables (such as demand level, charging capacities, and the value of time) than the overall cost to those. This means that partial location decisions remain unchanged when the key parameters vary. [ABSTRACT FROM AUTHOR]

Purpose: In order to promote the seismic performance of bridges and the design of isolation bearings, this paper studies the influence of isolation bearing parameters on the seismic performance of bridges, and proposes an optimization framework for isolation bearing parameters of isolated continuous beam bridges. Methods: In this paper, Matlab is used for independent programming, and non-parametric regression analysis method is used to build the optimization objective function relationship of lead rubber bearing, and combined with NSGA2 (nondominated sorting genetic algorithm II) algorithm for optimization. Finally, we take the seismic vulnerability after optimization as an evaluation index to analyze the optimization effect of the lead rubber bearing. Results: By comparing the seismic vulnerability curve results of the lead rubber bearing before and after optimization, it is found that when the bearing parameters K1, K2, and Q are 21.65, 1.7, and 267.2 respectively, the seismic vulnerability of the whole bridge is reduced by 3–4% and the corresponding pier damage probability is reduced by 20–30% under the action of rare earthquakes. The probability of support damage only increased by 48%. Therefore, the selection of appropriate supporting parameters can help reduce pier damage and ensure the future repair of the bridge. Conclusion: For bridges that only use isolation devices, it is found that when the characteristic strength Q = 267.21 kN, the post-yield stiffness K2 = 1.7 kN/mm, and K1 = 22.1 kN/mm, the probability of pier damage can be minimized. It is also proved that the optimization frame is effective to optimize the parameters of the seismic isolation mounts of continuous beam bridges. [ABSTRACT FROM AUTHOR]

A Soft Computing technique is one of the essential problems solving techniques for the researchers present in the world. Compared to other issues solving techniques, the Soft Computing domain gives outstanding performance, so the researchers are concentrating the Soft Computing domain for solving problems. Soft Computing domain categorizes into many sub-domains, like Neural Networks, Machine Learning, and Genetic Algorithm. Through this paper, we considered to study the impact produced by the Institutions as well as authors in the domain of Soft Computing from the year 1999 to 2019 for PubMed database. From the overall study, we found that China has made more number of publications, author productivity, and influential authors. Some countries, like Russia, Saudi Arabia, and Turkey, with minimum author productivity and minimum publications from the Asian continent in the Soft Computing-related domains. From the research, we determined that china dominates in terms of Institutions wise and Author productivity in the field of Soft Computing domain. [ABSTRACT FROM AUTHOR]

Features within the dataset carry a significant role; however, resource utilization, prediction-time, and model weight are increased by utilizing high-dimensional data in intrusion-detection paradigm. This paper aims to design a novel lightweight intrusion detection system in two phases utilizing a swarm intelligence-based technique. In 1st-phase, essential features are selected using particle swarm optimization algorithm by considering imbalanced dataset. Ant colony optimization algorithm is utilized in 2nd-phase for extracting information-rich and uncorrelated features. Additionally, genetic algorithm is employed for fine-tuning each detection model. Proposed model's performance is evaluated on different base and ensemble classifiers, and it is observed that xgboost achieves best accuracy with 90.38%, 92.63%, and 97.87% on NSL-KDD, UNSW-NB15, and CSE-CIC-IDS2018 datasets, respectively. The proposed model also outperforms other traditional dimensionality reduction and state-of-the-art approaches with statistical validation. This paper also analyses objective function of each metaheuristic algorithm used in this paper, applying convergence graphs, box, and swarm plots. [ABSTRACT FROM AUTHOR]

Edge computing provides a real-time guarantee for the industrial internet. Server deployment is the first step to building an edge computing system, and the deployment strategy has a huge impact on system delay and reliability. Industrial environments place higher demands on reliability than other common environments. However, existing research on edge server deployment assumes that the server will not fail and thus rarely considers edge server reliability while reducing delay. This paper focuses on edge server deployment approach for delay reduction and reliability enhancement in the industrial internet. Firstly, a basic edge server deployment model is established to optimize server load balancing and delay. On this basis, an edge server deployment model with enhanced reliability is established. This model improves system reliability by adding fault-tolerant servers when deploying edge servers. When some edge servers in the system fail, the fault-tolerant servers will intervene in time and start working to replace the failed edge servers. To solve the optimal deployment strategy, an Improved Grey Wolf-Genetic Algorithm-based deployment algorithm is proposed. The deployment algorithm improves the traditional genetic algorithm's performance to find the global optimal solution by improving the initialization and mutation part of the genetic algorithm. The deployment algorithm selects appropriate wireless access points (WAPs) to deploy fault-tolerant edge servers among a large number of WAPs. Simulation results show that the established fault-tolerant model can significantly improve system reliability while reducing system delay. The proposed algorithm performs better compared with existing algorithms in terms of convergence speed and finding the optimal deployment location. [ABSTRACT FROM AUTHOR]

In the modern world the availability of the machinery for any industry is of utmost importance. It is the right maintenance at right time which keeps these machineries available for their jobs. The primary goal of maintenance is to avoid or mitigate consequences of failure of equipment. There are various types of maintenance schemes available such as breakdown maintenance, preventive maintenance, condition based maintenance etc. Out of all these schemes Reliability Centred Maintenance (RCM) is most recent one and the application of which will enhance the productivity and availability. RCM ensures better system uptime along with understanding of risk involved. RCM has been used in various industries, however, it is very less explored and utilized in marine operations.Hence in the present study maintenance schemes of a marine diesel engine has been considered for optimization using RCM.Failure Modes and Effects Analysis and Fault Tree Analysis (FTA)are some of the basic steps involved in RCM. Due to the scarcity of reliability data particularly in the marine environment some of the components data had to be estimated based on the operating experience. As FTA is based on binary state perspective, assuming the system exist in either functioning or failed state, some of the components (whose performance varies with time and degrades) cannot be modeled using FTA. Hence, in this paper reliability modeling of performance degraded components is dealt with Markov models and the required data is evaluated from condition monitoring techniques. After obtaining the availability of the marine diesel engine, based on the importance ranking, critical components have been obtained for optimizing the maintenance schedules. In this paper genetic algorithm approach has been used for optimization. The results obtained have been compared and new maintenance scheme has been proposed. [ABSTRACT FROM AUTHOR]

The right lane and platoon assignment to a vehicle significantly impacts achieving the desired driving goals to improve occupants' safety or reduce pollution. Preparing an intelligent assistant to address this issue has exposed researchers' attention, especially in intelligent transportation systems. Implementing such a system is complex and challenging to design, mainly because of conflicting driving goals possibility and the mixed traffic of autonomous and human-driven vehicles. This paper presents a multi-tier computational architecture to utilize the cloud, fog, and edge computational resources and formulate the lane/platoon assignment as an optimization problem subject to safety combined with any other secondary goal. The problem is then solved by the meta-heuristic Genetic Algorithm. By evaluating the proposed method by real data gathering, machine learning, and numerical experiments, the results show that the proposed method satisfies the minimization of overlapping collision areas during vehicles' lane/platoon changes and harmonizes the traffic in all lanes and each platoon. [ABSTRACT FROM AUTHOR]

Efficient specialized vehicle cooperative scheduling is significant for airport operations, particularly during times of high traffic, which reduces the risk of flight delays and increases customer satisfaction. In this paper,we construct a multi-type vehicles collaborative scheduling model with the objectives of minimizing vehicle travel distance and vehicle waiting time. Additionally, a three-layer genetic algorithm is designed, and the crossover and mutation operations are enhanced to address the scheduling model. Due to the numerous uncertainties and stochastic interferences in airport operations, conventional scheduling methods unable to effectively address these challenges, this paper combines improved genetic algorithm, simulation algorithm, and digital twins technology, proposing a multi-strategy scheduling framework for specialized vehicles based on digital twins. The scheduling framework utilises digital twins to capture dynamic data from the airport and continuously adjusts the scheduling plan through the scheduling strategy to ensure robust scheduling for specialized vehicles. In the event of severe delays at the airport, fast and efficient re-scheduling can be achieved. Finally, the effectiveness of the proposed scheduling framework is validated using domestic flight data, and extensive experiments and analyses are conducted in different scenarios. This research contributes to addressing the optimization problem of cooperative scheduling for multi-type vehicles at airports. [ABSTRACT FROM AUTHOR]

The development of various communication technologies has made it possible to connect any intelligent device with each other and to the Internet. However, with the proliferation of such devices, the need for dynamic networks that require less efforts in managing and optimizing end users experience is mounting at a fast pace. Wireless Mesh Networks (WMNs) are a good choice not only to meeting users demands but also to reducing maintenance and upfront costs. Nevertheless, deploying a reliable highly connected WMN at low cost requires the utilization of the least possible mesh routers, yet fully interconnected and able to cover all mesh clients. To cope with these challenges, we have previously implemented a hybrid intelligent system, called WMN-PSODGA, which combines two intelligent algorithms: Particle Swarm Optimization and Distributed Genetic Algorithm. In this paper, we consider Boulevard and Stadium distributions of mesh clients and evaluate the performance of the WMN for different router replacement methods. By comparing the simulation results for each distribution and router replacement method, we conclude that the best scenario in terms of client coverage, router connectivity and load balancing is Stadium distribution with Rational Decrement of Vmax Method as a router replacement method. [ABSTRACT FROM AUTHOR]

A Virtual Power Plant (VPP) is a centralized energy system that manages, and coordinates distributed energy resources, integrating them into a unified entity. While the physical assets may be dispersed across various locations, the VPP integrates them into a virtual unified entity capable of responding to grid demands and market signals. This paper presents a tri-level hierarchical coordinated operational framework of VPP. Firstly, an Improved Pelican Optimization Algorithm (IPOA) is introduced to optimally schedule Distributed Energy Resources (DERs) within the VPP, resulting in a significant reduction in generation costs. Comparative analysis against conventional algorithms such as Genetic Algorithm (GA) and Particle Swarm Optimization (PSO) demonstrates IPOA's superior performance, achieving an average reduction of 8.5% in generation costs across various case studies. The second stage focuses on securing the optimized generation data from rising cyber threats, employing the capabilities of machine learning, preferably, a convolutional autoencoder to learn the normal patterns of the optimized data to detect deviations from the optimized generation data to prevent suboptimal decisions. The model exhibits exceptional performance in detecting manipulated data, with a False Positive Rate (FPR) of 1.92% and a Detection Accuracy (DA) of 98.06%, outperforming traditional detection techniques. Lastly, the paper delves into the dynamic nature of the day ahead market that the VPP participates in. In responding to the grid by selling its optimized generated power via the day-ahead market, the VPP employs the Prophet model, another machine learning technique to forecast the spot market price for the day-ahead to mitigate the adverse effects of price volatility. By utilizing Prophet forecasts, the VPP achieves an average revenue increase of 15.3% compared to scenarios without price prediction, emphasizing the critical role of predictive analytics in optimizing economic gains. This tri-level coordinated approach adopted addresses key challenges in the energy sector, facilitating progress towards achieving universal access to clean and affordable energy. [ABSTRACT FROM AUTHOR]

The flexible job-shop scheduling problem (FJSP) with parallel batch processing machine (PBM) is one of those long-standing issues that needs cutting-edge approaches. It is a recent extension of standard flexible job shop scheduling problems. Despite their wide application and prevalence in practical production, it seems that current research on these types of combinatorial optimization problems remains limited and uninvestigated. More specifically, existing research mainly concentrates on the flow shop scenarios in parallel batch machines for job shop scheduling but few literature emphasis on the flexible job shop integration in these contexts. To directly address the above mentioned problems, this paper establishes an optimization model considering parallel batch processing machines, aiming to minimize the maximum completion time in operating and production environments. The proposed solution merges variable neighborhood search with multi-population genetic algorithms, conducting a neighborhood search on the elite population to reduce the likelihood of falling into local optima. Subsequently, its applicability was evaluated in computational experiments using real production scenarios from a partnering enterprise and extended datasets. The findings from the analyses indicate that the enhanced algorithm can decrease the objective value by as much as 15% compared to other standard algorithms. Importantly, the proposed approach effectively resolves flexible job shop scheduling problems involving parallel batch processing machines. The contribution of the research is providing substantial theoretical support for enterprise production scheduling. [ABSTRACT FROM AUTHOR]

To improve cargo loading efficiency and achieve diverse needs of companies for the loading process, this paper innovatively establishes a multiple objective mixed integer programming model for the three-dimensional multiple bin-size bin packing problem (3D-MBSBPP). The model is designed to maximize container space utilization rate and cargo load balance, minimize container usage costs, and incorporates some practical constraints. On this basis, we propose a novel dynamic feedback algorithm based on spatial corner fitness (SCF_DFA) to solve this model, which consists of three stages. Specifically, Stage 1 employs a heuristic algorithm based on spatial corner fitness to optimize the search of the remaining spaces. Stage 2 employs a container type selection algorithm to dynamically adjust and optimize container types. Stage 3 uses an improved genetic algorithm to improve the quality of the solutions of the first two stages. We demonstrate the effectiveness of the proposed algorithm through comparative experiments on benchmark instances, and apply it to solve the real-life instances for the 3D-MBSBPP. The results show that the proposed algorithm can make the average container space utilization rate reach 85.38%, which is 1.48% higher than that of baseline method, while the loading results obtained are more balanced, indicating the advantages of the SCF_DFA in solving 3D-MBSBPP. Furthermore, we conduct ablation experiments to confirm the effectiveness of each component within the algorithm. [ABSTRACT FROM AUTHOR]

Internet of Things (IoT) systems generate a vast volume of data to process, and the volume of data generated by the IoT will continue to expand exponentially in the future. Due to the large-scale nature of such systems and their geographically distributed nature, how to optimally place operators and brokers for data processing across cloud, fog, and edge is the main concern of this paper. Furthermore, in the past, IoT systems relied on cloud-based brokers. If the communication between operators in an IoT application has to be regulated by a broker located in the cloud, the advantages brought by the processing of nodes located at the edge and the fog may be neglected. We consider various factors, such as the impact of different network topologies on operators and brokers, the needs of IoT application users, the performance of sensor layers, and the location characteristics of IoT sensors. In diverse placement strategies, the characteristics of the broker have been given special attention. This paper considers the combined architecture of the operator and broker on the edge, fog, and cloud as an optimization problem of minimizing computational processing and data transmission cost. We propose jointly placing the IoT application's operator and broker on the edge, fog, and cloud nodes. Then we proposed two algorithms: the low-complexity heuristic algorithm named GREEDY and the genetic algorithm called GA. Simulation results show that, in most situations, the GA placement method outperforms others and provides a near-optimal solution. [ABSTRACT FROM AUTHOR]

In recent years, the demand for electronic products has been increasing rapidly. T mounting technology (SMT) line is one of the production areas for electronic products, directly affecting this situation. In an SMT line, multiple machines mount electronic parts to the board. The worker must complete work when the parts used in these machines are within the remaining parts available for replacement. When a worker fails to replace parts at the right time, the production line stops, and delays occur. Besides, there may be a designated worker who should be assigned to each task. In the current situation, workers' work procedures are not optimized, so they should schedule work procedures for each worker. This problem is called Worker Assignment Problem with Time Window (WAPTW). This paper proposes a method to solve WAPTW called Genetic Algorithm with Local Restriction (GALR). GALR combines a genetic algorithm (GA) and local search with local restriction. This paper's main contribution is introducing WAPTW as a novel real-world optimization problem in an electricity company, its mathematical formulation, and a proposed GALR to solve WAPTW. The experiment shows that the proposed method could yield the best result in real-world WAPTW compared with other methods. [ABSTRACT FROM AUTHOR]

To improve the quality and efficiency of machine translation (MT) for low-resource languages (LRLs), this paper analyzes the application of genetic algorithm (GA) under the background of cloud computing (CC). By using GA to optimize MT for LRL, this study aims to address the limitations and challenges of traditional methods on LRL. Firstly, GA under the background of the CC platform is analyzed in detail. The CC platform offers powerful computing and storage capabilities that provide the basis for large-scale optimization using GA. GA is an optimization algorithm based on the principle of biological evolution, which seeks the optimal solution by simulating genes' genetic and evolutionary processes. In MT of LRL, GA can be used to optimize model parameters, select translation rules, and improve translation quality, thereby improving translation results. Secondly, the present situation of MT for LRL is described. Finally, the traditional LRL-oriented MT and the GA-optimized LRL-oriented MT are compared and analyzed. The results reveal that the traditional LRL-oriented MT has low accuracy and low customer satisfaction (CS). Considering the translation time, accuracy, and resource utilization rate (RUR), the highest rate is only about 47%. In contrast, GA-optimized LRL-oriented MT significantly improves translation accuracy and CS, reaching approximately 94%. The final evaluation results indicate that the accuracy of the model is usually above 70%, and up to 94%. Therefore, GA plays an important role in optimization for LRL-oriented MT. This paper provides technical support for optimizing LRL-oriented MT and contributes to the further development of MT technology. By applying GA, the limitations of traditional methods in LRL can be overcome and the quality and efficiency of translation can be improved. It is of great significance to improve the development of translation technology of LRL, enhance cross-language communication, and promote global cultural exchange. [ABSTRACT FROM AUTHOR]

The fuzzy min-max (FMM) neural network can be regarded as a typical fuzzy hyperbox classifier that is designed in a sequential way, which leads to an input order drawback and overlap elimination limitation. In this paper, we propose a two-stage-based genetic algorithm (TGA) to construct blue a fuzzy hyperbox classifier (FHC) in a simultaneous way. The simultaneous method is realized by estimating all parameters of hyperboxes at one time rather than by separately determining the parameters of hyperboxes in a sequential way. In this paper, we propose a two-stage-based genetic algorithm to construct the fuzzy hyperbox classifier. The overall TGA consists of two stages, namely, the construction stage and optimization stage. The construction stage is aimed at designing the FHC structure, while the goal of the optimization stage is to further optimize the FHC structure. Using a two-stage genetic algorithm to directly construct a fuzzy hyperbox classifier can overcome the problem of input order and hyperbox overlap. The experimental results show that the proposed FHC yields higher classification accuracy in comparison with the stage-of-the-art FMMs reported in the literature. [ABSTRACT FROM AUTHOR]

The increasing inclusion of electric vehicles (EVs) in distribution systems is a global trend due to their several advantages, such as increased autonomy and reduced price. However, this growth requires a high investment in electric vehicle charging stations (EVCSs) infrastructure to satisfy the demand. Thus, in this paper, an adequate planning of the EVCSs allocation and sizing is carried out to ensure better power quality indices, in addition to reducing costs related to EVCSs installation and EV users' recharging. Besides the optimal planning of EVCSs, this paper performs the optimal allocation and sizing of distributed energy resources (DERs) in order to mitigate the problem related to voltage levels and power losses. Additionally, a spatial distribution of EVs was performed for the 24 h, considering residential and commercial nodes of a distribution feeder test, from the closeness centrality of graph theory. The non-dominated sorting genetic algorithm II (NSGA-II) was applied to obtain the Pareto curve, which made it possible to minimize the objective functions for the IEEE 34-node test feeder. Even with the integration of EV loads, the optimal allocation and sizing of EVCSs and DERs promoted a reduction in voltage deviation and power losses of 11.576% and 56.683%, respectively, in addition to a low variation in the energy costs of 4.447%. [ABSTRACT FROM AUTHOR]

Most of the kinematic calibration methods of parallel mechanisms only consider the geometric error of the mechanism, and the calibration effect is poor. To improve the calibration effect, this paper takes the 3-PTT (3-prismatic hook hook) parallel mechanism as the research object and proposes a kinematics calibration method based on the normalized representation model of the geometric error and non-geometric error of the mechanism. First, the degree of freedom of the mechanism is analyzed, its kinematics positive and negative solutions are solved, and its singularity is analyzed. Secondly, a normalized characterization method of mechanism geometric errors and non-geometric errors is proposed, and an error model without redundant parameters is constructed. The end motion error of the machine is measured by laser tracker, and the objective function is constructed. The genetic algorithm is designed to solve the minimum value of the objective function, and the normalized error of the mechanism is identified. By comparing with the recent methods, the better identification performance of the algorithm in this paper is verified. Finally, the kinematics model was corrected according to the identification results. After the calibration was completed, the movement errors of the end of the mechanism along each coordinate axis were reduced by more than 99 %. Compared with other calibration methods, the better calibration performance of the method in this paper is verified. [ABSTRACT FROM AUTHOR]

Computation offloading and service migration are two major research hotspots in the mobile edge computing (MEC) environment. However, in the existing MEC architecture, the idle computing resources of offsite edge servers are not fully utilized, which leads to the problem of high overall system time and energy costs. In this paper, we propose a multi-edge collaborative computation offloading strategy for this problem. The strategy analyzes and calculates the energy consumption and latency cost of task execution for local terminals, edge servers and central cloud, constructs a computation offloading model with the weighted sum of latency and energy consumption as the optimization objective, and then solves the model using an improved genetic algorithm to obtain the best computation offloading decision. On the other hand, the mobility of users in the MEC environment leads to service migration, which leads to unbalanced load on the edge servers and network congestion, etc. This paper proposes an energy threshold-based task migration strategy. The strategy analyzes the time and energy consumption of service execution and data transmission, designs an edge server selection algorithm based on the energy consumption threshold, constructs a service migration model, and finally solves the optimal service migration strategy by improving the genetic algorithm. Experimental results show that the multi-edge collaborative computation offloading strategy proposed can significantly improve the performance of data transfer cost, energy consumption, and task completion time. The proposed migration strategy based on energy consumption threshold can significantly improve the performance of mobile server energy consumption, service completion time, and data transfer energy consumption. [ABSTRACT FROM AUTHOR]

Music expresses thoughts and emotions in artistic form and is made up of different components including harmony, rhythm, and melody. Several musical elements are tied together during the songwriting process in order to generate melodies that are harmonic. A music melody is the essential element of any music to generate strong feelings from listeners and capture their interest. In the process of music appreciation, melody controls the emotional changes of music. It is an efficiently perceived part and the tone of a song. In recent years, Sichuan unvoiced music has developed rapidly and attracted much attention. This paper selects Sichuan unvoiced music as the main research theme and constructs a melody generation algorithm by utilizing the state-of-the-art techniques of deep learning (DL) and evolutionary algorithms (EAs) such as recurrent neural network-long short-term memory (RNN-LSTM) and genetic algorithm (GA). Firstly, this paper briefly describes the concept of DL algorithms, the deep generation model, and sequence to sequence model, as they constitute the technological foundation for this research. Secondly, this paper proposes a melody generation algorithm that utilizes RNN-LSTM for melody generation and GA for melody optimization. More specifically, the melody is generated by preprocessing data, creating, and training the RNN-LSTM model. A GA was used to determine the melodic fitness function for eight songs as the fitness function directly affects the selected termination condition. The fitness function can be thought of as either a person or an evolutionary rule. Finally, the average score of these songs, before and after evolution, is calculated, which demonstrates that the analysis and rotation creation methods are more precise and that the song's average melody score is higher. The method proposed in this study has been thoroughly compared to the existing approaches proposed in earlier studies, and it was found that the approach we propose is more effective in terms of accuracy and the average melody score. [ABSTRACT FROM AUTHOR]

Nowadays time series clustering is of great importance in manufacturing industries. Meanwhile, it is considerably challenging to achieve explainable solution as well as significant performance due to computation complexity and variable diversity. To efficaciously handle the difficulty, this paper presents a novel metaheuristic-based time series clustering method which can improve the effectiveness and logicality of existing clustering approaches. The proposed method collects candidate cluster references from hierarchical and partitional clustering through shape-based distance measure as well as dynamic time warping (DTW) on manufacturing time series data. By applying metaheuristics highlighting estimation of distribution algorithms (EDA), such as extended compact genetic algorithm (ECGA), on the collected candidate clusters, advanced cluster centroid combinations with minimal distances can be achieved. ECGA employs the least complicated and the most closely related probabilistic model structure regarding population space during generation cycle. This feature strengthens the comprehension of clustering results in how such optimal solutions were achieved. The proposed method was tested on real-world time series data, open to the public, from manufacturing industry, and showed noticeable performances compared to well-established methods. Accordingly, this paper demonstrates that obtaining both comprehensible result as well as prominent performance is feasible by employing metaheuristic techniques to time series data clustering methods. [ABSTRACT FROM AUTHOR]

In this paper, a multi-objective optimization approach to solve the problem of optimal allocation and sizing of inverter-based distributed energy resources (DERs) in distribution systems is presented. The objectives of this allocation and sizing problem consist of the minimization of the investment and operation costs, the voltage deviation and the short-circuit currents. The recloser–fuse coordination constraints were included in the mathematical formulation of the problem, in order to preserve the original network protection scheme. It is important to mention that this protection scheme was also carried out in this paper, using the multi-objective approach, to minimize the operating time of the reclosers and fuses. The distribution system considered to evaluate the proposed methodology was the IEEE 34-Node Test Feeder, and the non-dominated sorting genetic algorithm II was used to solve the proposed multi-objective problems. Furthermore, a time-series-based probabilistic approach, through the Monte Carlo simulation, was adopted to deal with the uncertainties of the load and power generated by each DER. Finally, from the results, it was possible to reduce the investment and operation costs by 15.61% when compared to the system without DERs, improve the voltage profile and preserve the original protection scheme present in the network. [ABSTRACT FROM AUTHOR]

Electric vehicles (EVs) are a promising solution to resolve the greenhouse emission issue as well as the fossil fuels scarcity problem in the future. However, as the number of EVs significantly increases, the excessive charging demand of EV parking lots (EVPLs) in the charging station may incur an instability problem to the electricity network. In this paper, the optimal allocation and sizing of EVPLs were carried out in order to minimize the costs of the EVPLs installation and EV users' distance traveled and recharge. As a consequence, it encourages the participation of vehicle users in a demand response program related to smart charging and time of use tariffs. It is important to mention that the increasing inclusion of EVs negatively affects the voltage level and power losses of the distribution system. Therefore, this paper also performs the optimal allocation and sizing of distributed energy resources (DERs) in order to mitigate these problems. The non-dominated sorting genetic algorithm II (NSGA-II) was applied to obtain the Pareto curve, which made it possible to minimize the objective functions for the IEEE 33-node test feeder and 25-node transportation network. Furthermore, it was considered a spatial distribution of EVs for the 24-h from the closeness centrality of graph theory. The optimal planning of EVPLs and DERs promoted a 35%, 23.14% and 34.11% reduction of the travel distance, voltage deviation and power losses, respectively. [ABSTRACT FROM AUTHOR]

The purpose of this paper is to develop and test three meta-heuristic algorithms to solve large size multi-objective supply chain network design problems. The algorithms are based on tabu search, genetic algorithm, and simulated annealing to find near-optimal global solutions. The three algorithms are designed, coded, and tested, and their parameters are fine tuned. The exact ε-constraint algorithm embedded in the General Algebraic Modeling System is used to validate the results of the three algorithms. The algorithms are compared using a typical multi-objective supply chain model utilizing several performance measures. The measures include the mean ideal distance, diversification metric, and percent of domination, inverted generational distance, and computation time. The results show that the tabu search algorithm outperformed the other two algorithms in terms of the percent of domination and computation time. On the other hand, the simulated annealing solutions are the best in terms of their diversity. The work in this paper is expected to help managers to solve large-scale supply chain problems that arise in oil and gas, petrochemical, and food supply chains. [ABSTRACT FROM AUTHOR]

The coronavirus first appeared in China in 2019, and the World Health Organization (WHO) named it COVID-19. Then WHO announced this illness as a worldwide pandemic in March 2020. The number of cases, infections, and fatalities varied considerably worldwide. Because the main characteristic of COVID-19 is its rapid spread, doctors and specialists generally use PCR tests to detect the COVID-19 virus. As an alternative to PCR, X-ray images can help diagnose illness using artificial intelligence (AI). In medicine, AI is commonly employed. Convolutional neural networks (CNN) and deep learning models make it simple to extract information from images. Several options exist when creating a deep CNN. The possibilities include network depth, layer count, layer type, and parameters. In this paper, a novel Xception-based neural network is discovered using the genetic algorithm (GA). GA finds better alternative networks and parameters during iterations. The best network discovered with GA is tested on a COVID-19 X-ray image dataset. The results are compared with other networks and the results of papers in the literature. The novel network of this paper gives more successful results. The accuracy results are 0.996, 0.989, and 0.924 for two-class, three-class, and four-class datasets, respectively. [ABSTRACT FROM AUTHOR]

As the terminal of the power system, the distribution network is the main area where failures occur. In addition, with the integration of distributed generation, the traditional distribution network becomes more complex, rendering the conventional fault location algorithms based on a single power supply obsolete. Therefore, it is necessary to seek a new algorithm to locate the fault of the distributed power distribution network. In existing fault localization algorithms for distribution networks, since there are only two states of line faults, which can usually be represented by 0 and 1, most algorithms use discrete algorithms with this characteristic for iterative optimization. Therefore, this paper combines the advantages of the particle swarm algorithm and genetic algorithm and uses continuous real numbers for iteration to construct a successive particle swarm genetic algorithm (SPSO-GA) different from previous algorithms. The accuracy, speed, and fault tolerance of SPSO-GA, discrete particle swarm Genetic algorithm, and artificial fish swarm algorithm are compared in an IEEE33-node distribution network with the distributed power supply. The simulation results show that the SPSO-GA algorithm has high optimization accuracy and stability for single, double, or triple faults. Furthermore, SPSO-GA has a rapid convergence velocity, requires fewer particles, and can locate the fault segment accurately for the distribution network containing distorted information. [ABSTRACT FROM AUTHOR]

The need for intelligence in today's era has tremendously increased the demand for Internet of Things (IoT) devices implanted to collect and process diverse data. Cloud computing offers a plethora of services to computationally constrained internet of things devices, but latency degrades the performance of real-time applications. A few other computing paradigms have been developed through the years to overcome this limitation of IoT devices. Fog computing, one of these paradigms, comes into picture as a backbone and offers services to applications which are required to be processed within a deadline. However, addressing challenges such as heterogeneity, offloading mechanisms, resource allocation, and complexity is crucial. This paper presents a framework for intelligent offloading mechanisms and an efficient resource allocation that results in improving the quality of service (QoS) parameters in an integrated cloud-fog-IoT environment. The proposed Fuzzy based Harris Hawks -Genetic Algorithm (HHGA) applies fuzzy-based logic to offload tasks to respective paradigms (cloud or fog), where the upcoming IoT request will be executed. In addition, the Fuzzy-based HHGA algorithm is developed by combining conventional Harris Hawks Optimization (HHO) and Genetic Algorithm (GA) to improve the exploration and exploitation. The proposed algorithm is eventually integrated with the present framework to search for the optimal resources for upcoming requests and reduce the service cost, time, and energy consumption. The experiments are conducted and consecutively the performance of the proposed framework is evaluated. The results demonstrate that the proposed algorithm outperforms Harris Hawks Optimization by 16.95%, Genetic Algorithm by 38.23% and Particle Swarm Optimization (PSO) by 23.09%. [ABSTRACT FROM AUTHOR]

First-Person Shooter (FPS) games are among the most popular latency-sensitive multiplayer online games. A separate game server manages each multiplayer group hosted appropriately to meet the given Quality of Service (QoS) and Quality of Experience (QoE) requirements of the game and the players. Cloud computing is typically used to host these game servers to cope with changing workload requirements, given its elasticity, scalability, and on-demand provisioning characteristics [1]. However, the Cloud still suffers from known latency limitations, especially when dealing with latency-sensitive applications such as FPS games. Hence, Fog computing can be a good alternative for hosting FPS game servers, given that Fog nodes hosting the servers can be placed close to the players, thereby reducing latency. However, a careful resource management is necessary given the Fog's capacity unpredictability. This paper introduces an optimization-based game server placement approach that minimizes server costs while optimizing latency delays and, eventually, QoE for the players. A static model for the server placement problem is formulated as an Integer Linear Program (ILP) with valid inequalities. Given the complexity of the problem, a resolution strategy based on a non-linear, double penalty relaxation technique in conjunction with a proven Genetic Algorithm (GA) is developed. A dynamic version of the placement problem is also formulated to cope with the realistic scenarios dealing with changing multiplayer groups and Fog servers. A two-step dynamic scheme, based on the developed GA, is applied. Extensive simulations are conducted showing a good performance of the proposed approach both in terms of solution quality and execution time. [ABSTRACT FROM AUTHOR]

Virtual machine placement (VMP) has a significant importance with respect to resource utilization in cloud data centers. Indeed, the optimized management of machine placement usually results in a significant reduction in energy consumption. VMP is a bin packing problem generalization, which is a well known hard combinatorial optimization problem. Besides being NP-hard, VMP is characterized by conflicting objectives and a noisy search space. Meta-heuristics, such as genetic algorithms, particle swarm optimization (PSO), cuckoo search (CS), tabu search and simulated annealing (SA) have been shown to be effective for this category of problems. This paper reports a performance comparison between SA, CS and PSO meta-heuristics to solve the VMP problem. In contrast to reported research work in this area, we study the performance behavior of these three meta-heuristics with respect to, not only the quality of solutions, but also the quality of the explored solution sub-space, in addition to the convergence speed towards reported solutions and the speed with which each meta-heuristic evolves towards the best reported optimized solution. Extensive simulations on randomly generated tests with sizes varying between 200 and 1000 virtual machine demands show that PSO achieves the best performance behavior with respect to all criteria. Moreover, for all tests, PSO produces a reduction of as much as 17% of the number of physical machines, 15% of the energy cost and 21% of the resource utilization of physical machines. [ABSTRACT FROM AUTHOR]

In this research paper, we propose a two-stage hybrid approach that uses machine learning techniques and meta-heuristic algorithms. The first step, known as data preparation, involves converting string values to numeric format and subsequently normalizing the data. To increase the performance beyond the limitations of traditional methods, we use population-based meta-heuristic algorithms, namely Atom Search Optimization (ASO) and Equilibrium Optimization (EO), for feature selection, aiming to achieve global optimization. The second step, called attack detection, focuses on distinguishing normal traffic from malicious traffic. To improve the performance of this step, we use K-means clustering and firefly algorithm (FA). In addition, an elitism method is randomly integrated. The resulting approach is called ASO-EO-FA-K-means. We evaluate the performance of our proposed method using two datasets, namely NSL-KDD, UNSW_NB15, and KDD_CUP99. To establish a benchmark, we compare our method with other approaches including Particles Swarm Optimization (PSO), Genetic, Grey Wolf Optimization (GWO), Ant colony optimization (ACO), Harris Hawk Optimization (HHO), NSGA-2, Multi-objective PSO, Multi-objective GWO, learning vector quantization (LVQ), XGBoost, particle swarm optimization based on C4.5 (PSO-C4.5) and genetic algorithm based on multilayer perceptron (GA-MLP)) we compare. The evaluation results show that the proposed method achieves the highest accuracy and the lowest error rate in three datasets NSL-KDD and UNSW_NB15 KDD-CUP99 with accuracy values of 0.998, 0.995 and 0.995, respectively. In addition, our method shows superior efficiency in terms of computation time. In general, our research shows the effectiveness of the ASO-EO-FA-K-means method in intrusion detection and provides better accuracy and efficiency compared to alternative approaches. In all three data sets, the results have shown that NSL-KDD data set with MSE 0.012, accuracy value 0.998 has obtained better results than other data sets. [ABSTRACT FROM AUTHOR]

Tool design is very important in the modern manufacturing industry. However, the traditional tool design process often has a heavy workload, which reduces the production efficiency of tool manufacturing enterprises. To deal with these problems, this paper proposes an integrated tool design platform to solve the problems in tool design. The tool-integrated design platform uses parametric modeling technology to allow design engineers to quickly create a geometric model of the tool by setting key parameters. The platform also introduces cutting simulation technology. Design engineers can perform simulation analysis on the platform and evaluate its performance and feasibility by simulating different tool design schemes. At the same time, this paper also uses cloud database technology to realize the function of multi-person remote collaborative design. In addition, the platform also uses genetic algorithm to optimize the cutting depth, cutting width, feed rate, and spindle speed of the tool with the minimum three-way milling force as the goal to guide the actual processing and production. In summary, by introducing technologies such as parametric modeling, parametric simulation, and cloud databases, enterprises can effectively solve the problems in the tool design process. The design time cycle is greatly shortened, and multi-person remote collaborative design becomes more convenient. This will significantly improve the enterprise's production efficiency and help the tool's precise design. [ABSTRACT FROM AUTHOR]

An effective health status assessment (HSA) for pump station units (PSUs) is crucial for accurately determining their real status and providing technical support for safe operational decisions. Due to the limitations of existing data-driven HSA methods, which primarily focus on the temporal dependencies of monitoring signals and fail to explore the complex interconnections among signals comprehensively. Moreover, when constructing performance degradation indices based on linear differences, these methods do not effectively integrate heterogeneous signals, resulting in an incomplete and inaccurate assessment of the overall system degradation. This paper proposes a real-time comprehensive HSA method for PSUs based on multi-source heterogeneous uncertainty information. Initially, a health benchmark model (HBM) is built using CrossGNN, which possesses cross-scale and cross-variable interaction capabilities, to precisely capture the temporal dependencies and dynamic relationships among variables in monitoring signals. Subsequently, key measurement points that reflect the operational status of the PSUs are identified through correlation analysis to establish multi-source evaluation indices. Then, considering the uncertainty in signal changes, a novel health degradation index (HDI) is developed using Mahalanobis distance (MD) and the Gaussian Cloud Model (GCM) to analyze changes in unit status. Furthermore, a weighting calculation method based on the non-dominated sorting genetic algorithm (NSGA-II) is proposed to establish a real-time comprehensive health index (RCHDI) for a thorough assessment of PSUs status. Finally, the effectiveness of the proposed method is validated through a case study using data from a pump station in the South-to-North Water Diversion Project in China. The results show that, compared to other studies, the proposed method significantly improves the stability and smoothness of the state assessment curve, with increases of 21.5% and 47.1% respectively, providing a new perspective for comprehensively assessing the health status of PSUs.V [ABSTRACT FROM AUTHOR]

As a carrier of multi-industrial technology integration and the key to industrial competition, the intelligent connected vehicle (ICV) has been taken seriously around the world. However, as a fast-growing emerging industry, its development process varies greatly from place to place. Hence, the merits and demerits are analyzed for the development of the ICV industry in different cities scientifically and to clarify the development of different links in each city, this paper suggests an extensive assessment framework integrating rough set theory and projection pursuit-based computation to systematically assess and thoroughly evaluate the level of competitiveness of the ICV industry. First, through big data text analysis technology, we constructed a "5 + 24" two-tier evaluation index system composed of 24 level-II evaluation indexes as well as five level-I evaluation indexes and selected 19 typical cities as input data for the comprehensive evaluation system. Further, the Adaptive Random Forest based Crossover Tactical Unit (ARF-CTU) algorithm is proposed for evaluating the performance of the industrial vehicle industry. However, the ARF algorithm is employed to estimate the lowering of overfitting issues and handling of high dimensional data. Moreover, the continuously varying conditions are analyzed by CTU. Then, we constructed a comprehensive evaluation system in the rough set theory and projection pursuit: (I) Quoting the rough set non-decision-making algorithm for attribute reduction, that is, under the premise of unchanged classification ability, derive a new evaluation system, and calculate the index weight and score based on the new system. (II) Based on the projection pursuit technology, the index score is mapped by a genetic algorithm to a linear structure, and a one-dimensional projection vector is an output. [ABSTRACT FROM AUTHOR]

Improvement of particle swarm optimization (PSO) is relevant to solving the inherent local optima and premature convergence problem of the PSO. In this paper, a novel improvement of the particle swarm optimization is provided to curb the problem of the classical PSO. The proposed improvement modifies the updating velocity function of the PSO, and it uses a local best murmuration particle which is found using the k-means clustering technique. In this contribution, each particle moves towards the global best position by not only using the personal best and global best, but particles are modelled to move in murmuration towards the global best using the personal best, global best and a local best particle known as the local best murmuration particle. The improved model was tested against the traditional PSO and two other variants of the PSO and genetic algorithm (GA) using 18 benchmark test functions. The proposed improvement demonstrated superior exploration abilities by achieving the best optimum values in 15 out of 18 functions, particularly in the multimodal functions, where it achieved the best optimum value in all 6 cases. It also achieved the best worst-case values in 12 out of 18 functions, especially in the variable-dimension functions, where other algorithms showed significant escalation, indicating the proposed improvement's reliability and robustness. In terms of convergence, the proposed improvement exhibited the best convergence rate in all 18 functions. These findings highlight the impressive ability of the proposed improvement to converge swiftly without compromising accuracy. [ABSTRACT FROM AUTHOR]

The paper proposes an innovation method of integrating a multi-agent reinforcement learning and 3D A* search, , to tackle the facility layout problem with the goal of minimizing connector-assembly cost, including wires and pipes, in a finite three-dimensional space subjected to complex constraints. The mathematical model is established through the bounding boxes and grids, and an improved 3D A* algorithm is used to evaluate the route quality of connectors. After defining facility states in the ranking way, the position and orientation of each facility are iteratively solved by the multi-agent reinforcement learning, Wolf Policy Hill-Climbing (Wolf-PHC), with three actions of horizontal movement, rotation and swap. Then a pure water manufacturing system has been taken as a case to carry out a series of combination comparative experiments with other approaches (Dijkstra; Ant colony optimization; Genetic algorithm) used in the relevant literatures and the parameter values of these approaches have been sampled by Latin Hypercube. The results show that the stability, efficiency and solving quality of are better. [ABSTRACT FROM AUTHOR]

In this paper, the structures and properties of (HF)nH2O (n = 1–9) clusters are studied by the combination of genetic algorithm (GA) and density functional theory(GDF) method. The structures are optimized at B3LYP/6–311++G(d,p) level. The refined energies are computed at CCSD(t)/aug-cc-pVDZ level. Infrared spectrum analysis, charge analysis, orbital analysis, and stability analysis are performed on the most stable configurations of each size. Lower-lying structures are obtained for (HF)nH2O (n = 5,6) clusters. (HF)7H2O cluster has special ability based on stability analysis. NCI analysis is conducted on the global optimal structure of all size clusters, and it is found that there are obvious hydrogen bonds in the clusters. Hydrogen bonding is an important factor in stabilizing (HF)nH2O (n = 1–9) composite clusters. The studied clusters can be divided into two categories: non-ionic clusters (HF)nH2O (n = 1–5) and ionic clusters (n = 6–9). [ABSTRACT FROM AUTHOR]

In this paper, a permanent magnet synchronous machine (PMSM) with an auxiliary winding (AW) on the rotor is analyzed by two-dimensional approach. This PMSM with AW (AWPMSM) can be used in many applications such as propulsion system, aircraft and traction because it includes rotor flux control capability. First, the magnetic field in different parts of AWPMSM is calculated based on Maxwell equations. Then, as a consequence of the magnetic field, the torque components, including cogging, reluctance, electromagnetic and instantaneous torque are computed. Next, torque-speed characteristic has been investigated. This AWPMSM can be located in the flux weakening mode in two ways, first one is to attenuate the rotor field by changing the direction of the AW field and the other one is to adjust the armature current angle, both of them have been investigated. After that, the overload capability and temperature effects have been analyzed. Finally, using the meta-heuristic algorithms such as genetic algorithm, particle swarm optimization, differential evolution and teaching learn base optimization the dimensions of AWPMSM and the initial angle of the rotor are determined in such a way that the torque-to-volume ratio is maximized. The influences of the type of armature winding and the magnetization patterns have also been investigated. The results obtained by the two-dimensional method have been confirmed numerically. [ABSTRACT FROM AUTHOR]

Electric vehicles are considered as an emerging solution to mitigate the environmental footprint of transportation sector. Therefore, researchers and automotive developers devote significant efforts to enhance the performance of electric vehicles to promote broader adoption of such technology. One of the critical challenges of the electric vehicle is limited battery lifetime and entailed range anxiety. In his context, development of counter-aging control strategies based on precise battery modeling is regarded as an emerging approach that has a significant potential to address battery degradation challenges. This paper presents a combined trade-off strategy to minimize battery degradation while maintaining acceptable driving performance and charge retention in electric vehicles. A battery aging model has been developed and integrated into a full vehicle model. An optimal control problem has been formulated to tackle the afore-mentioned challenges. Non-dominant sorting genetic algorithms have been implemented to yield the optimal solution through the Pareto-front of three contending objectives, based upon which an online simulation has been conducted considering three standard driving cycles. The results reveal the ability of the proposed strategy to prolong the life cycle of the battery and extend the driving range by 25 % and 8 % respectively with minimal influence of 0.6 % on the driveability. [ABSTRACT FROM AUTHOR]

Computational intelligence (CI) has become one of the most useful and successful tools for dealing with uncertainties and complex problems in many fields, such as neural networks, genetic algorithms, and swarm intelligence, artificial intelligence, risk management, financial monitoring, etc. With the development of CI, abundant publications have arisen related to many research directions and hotspots. Based on the technical support from bibliometrics and the corresponding approach as well as the content analysis, this study conducts a science mapping analysis and a coherent knowledge picture of the research field in CI. The research contributes to clear future development trends and provides more ideas for scholars in this field. First, this paper focuses on the fundamental characteristics of CI publications, including annual numbers, term co-occurrence, and hot research directions, as the preliminary exploration of this field. Then, according to the widely used core database, i.e., Web of Science (WoS), and the technologies of software, VOS viewer, and CiteSpace, the productive institutions, authors, and journals are explored. Next, the corresponding internal characteristics of the CI research are analyzed, including the citation features of countries/regions, institutions, journals and authors. Furthermore, to analyze the development trend of research hotspots, the keywords of all CI publications are studied: (a) classifying them into three phases in chronological order aimed; (b) implementing the burst detection algorithm to intuitively reflect the scientific research in the field of CI. Finally, this paper provides a relatively throughout perspective for the CI articles and reviews and discloses the future development trend, which will help the scholars interested in this area conduct deep research. We conclude this bibliometric overview with the limitations and recommendations for future research in the field of CI. [ABSTRACT FROM AUTHOR]

Cuckoo search (CS) algorithm is a classical swarm intelligence algorithm widely used in a variety of engineering optimization problems. However, its search accuracy and convergence speed still have a lot of room for improvement. In this paper, an improved version of the CS algorithm based on intelligent perception strategy, adaptive invasive weed optimization (AIWO), and elite cross strategy, called IIC-CS is proposed. Firstly, the intelligent perception strategy can update the value according to the searching state. Moreover, the CS is hybridized with the AIWO to improve the searching performance of the algorithm. Additionally, the elite cross strategy is employed to enhance the exploration capability and exploitation capability of the algorithm. Combining the improvements of these three methods, the performance of the CS algorithm is significantly improved. Meanwhile, 23 classical benchmark functions, some CEC2014 and CEC2018 benchmark functions are used to test the search accuracy and convergence rate of the IIC-CS. Furthermore, some classical or state-of-the-art algorithms such as the genetic algorithm (GA), particle swarm optimization (PSO), bat algorithm (BA), ant lion optimizer (ALO) and cuckoo search (CS) algorithm, invasive weed optimization (IWO), integrated cuckoo search optimizer (ICSO) and improved island cuckoo search (iCSPM2) are used to make comparisons. Through the statistical results of the experiments, we find that the IIC-CS algorithm can achieve better results on most benchmark functions compared to other algorithms, thus demonstrating the effectiveness of the improvements and the superiority of the IIC-CS algorithm. [ABSTRACT FROM AUTHOR]

The CNC machining scheduling problem is a classic flexible job shop scheduling problem (FJSSP) that has been proven to be NP-hard. Although there has been extensive research on FJSSP, its applications in real-world CNC machining scheduling problems have received limited attention, with few related papers. In reality, several critical characteristics within the CNC machining industry can significantly impact the scheduling problem, such as process plan flexibility, multiple resource constraints, and lot streaming. This study aims to establish a scheduling system for the CNC machining industry that integrates order information, work in process information, and the aforementioned characteristics, using a hybrid multi-objective genetic algorithm (HMOGA) combined with local search. The optimal parameter combination for HMOGA is determined through a design of experiments, while the effectiveness of local search is evaluated using computational analysis. Finally, real data from a company is used to validate the proposed method. The results demonstrate that the scheduling system developed in this study effectively addresses real-world CNC machining scheduling problems. [ABSTRACT FROM AUTHOR]

This paper considers jointly scheduling the production and resource-constrained maintenance activities in a manufacturing setting with unrelated parallel machines. In particular, a single maintenance activity needs to be scheduled on each machine in one of its available time windows, and the maintenance activities require a scarce resource, thereby limiting the number of maintenance activities that can be scheduled simultaneously on different machines. In addition, machine- and sequence-dependent setup times, machine eligibility constraints and job-specific release and due dates are considered. A mixed-integer linear program is formulated with objectives including the makespan and, motivated from practice, a weighted sum of total production completion times at machines and total job tardiness. Additionally, a hybrid genetic algorithm with a novel solution representation is proposed for solving industry-scale large instances. A case study is performed with real-world data from a semiconductor manufacturer, where production and maintenance are scheduled separately. The benefit of simultaneously scheduling production and maintenance is investigated. Tests with real-world data show that the proposed model results in schedules that substantially improve the current factory practice. [ABSTRACT FROM AUTHOR]