In the automatic detection of epileptic seizures, the monitoring of critically ill patients with time varying EEG signals is an essential procedure in intensive care units. There is an increasing interest in using EEG analysis to detect seizure, and in this study we aim to get a better understanding of how to visualize the information in the EEG time-frequency feature, and design and train a novel random forest algorithm for EEG decoding, especially for multiple-levels of illness. Here, we propose an (...) automatic detection framework for epileptic seizure based on multiple time-frequency analysis approaches; it involves a novel random forest model combined with grid search optimization. The short-time Fourier transformation visualizes seizure features after normalization. The dimensionality of features is reduced through principal component analysis before feeding them into the classification model. The training parameters are optimized using grid search optimization to improve detection performance and diagnostic accuracy by in the recognition of three different levels epileptic of conditions (healthy subjects, seizure-free intervals, seizure activity). Our proposed model was used to classify 500 samples of raw EEG data, and multiple cross-validations were adopted to boost the modeling accuracy. Experimental results were evaluated by an accuracy, a confusion matrix, a receiver operating characteristic curve and an area under the curve. The evaluations indicated that our model achieved the more effective classification than some previous typical methods. Such a scheme for computer-assisted clinical diagnosis of seizures has a potential guiding significance, which not only relieves the suffering of patient with epilepsy to improve quality of life, but also helps neurologists reduce their workload. (shrink)

The problem of combinatorial optimization is considered in relation to the choice of the location of the location of power supplies when solving the problem of the development of urban distribution networks of power supply. Two methods have been developed for placing power supplies and assigning consumers to them to solve this problem. The first developed method consists in placing power supplies of the same standard sizes, and the second - of different standard sizes. The fundamental difference between the (...) created methods and the existing ones is that the proposed methods take into account all the material of the problem and have specialized methods for coding possible solutions, modified operators of crossing and selection. The proposed methods effectively solve the problem of low inheritance, topological unfeasibility of the found solutions, as a result of which the execution time is significantly reduced and the accuracy of calculations is increased. In the developed methods, the lack of taking into account the restrictions on the placement of new power supplies is realized, which made it possible to solve the problem of applying the methods for a narrow range of problems. A comparative analysis of the results obtained by placing power supplies of the same standard sizes and known methods was carried out, and it was found that the developed method works faster than the known methods. It is shown that the proposed approach ensures stable convergence of the search process by an acceptable number of steps without artificial limitation of the search space and the use of additional expert information on the feasibility of possible solutions. The results obtained allow us to propose effective methods to improve the quality of decisions made on the choice of the location of power supply facilities in the design of urban electrical. (shrink)

This paper addresses a common challenge with computational cognitive models: identifying parameter values that are both theoretically plausible and generate predictions that match well with empirical data. While computational models can offer deep explanations of cognition, they are computationally complex and often out of reach of traditional parameter fitting methods. Weak methodology may lead to premature rejection of valid models or to acceptance of models that might otherwise be falsified. Mathematically robust fitting methods are, therefore, essential to the progress of (...) computational modeling in cognitive science. In this article, we investigate the capability and role of modern fitting methods—including Bayesian optimization and approximate Bayesian computation—and contrast them to some more commonly used methods: grid search and Nelder–Mead optimization. Our investigation consists of a reanalysis of the fitting of two previous computational models: an Adaptive Control of Thought—Rational model of skill acquisition and a computational rationality model of visual search. The results contrast the efficiency and informativeness of the methods. A key advantage of the Bayesian methods is the ability to estimate the uncertainty of fitted parameter values. We conclude that approximate Bayesian computation is (a) efficient, (b) informative, and (c) offers a path to reproducible results. (shrink)

This paper conducts an evaluative study on the rehabilitation of limb motor function by using a microsensor information flow gain algorithm and investigates the surface electromyography signals of the upper limb during rehabilitation training. The surface EMG signals contain a large amount of limb movement information. By analysing and processing the surface EMG signals, we can grasp the human muscle movement state and identify the human upper limb movement intention. The EMG signals were processed by the trap and filter combination (...) denoising method and wavelet denoising method, respectively, the signal-to-noise ratio was used to evaluate the noise reduction effect, and finally, the wavelet denoising method with a better noise reduction effect was selected to process all the EMG signals. After the noise is removed, the signal is extracted in the time domain and frequency domain, and the root mean square, absolute mean, median frequency in the time domain, and average power frequency in the frequency domain are selected and input to the classifier for pattern recognition. The support vector machine is used to classify the myoelectric signals and optimize the parameters in the support vector machine using the grid search method and particle swarm optimization algorithm and classify the test samples using the trained support vector machine. Compared with the classification results of the grid search optimized support vector machine, the optimized vector machine has a 7% higher recognition rate, reaching 85%. The action recognition classification method of myoelectric signals is combined with an upper limb rehabilitation training platform to verify the feasibility of using myoelectric signals for rehabilitation training. After the classifier recognizes the upper limb movements, the upper computer sends movement commands to the controller to make the rehabilitation platform move according to the recognition results, and finally, the movement execution accuracy of the rehabilitation platform reaches 80% on average. (shrink)

This work aims to solve the complex problems of non-linearity, instability, and multiple economic factors in the tax forecast of the ceramic industry to ensure the sustainable development of the ceramic industry. The key influential indicators of the tax forecast are obtained by analyzing the principal components affecting the tax index. In addition, a human-computer interaction system is established based on cognitive psychology theory to improve the user-friendliness of tax analysis. At the same time, the tax data of the ceramic (...) industry in Jingdezhen City, Jiangxi Province in different years are used for the empirical analysis of the tax prediction of different prediction models, including particle swarm optimization algorithm, and fusion algorithm, and support vector machine. This work comprehensively analyzes the influence of the optimized tax supervision mode on the economic development of the ceramic industry and provides ideas for the development of the ceramic industry in Jingdezhen. The research results demonstrate that the main indicator affecting tax revenue is the added value of the primary and secondary industries. The optimized SVM based on grid search method can provide a comprehensive data base for tax forecasting. The optimization of the computer system based on cognitive psychology improves the model prediction accuracy by 10%, and the absolute error decreases from 6.9 to 1.8%. The tax forecast results indicate that the tax imbalance in Jingdezhen is increasing. Therefore, the government needs to attach great importance to the development of the ceramic industry and strictly implement the tax policy. The tax supervision model can alleviate the problems of low fiscal contribution rate, tax evasion, and management loopholes. In addition, the SVM tax prediction model optimized by grid search method will lay a theoretical foundation for the research and application of taxation in the ceramic industry. (shrink)

Students’ performance is an important factor for the evaluation of teaching quality in colleges. The aim of this study is to propose a novel intelligent approach to predict students’ performance using support vector regression optimized by an improved duel algorithm. To the best of our knowledge, few research studies have been developed to predict students’ performance based on student behavior, and the novelty of this study is to develop a new hybrid intelligent approach in this field. According to the obtained (...) results, the IDA-SVR model clearly outperformed the other models by achieving less mean square error. In other words, IDA-SVR with an MSE of 0.0089 has higher performance than DT with an MSE of 0.0326, SVR with an MSE of 0.0251, ANN with an MSE of 0.0241, and PSO-SVR with an MSE of 0.0117. To investigate the efficacy of IDA, other parameter optimization methods, that is, the direct determination method, grid search method, GA, FA, and PSO, are used for a comparative study. The results show that the IDA algorithm can effectively avoid the local optima and the blindness search and can definitely improve the speed of convergence to the optimal solution. (shrink)

A large number of modern communication technologies and sensing technologies are incorporated into the smart grid, which makes its structure unique. The centralized optimized dispatch method of traditional power grids is difficult to achieve effective dispatch of smart grids. Based on the analysis of power generation plan and maintenance plan optimization model, this paper establishes a smart grid power generation and maintenance collaborative optimization model with distributed renewable energy. The objective function of this collaborative optimization (...) problem is the operating cost of conventional units, the cost of wind power generation, and the cost of overhauling units; the constraints considered mainly include system constraints and overhaul constraints. The solution method of combinatorial optimization is analyzed, and the genetic optimization algorithm adopted in this paper is selected and discussed. According to the characteristics of the system, various loads are modeled, and power supply constraints are considered. By establishing an effective objective function, the adjustable load scheduling problem is transformed into a solvable optimal control problem. Taking into account the uncertain factors in the system, the advantage of the real-time control system is that it can realize the dynamic update scheduling of the load, so it is more in line with the requirements of the actual system. The real-time algorithm proposed in the paper is based on a distributed control strategy, which can not only realize dynamic compensation for random fluctuations in renewable energy power generation but also satisfy the load curve optimization under the premise of making full use of power supply resources. In addition, simulation experiments compare the load dispatching capabilities of the proposed algorithm with the existing algorithms, thereby verifying the performance of the proposed method. (shrink)

The indispensability argument seeks to establish the existence of mathematical objects. The success of the indispensability argument turns on finding cases of genuine extra- mathematical explanation. In this paper, I identify a new case of extra- mathematical explanation, involving the search patterns of fully-aquatic marine predators. I go on to use this case to predict the prevalence of extra- mathematical explanation in science.

A considerable number of areas of bioscience, including gene and drug discovery, metabolic engineering for the biotechnological improvement of organisms, and the processes of natural and directed evolution, are best viewed in terms of a ‘landscape’ representing a large search space of possible solutions or experiments populated by a considerably smaller number of actual solutions that then emerge. This is what makes these problems ‘hard’, but as such these are to be seen as combinatorial optimisation problems that are best (...) attacked by heuristic methods known from that field. Such landscapes, which may also represent or include multiple objectives, are effectively modelled in silico, with modern active learning algorithms such as those based on Darwinian evolution providing guidance, using existing knowledge, as to what is the ‘best’ experiment to do next. An awareness, and the application, of these methods can thereby enhance the scientific discovery process considerably. This analysis fits comfortably with an emerging epistemology that sees scientific reasoning, the search for solutions, and scientific discovery as Bayesian processes. (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)

For companies involved in the supply chain, proper warehousing management is crucial. Warehouse layout arrangement and operation play a critical role in a company’s ability to maintain and improve its competitiveness. Reducing costs and increasing efficiency are two of the most crucial warehousing goals. Deciding on the best warehouse layout is a remarkable optimization problem. This paper uses an optimization method to set bin allocations within an automated warehouse with particular characteristics. The warehouse’s initial layout and the automated (...) platforms limit the search and define the time required to move goods within the warehouse. With the help of historical data and the definition of the time needed to move goods, a mathematical model of warehouse operation was created. An optimization procedure based on the well-known Variable Neighbourhood Search algorithm is defined and applied to the problem. Experimental results demonstrate increments in the efficiency of warehousing operations. (shrink)

Among the data clustering algorithms, the k-means (KM) algorithm is one of the most popular clustering techniques because of its simplicity and efficiency. However, KM is sensitive to initial centers and it has a local optima problem. The k-harmonic means (KHM) clustering algorithm solves the initialization problem of the KM algorithm, but it also has a local optima problem. In this paper, we develop a new algorithm for solving this problem based on a modified version of particle swarm optimization (...) (MPSO) algorithm and KHM clustering. In the proposed algorithm, MPSO is equipped with the cuckoo search algorithm and two new concepts used in PSO in order to improve the efficiency, fast convergence, and escape from local optima. MPSO updates the positions of particles based on a combination of global worst, global best with personal worst, and personal best to dynamically be used in each iteration of the MPSO. The experimental result on eight real-world data sets and two artificial data sets confirms that this modified version is superior to KHM and the regular PSO algorithm. The results of the simulation show that the new algorithm is able to create promising solutions with fast convergence, high accuracy, and correctness while markedly improving the processing time. (shrink)

Topic modelling is a popular unsupervised method for text processing that provides interpretable document representation. One of the most high-level approaches is additively regularized topic models (ARTM). This method features better quality than other methods due to its flexibility and advanced regularization abilities. However, it is challenging to find an optimal learning strategy to create high-quality topics because a user needs to select the regularizers with their values and determine the order of application. Moreover, it may require many real runs (...) or model training which makes this task time consuming. At the current moment, there is a lack of research on parameter optimization for ARTM-based models. Our work proposes an approach that formalizes the learning strategy into a vector of parameters which can be solved with evolutionary approach. We also propose a surrogate-based modification which utilizes machine learning methods that makes the approach for parameters search time efficient. We investigate different optimization algorithms (evolutionary and Bayesian) and their modifications with surrogates in application to topic modelling optimization using the proposed learning strategy approach. An experimental study conducted on English and Russian datasets indicates that the proposed approaches are able to find high-quality parameter solutions for ARTM and substantially reduce the execution time of the search. (shrink)

River water pollution by wastewater can cause significant negative impact on the aquatic sustainability. Hence, accurate modeling of this complicated system and its cost-effective treatment and reuse decision is very important because this optimization process is related to economic expenditure, societal health, and environmental deterioration. In order to optimize this complex system, we may consider three treatment or reuse options such as microscreening filtration, nitrification, and fertilization-oriented irrigation on top of two existing options such as settling and biological oxidation. (...) The objective of this environmental optimization is to minimize the economic expenditure of life cycle costs while satisfying the public health standard in terms of groundwater quality and the environmental standard in terms of river water quality. Particularly, this study improves existing optimization model by pinpointing the critical deficit location of dissolved oxygen sag curve by using analytic differentiation. Also, the proposed formulation considers more practical constraints such as maximal size of irrigation area and minimal amount of filtration treatment process. The results obtained by using an evolutionary algorithm, named a parameter-setting-free harmony search algorithm, show that the proposed model successfully finds optimal solutions while conveniently locating the critical deficit point. (shrink)

The Genetic Algorithm (GA) and Simulated Annealing (SA), two techniques for global optimization, were applied to a reduced (simplified) form of the phase problem (RPP) in computational crystallography. Results were compared with those of "enhanced pair flipping" (EPF), a more elaborate problem-specific algorithm incorporating local and global searches. Not surprisingly, EPF did better than the GA or SA approaches, but the existence of GA and SA techniques more advanced than those used in this study suggest that these techniques still (...) hold promise for phase problem applications. The RPP is, furthermore, an excellent test problem for such global optimization methods. (shrink)

In order to solve the shortcomings of particle swarm optimization in solving multiobjective optimization problems, an improved multiobjective particle swarm optimization algorithm is proposed. In this study, the competitive strategy was introduced into the construction process of Pareto external archives to speed up the search process of nondominated solutions, thereby increasing the speed of the establishment of Pareto external archives. In addition, the descending order of crowding distance method is used to limit the size of external (...) archives and dynamically adjust particle parameters; in order to solve the problem of insufficient population diversity in the later stage of algorithm iteration, time-varying Gaussian mutation strategy is used to mutate the particles in external archives to improve diversity. The simulation experiment results show that the improved algorithm has better convergence and stability than the other compared algorithms. (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)

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)

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)

As an advanced network calculation mode, cloud computing is becoming more and more popular. However, with the proliferation of large data centers hosting cloud applications, the growth of energy consumption has been explosive. Surveys show that a remarkable part of the large energy consumed in data center results from over-provisioning of the network resource to meet requests during peak demand times. In this paper, we propose a solution to this problem by constructing a dynamic energy-efficient resource management scheme. As a (...) way of saving energy as well as maintaining cloud user’s quality of experience, the scheme presents a multitier cloud architecture by configuring physical machines into two pools: a hot pool and a warm pool. Each PM is configured with a resource search engine that finds an available virtual machine for the request, and a synchronous sleep mechanism is introduced to the warm pool. To analyze the end-to-end performance of the cloud system’s service with the proposed scheme, we establish a hybrid queueing system composed of three stochastic submodels by using a matrix-geometric solution. Accordingly, the average latency of requests and the energy-saving rate of the system are derived. Through numerical results, we show the influence of the synchronous sleep mechanism on the system performance. Moreover, from the perspective of economics, we build a system cost function to study the trade-off between different performance measures. An improved Salp Swarm Algorithm is presented to minimize the system cost and optimize the sleep parameter. (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 order to better assist investors in the evaluation and decision-making of financial data, this paper puts forward the need to build a reliable and effective financial data prediction model and, on the basis of financial data analysis, integrates deep learning algorithm to analyze financial data and completes the financial data analysis system based on deep learning. This paper introduces the implementation details of the key modules of the platform in detail. The user interaction module obtains and displays the retrieval (...) results through data parsing, calling the background, and computing engine. The data cleaning module fills, optimizes, and normalizes the data through business experience; the calculation engine module uses the algorithm and extracts the database information to get the similar time series and matching financial model. Finally, the data acquisition module fills the database with historical data at the initialization stage and updates the database every day. The data analysis platform for quantitative trading designed and implemented in this paper has carried out demand analysis, design, implementation, and test. From the perspective of function test and performance test, two functions of similar stock search and financial matching model are selected and tested, and the results are in line with the expected results. (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)

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)

Under the background of the information age, scientific research and engineering practice have developed vigorously, resulting in many complex optimization problems that are difficult to solve. How to design more effective optimization methods has become the focus of urgent solutions in many academic fields. Under the guidance of such demand, intelligent optimization algorithms have emerged. This article analyzes and optimizes the modern artificial intelligence teaching information system in detail. On the basis of determining the network architecture, a (...) detailed demand analysis was carried out, and the overall structure optimization of the network was given; the business process and data flow of the main modules of the website were optimized. In order to further enhance the local search ability of the algorithm, a multiclass interactive optimization algorithm is proposed in combination with the Euclidean distance-based clustering method, which changes the teaching mode from “one-person teaching” to “multiperson teaching.” This clustering method has lower complexity and is beneficial to enhance the utilization of neighborhood information. At the same time, in order to enhance the diversity of the population and strengthen the connection between the subgroups, after the teaching phase, the worst students in each subgroup are allowed to learn from the best teachers of the population, and after the learning phase, individuals in a random subgroup are allowed to learn from other subgroups. The algorithm was tested in the experimental environment of unconstrained, constrained, and an engineering problem. From the test results, it can be seen that the algorithm is not easy to fall into the local optimum. Compared with other algorithms, the solution accuracy is higher and the stability is better. And it performed well in engineering optimization problems, thus verifying the effectiveness of the strategy. (shrink)

Localization Wireless Sensor Networks (WSN) represent a research topic with increasing interest due to their numerous applications. However, the viability of these systems is compromised by the attained localization uncertainties once implemented, since the network performance is highly dependent on the sensors location. The Node Location Problem (NLP) aims to obtain the optimal distribution of sensors for a particular environment, a problem already categorized as NP-Hard. Furthermore, localization WSN usually perform a sensor selection for determining which nodes are to be (...) utilized for maximizing the achieved accuracy. This problem, defined as the Sensor Selection Problem (SSP), has also been categorized as NP-Hard. While different metaheuristics have been proposed for attaining a near optimal solution in both problems, no approach has considered the two problems simultaneously, thus resulting in suboptimal solutions since the SSP is biased by the actual node distribution once deployed. In this paper, a combined approach of both problems simultaneously is proposed, thus considering the SSP within the NLP. Furthermore, a novel metaheuristic combining the Black Widow Optimization (BWO) algorithm and the Variable Neighbourhood Descent Chains (VND-Chains) local search, denominated as BWO-VND-Chains, is particularly devised for the first time in the author’s best knowledge for the NLP, resulting in a more efficient and robust optimization technique. Finally, a comparison of different metaheuristic algorithms is proposed over an actual urban scenario, considering different sensor selection criteria in order to attain the best methodology and selection technique. Results show that the newly devised algorithm with the SSP criteria optimization achieves mean localization uncertainties up to 19.66 % lower than traditional methodologies. (shrink)

Based on the adaptive particle swarm algorithm and error backpropagation neural network, this paper proposes methods for different styles of music classification and migration visualization. This method has the advantages of simple structure, mature algorithm, and accurate optimization. It can find better network weights and thresholds so that particles can jump out of the local optimal solutions previously searched and search in a larger space. The global search uses the gradient method to accelerate the optimization and (...) control the real-time generation effect of the music style transfer, thereby improving the learning performance and convergence performance of the entire network, ultimately improving the recognition rate of the entire system, and visualizing the musical perception. This kind of real-time information visualization is an artistic expression form, in which artificial intelligence imitates human synesthesia, and it is also a kind of performance art. Combining traditional music visualization and image style transfer adds specific content expression to music visualization and time sequence expression to image style transfer. This visual effect can help users generate unique and personalized portraits with music; it can also be widely used by artists to express the relationship between music and vision. The simulation results show that the method has better classification performance and has certain practical significance and reference value. (shrink)

Uninhabited combat air vehicle path planning is a complicated, high-dimension optimization problem. To solve this problem, we present in this article an improved glowworm swarm optimization algorithm based on the particle swarm optimization algorithm, which we call the PGSO algorithm. In PGSO, the mechanism of a glowworm individual was modified via the individual generation mechanism of PSO. Meanwhile, to improve the presented algorithm’s convergence rate and computational accuracy, we reference the idea of parallel hybrid mutation and local (...) search near the global optimal location. To prove the performance of the proposed algorithm, PGSO was compared with 10 other population-based optimization methods. The experiment results show that the proposed approach is more effective in UCAV path planning than most of the other meta-heuristic algorithms. (shrink)

This article proposes a new problem which is called the Stochastic Travelling Advisor Problem in network optimization, and it is defined for an advisory group who wants to choose a subset of candidate workplaces comprising the most profitable route within the time limit of day working hours. A nonlinear binary mathematical model is formulated and a real application case study in the occupational health and safety field is presented. The problem has a stochastic nature in travelling and advising times (...) since the deterministic models are not appropriate for such real-life problems. The STAP is handled by proposing suitable probability distributions for the time parameters and simulating the problem under such conditions. Many application problems like this one are formulated as nonlinear binary programming models which are hard to be solved using exact algorithms especially in large dimensions. A novel binary version of the recently developed gaining-sharing knowledge-based optimization algorithm to solve binary optimization problems is given. GSK algorithm is based on the concept of how humans acquire and share knowledge during their life span. The binary version of GSK depends mainly on two stages that enable BGSK for exploring and exploitation of the search space efficiently and effectively to solve problems in binary space. The generated simulation runs of the example are solved using the BGSK, and the output histograms and the best-fitted distributions for the total profit and for the route length are obtained. (shrink)

For the application of the standard genetic algorithm in illustration art design, there are still problems such as low search efficiency and high complexity. This paper proposes an illustration art design model based on operator and clustering optimization genetic algorithm. First, during the operation of the genetic algorithm, the values of the crossover probability and the mutation probability are dynamically adjusted according to the characteristics of the population to improve the search efficiency of the algorithm, then the (...) k-medoids algorithm is introduced to optimize the clustering of the genetic algorithm, and a cost function is used to carry out and evaluate the quality of clustering to optimize the complexity of the original algorithm. In addition, a multiobjective optimization genetic algorithm with complex constraints based on group classification is proposed. This algorithm focuses on the problem of group diversity and uses k-means cluster analysis operation to solve the problem of group diversity. The algorithm divides the entire group into four subgroups and assigns appropriate fitness values to reflect the optimal preservation strategy. A large number of computer simulation calculations show that the algorithm can obtain a widely distributed and uniform Pareto optimal solution, the evolution speed is fast, usually only a few iterations can achieve a good optimization effect, and finally the improved genetic algorithm is used to design the random illustration art. The example simulation shows that the improved algorithm proposed in this paper can achieve higher artistic and innovative illustration art design. (shrink)

Path selection is one of the key technologies of wireless sensor network. A reasonable choice of coverage path can improve the service quality of WSN and extend the life cycle of WSN. Biogeography-based optimization is widely used in the field of cluster intelligent optimization because its search method has a better incentive mechanism for population evolution. In this paper, the move-in and move-out operation and mutation operation of the BBO algorithm enable WSN to find an efficient routing (...) path. In this paper, simulation experiments are carried out in two scenarios of regular deployment and random deployment of WSN nodes. The experimental results show that the quality of the WSN coverage path solution optimized by the BBO algorithm in the two scenarios is better than that of the particle swarm algorithm and genetic algorithm. (shrink)

This paper proposes a Multi-Agent based Particle Swarm Optimization (PSO) Framework for the Traveling salesman problem (MAPSOFT). The framework is a deployment of the recently proposed intelligent multi-agent based PSO model by the authors. MAPSOFT is made up of groups of agents that interact with one another in a coordinated search effort within their environment and the solution space. A discrete version of the original multi-agent model is presented and applied to the Travelling Salesman Problem. Based on the (...) simulation results obtained, it was observed that agents retrospectively decide on their next moves based on consistent better fitness values obtained from present and prospective neighborhoods, and by reflecting back to previous behaviors and sticking to historically better results. These overall attributes help enhance the conventional PSO by providing more intelligence and autonomy within the swarm and thus contributed to the emergence of good results for the studied problem. (shrink)

In the past few decades, a lot of optimization methods have been applied in estimating the parameter of photovoltaic models and obtained better results, but these methods still have some deficiencies, such as higher time complexity and poor stability. To tackle these problems, an enhanced success history adaptive DE with greedy mutation strategy is employed to optimize parameters of PV models to propose a parameter optimization method in this paper. In the EBLSHADE, the linear population size reduction strategy (...) is used to gradually reduce population to improve the search capabilities and balance the exploitation and exploration capabilities. The less and more greedy mutation strategy is used to enhance the exploitation capability and the exploration capability. Finally, a parameter optimization method based on EBLSHADE is proposed to optimize parameters of PV models. The different PV models are selected to prove the effectiveness of the proposed method. Comparison results demonstrate that the EBLSHADE is an effective and efficient method and the parameter optimization method is beneficial to design, control, and optimize the PV systems. (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)

The high traffic density of railway line causes ballasted track to be extremely busy, and thus it is particularly important to improve the efficiency during railway maintenance. The changing law of dynamic characteristics of ballast bed during operation for the dynamic track stabilizer is conducive to optimize simulation analysis of the vehicle-track system, so as to provide an optimized choice of operating parameters for promoting the pertinence and efficiency of dynamic track stabilizer. This paper presents the acceleration response of vehicle-track-subgrade (...) system during operation of a WD-320 dynamic track stabilizer and proposes the range of effective operating parameters. Then, the influence of operating parameters on the dynamic characteristics of the ballast bed is discussed for searching the optimal operating parameters under the single factor influence. Finally, the change laws including the support stiffness, damping, lateral resistance, and subsidence for the ballast bed are studied, and a parameterized model for dynamic characteristics of the ballast bed which can optimize the selection for operating parameters is constructed, rendering an effective reference variable for improving the simulation accuracy of the vehicle-track coupling system. (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)

Job shop scheduling problem is one of the most difficult optimization problems in manufacturing industry, and flexible job shop scheduling problem is an extension of the classical JSP, which further challenges the algorithm performance. In FJSP, a machine should be selected for each process from a given set, which introduces another decision element within the job path, making FJSP be more difficult than traditional JSP. In this paper, a variant of grasshopper optimization algorithm named dynamic opposite learning assisted (...) GOA is proposed to solve FJSP. The recently proposed dynamic opposite learning strategy adopts the asymmetric search space to improve the exploitation ability of the algorithm and increase the possibility of finding the global optimum. Various popular benchmarks from CEC 2014 and FJSP are used to evaluate the performance of DOLGOA. Numerical results with comparisons of other classic algorithms show that DOLGOA gets obvious improvement for solving global optimization problems and is well-performed when solving FJSP. (shrink)

The critical node detection problem is a central task in computational graph theory due to its large applicability, consisting in deleting $k$ nodes to minimize a certain graph measure. In this article, we propose a new Extremal Optimization-based approach, the Pseudo-Deterministic Noisy Extremal Optimization (PDNEO) algorithm, to solve the Critical Node Detection variant in which the pairwise connectivity is minimized. PDNEO uses an adaptive pseudo-deterministic parameter to switch between random nodes and articulation points during the search, as (...) well as other features, such as noise induction to preserve diversity, greedy search to better exploit the search space and a greater search space exploration mechanism. Numerical experiments on synthetic and real-world networks show the effectiveness of the proposed algorithm compared with existing methods. (shrink)

The field service scheduling problem is the key problem in field services. Field service pays particular attention to customer experience, that is, customer satisfaction. Customer satisfaction described by customer behavior characteristics based on the prospect theory is considered as the primary optimization goal in this paper. The knowledge of the insertion feasibility on the solution is analysed based on the skill constraint and time window. According to the knowledge, an initialization method based on the nearest heuristic algorithm is constructed. (...) Based on the prior knowledge of the FSSP and the endowment of the Fruit Fly Optimization Algorithm, two operators are defined according to the matrix encoding method. Based on these two operators, three search strategies are then proposed, and the smell-based search strategy and vision-based search strategy for the FOA are redesigned. To verify the performance of the algorithms, the proposed operators and strategies are tested and analysed in the well-known benchmark. Through comparison with the state-of-the-art algorithms, the results show that the proposed HFOA is an effective and efficient method to solve the FSSP with customer satisfaction. (shrink)

Aiming at the shortcomings of standard particle swarm optimization algorithms that easily fall into local optimum, this paper proposes an optimization algorithm that improves quantum behavioral particle swarms. Aiming at the problem of premature convergence of the particle swarm algorithm, the evolution speed of individual particles and the population dispersion are used to dynamically adjust the inertia weights to make them adaptive and controllable, thereby avoiding premature convergence. At the same time, the natural selection method is introduced into (...) the traditional position update formula to maintain the diversity of the population, strengthen the global search ability of the LTQPSO algorithm, and accelerate the convergence speed of the algorithm. The improved LTQPSO algorithm is applied to landscape trail path planning, and the research results prove the effectiveness and feasibility of the algorithm. (shrink)