In this paper, a new human resource scheduling algorithm is proposed based on the optimization simulation of the human resource scheduling algorithm to find the most suitable human resource allocation scheme for different regions. A simulation system for human resource allocation is proposed, which integrates the scheduling algorithm of this paper and conducts simulation experiments using the historical data of enterprise problems in each region collected in a smart city. The simulation experiment proves that the dispatching algorithm in this (...) paper is more reasonable than the current dispatching algorithm, and the relationship between enterprise problems and the number of employees is also found, and finally, the simulation system in this paper is proved to be stable through large-scale simulation experiment. (shrink)

Visual cryptography is a cryptographic technique that allows visual information to be encrypted so that the human optical system can perform the decryption without any cryptographic computation. The halftone visual cryptography scheme (HVCS) is a type of visual cryptography (VC) that encodes the secret image into halftone images to produce secure and meaningful shares. However, the HVC scheme has many unsolved problems, such as pixel expansion, low contrast, cross-interference problem, and difficulty in managing share images. This article aims to enhance (...) the visual quality and avoid the problems of cross-interference and pixel expansion of the share images. It introduces a novel optimization of color halftone visual cryptography (OCHVC) scheme by using two proposed techniques: hash codebook and construction techniques. The new techniques distribute the information pixels of a secret image into a halftone cover image randomly based on a bat optimization algorithm. The results show that these techniques have enhanced security levels and make the proposed OCHVC scheme more robust against different attacks. The OCHVC scheme achieves mean squared error (MSE) of 95.0%, peak signal-to-noise ratio (PSNR) of 28.3%, normalized cross correlation (NCC) of 99.4%, and universal quality index (UQI) of 99.3% on average for the six shares. Subsequently, the experiment results based on image quality metrics show improvement in size, visual quality, and security for retrieved secret images and meaningful share images of the OCHVC scheme. Comparing the proposed OCHVC with some related works shows that the OCHVC scheme is more effective and secure. (shrink)

The teaching management department carries all the work related to teaching in the whole school. A scientific, efficient, and complete teaching management system cannot only help the teaching management department improve work efficiency and quality but also greatly reduce many problems caused by manual labour risk. This paper designs and implements a teaching management system based on an improved association rule algorithm. First, aiming at the low efficiency of the Apriori algorithm for mining association rules, an association rule model based (...) on interest is proposed. Second, use the MapReduce calculation model to partition the transaction database, then use the improved Apriori optimization algorithm for mining, and finally merge the mining results to obtain frequent itemsets. Through experiments, the optimized algorithm has greatly improved selection mining and computing time than traditional algorithms. (shrink)

A comprehensive introduction to optimization with a focus on practical algorithms for the design of engineering systems. This book offers a comprehensive introduction to optimization with a focus on practical algorithms. The book approaches optimization from an engineering perspective, where the objective is to design a system that optimizes a set of metrics subject to constraints. Readers will learn about computational approaches for a range of challenges, including searching high-dimensional spaces, handling problems where there are multiple competing (...) objectives, and accommodating uncertainty in the metrics. Figures, examples, and exercises convey the intuition behind the mathematical approaches. The text provides concrete implementations in the Julia programming language. Topics covered include derivatives and their generalization to multiple dimensions; local descent and first- and second-order methods that inform local descent; stochastic methods, which introduce randomness into the optimization process; linear constrained optimization, when both the objective function and the constraints are linear; surrogate models, probabilistic surrogate models, and using probabilistic surrogate models to guide optimization; optimization under uncertainty; uncertainty propagation; expression optimization; and multidisciplinary design optimization. Appendixes offer an introduction to the Julia language, test functions for evaluating algorithm performance, and mathematical concepts used in the derivation and analysis of the optimization methods discussed in the text. The book can be used by advanced undergraduates and graduate students in mathematics, statistics, computer science, any engineering field, (including electrical engineering and aerospace engineering), and operations research, and as a reference for professionals. (shrink)

This paper introduces the basic principle and application process of simulated annealing algorithm and improves the simulated annealing algorithm so that it can converge faster to get the new parameters of cultural and creative product design and make it more in line with the reality of engineering optimization. In the cultural creative industry, it is necessary to use the creatorʼs creativity and technology to derive and develop the original cultural resources with the help of various materialization means, to refine (...) the abstract and profound contents of cultural resources to make them more visualized, and to produce products with both spiritual and economic values through the multiple development and utilization of their intellectual property contents. By studying the feasibility analysis of the cultural and creative design, the design positioning of the cultural and creative products is determined. In this article, we use the simulated annealing method to simulate and analyse the condition values in the design process of cultural creative products. As the Internet era progresses, people have more diversified requirements for cultural and creative products, and they need to have innovative ideas to follow the trend, so the design of cultural and creative products can spread culture through different design expressions and media. As one of the important pillar industries for future development, cultural and creative products are characterized by a wide range of styles and practicality, which meet the aesthetic needs and fashion trends of modern people. (shrink)

The topology optimization of computer communication network is studied based on improved genetic algorithm, a network optimization design model based on the establishment of network reliability maximization under given cost constraints, and the corresponding improved GA is proposed. In this method, the corresponding computer communication network cost model and computer communication network reliability model are established through a specific project, and the genetic intelligence algorithm is used to solve the cost model and computer communication network reliability model, respectively. (...) It has been proved that GA can solve the complex problems of computer working environment better, which is 80% higher than the general algorithm, and can select the optimal scheme pertinently. (shrink)

Freight transportation plays a critical role in improving company performance in the modern manufacturing industry. To reduce costs, companies must take advantage of the use of large vehicles. It caused fewer deliveries, but inventory costs and degradation quality are high. One of the joint economic lot size problems in supply chain is Integrated Single-Vendor Single-Buyer Inventory Problem. This study developed the I-SVSB-IP model that considers raw materials’ exponential quality degradation and transportation costs. The objective function of this research was to (...) maximize the Joint Total Profit. Three decision variables used were inventory cycle time, raw material ordering frequency, and frequency of delivery of finished products to buyers. This study proposed a sophisticated Chimp Optimization Algorithm procedure to solve the I-SVSB-IP problem. A case study on the food industry in Indonesia was presented to optimize the I-SVSB-IP. The results showed that the ChOA procedure had produced an optimal solution compared to the state-of-the-art algorithm. This study also demonstrated a sensitivity analysis of decision and transportation variables to cost, revenue, and JTP. The results show that increasing transport frequency of ordering raw materials and finished products to buyers enhances the total cost and reduces joint total profit. In addition, increasing the rate of quality degradation of raw materials reduces JTP. (shrink)

This paper is aimed at the problems of low accuracy, long recognition time, and low recognition efficiency in English speech recognition. In order to improve the accuracy and efficiency of English speech recognition, an improved ant colony algorithm is used to deal with the dynamic time planning problem. The core is to adopt an adaptive volatilization coefficient and dynamic pheromone update strategy for the basic ant colony algorithm. Using new state transition rules and optimal ant parameter selection and other improved (...) methods, the best path can be found in a shorter time and the execution efficiency can be improved. Simulation experiments tested the recognition rates of traditional ant colony algorithm and improved ant colony algorithm. The results show that the global search ability and accuracy of improved ant colony algorithm are better than traditional algorithms, which can effectively improve the efficiency of English speech recognition system. (shrink)

This paper provides a detailed description of the recommendation system and collaborative filtering algorithm to optimize the English learning platform through the collaborative filtering algorithm and analyses the algorithmic principles and specific techniques of collaborative filtering. After introducing the recommendation system and collaborative filtering algorithm, this paper elaborates on the theoretical basis and technical principles of the recommendation algorithm based on cognitive ability and difficulty and provides an in-depth analysis of the design and implementation of the recommendation algorithm by (...) combining cognitive diagnosis theory, readability formula, and English knowledge map, which provides a comprehensive and solid theoretical guidance and support for the application development of the online English learning platform. The system is tested by building a Spring Cloud platform, importing actual business data, focusing on the validation of the recommendation model, and connecting the recommendation system to the formal production system to analyse the recommendation effect. Compared with the original recommendation method, the online English learning platform designed and implemented in this paper based on the cognitive ability and difficulty collaborative filtering recommendation algorithm has a better recommendation effect. The system is proved to be well designed and has certain reference and guiding value for the whole web-based online learning platform and has a broader application prospect nowadays and in the future. (shrink)

Because of the difficulty of music feature recognition due to the complex and varied music theory knowledge influenced by music specialization, we designed a music feature recognition system based on Internet of Things technology. The physical sensing layer of the system places sound sensors at different locations to collect the original music signals and uses a digital signal processor to carry out music signal analysis and processing. The network transmission layer transmits the completed music signals to the music signal database (...) in the application layer of the system. The music feature analysis module of the application layer uses a dynamic time regularization algorithm to obtain the maximum similarity between the test template and the reference. The music feature analysis module of the application layer uses the dynamic time regularization algorithm to obtain the maximum similarity between the test template and the reference template to realize the feature recognition of the music signal and determine the music pattern and music emotion corresponding to the music feature content according to the recognition result. The experimental results show that the system operates stably, can capture high-quality music signals, and can correctly identify music style features and emotion features. The results of this study can meet the needs of composers’ assisted creation and music researchers’ analysis of a large amount of music data, and the results can be further transferred to deep music learning research, human-computer interaction music creation, application-based music creation, and other fields for expansion. (shrink)

In this paper, an in-depth study of interactive visual communication of network topology through non-line-of-sight congestion control algorithms is conducted to address the real-time routing problem of adapting to dynamic topologies, and a delay-constrained stochastic routing algorithm is proposed to enable packets to reach GB within the delay threshold in the absence of end-to-end delay information while improving network throughput and reducing network resource consumption. The algorithm requires each sending node to select an available relay set based on the location (...) of its neighbor nodes and channel state and computes transfer probabilities for each node in the relay set combining the remaining delay of the packet with the distance from the relay node to GB. Based on the obtained transfer probability and local channel state, the sending node passes the packet to the relay node. The convergence of the algorithm is proved and its performance is verified by simulation. The first part of the algorithm is based on the greedy algorithm to deploy and locate the network flying platform nodes with the goal of efficient coverage of the network flying platform nodes, considering the ground base station services. As the delay on each link varies due to the change of channel state, the source and relay nodes asynchronously update the data generation rate and the pairwise parameters based on the received local information and use the obtained optimal values to pass the packets to GB. (shrink)

This study is to explore the optimization of the adaptive genetic algorithm in the backpropagation neural network, so as to expand the application of the BPNN model in nonlinear issues. Traffic flow prediction is undertaken as a research case to analyse the performance of the optimized BPNN. Firstly, the advantages and disadvantages of the BPNN and genetic algorithm are analyzed based on their working principles, and the AGA is improved and optimized. Secondly, the optimized AGA is applied to optimize (...) the standard BPNN, and the optimized algorithm is named as OAGA-BPNN. Finally, three different cases are proposed based on the actual scenario of traffic flow prediction to analyse the optimized algorithm on the matrix laboratory platform by simulation. The results show that the average error distribution of the GA-BPNN algorithm is about 1% with small fluctuation range, better calculation accuracy, and generalization performance in contrast to the BPNN. The average output error of the AGA-BPNN fluctuates around 0 and remains in a relatively stable range as a whole in contrast to that of GA-BPNN; the maximum fitness level keeps increasing during the evolution process but approaches the average value in later process, so the population diversity is hard to be guaranteed. The output error of the OAGA-BPNN fluctuates little compared with that of AGA-BPNN, and its maximum fitness continues to increase in the evolution process with guaranteed population diversity. In short, the OAGA-BPNN algorithm can achieve the best performance in terms of calculation accuracy, generalization performance, and population evolution. (shrink)

This paper addresses the job shop scheduling problem including time lag constraints. This is an extension of the job shop scheduling problem with many applications in real production environments, where extra delays can be introduced between successive operations of the same job. It belongs to a category of problems known as NP-hard problem due to large solution space. Biogeography-based optimization is an evolutionary algorithm which is inspired by the migration of species between habitats, recently proposed by Simon in 2008 (...) to optimize hard combinatorial optimization problems. We propose a hybrid biogeography-based optimization algorithm for solving the job shop scheduling problem with additional time lag constraints with minimization of total completion time. In the proposed HBBO, the effective greedy constructive heuristic is adapted to generate the initial population of habitat. Moreover, a local search metaheuristic is investigated in the mutation step in order to ameliorate the solution quality and enhance the diversity of the population. To assess the performance of HBBO, a series of experiments on well-known benchmark instances for job shop scheduling problem with time lag constraints is performed. (shrink)

Metaheuristic algorithms are often applied to global function optimization problems. To overcome the poor real-time performance and low precision of the basic salp swarm algorithm, this paper introduces a novel hybrid algorithm inspired by the perturbation weight mechanism. The proposed perturbation weight salp swarm algorithm has the advantages of a broad search scope and a strong balance between exploration and exploitation and retains a relatively low computational complexity when dealing with numerous large-scale problems. A new coefficient factor is introduced (...) to the basic salp swarm algorithm, and new update strategies for the leader position and the followers are introduced in the search phase. The new leader position updating strategy has a specific bounded scope and strong search performance, thus accelerating the iteration process. The new follower updating strategy maintains the diversity of feasible solutions while reducing the computational load. This paper describes the application of the proposed algorithm to low-dimension and variable-dimension functions. This paper also presents iteration curves, box-plot charts, and search-path graphics to verify the accuracy of the proposed algorithm. The experimental results demonstrate that the perturbation weight salp swarm algorithm offers a better search speed and search balance than the basic salp swarm algorithm in different environments. (shrink)

On the basis of ecological footprint theory and tourism ecological footprint theory, the sustainable development indexes such as ecological footprint, ecological carrying capacity, ecological deficit, and ecological surplus of the research area were calculated and the long-term change pattern of each index was analyzed. This paper shows that the ecological footprint of the research area increases year by year, but the ecological footprint is always smaller than the ecological carrying capacity, indicating that the area is still in the state of (...) sustainable development. However, the per capita ecological surplus shows a decreasing trend year by year, indicating that the sustainable development of the region is getting worse. This paper proposes a reordering method of tourist attractions based on heterogeneous information fusion, and realizes the retrieval and reordering of tourist attractions based on user query and fusion of heterogeneous information, so as to help users make travel decisions. In view of the shortage of tourism commercial websites to passively provide scenic spot information, this paper puts forward a scenic spot retrieval method based on query words to enable users to obtain scenic spot information according to their needs, and constructs a tourist consumer data analysis system. The preprocessing methods and methods adopted by the data preprocessing module are analyzed in detail, and the algorithms used in the travel route analysis and consumer spending ability analysis are described in detail. The data of tourism consumers are analyzed by this system, and the results are evaluated. (shrink)

Constrained optimization plays an important role in many decision-making problems and various real-world applications. In the last two decades, various evolutionary algorithms were developed and still are developing under the umbrella of evolutionary computation. In general, EAs are mainly categorized into nature-inspired and swarm-intelligence- based paradigms. All these developed algorithms have some merits and also demerits. Particle swarm optimization, firefly algorithm, ant colony optimization, and bat algorithm have gained much popularity and they have successfully tackled various test (...) suites of benchmark functions and real-world problems. These SI-based algorithms follow the social and interactive principles to perform their search process while approximating solution for the given problems. In this paper, a multiswarm-intelligence-based algorithm is developed to cope with bound constrained functions. The suggested algorithm integrates the SI-based algorithms to evolve population and handle exploration versus exploitation issues. Thirty bound constrained benchmark functions are used to evaluate the performance of the proposed algorithm. The test suite of benchmark function is recently designed for the special session of EAs competition in IEEE Congress on Evolutionary Computation. The suggested algorithm has approximated promising solutions with good convergence and diversity maintenance for most of the used bound constrained single optimization problems. (shrink)

Because of the lack of interaction between seeking mode cats and tracking mode cats in cat swarm optimization, its convergence speed and convergence accuracy are affected. An information interaction strategy is designed between seeking mode cats and tracking mode cats to improve the convergence speed of the CSO. To increase the diversity of each cat, a top-N learning strategy is proposed during the tracking process of tracking mode cats to improve the convergence accuracy of the CSO. On ten standard (...) test functions, the average values, standard deviations, and optimal values of the proposed algorithm with different N values are compared with the original CSO algorithm and the adaptive cat swarm algorithm based on dynamic search. Experimental results show that the global search ability and the convergence speed of the proposed algorithm are significantly improved on all test functions. The proposed two strategies will improve the convergence accuracy and convergence speed of CSO greatly. (shrink)

Due to the difficulty in solving combinatorial optimization problems, it is necessary to improve the performance of the algorithms by improving techniques to deal with complex optimizations. This research addresses the metaheuristics of marriage in honey-bees optimization based on the behavior of bees. The current study proposes a technique for solving combinatorial optimization problems within proper computation times. The purpose of this study focuses on the travelling salesperson problem and the application of chaotic methods in important sections (...) of the MBO metaheuristic. Three experiments were conducted to measure the efficiency and quality of the solutions: MBO with chaos to generate initial solutions ; MBO with chaos in the workers ; and MBO with chaos to generate initial solutions and the workers. The application of chaotic functions in MBO was significantly better at solving the travelling salesperson problem. (shrink)

Model predictive control technology can effectively reduce the bad effect caused by inaccurate data prediction in microgrid energy management problem. However, the use of MPC technology needs to dynamically select an optimal solution from the Pareto solution set to implement, which needs the participant of the decision-makers frequently. In order to reduce the burden on decision-makers, we designed a knee point-based evolutionary multiobjective optimization algorithm, termed KBEMO. Knee point is the solution on Pareto front with the maximum marginal utility, (...) which is considered as the preferred solution if there is no other preference. This algorithm focuses on obtaining the knee region and automatically outputs knee points after the optimization. By combining this algorithm with MPC technology, it can effectively reduce the amount of computational consumption and obtain better convergence. Experimental results show that this method is more competitive than the traditional single-objective MPC method. (shrink)

An improved variant of the Jaya optimization algorithm, called Jaya2, is proposed to enhance the performance of the original Jaya sacrificing its algorithmic design. The proposed approach arranges the solutions in a ring topology to reduce the likelihood of premature convergence. In addition, the population size reduction is used to automatically adjust the population size during the optimization process. Moreover, the translation dependency problem of the original Jaya is discussed, and an alternative solution update operation is proposed. (...) To test Jaya2, we compare it with nine different optimization methods on the CEC 2020 benchmark functions and the CEC 2011 real-world optimization problems. The results show that Jaya2 is highly competitive on the tested problems where it generally outperforms most approaches. Having an easy-to-implement approach with little parameter tuning is highly desirable since researchers from different disciplines with basic programming skills can use it to solve their optimization problems. (shrink)

Bound-constrained optimization has wide applications in science and engineering. In the last two decades, various evolutionary algorithms were developed under the umbrella of evolutionary computation for solving various bound-constrained benchmark functions and various real-world problems. In general, the developed evolutionary algorithms belong to nature-inspired algorithms and swarm intelligence paradigms. Differential evolutionary algorithm is one of the most popular and well-known EAs and has secured top ranks in most of the EA competitions in the special session of the IEEE Congress (...) on Evolutionary Computation. In this paper, a customized differential evolutionary algorithm is suggested and applied on twenty-nine large-scale bound-constrained benchmark functions. The suggested C-DE algorithm has obtained promising numerical results in its 51 independent runs of simulations. Most of the 2013 IEEE-CEC benchmark functions are tackled efficiently in terms of proximity and diversity. (shrink)

The existing computer technology is used to conduct an in-depth study and analysis of drilling waste treatment, and the results are analyzed by computer simulation optimization algorithms. Based on the system theory, we define the research system, combine the unique characteristics of the technological innovation mechanism of drilling waste treatment, and use the internal and external factors affecting the technological innovation dynamics of drilling waste treatment, such as drilling waste treatment capacity, from the current actual situation. On this basis, (...) factor analysis is used to analyze the factors affecting technological innovation dynamics from both internal and external aspects of the system, establish a system model of technological innovation dynamics of drilling waste disposal, and give the initial values of the simulation model. This will reduce the pollution of the environment and enhance the competitiveness of enterprises. Drilling waste treatment technology is getting increased attention, but at this stage, there is no suitable technology innovation mechanism for drilling waste treatment. Through the simulation trend chart obtained by sensitivity analysis, the key factors in the system are found, and the innovation power mechanism of drilling waste treatment technology is constructed, which provides a basis for the formulation of enterprise technological innovation strategies and the development of technological innovation activities. Research on the dynamic mechanism of drilling waste treatment technology innovation explores a waste treatment mechanism suitable for the drilling industry, so as to promote the steady development of the drilling industry and at the same time provide theoretical support for the treatment of drilling engineering waste. (shrink)

Software testing is a very important technique to design the faultless software and takes approximately 60% of resources for the software development. It is the process of executing a program or application to detect the software bugs. In software development life cycle, the testing phase takes around 60% of cost and time. Test case generation is a method to identify the test data and satisfy the software testing criteria. Test case generation is a vital concept used in software testing, that (...) can be derived from the user requirements specification. An automatic test case technique determines automatically where the test cases or test data generates utilizing search based optimization method. In this paper, Cuckoo Search and Bee Colony Algorithm (CSBCA) method is used for optimization of test cases and generation of path convergence within minimal execution time. The performance of the proposed CSBCA was compared with the performance of existing methods such as Particle Swarm Optimization (PSO), Cuckoo Search (CS), Bee Colony Algorithm (BCA), and Firefly Algorithm (FA). (shrink)

The swarm intelligence algorithm simulates the behavior of animal populations in nature and is a new type of intelligent solution that is different from traditional artificial intelligence. Feature selection is a very common data dimensionality reduction method, which requires us to select the feature subset with the best evaluation criteria from the original feature set. Feature selection, as an effective data processing method, has become a hot research topic in the fields of machine learning, pattern recognition, and data mining and (...) has received extensive attention and attention. In order to verify the improvement effect of the feature selection algorithm based on the swarm intelligence algorithm on the data, this paper conducts experiments on six classes in the city’s first middle school with similar conditions. First, count the current situation of the students in the class, then divide them into classes, use different algorithms to teach them, and count the changes of the students after a period of teaching. The experiment found that the performance of students under the feature selection algorithm is about 30% higher than other teaching methods, and the awareness of cooperation between students reaches 0.8. It solves the contradiction between popularization and improvement and solves the problems of polarization and transformation of underachievers. The individuality of the algorithm has been fully utilized and developed. The test results show that the improved algorithm has faster convergence speed and higher solution accuracy, and the feature selection algorithm based on swarm intelligence algorithm can effectively improve the efficiency of the algorithm. (shrink)

In this paper, the most common pepper noise in grayscale image noise is investigated in depth in the median filtering algorithm, and the improved median filtering algorithm, adaptive switching median filtering algorithm, and adaptive polar median filtering algorithm are applied to the OTSU algorithm. Two improved OTSU algorithms such as the adaptive switched median filter-based OTSU algorithm and the polar adaptive median filter-based OTSU algorithm are obtained. The experimental results show that the algorithm can better cope with grayscale images contaminated (...) by pretzel noise, and the segmented grayscale images are not only clear but also can better retain the detailed features of grayscale images. A genetic algorithm is a kind of search algorithm with high adaptive, fast operation speed, and good global space finding ability, and it will have a good effect when applied to the threshold finding of the OTSU algorithm. However, the traditional genetic algorithm will fall into the local optimal solution in different degrees when finding the optimal threshold. The advantages of the two interpolation methods proposed in this paper are that one is the edge grayscale image interpolation algorithm using OTSU threshold adaptive segmentation and the other is the edge grayscale image interpolation algorithm using local adaptive threshold segmentation, which can accurately divide the grayscale image region according to the characteristics of different grayscale images and effectively improve the loss of grayscale image edge detail information and jagged blur caused by the classical interpolation algorithm. The visual effect of grayscale images is enhanced by selecting grayscale images from the standard grayscale image test set and interpolating them with bilinear interpolation, bucolic interpolation, NEDI interpolation, and FEOI interpolation for interpolation simulation validation. The subjective evaluation and objective evaluation, as well as the running time, are compared, respectively, showing that the method of this paper can effectively improve the quality of grayscale image interpolation. (shrink)

In multimodal multiobjective optimization problems, multiple Pareto optimal sets, even some good local Pareto optimal sets, should be reserved, which can provide more choices for decision-makers. To solve MMOPs, this paper proposes an evolutionary algorithm with clustering-based assisted selection strategy for multimodal multiobjective optimization, in which the addition operator and deletion operator are proposed to comprehensively consider the diversity in both decision and objective spaces. Specifically, in decision space, the union population is partitioned into multiple clusters by using (...) a density-based clustering method, aiming to assist the addition operator to strengthen the population diversity. Then, a number of weight vectors are adopted to divide population into N subregions in objective space. Moreover, in the deletion operator, the solutions in the most crowded subregion are first collected into previous clusters, and then the worst solution in the most crowded cluster is deleted until there are N solutions left. Our algorithm is compared with other multimodal multiobjective evolutionary algorithms on the well-known benchmark MMOPs. Numerical experiments report the effectiveness and advantages of our proposed algorithm. (shrink)

Due to the currently insufficient consideration of task fitness and task coordination for task allocation in collaborative customized product development, this research was conducted based on the analysis of collaborative customized product development process and task allocation strategy. The definitions and calculation formulas of task fitness and task coordination efficiency were derived, and a multiobjective optimization model of product customization task allocation was constructed. A solution based on adaptive genetic algorithm was proposed, and the feasibility and effectiveness of the (...) task allocation algorithm were tested and verified using a 5-MW wind turbine product development project as example. (shrink)

Considering the highly complex structure of quantum chaos and the nonstationary characteristics of speech signals, this paper proposes a quantum chaotic encryption and quantum particle swarm extraction method based on an underdetermined model. The proposed method first uses quantum chaos to encrypt the speech signal and then uses the local mean decomposition method to construct a virtual receiving array and convert the underdetermined model to a positive definite model. Finally, the signal is extracted using the Levi flight strategy based on (...) kurtosis and the quantum particle swarm optimization optimized by the greedy algorithm. The bit error rate and similarity coefficient of the voice signal are extracted by testing the source voice signal SA1, SA2, and SI943 under different SNR, and the similarity coefficient, uncertainty, and disorder of the observed signal and the source voice signal SA1, SA2, and SI943 verify the effectiveness of the proposed speech signal extraction method and the security of quantum chaos used in speech signal encryption. (shrink)

The whale optimization algorithm is a powerful swarm intelligence method which has been widely used in various fields such as parameter identification of solar cells and PV modules. In order to better balance the exploration and exploitation of WOA, we propose a novel modified WOA in which both the mutation strategy based on Levy flight and a local search mechanism of pattern search are introduced. On the one hand, Levy flight can make the algorithm get rid of the local (...) optimum and avoid stagnation; thus, it is able to prevent the algorithm from losing diversity and to increase the global search capability. On the other hand, pattern search, a direct search method, has not only high convergence rate but also good stability, which can boost the local optimization ability of the WOA. Therefore, the combination of these two mechanisms can greatly improve the capability of WOA to obtain the best solution. In addition, MWOA may be employed to estimate parameters in single diode model, double diode model, and PV modules and to identify unknown parameters of two different types of PV modules under diverse light irradiance and temperature conditions. The analytical results demonstrate the validity and the practicality of MWOA for estimating parameters of solar cells and PV modules. (shrink)

In recent years, with the rapid development of computer storage capabilities and network transmission capabilities, users can easily share their own video and image information on social networking sites, and the amount of multimedia data on the network is rapidly increasing. With the continuous increase of the amount of data in the network, the establishment of effective automated data management methods and search methods has become an increasingly urgent need. This paper proposes a retrieval method of human motion data based (...) on motion capture in index space. By extracting key frames from the original motion to perform horizontal dimensionality reduction and defining features based on Laban motion analysis, the motion segment is subjected to vertical feature dimensionality reduction. After extracting features from the input motion segment, motion matching is performed on the index space. This paper designs the optimization method of the phased dynamic time deformation algorithm in time efficiency and analyzes the optimization method of the phased dynamic time deformation algorithm in time complexity. Considering the time efficiency redundancy, this paper optimizes the time complexity of the phased dynamic time deformation method. This improves the time efficiency of the staged dynamic time warping algorithm, making it suitable for larger-scale human motion data problems. Experiments show that the method in this paper has the advantage of speed, is more in line with the semantics of human motion, and can meet the retrieval requirements of human motion databases. (shrink)