Search

Ensuring sufficient mechanical performance while enabling lightweight design is critical for utilizing paper sandwich panels in the furniture industry. To design lightweight sandwich panels that balance mechanical properties and cost, this study developed a circular core paper sandwich panel (CCPSP) and investigated its structural efficiency using multi-objective optimization. The response surface method (RSM) based on Box–Behnken design was utilized to establish mathematical models relating the paper tube spacing, inner diameter, and height to the out-of-plane compressive strength, density, and cost. The resulting models effectively revealed the coupled effects of the parameters on the responses. Subsequently, the models were optimized using the non-dominated sorting genetic algorithm II (NSGA-II) to find the Pareto optimal trade-offs between maximizing compressive strength while minimizing its density and cost. The optimization solution resulted in an optimal set of paper tube geometries that maximized the structural efficiency of CCPSP. Overall, lower tube height conferred superior structural efficiency, while tube spacing and diameter were constrained. The results highlight the potential of CCPSP as an efficient and sustainable material for furniture manufacturing, enabled by multi-objective optimization of its structure. [ABSTRACT FROM AUTHOR]

This paper proposes a digital twin enhanced approach for optimizing collaborative production scheduling in multi-enterprise manufacturing systems. A multi-objective model is developed incorporating practical constraints such as limited time windows, different production capacities, and transportation considerations. To solve the model, an Improved Non-dominated Sorting Genetic Algorithm (INSGA-II) is designed with specialized operators and strategies. The digital twin simulation is enriched with Multi-objective Decision Making based on Interaction Structures (MDIS) to obtain higher-quality solutions. Experiments demonstrate that the MDIS digital twin approach reduces manufacturing lead times and costs while improving utilization and quality compared to standard methods. This research provides an effective optimization framework to leverage cloud manufacturing resources across organizations. [ABSTRACT FROM AUTHOR]

This paper proposes the shortest path optimization algorithm for domestic and overseas e-commerce logistics based on a bilateral search method. This paper uses the logistics distribution route optimization algorithm based on the shortest path to set the collaborative parameters. Then, it builds an adaptive optimization model for the grid planning of domestic and overseas e-commerce logistics path. The route is optimized. Then, the PSO and genetic algorithm are integrated to establish the logistics path planning model of domestic and overseas e-commerce. The superiority of the proposed route optimization algorithm in domestic and overseas e-commerce logistics distribution is verified through simulation experiments. This algorithm has high spatial positioning efficiency and high transportation efficiency. [ABSTRACT FROM AUTHOR]

The ship piping layout is one of the essential tasks in the detailed design stage of a ship. Traditional manual expert design has disadvantages such as low efficiency, reliance on experience, and subjective influence. Therefore, this paper systematically proposes an intelligent arrangement method for ships' single, parallel, and branch pipelines. Firstly, the traditional genetic algorithm is improved and combined with the A* algorithm to solve the intelligent arrangement problem of a single pipeline in ships. Then, the parallel pipeline and branch pipeline are split into multiple single pipelines by combining with the connection point strategy to solve the arrangement problem of parallel pipeline and branch pipeline. Finally, the optimized A*-genetic algorithm proposed in this paper is compared with the A* algorithm, particle swarm algorithm, and the labyrinth-genetic algorithm used in previous research through simulation experiments. The results show that the A*-genetic algorithm of this paper is optimal in six indexes, including length, number of elbows, energy value, fitness value, number of optimal solutions, and average number of convergence generations, in the arrangement of the single pipeline. In solving the parallel pipeline and branch pipeline arrangement problems, the all-around performance of this paper's algorithm is better than that of A*-genetic algorithm and maze–genetic algorithm, respectively. The A*-genetic algorithm of this paper considers the quality of pipeline arrangement and the solution's efficiency. It verifies the adaptability and superiority of the algorithm for the intelligent arrangement of various types of pipelines in ship pipelines. [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]

Aerodynamic/stealth optimization is a key issue during the design of a stealth UAV. Balancing the weight of different incident angles of the RCS and combining stealth characteristics with aerodynamic characteristics are hotspots of aerodynamic/stealth optimization. To address this issue, this paper introduces a radar detection probability model to solve the weight balance problem of incident angles of the RCS and a penetration efficiency model to transfer the multi-object optimization into single-objective optimization. In this paper, a parameterized model of a flying-wing UAV is selected as the research object. A gradient-free optimization algorithm based on the genetic algorithm is used for maximizing efficiency. The optimization model balances the influence of the RCS mean value and RCS peak value on stealth performance. Moreover, the model achieves an optimal entire life cycle penetration efficiency coefficient by balancing aerodynamic and stealth optimization. The results show that the optimized model improves the penetration efficiency coefficient by 13.84% and increases maximum flight sorties by 1.8%. These results prove that the model has a reasonable combination of aerodynamic and stealth optimization for UAVs undertaking penetration missions. [ABSTRACT FROM AUTHOR]

Energy saving has become a key concern of metro systems to reduce operating costs and meet the requirements of sustainable development. Energy-efficient timetabling, an effective way to reduce traction energy consumption, has gotten much attention in recent decades. However, limited research about energy-efficient timetabling simultaneously considered realistic speed profiles and the influence of train loads, which change greatly in different sections and significantly affect energy consumption. Therefore, this paper proposes an energy-efficient timetabling approach to improve regenerative energy utilization based on varying train loads and realistic speed profiles for bidirectional metro lines. First, based on the operational and safety constraints, this paper constructs an integer energy-efficient timetabling model where dwell times and nonuniform headways are taken as decision variables. Besides, the turnaround process is also considered to ensure rolling stock circulation efficiency. Sectional passenger volumes are employed to determine the varying train loads. Energy consumption is calculated based on realistic speed profiles. Owing to the complexity of the model, an improved adaptive large neighborhood search (ALNS) algorithm is designed to solve this model according to its characteristics. Finally, numerical examples are conducted based on the practical data from Shanghai Metro Line 17. The results indicate that the proposed approach effectively solves the energy-efficient timetabling problem with varying train loads and realistic speed profiles for bi-directional metro lines. The approach is suitable for off peak hours and can reduce energy consumption effectively, and the reduction is up to 11.9% for the presented cases. The improved ALNS algorithm can find good solutions within reasonable times in different cases. Moreover, compared with the widely used genetic algorithm in the literature, the improved ALNS algorithm is more efficient in solving the proposed energy-efficient timetabling problem in different cases. [ABSTRACT FROM AUTHOR]

This paper introduces a novel type of connection that integrates unbonded prestressed strands (UPS) and mortise-tenon in an assembly frame structure (UPS-MTF). First, the damage process and failure modes of the joints under reciprocating horizontal loads were systematically analyzed using refined numerical models. The recommended values of the design parameters of the joints were derived from the parametric analysis results. Refined numerical modeling results reveal the diagonal compression strut mechanism within the core region of the joint. The diagonal compression struts model assists in establishing the theoretical calculation formula for the skeleton curve of shear stress–strain in the core region. Second, a genetic algorithm (GA) parameter was identified for the restoring force model of the core region to determine the parameters of the hysteresis rules. Finally, a macro-simplified analytical model of the joint was created based on the restoring force model of the core region, and parameter analysis was conducted to verify the applicability of this macro-simplified analytical model. The research results prove that the damaged form of the joint proposed in this paper originates from the shear and relative slip damage between the components in the core region. The axial compression ratio significantly affects the hysteretic performance of the joints, and the upper and lower limit values were identified for the axial compression ratio of the joints. The area and initial effective stress of the UPS exert a minimal effect on the hysteretic performance of the joint. Based on the method proposed in this paper for determining the restoring force model in the core region of the joints, the hysteresis curves obtained from the macro-simplified analytical model closely match the refined numerical analysis model results. This correspondence verifies the applicability of the macro-simplified analytical model. [ABSTRACT FROM AUTHOR]

This paper presents a multi-objective optimization analysis to improve the controller tuning of three-element control loop for the best fit to both its servo and regulatory control objectives during the process operations. The existing Proportional-Integral-Derivative (PID) controller tuning for the three-element control loop is challenging because the best setting of each controller is obtained during the concurrent analysis, but all controller settings affect the control performance of other control loops and the output responses. Furthermore, this paper highlights the determination of Upper Limit (UL) and Lower Limit (LL) bounds by using the necessity criterion of Routh-Hurwitz stability analysis. The Genetic Algorithm (GA) and Particle Swarm Optimization (PSO) are used as the optimization algorithms to improve the control performances. Both optimization analysis are operated by using a developed Graphical User Interface (GUI) via MATLAB software. At the same time, the optimized PID controller settings are applied to the steam boiler drum function of the LOOP-PRO simulator. Both GA and PSO outperform the manual tuning for the three-element loop. Among them, GA performs better than PSO even though both methods are capable of suggesting highly satisfactory performances. [ABSTRACT FROM AUTHOR]

With the large-scale integration of distributed generation (DG), it is difficult to realize distribution network planning and operation under specific requirements using the traditional cluster division method based on a single criterion. To reduce the complexity of frequency regulation control strategies, this paper proposes a cluster division method that synthesizes structural and functional indexes. First, the ability of DG within a cluster to provide flexibility to the system is analyzed. Then, a cluster response speed model is proposed to cope with the frequency regulation of demand flexibility on shorter time scales. Based on the above analysis, this paper proposes a distributed generation cluster (DGC) frequency regulation response speed index. The combined electrical distance based on the impedance–power reserve (I–PR) is defined by considering the power reserve of each node of the system. The I–PR is weighted to the structural indexes to improve the division. Meanwhile, in order to enhance the convergence speed of the algorithm for the division process, an adaptive genetic algorithm (GA) based on the encoding method of the weighted network adjacency matrix is used. Finally, distributed generation cluster division is performed on two systems to verify the validity of the proposed indexes in this paper. [ABSTRACT FROM AUTHOR]

The generation of test vectors is a key technique that affects the efficiency and fault detection rate of the boundary scan test. Aiming at the local optimal solution problem of the current common test vectors generation algorithm, this paper proposes a test vectors generation algorithm based on improved GA-AO* model, through which the test vectors are generated by using the idea of heuristic search and backtracking correction. In order to speed up the heuristic search, this paper designed a heuristic function with both prior and posterior parameters to describe the influence of typical faults on the failure probability index of the test vectors. At the same time, this paper used a genetic algorithm (GA) to determine the specific values of the posterior parameters iteratively. Finally, through theoretical analysis and physical verification, compared with the test vector generated by the traditional method, the test vector generated by this method is optimized on the prior failure probability index and performs better in the physical experiment. [ABSTRACT FROM AUTHOR]

The agile remote sensing satellite scheduling problem (ARSSSP) for large-scale tasks needs to simultaneously address the difficulties of complex constraints and a huge solution space. Taking inspiration from the quantum genetic algorithm (QGA), a multi-adaptive strategies-based higher-order quantum genetic algorithm (MAS-HOQGA) is proposed for solving the agile remote sensing satellites scheduling problem in this paper. In order to adapt to the requirements of engineering applications, this study combines the total task number and the total task priority as the optimization goal of the scheduling scheme. Firstly, we comprehensively considered the time-dependent characteristics of agile remote sensing satellites, attitude maneuverability, energy balance, and data storage constraints and established a satellite scheduling model that integrates multiple constraints. Then, quantum register operators, adaptive evolution operations, and adaptive mutation transfer operations were introduced to ensure global optimization while reducing time consumption. Finally, this paper demonstrated, through computational experiments, that the MAS-HOQGA exhibits high computational efficiency and excellent global optimization ability in the scheduling process of agile remote sensing satellites for large-scale tasks, while effectively avoiding the problem that the traditional QGA has, namely low solution efficiency and the tendency to easily fall into local optima. This method can be considered for application to the engineering practice of agile remote sensing satellite scheduling for large-scale tasks. [ABSTRACT FROM AUTHOR]

Pressurized irrigation network systems constitute an important water-saving approach, but their relatively high costs limit their promotion. Pipe diameter optimization is the most direct way to reduce irrigation costs and can bring significant economic benefits. In recent years, material technology developments have improved networks' impact resistance, resulting in traditional flow velocity constraints no longer applying to current network designs, and appropriately increasing the velocity has become an engineering requirement. In addition, with the update of engineering construction standards, the location of pipe diameter changes is no longer limited to pipe section connections and is allowed to change between standard pipes. Therefore, this paper removes the constraint of the upper limit of flow velocity, defines it as a factor related to the maintenance cost of the network, and establishes a pipe section optimization model. Further, this paper changes the minimum optimization unit from pipe sections to standard pipes and establishes a standard pipe optimization model. The results show that compared with traditional optimization methods, the pipe section optimization model that deletes the upper velocity limit can reduce costs by 5.1%, in which the velocity will not increase infinitely but will be stable within a reasonable range. The standard pipe optimization model can reduce irrigation costs by 12.1%. It is worth noting that the two models were optimized to balance the head loss; their energy costs did not change significantly with the reduction in pipe diameter. In addition, this paper changes the structure of the traditional algorithm and designs a structure of double selection and parallel variation, achieving a faster and more accurate solution than the classic genetic algorithm. Practical Applications: Smart irrigation is an irrigation method based on advanced technology and data analysis that can manage water resources more accurately and efficiently. As an essential part of smart irrigation, pressure networks have the characteristics of saving water resources, improving the water utilization coefficient, and facilitating management and control. Their promotion can promote the development of agriculture. However, high network costs limit the popularity of smart network irrigation. Therefore, this study is based on the latest material technology, cancels the upper limit of flow velocity, and establishes a pipe section optimization model. Furthermore, this paper changes the minimum optimization unit from pipe sections to standard pipes and establishes a standard pipe optimization model. The research results show that the standard pipe optimization model can significantly reduce irrigation costs. This has practical significance for increasing farmers' income and promoting the development of smart pipeline irrigation. In addition, this paper changes the structure of the traditional algorithm and designs a structure of double selection and parallel variation, achieving a faster and more accurate solution than the classic genetic algorithm. [ABSTRACT FROM AUTHOR]

In this paper, we develop a multi-objective integrated optimization method for feeder buses of rail transit based on realistic considerations. We propose a bus stop selection method that considers the influence of shared motorcycles, which can score the importance of alternative bus stops and select those with the highest scores as objectives. The objective of the model in this paper is to minimize both the travel costs of passengers and the operating costs of the bus company. This is achieved by optimizing feeder bus routes, the frequency of departures, and interchange discounts to enhance the connectivity between feeder buses and rail transit. In addition, to ensure the feasibility of generated routes in the real road network, a genetic algorithm encoded with priority is used to solve this model. We use the Xingyao Road subway station in Kunming as an example, and the results show that the optimization method is effective. [ABSTRACT FROM AUTHOR]

Aiming to tackle the problems of low classification accuracy, difficult data processing, long analysis time, and the influence of subjective consciousness of traditional Baijiu (Chinese liquor), this paper reports a method based on the combination of laser-induced breakdown spectroscopy with high-frequency ultrasonic atomization system (AS-LIBS) and optimized grid search cross validation (Opt-GSCV) for high-precision and rapid classification of Baijiu of different dimensions. Multi-dimensional high-precision classification of 23 Baijiu samples with different series, degrees, and production dates from Shanxi Xinghuacun Fen Wine Factory Co., Ltd was performed. By studying the growth and evolution mechanism of plasma generated by laser excitation, a new method of Baijiu spectral signal acquisition was realized by combining LIBS with Baijiu detection. Aiming at addressing the shortcomings of high breakdown thresholds and poor signal stability due to the direct breakdown of Baijiu with high ethanol content, a high-frequency atomization system based on ultrasonic technology is proposed to realize the efficient extraction of Baijiu plasma spectral signals. With regard to the selection of the number of nodes, weights and thresholds of the implicit layer of the back-propagation (BP) network, an optimization model based on the combination of the particle swarm optimization (PSO) algorithm combined with the genetic algorithm (GA) is proposed to realize the construction of the BP optimal network architecture. By constructing a secondary optimization seeking network model based on OptGSCV, the technical problem of mismatch between optimal parameter selection and optimal network construction is solved, and a new network integrating an intelligent qualitative analysis algorithm and a traditional classification algorithm is realized. The experimental results show that the proposed OptGSCV quadratic optimization network combined with the AS-LIBS multidimensional Baijiu high-precision classification model not only introduces an innovative and high-efficiency detection method for the Baijiu industry, but also provides important technical support and new ideas for the key areas of food safety production and Baijiu quality control. [ABSTRACT FROM AUTHOR]

In this paper, a joint optimization algorithm of offloading decision, energy harvesting time, and unmanned aerial vehicle (UAV) location is proposed for user equipment (UEs)'s task completion latency problem in a communication–sensing–computing integration scenario with wireless energy supply. Under the constraints of causality of energy harvesting consumption by the UEs and conditional mutual information, the total latency minimization problem of the UEs is established. Firstly, the optimization variables of the problem are transformed from three variables of offloading decision, energy harvesting time, and UAV location to two variables of offloading decision and UAV location by means of the derived closed expression, and then the transformed optimization problem is decomposed into the offloading decision optimization sub-problem and the UAV location optimization sub-problem to be solved alternately and iteratively. The genetic algorithm is employed to tackle the optimization sub-problem of offloading decisions, and the successive convex approximation algorithm is applied to the drone positioning optimization sub-problem. Simulation results show that the proposed algorithm in this paper reduces the average task completion latency by 35 percent and 15 percent, respectively, compared to the two baseline algorithms for different numbers of UEs. [ABSTRACT FROM AUTHOR]

The data presented in this paper are related to the paper entitled "Optimal Estimation of Under-Frequency Load Shedding Scheme Parameters by Considering Virtual Inertia Injection", available in the Energies journal. Here, data are included to show the results of an Under-Frequency Load Shedding (UFLS) scheme that considers the injection of virtual inertia by a VSC-HVDC link. The data obtained in six cases which were considered and analyzed are shown. In this paper, each case represents a different frequency response configuration in the event of generation loss, taking into account the presence or absence of a VSC-HVDC link, traditional and optimized UFLS schemes, as well as the injection of virtual inertia by the VSC-HVDC link. Data for each example contain the state of the relay, threshold, position in every delay, load shed, and relay configuration parameters. Data were obtained through Digsilent Power Factory and Python simulations. The purpose of this dataset is so that other researchers can reproduce the results reported in our paper. Dataset: 10.5281/zenodo.11371324 Dataset License: Creative Commons Attribution 4.0 International (CC BY 4.0) [ABSTRACT FROM AUTHOR]

Many companies prefer to use third party logistics firms to deliver their goods and as such planning the return of the vehicles to the depot is not required. This is called open vehicle routing problem (OVRP). In literature, the OVRP is handled with minimum distance as objective function like vehicle routing problem. But in the real world, the objective function achieves minimum many costs like standard routing cost, stopping by cost and the deviation cost. The standard routes are previously defined under free market conditions by third party logistic firms. The deviation from the standard route is required to arrive cities which are not on the standard route. The stop by cost occurs on the delivery points. In this paper mentioned three costs are considered in the objective function while many papers consider only distance related costs in the literature. This paper proposes a new mathematical model for the OVRP. In the constraints, the last points of the routes are researched in detail. The standard route costs are determined by considering the last point of the route. Because of the NP-hard structure of the OVRP, the proposed mathematical model is solved with a hybrid metaheuristic called Civilized Genetic Algorithm (CGA). CGA is developed by hybridizing a modified genetic algorithm and a local search algorithm. The application of this study is implemented for the delivery routing of a combi boiler producer in Turkey. The third party logistic firms may use this proposed model and the solution approach for the real life applications. [ABSTRACT FROM AUTHOR]

Space layout design is a critical aspect of architectural design, influencing functionality and aesthetics. The inherent combinatorial nature of layout design poses challenges for traditional planning approaches; thus, it demands the exploration of novel methods. This paper presents a novel framework that leverages the potential of deep reinforcement learning (RL) algorithms to optimize space layouts. RL has demonstrated remarkable success in addressing complex decision-making problems, yet its application in the design process remains relatively unexplored. We argue that RL is particularly well-suited for the design process due to its ability to accommodate offline tasks and seamless integration with existing computer-aided design software, effectively acting as a simulator for design exploration. Framing space layout design as an RL problem and employing RL methods allows for the automated exploration of the expansive design space, thereby enhancing the discovery of innovative solutions. This paper also elucidates the synergy between the design process and the RL problem, which opens new avenues for exploring the potential of RL algorithms in design. We aim to foster experimentation and collaboration within the RL and architecture communities. To facilitate our research, we have developed SpaceLayoutGym , an environment specifically designed for space layout design tasks. SpaceLayoutGym serves as a customizable environment that encapsulates the essential elements of the layout design process within an RL framework. To showcase the effectiveness of SpaceLayoutGym and the capabilities of RL as an artificial space layout designer, we employ the Proximal Policy Optimization (PPO) algorithm to train the RL agent in selected design scenarios with both geometrical constraints and topological objectives. The study further extends to contrast the effectiveness of PPO agents with that of genetic algorithms, and also includes a comparative analysis with existing layouts. Our results demonstrate the potential of RL to optimize space layouts, offering a promising direction for the future of artificial intelligence-aided design. [ABSTRACT FROM AUTHOR]

Array-type electrostatic monitoring is gradually becoming an effective tool for aero-engine fault diagnosis. In this paper, we innovatively apply the surrogate optimization method to the optimization of the sensor array structure in order to meet the need of improving the particle information recognition capability of the electrostatic sensor array (ESA). A structure optimization method of ESA based on the Kriging surrogate model and improved NSGA-II algorithm is proposed. In this paper, a finite element simulation model of ESA is established, and the array optimization problem is abstracted as the solution of a mixed-integer optimization problem. This paper reduces the large-scale numerical simulations in the full-variable space with the help of the Kriging surrogate model. In addition, an improved NSGA-II algorithm for mixed-integer optimization is proposed. The simulation experiment verified that the average absolute error of the sensor before and after optimization for the identification of particle position and charge quantity was reduced by 69.88% and 49.68%, respectively. The array structure optimization method proposed in this paper facilitates the acceleration of the design process of electrostatic sensors and provides a scientific design method for their specific design for airborne application. [ABSTRACT FROM AUTHOR]

To improve the productivity, the resource utilization and reduce the production cost of flexible job shops, this paper designs an improved two-layer optimization algorithm for the dual-resource scheduling optimization problem of flexible job shop considering workpiece batching. Firstly, a mathematical model is established to minimize the maximum completion time. Secondly, an improved two-layer optimization algorithm is designed: the outer layer algorithm uses an improved PSO (Particle Swarm Optimization) to solve the workpiece batching problem, and the inner layer algorithm uses an improved GA (Genetic Algorithm) to solve the dual-resource scheduling problem. Then, a rescheduling method is designed to solve the task disturbance problem, represented by machine failures, occurring in the workshop production process. Finally, the superiority and effectiveness of the improved two-layer optimization algorithm are verified by two typical cases. The case results show that the improved twolayer optimization algorithm increases the average productivity by 7.44% compared to the ordinary two-layer optimization algorithm. By setting the different numbers of AGVs (Automated Guided Vehicles) and analyzing the impact on the production cycle of the whole order, this paper uses two indicators, the maximum completion time decreasing rate and the average AGV load time, to obtain the optimal number of AGVs, which saves the cost of production while ensuring the production efficiency. This research combines the solved problem with the real production process, which improves the productivity and reduces the production cost of the flexible job shop, and provides new ideas for the subsequent research. [ABSTRACT FROM AUTHOR]

When the electromagnetic transient simulation of a large-scale power grid is carried out, because the simulation is limited by the scale of simulation software, it is necessary to divide the grid into internal and external grids, and the external grid is modeled with equivalent simplification. Aiming at resolving the difficulties of the traditional grid equivalence method, such as a cumbersome calculation process and harsh calculation conditions, a static grid equivalence method based on the genetic algorithm is proposed in this paper. The method first constructs an external grid equivalence network, which includes coupling branches between boundary nodes, and each boundary node is connected to the external grid equivalence power supply through the branches. Then, the external grid equivalence model is used to establish an optimization model for solving the equivalence network parameters based on the information of the internal network, the difference of the power input from the external grid to the boundary nodes before and after equivalence is used as the objective function, and the genetic algorithm is used to realize the iterative optimization of the objective function to obtain a set of optimal post-equivalence network model parameters so that the state variables of the internal power grid before and after the equivalence are matched. The accuracy and effectiveness of the proposed method are verified through simulation with the CERPI36V7 node system. [ABSTRACT FROM AUTHOR]

Given the increasing severity of energy shortages, the exploration of effective strategies to optimize energy structures has become imperative. This requires careful consideration of energy consumption patterns, especially since these data are fundamental inputs for policy formulation. Given the uncertainty in the rate of change in energy consumption, this paper proposes an optimized multivariable grey Bernoulli model that is rooted in the grey Bernoulli model and incorporates background values and genetic algorithms. The grey Bernoulli model effectively linearizes nonlinear problems, thus simplifying computational procedures. In addition, to account for random fluctuations of relevant factors that may affect the model's predictions, this model introduces nonlinear correction terms that allow simulation and prediction values to adhere to the grey index law. The incorporation of background values enhances the model's ability to process information, providing it with a superior grasp of real data. Genetic algorithms can be used to refine the model's parameters, increasing its adaptability and precision. Finally, this paper applies the refined model to examine China's energy consumption patterns, validating its efficacy and versatility. Furthermore, energy consumption patterns for the next four years are forecast, with the analysis revealing that the growth rate of energy consumption from 2021 to 2024 shows a downward trend, particularly notable in 2024, where the growth rate is 1.64%. [ABSTRACT FROM AUTHOR]

This paper focuses on wireless-powered communication systems, which are increasingly relevant in the Internet of Things (IoT) due to their ability to extend the operational lifetime of devices with limited energy. The main contribution of the paper is a novel approach to minimize the secrecy outage probability (SOP) in these systems. Minimizing SOP is crucial for maintaining the confidentiality and integrity of data, especially in situations where the transmission of sensitive data is critical. Our proposed method harnesses the power of an improved biogeography-based optimization (IBBO) to effectively train a recurrent neural network (RNN). The proposed IBBO introduces an innovative migration model. The core advantage of IBBO lies in its adeptness at maintaining equilibrium between exploration and exploitation. This is accomplished by integrating tactics such as advancing towards a random habitat, adopting the crossover operator from genetic algorithms (GA), and utilizing the global best (Gbest) operator from particle swarm optimization (PSO) into the IBBO framework. The IBBO demonstrates its efficacy by enabling the RNN to optimize the system parameters, resulting in significant outage probability reduction. Through comprehensive simulations, we showcase the superiority of the IBBO-RNN over existing approaches, highlighting its capability to achieve remarkable gains in SOP minimization. This paper compares nine methods for predicting outage probability in wireless-powered communications. The IBBO-RNN achieved the highest accuracy rate of 98.92%, showing a significant performance improvement. In contrast, the standard RNN recorded lower accuracy rates of 91.27%. The IBBO-RNN maintains lower SOP values across the entire signal-tonoise ratio (SNR) spectrum tested, suggesting that the method is highly effective at optimizing system parameters for improved secrecy even at lower SNRs. [ABSTRACT FROM AUTHOR]

This paper provides a systematic review of the Genetic Algorithm (GA)s proposed to solve planning and scheduling problems in Engineer-To-Order (ETO) contexts. Our review focuses on how the key characteristics of ETO projects affect both the problem studied and the GA algorithmic features. Typical ETO projects consist of one-of-a-kind products with complex structures and uncertain designs. A deep analysis of the papers published between 2000 and 2022 enables identifying 10 main characteristics of ETO projects, six activity types, 10 decision types, eight groups of constraints, and 10 optimisation objectives. Our study shows that none of the reported papers integrates all 10 ETO characteristics. The less studied ETO characteristics are incorporating design and engineering information in the problem definition and the design uncertainty. Our review also identifies 10 recurrent encoding formats and emphasises the most frequently used genetic operators. We observed that most planning and scheduling problems consider objectives and decisions related to product customisation or supply chain configuration yielding multi-objective problems. Most multi-objective GAs use a weighted sum or are based on NSGAII. Diversity maintenance methods, adaptive and parameter tunning mechanisms, or hybridisation with machine learning models are still not used in this context. A systematic review of genetic algorithms dedicated to industrial planning and scheduling Analysis on how the characteristics of ETO projects impact the design of genetic representation and operators Recommendation on approaches employed to reach high-quality solutions [ABSTRACT FROM AUTHOR]

Direct current microgrid (DCMG) clusters are gaining popularity in power systems due to their simplicity and high efficiency. However, DCMG clusters are susceptible to minor disturbances due to low system inertia. This paper proposes a method to enhance the small‐signal stability of a DCMG cluster by optimizing the main control parameters of the system. This paper presents a small‐signal state‐space model of a DCMG cluster system at the system level, considering a multi‐bus network topology. Then, the control parameters that significantly affect the small‐signal stability of the DCMG are selected using the participation factor method. To enhance the system damping, the Pareto‐optimal frontier of the bi‐objective problem was determined using the elite non‐dominated sorting genetic algorithm (NSGA‐II). The optimal compromise is determined by using the fuzzy membership function method to extract it from the generated Pareto optimal front. The proposed method has been verified on a three‐sub DCMG test system with droop control. [ABSTRACT FROM AUTHOR]

Due to high computation complexity, traditional design methods for LLC converter usually consider limited kinds of performance, and the process for searching the optimal parameter scheme is discrete, which might cause the missing of real optimal solution. In order to solve these problems, a multi‐objectives optimization design method for the LLC converter is proposed in this paper. According to the numerical calculation method, a closed parameter space for resonant parameters is established under the constraints of operation mode, switching frequency, zero voltage switching (ZVS), and voltage stress of resonant capacitor. Besides, the root‐mean‐square (RMS) value of resonant current and secondary current, as well as the core loss of the transformer, are selected as the optimization objectives. Non‐dominated sorting genetic algorithm (NSGA‐II) is utilized to deal with these multi‐objective formulations. In order to reduce the computation complexity, a data‐driven method, called adaptive polynomial approximation (APA), is selected to obtain the explicit expressions of the parameter space and the optimization objectives. Then, by substituting this simplified surrogate model into the NSGA‐II algorithm, the optimal parameter scheme is obtained. The comprehensive comparison analysis is performed, and a 400 W/48 V experimental prototype was built to verify the theoretical analysis, which shows that the proposed method features the highest efficiency of 95%. [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]

To achieve an accurate measurement of tread size after fixed-length cutting, this paper proposes a point-cloud-based tread size measurement method. Firstly, a mathematical model of corner points and a reprojection error is established, and the optimal solution of the number of corner points is determined by the non-dominated sorting genetic algorithm II (NSGA-II), which reduces the reprojection error of the RGB-D camera. Secondly, to address the problem of the low accuracy of the traditional pixel metric ratio measurement method, the random sampling consensus point cloud segmentation algorithm (RANSAC) and the oriented bounding box (OBB) collision detection algorithm are introduced to complete the accurate detection of the tread size. By comparing the absolute error and relative error data of several groups of experiments, the accuracy of the detection method in this paper reaches 1 mm, and the measurement deviation is between 0.14% and 2.67%, which is in line with the highest accuracy standard of the national standard. In summary, the RGB-D visual inspection method constructed in this paper has the characteristics of low cost and high inspection accuracy, which is a potential solution to enhance the pickup guidance of tread size measurement. [ABSTRACT FROM AUTHOR]

To further improve the braking energy recovery efficiency of battery electric vehicles and increase the range of the cars, this paper proposes a multi-mode switching braking energy recovery control strategy based on fuzzy control. The control strategy is divided into three modes: single-pedal energy recovery, coasting energy recovery, and conventional braking energy recovery. It takes the accelerator pedal and brake pedal opening as the switching conditions. It calculates the front and rear wheel braking ratio allocation coefficients and the motor braking ratio through fuzzy control to recover braking energy. The genetic algorithm (GA) is used to update the optimized affiliation function to optimize the motor braking allocation ratio through fuzzy control, and joint simulation is carried out based on the NEDC (New European Driving Cycle) and CLTC-P (China Light-duty Vehicle Test Cycle for Passenger vehicles) cycle conditions. The results show that the multi-mode braking energy recovery control strategy proposed in this paper improves the energy recovery rate and range contribution rate by 4% and 9.6%, respectively, and increases the range by 22.5 km under NEDC cycle conditions. It also improves the energy recovery rate and range contribution rate by 8.7% and 5.5%, respectively, and increases the range by 13 km under CLTC-P cycle conditions, which can effectively improve the energy recovery efficiency of the vehicle and increase the range of battery electric vehicles. [ABSTRACT FROM AUTHOR]

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. [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]

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]

Purpose: Project scheduling plays an essential role in the implementation of a project due to the limitation of resources in practical projects. However, the existing research tend to focus on finding suitable algorithms to solve various scheduling problems and fail to find the potential scheduling rules in these optimal or near-optimal solutions, that is, the possible intrinsic relationships between attributes related to the scheduling of activity sequences. Data mining (DM) is used to analyze and interpret data to obtain valuable information stored in large-scale data. The goal of this paper is to use DM to discover scheduling concepts and obtain a set of rules that approximate effective solutions to resource-constrained project scheduling problems. These rules do not require any search and simulation, which have extremely low time complexity and support real-time decision-making to improve planning/scheduling. Design/methodology/approach: The resource-constrained project scheduling problem can be described as scheduling a group of interrelated activities to optimize the project completion time and other objectives while satisfying the activity priority relationship and resource constraints. This paper proposes a new approach to solve the resource-constrained project scheduling problem by combining DM technology and the genetic algorithm (GA). More specifically, the GA is used to generate various optimal project scheduling schemes, after that C4.5 decision tree (DT) is adopted to obtain valuable knowledge from these schemes for further predicting and solving new scheduling problems. Findings: In this study, the authors use GA and DM technology to analyze and extract knowledge from a large number of scheduling schemes, and determine the scheduling rule set to minimize the completion time. In order to verify the application effect of the proposed DT classification model, the J30, J60 and J120 datasets in PSPLIB are used to test the validity of the scheduling rules. The results show that DT can readily duplicate the excellent performance of GA for scheduling problems of different scales. In addition, the DT prediction model developed in this study is applied to a high-rise residential project consisting of 117 activities. The results show that compared with the completion time obtained by GA, the DT model can realize rapid adjustment of project scheduling problem to deal with the dynamic environment interference. In a word, the data-based approach is feasible, practical and effective. It not only captures the knowledge contained in the known optimal scheduling schemes, but also helps to provide a flexible scheduling decision-making approach for project implementation. Originality/value: This paper proposes a novel knowledge-based project scheduling approach. In previous studies, intelligent optimization algorithm is often used to solve the project scheduling problem. However, although these intelligent optimization algorithms can generate a set of effective solutions for problem instances, they are unable to explain the process of decision-making, nor can they identify the characteristics of good scheduling decisions generated by the optimization process. Moreover, their calculation is slow and complex, which is not suitable for planning and scheduling complex projects. In this study, the set of effective solutions of problem instances is taken as the training dataset of DM algorithm, and the extracted scheduling rules can provide the prediction and solution of new scheduling problems. The proposed method focuses on identifying the key parameters of a specific dynamic scheduling environment, which can not only reproduces the scheduling performance of the original algorithm well, but also has the ability to make decisions quickly under the dynamic interference construction scenario. It is helpful for project managers to implement quick decisions in response to construction emergencies, which is of great practical significance for improving the flexibility and efficiency of construction projects. [ABSTRACT FROM AUTHOR]

The relative rotation angle between two cabins should be automatically and precisely obtained during automated assembly processes for spacecraft and aircraft. This paper introduces a method to solve this problem based on distributed vision, where two groups of cameras are employed to take images of mating features, such as dowel pins and holes, in oblique directions. Then, the relative rotation between the mating flanges of two cabins is calculated. The key point is the registration of the distributed cameras; thus, a simple and practical registration process is designed. It is assumed that there are rigid and scaling transformations among the world coordinate systems (WCS) of each camera. Therefore, the rigid-correct and scaling-correct matrices are adopted to register the cameras. An auxiliary registration device with known features is designed and moved in the cameras' field of view (FOV) to obtain the matrix parameters so that each camera acquires traces of every feature. The parameters can be solved using a genetic algorithm based on the known geometric relationships between the trajectories on the registration devices. This paper designs a prototype to verify the method. The precision reaches 0.02° in the measuring space of 340 mm. [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]

In a hydropower station, equipment needs maintenance to ensure safe, stable, and efficient operation. And the essence of equipment maintenance is a disassembly sequence planning problem. However, the complexity arises from the vast number of components in a hydropower station, leading to a significant proliferation of potential combinations, which poses considerable challenges when devising optimal solutions for the maintenance process. Consequently, to improve maintenance efficiency and decrease maintenance time, a discrete whale optimization algorithm (DWOA) is proposed in this paper to achieve excellent parallel disassembly sequence planning (PDSP). To begin, composite nodes are added into the constraint relationship graph based on the characteristics of hydropower equipment, and disassembly time is chosen as the optimization objective. Subsequently, the DWOA is proposed to solve the PDSP problem by integrating the precedence preservative crossover mechanism, heuristic mutation mechanism, and repetitive pairwise exchange operator. Meanwhile, the hierarchical combination method is used to swiftly generate the initial population. To verify the viability of the proposed algorithm, a classic genetic algorithm (GA), simplified teaching–learning-based optimization (STLBO), and self-adaptive simplified swarm optimization (SSO) were employed for comparison in three maintenance projects. The experimental results and comparative analysis revealed that the proposed PDSP with DWOA achieved a reduced disassembly time of only 19.96 min in Experiment 3. Additionally, the values for standard deviation, average disassembly time, and the rate of minimum disassembly time were 0.3282, 20.31, and 71%, respectively, demonstrating its superior performance compared to the other algorithms. Furthermore, the method proposed in this paper addresses the inefficiencies in dismantling processes in hydropower stations and enhances visual representation for maintenance training by integrating Unity3D with intelligent algorithms. [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 multi‐objective genetic algorithm (MOGA) is a powerful global optimization tool, but its results are considerably affected by the crossover parameter ηc. Finding an appropriate ηc demands too much computing time because MOGA needs be run several times in order to find a good ηc. In this paper, a self‐adaptive crossover parameter is introduced in a strategy to adopt a new ηc for every generation while running MOGA. This new scheme has also been adopted for a multi‐generation Gaussian process optimization (MGGPO) when producing trial solutions. Compared with the existing MGGPO and MOGA, the MGGPO and MOGA with the new strategy show better performance in nonlinear optimization for the design of low‐emittance storage rings. [ABSTRACT FROM AUTHOR]

As global climate change intensifies, the challenges of water scarcity and flood disasters become increasingly severe. This severity makes efficient reservoir scheduling management crucial for the rational utilization of water resources. Due to the diverse topological structures and varying objectives of different watersheds, existing optimization models and algorithms are typically applicable only to specific watershed environments. This specificity results in a "one watershed, one model" limitation. Consequently, optimization of different watersheds usually requires manual reconstruction of models and algorithms. This process is not only time-consuming but also limits the versatility and flexibility of the algorithms. To address this issue, this paper proposes a knowledge graph-driven method for reservoir optimization scheduling. By improving genetic algorithms, this method allows for the automatic construction of optimization models tailored to specific watershed characteristics based on knowledge graphs. This approach reduces the dependency of the optimization model on manual modeling. It also integrates hydrodynamic simulations within the watershed to ensure the effectiveness and practicality of the genetic algorithms. Furthermore, this paper has developed an algorithm that directly converts optimized reservoir outflow into actionable dispatch instructions. This method has been applied in the Pihe River Basin, optimizing flood control and resource management strategies according to different seasonal demands. It demonstrates high flexibility and effectiveness under varying hydrological conditions, significantly enhancing the operational efficiency of reservoir management. [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]