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]

Currently, tissue product producers try to meet consumers' requirements to retain their loyalty. In perforated products, such as toilet paper, these requirements involve the paper being portioned along the perforation line and not outside of it. Thus, it becomes necessary to enhance the behavior of the perforation line in perforated tissue papers. The current study aimed to verify if the perforation line for 0° (the solution found in commercial perforated products) is the best solution to maximize the perforation efficiency. A finite element (FE) simulation was used to validate the experimental data, where the deviations from the experiments were 5.2% for the case with a 4 mm perforation length and 8.8% for a perforation of 2 mm, and optimize the perforation efficiency using the genetic algorithm while considering two different cases. In the first case, the blank distance and the perforation line angle were varied, with the best configuration being achieved with a blank distance of 0.1 mm and an inclination angle of 0.56°. For the second case, the blank distance was fixed to 1.0 mm and the only variable to be optimized was the inclination angle of the perforation line. It was found that the best angle inclination was 0.67°. In both cases, it was verified that a slight inclination in the perforation line will favor partitioning and therefore the perforation efficiency. [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]

To enhance the quality and efficiency of computer-enabled generation of papers for Test for English Majors Band 8 (TEM-8), a paper generation model supported by sparrow search algorithm-genetic algorithm was studied. First, a simplified test paper generation mathematical model was set up after analyzing and studying types and characteristics of TEM-8 tasks. In the model, quantity, type, difficulty, discrimination degree, scores, exposure, and answering time of test questions were taken into consideration. To enhance the optimizing effect of the genetic algorithm for searching test questions, the traditional genetic algorithm was improved by introducing the sparrow search algorithm into the model to achieve a better crossover rate, variance rate, optimization precision, and speed of the genetic algorithm. A new sparrow search-genetic algorithm (SSA-GA) was designed, and the optimizing effect of SSA-GA was verified to be ideal through optimizing six standard test functions. Then, SSA-GA was applied to conduct experimentation with test paper generation, and comparison with traditional genetic algorithms was also made. The values of best and average fitness of SSA-GA were better than those of the traditional genetic algorithm (GA) in the paper generation. Exposure rate and success rate in TEM-8 paper generation of SSA-GA were higher than those of traditional GA in TEM-8 paper generation. Results showed that the studied SSA-GA could implement test paper generation with higher speed and better quality. [ABSTRACT FROM AUTHOR]

With the surging energy price and environmental concerns, measures to improve energy efficiency have attracted increasing concerns of the manufacture sector, especially energy-intensive manufacturing industries such as tissue paper mills. Energy-efficiency scheduling, as a novel energy-efficient method, has attracted the attention of an increasing number of researchers in recent years. Drying process is the most energy-intensive production process in tissue paper mills, which has a great energy-saving potential. This paper aims to reduce the energy costs for the tissue paper mill, consisting of processing energy cost and set-up energy cost, through integrating drying process optimization with energy-efficient scheduling. First, the energy cost model and the scheduling model were built. Then, the energy cost of the drying process of every job in a given scheduling problem was optimized using particle swarm optimization (PSO). Afterwards, the energy cost was further optimized using energy-efficiency scheduling. In addition, a hybrid non-dominated sorting genetic algorithm II (NSGA-II) was utilized to solve the energy-efficiency scheduling problem. Finally, several real scheduling problems from a real tissue paper mill were addressed using the proposed approach to demonstrate its effectiveness in energy saving. The experiment result showed that there is a great energy-saving potential in the drying process, accounting for up to 12.53% of the total energy consumption. Moreover, the maximum energy saving ratio of the proposed approach could reach 9.03%. On the whole, the proposed approach can provide a new energy-saving method for tissue paper mills or other manufacturing industries. [ABSTRACT FROM AUTHOR]

This paper focuses on question paper template generation and its use in dynamic generation of examination question paper. Question paper template generation is a constrained based optimization problem. Choosing an efficient, scientific and rational algorithm to generate a template is the key to dynamic examination question paper generation system. By using Genetic Algorithm (GA) and educational taxonomies, this paper analyses the initial population generation, does chromosome encoding, applies genetic manipulations and experimentally proves that the generated question paper templates are best suited for the dynamic examination paper generation system. This new approach outperforms traditional algorithms that randomly generate examination papers in terms of their topic coverage, learning domains and marks distribution. [ABSTRACT FROM AUTHOR]

A Genetic algorithm is a search algorithm depends on the methodology of natural selection and natural genetics. A Mobile Ad hoc network (MANET) is a type of wireless nodes (Devices) which are free to move anywhere in the network without any constraints. The nodes which are in range can communicate each other through radio waves and those who are not in range use any routing algorithm for communication. In this review paper, we focus on the problems of MANET that has been solved by applying GA for it and highlights the characteristic and challenges of MANET in the literature. More specifically, we present the summary of review papers and basic solutions that use and in the last, we present some future direction. Consequently, we concluded that modification in Fitness function (Evaluation function) according to the problem is the base of Genetic algorithm and variation in algorithm parameters can give solutions in a reasonable time. [ABSTRACT FROM AUTHOR]

This article investigates an optimal design for a paper-feeding system that minimizes both jamming and simultaneous feeding of multiple papers, hereafter referred to as the multi-feeding rate. A total of 11 design parameters for the paper transfer device, the paper separation device, and the paper guide path are selected and analysed in this study. A test jig for feeding and transferring papers is manufactured to obtain experimental data for use in parameter analysis and design optimization. Back-propagation neural network-based causality analysis is employed to extract five dominant variables among 11 design parameters, and the results of causality analysis are compared with sensitivity results obtained from the analysis of means in the context of experimental design. Five-variable, second-order polynomial based approximate meta-models for jam rate and multi-feeding rate are then constructed, and numerical optimization is performed using NSGA-II, a non-dominated sorting genetic algorithm. Finally, two numerical Pareto optimal solutions are verified via experimental testing. [ABSTRACT FROM AUTHOR]

An approach based on the characterisation of individual operations by water demands and sources has been utilised to study an operating integrated pulp and paper mill. The search for novel whitewater network configurations as a function of specified process constraints and objective functions was done by means of a genetic algorithm coupled with linear programming. Potential solutions are derived from an initial superstructure representation which embodies all possible source and demand connections by an evolutive process akin to natural selection and adaptation. Various objective functions were investigated. Innovative strategies have been identified and are being considered for implementation. [Copyright &y& Elsevier]

Cross project defect prediction (CPDP) is a key method for estimating defect-prone modules of software products. CPDP is a tempting approach since it provides information about predicted defects for those projects in which data are insufficient. Recent studies specifically include instructions on how to pick training data from large datasets using feature selection (FS) process which contributes the most in the end results. The classifier helps classify the picked-up dataset in specified classes in order to predict the defective and non-defective classes. The aim of our research is to select the optimal set of features from multi-class data through a search-based optimizer for CPDP. We used the explanatory research type and quantitative approach for our experimentation. We have F1 measure as our dependent variable while as independent variables we have KNN filter, ANN filter, random forest ensemble (RFE) model, genetic algorithm (GA), and classifiers as manipulative independent variables. Our experiment follows 1 factor 1 treatment (1F1T) for RQ1 whereas for RQ2, RQ3, and RQ4, there are 1 factor 2 treatments (1F2T) design. We first carried out the explanatory data analysis (EDA) to know the nature of our dataset. Then we pre-processed our data by removing and solving the issues identified. During data preprocessing, we analyze that we have multi-class data; therefore, we first rank features and select multiple feature sets using the info gain algorithm to get maximum variation in features for multi-class dataset. To remove noise, we use ANN-filter and get significant results more than 40% to 60% compared to NN filter with base paper (all, ckloc, IG). Then we applied search-based optimizer i.e., random forest ensemble (RFE) to get the best features set for a software prediction model and we get 30% to 50% significant results compared with genetic instance selection (GIS). Then we used a classifier to predict defects for CPDP. We compare the results of the classifier with base paper classifier using F1-measure and we get almost 35% more than base paper. We validate the experiment using Wilcoxon and Cohen's d test. [ABSTRACT FROM AUTHOR]

In the production of facial oil blotting papers, a certain number of papers must be counted before packaging. Currently, the papers are counted by hand, and this is hard work. Also, there are risks of adhesion of dust and wrinkles. In order to solve these problems, we propose a vision‐based approach. After the papers, which are arranged by shifting, are captured, the proposed image processing steps detect the boundaries of the papers. By counting the detected boundaries, the number of papers can be counted. Since the parameters for the proposed image processing are optimized by genetic algorithm, prior setting by a user is not necessary. For the experiments, an image dataset was constructed with six types of facial oil blotting papers. The proposed method achieved higher F‐measure than in other related works. © 2019 Institute of Electrical Engineers of Japan. Published by John Wiley & Sons, Inc. [ABSTRACT FROM AUTHOR]

Abstract: Alarmingly low pulp prices in early 2009 left pulp and paper mills across North America desperate for any way to improve thin profit margins. One solution that continues to gain popularity among the industry is improved energy management systems for cogeneration systems, which use steam for two purposes – to provide heat for the pulping process and to generate electricity for sale to regional providers. This paper presents an energy optimization algorithm for use in a pulp and paper mill cogeneration system. The algorithm is applicable to a number of popular mill configurations, power sale contracts, and fuel purchasing scenarios. The method is also extended to address weather-dependent cooling limitations encountered by a mill cogeneration facility, in which case an iterative solution is proposed in order to maintain convexity of the optimization problem. Results are presented in the form of three case studies. [ABSTRACT FROM AUTHOR]

Due to the complexity and the magnitude of optimisation models that appeared in sustainable supply chain management (SSCM), the use of meta-heuristic algorithms as competent solution approaches is being increased in recent years. Although a massive number of publications exist around SSCM, no extant paper explicitly investigates the role of meta-heuristics in the sustainable (forward) supply chain. To fill this gap, a literature review is provided on meta-heuristic algorithms applied in SSCM by analyzing 160 rigorously selected papers published by the end of 2020. Our statistical analysis ascertains a considerable growth in the number of papers in recent years and reveals the contribution of 50 journals in forming the extant literature. The results also show that in the current literature the use of hybrid meta-heuristics is overtaking pure meta-heuristics, the genetic algorithm (GA) and the non-dominated sorting GA (NSGA-II) are the most-used single- and multi-objective algorithms, the aspects of sustainability are mostly addressed in connection with product distribution and routing of vehicles as pivotal operations in supply chain management, and last but not least, the economic-environmental category of sustainability has been further noticed by the scholars. Finally, a detailed discussion of findings and recommendations for future research are provided. [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]

Spinning end breakage is a major factor limiting the efficiency of the spinning process, and this paper proposes a digital method of spinning joint management. Based on the broken ends data collected by a single spindle monitoring system and guided by the empirical knowledge obtained from a factory investigation, a genetic algorithm-based spinning joint scheduling model is built with the minimum spinning machine idle time as the optimization objective. Three different heuristic rules are introduced in generating the initial population, and their relationship with the distribution of broken ends is discussed; to curb the potential efficiency loss, the broken ends are classified by the data obtained from the single spindle monitoring, and the priority joint task is introduced in the model. The experimental results show that, compared with the traditional S-tour, the model with heuristic rule 2 can reduce the machine idle time by 43% on average, and the priority-based model can reduce it by 42% on average. They both have comparable optimization capabilities, but the priority-based model avoids more serious production loss and is the superior choice. [ABSTRACT FROM AUTHOR]

With the increased awareness of environmental protection and the establishment of the spot market of electric power, renewable energy plays a more and more important role in energy structure adjustment. But the intermittence and instability of renewable energy often result in energy waste. Micro-grid energy storage can effectively improve the utilization rate, economy and reliability of renewable energy. To ensure the economical operation of the micro-grid system and improve the load curve, a two-stage optimal dispatch model was established based on non-dominated sorting genetic algorithm (NSGA-II) and deep Q-value reinforcement learning algorithm (DQN). In the first stage, to get the appropriate battery capacity, the minimum comprehensive operation cost and the minimum capacity fading of battery in the cycle life were selected as the optimization objectives. The optimal solution was calculated by using the improved non-dominated sorting genetic algorithm (NSGA-II). In the second stage, the DQN Algorithm was used to propose a scheduling strategy. Compared with the GA method, the DQN method was able to reduce the operating cost from 0.5829% to 1.2294%. The results showed that the method was feasible and effective. [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]

Abstract: A novel system based on Bernoulli Theorem of Large Number Law and the genetic algorithms was designed and realized in this paper, which had many advantages such as self-adaptive study for difficulty coefficient of item pool and intelligent test paper construction etc. At present, the system has applied in the examination of paperless computer tests of Jinlin university of finance and economics and some satisfactory results have been also obtained. [Copyright &y& Elsevier]

Abstract: The continuation education is very important for people who have left school to work to increase their competence and skills. To avoid the disadvantages of the common test paper generating methods, genetic algorithm is used to generate the test paper automatically. The concrete design process of test paper generating based on genetic algorithm is discussed in this paper, and some corresponding parameters setting have been compared and defined. The application results demonstrated that the genetic algorithm was an effective tool in the test paper generating. [Copyright &y& Elsevier]

Abstract: The study first summarizes the characteristics of various intelligent algorithms such as improved genetic algorithm, differential evolution algorithm and ant colony algorithm adopted in test paper generation, and then proposes the parallel evolution of swarm based on ideas of shared intelligent algorithm and dynamic multi branches tree algorithm, so as to improve searching speed and achieve the effect of short-time optimization. During forming optimal individuals, classified training and repeated recognition by virtue of dynamic multi branches tree can not only avoid premature appearance but also get strong convergence. In addition, when the constraints change, the existing knowledge can be inherited. Facts have shown that this algorithm has certain theoretical significance and reference value to the development of intelligent test paper generation algorithm. [Copyright &y& Elsevier]

In the very few recently published paper by Alavidoost et al. [1] , they proposed a novel fuzzy adaptive genetic algorithm for multi-objective assembly line balancing problem, in continue of their previous presented work by Alavidoost et al. [2] , as a modification on genetic algorithm for assembly line balancing with fuzzy processing times. Despite the fact that both of them are well-written, and completely discussed their contributions, this note looks forward to collate these papers together. Likewise provides the correct order of the figures in [1] matching with their corresponding caption. [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]

This paper provides a corrected formulation to the mixed integer programming model proposed by Aydogan et al. (2012) [1] . They proposed a genetic algorithm to learn fuzzy rules for a fuzzy rule-based classification system and developed a Mixed Integer Programming model (MIP) to prune the generated rules by selecting the best set of rules to maximize predictive accuracy. However, their proposed MIP formulation contains errors, which are described in this technical note. We develop corrections and improvements to the original formulation and test it with non-parametric statistical tests on the same data sets used to evaluate the original model. The statistical analysis shows that the results of the correction formulation are significantly different from the original model. [ABSTRACT FROM AUTHOR]

Network compression coding technology is a research hotspot in the field of digital steganography and image synthesis. How to improve image quality while achieving short compression time is a problem currently faced. Based on the improved wavelet neural network theory, this paper constructs a digital steganography and image synthesis model. The model first tracks the contour of the digit to be recognized, then equalizes and resamples the contour to make it translation-invariant and scaling-invariant, and then uses multi-wavelet neural network clusters to stretch the contour shell to obtain orders of magnitude multi-resolution and its average, and finally, these shell coefficients are fed into a feedforward neural network cluster to identify this handwritten digit, solving the problem of multi-resolution decomposition of contour shells while having a high sampling rate. In the simulation process, the classification model that a single pixel is a text/non-text pixel is trained on the original gray value of the gray pixel and its neighboring pixels, and the classified text pixels are connected to a text area through an adaptive MeanShift method. The experimental results show that it is feasible to use multi-wavelet features for handwritten digit recognition. The model combines the neural network and the genetic algorithm, making full use of the advantages of both, so that the new algorithm has the learning ability and robustness of the neural network. The compression ratio after compression by ordinary wavelet coding, PSNR, MSE, and compression time are 8.4, 25 dB, 210, and 7 s, respectively. The values are 11.7, 24 dB, 207, and 11 s, respectively. At the same time, the peak signal-to-noise ratio is higher and the mean square error is lower, that is, the compression quality is better, and the accuracy of digital steganography and image synthesis is effectively improved. [ABSTRACT FROM AUTHOR]

Damage detection and localization in civil engineering constructions using dynamic analysis has become an important topic in recent years. This paper presents a methodology based on non-destructive detection, localization and quantification of multiple damages in simple and continuous beams, and a more complex structure, namely two-dimensional frame structure. The proposed methodology makes used of Firefly Algorithm and Genetic Algorithm as optimization tools and the Coordinate Modal Assurance Criterion as an objective function. The results show that the proposed combination of Coordinate Modal Assurance Criterion and Firefly Algorithm or Genetic Algorithm can be easily used to identify multiple local structural damages in complex structures. However, the convergence rate becomes slower for the case of multiple damages compared to the case of single damage. The effect of noise on the algorithm is further investigated. It is found that the proposed technique is able to detect the damage location and its severity with high accuracy in the presence of noise, although the convergence rate became slower than in the case when no noise is present. It is also found that the convergence rate of Firefly Algorithm is much faster than that of Genetic Algorithm. [ABSTRACT FROM AUTHOR]

Abstract: This paper presents the methodology used and the results obtained in the determination of moisture diffusion coefficient of non-impregnated transformer insulating paper. In order to establish the diffusion coefficient, drying curves of paper samples were obtained by means of thermogravimetric experiments. The diffusion coefficient parameters were found by applying an optimization process based on genetic algorithms. The error function between measured and simulated curves was determined, and the parameters achieving the best correspondence between measured and estimated values were obtained. As a result, a new equation for the diffusion coefficient of non-impregnated insulating paper is proposed, depending on average moisture concentration, temperature and insulation thickness. The proposed coefficient was validated through experimental cases finding a good agreement between the experimental drying curves and those obtained by simulation using the diffusion coefficient. The proposed diffusion coefficient can be used for the determination of the time required to dry power transformers in factory. [Copyright &y& Elsevier]

A genetic algorithm-based neural fuzzy system (GA-NFS) was presented for studying the coagulation process of wastewater treatment in a paper mill. In order to adapt the system to a variety of operating conditions and acquire a more flexible learning ability, the GA-NFS was employed to model the nonlinear relationships between the effluent concentration of pollutants and the chemical dosages, and a hybrid learning algorithm divided into two stages was proposed for parameters learning. During the first learning stage, a genetic algorithm was used to optimize the structure of GA-NFS and the membership function of each fuzzy term due to its capability of parallel and global search. On the basis of an optimized training stage, the back-propagation algorithm (BP algorithm) was chosen to update the parameters of GA-NFS to improve the system precision. The GA-NFS proves to be very effective in modeling coagulation perform and performs better than adaptive-network-based fuzzy inference system (ANFIS). RMSE, MAPE, and Rbetween the predicted and observed values for GA-NFS were only 0.01099, 2.3337, and 0.9375, respectively. [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]

Multiple-input-multiple-output (MIMO) systems are of interest for meeting the expected demand for higher data rates and lower delays in future wireless packet data systems. In such systems, it is optimal to simultaneously transmit to multiple users compared with a single user in a single-input-single-output system. In addition, multicarrier systems are of interest to combat frequency-selective fading that is experienced over the larger bandwidth that these future broadband systems will use. The use of dirty paper coding further complicates the matter, because the order in which the users are encoded will affect the rates that they can achieve. A well-designed cross-layer scheduling algorithm must take into account the multiple dimensions of this resource-allocation problem and other quality-of-service (QoS) parameters to fully exploit the communications channel. The scheduling problem is often expressed in terms of optimizing some utility function. Unfortunately, the search space for this optimization problem is extremely large, which prohibits an optimal exhaustive search. To this end, we investigate the use of genetic algorithms to reduce the complexity of the scheduling. This paper builds upon prior work that implements scheduling via genetic algorithms in the context of single-carrier systems using zero-forcing beamforming (ZFB). In this paper, we investigate how the genetic algorithm can be adapted to account for the effect of encoding order on the scheduling and how the scheduling can be extended to a multicarrier system. In particular, we investigate the maximum throughput and proportionally fair scheduling criteria. We demonstrate that the performance of the genetic algorithm is near optimal compared with an exhaustive search at a greatly reduced computational complexity. Furthermore, in the case of a multicarrier orthogonal frequency-division multiplexing (OFDM) system, an increase in capacity is shown relative to the single-carrier case. [ABSTRACT FROM AUTHOR]

This paper analyzes some details of artificial intelligence algorithms to paper-reviewer assignment problem. In particular, the study on most common algorithms like genetic algorithm (GA), ant colony optimization (ACO) and tabu-search (TS) is made and the performance of these algorithms in paper-reviewer assignment problem is tested. Moreover, two hybrid methods that efficiently combine the above-mentioned algorithms are proposed: the ACO-GA and GA-TS algorithms. To measure the performance of these algorithms, extensive computational experiments are conducted. Evaluation using different data sets shows that the proposed algorithms are effective and achieve good results. [ABSTRACT FROM AUTHOR]

Abstract: Quantitative non-destructive analysis of individual constituents of historic rag paper is crucial for its effective preservation. In this work, we examine the potentials of mid- and near-infrared spectroscopy, however, in order to fully utilise the selectivity inherent to spectroscopic multivariate measurements, genetic algorithms were used to select spectral data derived from information-rich FT-IR or UV–vis-NIR measurements to build multivariate calibration models based on partial least squares regression, relating spectra to gelatine content in paper. A selective but laborious chromatographic method for the quantification of hydroxyproline (HYP) has been developed to provide the reference data on gelatine content. We used 9-fluorenylmethyl chloroformate (FMOC) to derivatise HYP, which was subsequently determined using reverse-phase liquid chromatographic separation and fluorimetric detection. In this process, the sample is consumed, which is why the method can only be used as a reference method. The sampling flexibility afforded by small-size field-portable spectroscopic instrumentation combined with chemometric data analysis, represents an attractive addition to existing analytical techniques for cultural heritage materials. [ABSTRACT FROM AUTHOR]

This paper studies the cooperative multi-area coverage problem with obstacles, which requires a group of robots to cover an area while avoiding collisions. This problem is very common in scenarios such as garbage removal, mine clearance, and regional information collection. The currently proposed algorithms usually have the problem of high redundancy and weak scene scalability. This paper designs a cooperative area coverage algorithm for multiple robots. First, a set of rules is proposed to divide the area to be covered into several small areas. Then, a genetic algorithm based on circular coding is designed to allocate these divided areas to several robots. Finally, the coverage path of the robot is designed using the zigzag method, so that the robot can cover the area allocated to it. Through computational experiments, it has been verified that this algorithm has efficiency advantages over state-of-the-art algorithms in certain scenarios and has scalability for different scenarios. [ABSTRACT FROM AUTHOR]