Search

In recent years, in the classic battles and armed conflicts around the world, battlefield environment reconnaissance and the collection and processing of operational information play an increasingly critical role in the victory and defeat of the battlefield. Unmanned equipment, especially UAV equipment, is used by more and more countries in the field of combat reconnaissance. Meanwhile, the types of UAV are gradually diversified with the change of operational requirements. UAVs adapted to different combat environments shine brightly on the battlefield. In terms of naval battle field, due to the limitations and deficiencies of reconnaissance methods such as surface radar, UAVs play a more prominent role in combat reconnaissance. There are more scenarios for UAVs to be used in combat reconnaissance in naval battle field and higher requirements for UAVs' combat effectiveness. Therefore, this paper takes UAVs' naval battle reconnaissance missions as the research object. By using PSO as the research method, this paper studies the combat reconnaissance task configuration of UAVs, hoping to contribute to the improvement of UAVs' combat reconnaissance capability and combat effectiveness. [ABSTRACT FROM AUTHOR]

One of the main concepts in group technology (GT) is the cellular manufacturing system (CMS) with three main problems of cell formation (CF), cell layout (CL), and cell scheduling (CS). This paper studies the cell layout problem (CLP), aiming to find the optimal layout of machines within each cell (intracellular layout) and the optimal layout of cells in each workshop (intercellular layout). To adapt to reality, the dimensions of the cells and machines (inside each cell) were considered unequal, and also the cells and machines could rotate. We believe that a cellular layout that assumes unequal dimensions of the cells and machines can be used for batch production. This kind of production has a wide variety of low to medium demand. Furthermore, a cellular layout can be applied in CMSs and also in noncontinuous industries that have a job shop layout. Our main contribution is considering the possibility of rotating the cells and machines inside the cells. For this purpose, a mixed nonlinear programming model was developed to solve the CLP with the minimum cost of intracellular and intercellular material flows. The proposed nonlinear model was first converted into a linear model, and then a problem was generated and solved with GAMS software to validate the resulting linear model. This model finds the best layout of cells within the workshop and the best layout of machines inside each cell. Then, because of the NP-hardness of the CLP and the fact that even exact methods cannot solve large-scale examples in an acceptable computational time, an imperialist competitive algorithm (ICA) was designed and used to solve the problem. To evaluate the efficiency of the proposed algorithm, its numerical results in small dimensions were compared with the results of GAMS software. In large dimensions, 30 random problems were created, and the results of ICA were compared with the results of the particle swarm optimization (PSO) algorithm and genetic algorithm (GA). Finally, the parameters of the three meta-heuristic algorithms were set by the Taguchi method. Numerical results indicated that ICA was superior to both the PSO algorithm and GA. It could also achieve efficient solutions in a shorter computational time. [ABSTRACT FROM AUTHOR]

In this paper, based on computer reading and processing of music frequency, amplitude, timbre, image pixel, color filling, and so forth, a method of image style transfer guided by music feature data is implemented in real-time playback, using existing music files and image files, processing and trying to reconstruct the fluent relationship between the two in terms of auditory and visual, generating dynamic, musical sound visualization with real-time changes in the visualization. Although recommendation systems have been well developed in real applications, the limitations of CF algorithms are slowly coming to light as the number of people increases day by day, such as the data sparsity problem caused by the scarcity of rated items, the cold start problem caused by new items and new users. The work is dynamic, with real-time changes in music and sound. Taking portraits as an experimental case, but allowing users to customize the input of both music and image files, this new visualization can provide users with a personalized service of mass customization and generate personalized portraits according to personal preferences. At the same time, we take advantage of the BP neural network's ability to handle complex nonlinear problems and construct a rating prediction model between the user and item attribute features, referred to as the PSO-BP rating prediction model, by combining the features of global optimization of particle swarm optimization algorithm, and make further improvements based on the traditional collaborative filtering algorithm. [ABSTRACT FROM AUTHOR]

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. [ABSTRACT FROM AUTHOR]

In this paper, a novel bearing intelligent fault diagnosis method based on a novel krill herd algorithm (NKH) and kernel extreme learning machine (KELM) is proposed. Firstly, multiscale dispersion entropy (MDE) is used to extract fault features of bearings to obtain a set of fault feature vectors composed of dispersion entropy. Then, it is imported into the kernel extreme learning machine for fault diagnosis. But considering the kernel function parameters σ and the error penalty factor C will affect the classification accuracy of the kernel extreme learning machine, this paper uses the novel krill herd algorithm (NKH) for their optimization. The opposite populations are added to the NKH in the initialization of population to improve its speed and prevent local optimum, and during the period of looking for the optimal solution, the impulse operator is introduced to ensure it has enough impulse to rush out of the local optimal once into the local optimum. Finally, in order to verify the effectiveness of the proposed method, it was applied to the bearing fault experiment of Case Western Reserve University and XJTU-SY bearing data set. The results show that the proposed method not only has good fault diagnosis performance and generalization but also has fast convergence speed and does not easily fall into the local optimum. Therefore, this paper provides a method for fault diagnosis under different loads. Meanwhile, the new method (NKH-KELM) is compared and analyzed with other mainstream intelligent bearing fault diagnosis methods to verify the effectiveness and accuracy of the proposed method. [ABSTRACT FROM AUTHOR]

Intelligent manufacturing capability evaluation is the key for enterprises to scientifically formulate the implementation path and continuously improve the level of intelligent manufacturing. To help manufacturing enterprises diagnose the level of intelligent manufacturing capability, this paper conducts research on intelligent manufacturing capability maturity evaluation based on maturity theory. The evaluation problem is a complex nonlinear problem, and BP neural network is particularly suitable for solving such complex mapping problems. Aiming at the problem that the BP neural network is sensitive to initial weights and thresholds, the sparrow search algorithm (SSA) is used to optimize the initial weights and thresholds of the BP neural network. In order to overcome the shortcoming of SSA that it is easy to fall into the local optimum, the firefly disturbance strategy is introduced to improve it, a new sparrow search algorithm (FASSA) is proposed, and on this basis, an intelligent manufacturing capability maturity evaluation model based on the FASSA-BP algorithm is constructed. Finally, a large battery manufacturing enterprise in China is selected for empirical research, and the comparison experiments are carried out on the FASSA-BP model, BP model, SSA-BP model, and PSO-BP model in terms of accuracy, stability, etc. The results show that the evaluation of intelligent manufacturing capability maturity through this model can effectively help companies diagnose problems in the construction of intelligent manufacturing and provide a reference for companies to accurately improve their intelligent manufacturing capabilities. [ABSTRACT FROM AUTHOR]

In the hot continuous rolling process, the main factor affecting the actual thickness of strip is the rolling force. The precision of rolling force calculation is the key to realize accurate on-line control. However, because of the complexity and nonlinearity of the rolling process, as well as many influencing factors, the theoretical analysis of the traditional rolling force prediction model often needs to be simplified and hypothesized. This leads to the incompleteness of the mathematical model and the deviation between the calculated results and the actual working conditions. In this paper, a rolling force prediction method based on genetic algorithm (GA), particle swarm optimization algorithm (PSO), and multiple hidden layer extreme learning machine (MELM) is proposed, namely, PSO-GA-MELM algorithm, which takes MELM as the basic model for rolling force prediction. In the modeling process, GA is used to determine the optimal number of hidden layers and the optimal number of hidden nodes, and PSO is used to search for the optimal input weights and biases. This method avoids the influence of human intervention on the model and saves the modeling time. This paper takes the actual production data of BaoSteel 2050 production line as experimental data, and the experimental results indicate that the algorithm can be effectively used to determine the optimal network structure of MELM. The rolling force prediction model trained by the algorithm has excellent performance in prediction accuracy, computational stability, and the number of hidden nodes and is applicable to the prediction of rolling force in hot continuous rolling process. [ABSTRACT FROM AUTHOR]

Autonomous driving has recently been in considerable progress, and many algorithms have been suggested to control the motions of driverless cars. The model predictive controller (MPC) is one of the efficient approaches by which the speed and direction of the near future of an automobile could be predicted and controlled. Even though the MPC is of enormous benefit, the performance (minimum tracking error) of such a controller strictly depends on the appropriate tuning of its parameters. This paper applies the particle swarm optimization (PSO) algorithm to find the global minimum tracking error by tuning the controller's parameters and ultimately calculating the front steering angle and directed motor force to the wheels of an autonomous vehicle (AV). This article consists of acquiring vehicle dynamics, extended model predictive control, and optimization paradigm. The proposed approach is compared with previous research in the literature and simulation results show higher performance, and also it is less computationally expensive. The simulation results show that the proposed method with only three adjustable parameters has an overshoot of about 8% and its RMSE is 0.72. [ABSTRACT FROM AUTHOR]

The paper considers two-agent order acceptance scheduling problems with different scheduling criteria. Two agents have a set of jobs to be processed by a single machine. The processing time and due date of each job are known in advance. In the order accepting scheduling problem, jobs are allowed to be rejected. The objective of the problem is to maximize the net revenue while keeping the weighted number of tardy jobs for the second agent within a predetermined value. A mixed-integer linear programming (MILP) formulation is provided to obtain the optimal solution. The problem is considered as an NP-hard problem. Therefore, MILP can be used to solve small problem instances optimally. To solve the problem instances with realistic size, heuristic and metaheuristic algorithms have been proposed. A heuristic method is used to determine and secure a quick solution while the metaheuristic based on particle swarm optimization (PSO) is designed to obtain the near-optimal solution. A numerical experiment is piloted and conducted on the benchmark instances that could be obtained from the literature. The performances of the proposed algorithms are tested through numerical experiments. The proposed PSO can obtain the solution within 0.1% of the optimal solution for problem instances up to 60 jobs. The performance of the proposed PSO is found to be significantly better than the performance of the heuristic. [ABSTRACT FROM AUTHOR]

Aiming at the shortcomings of standard particle swarm optimization (PSO) algorithms that easily fall into local optimum, this paper proposes an optimization algorithm (LTQPSO) 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. [ABSTRACT FROM AUTHOR]

The wafer stage in dual-stage lithographic system is an air-bearing servo motion platform requiring high positioning accuracy and high transient performance. However, the residual vibration, resulting from almost zero damping, high velocity, parallel decoupling structure, and direct drive, brings about unacceptable overshoot and settling time. To suppress these unfavorable elements in high dynamic motion, a novel motion profile planning method combined with input shaping is proposed in this paper. Firstly, a trajectory named all free S-curve (AFS-curve) is derived, which has less constraints and better performance than traditional S-curve profile. Then, AFS-curve combined with a zero vibration shaper (ZV) is developed to further suppress residual vibration. Due to the very complex parameter adjustment, the online tuning may cause system oscillation that leads to damage of the precision stage. This paper, furthermore, proposes an online-offline method to optimize the parameters in the motion profile. Online step is performed to collect input and output data. Offline step includes the system model identification based on I/O data and parameter self-learning based on particle swarm optimization (PSO). The simulation and experimental results indicate that the proposed method achieves significant reduction of the positioning time and the overshoot in the dual-stage system. [ABSTRACT FROM AUTHOR]

This paper considers the parameter identification of Wiener systems with colored noise. The difficulty in the identification is that the model is nonlinear and the intermediate variable cannot be measured. Particle swarm optimization is an artificial intelligence evolutionary method and is effective in solving nonlinear optimization problem. In this paper, we obtain the identification model of the Wiener system and then transfer the parameter identification problem into an optimization problem. Then, we derive a particle swarm optimization iterative (PSOI) identification algorithm to identify the unknown parameter of the Wiener system. Furthermore, a gradient iterative identification algorithm is proposed to compare with the particle swarm optimization iterative algorithm. Numerical simulation is carried out to evaluate the performance of the PSOI algorithm and the gradient iterative algorithm. The simulation results indicate that the proposed algorithms are effective and the PSOI algorithm can achieve better performance over the gradient iterative algorithm. [ABSTRACT FROM AUTHOR]

Contactors are important components in circuits. To solve the multiobjective optimization problems (MOPs) of contactors, a niching multiobjective particle swarm optimization (NMOPSO) with the entropy weight ideal point theory is proposed in this paper. The new algorithm selecting and archiving the nondominated solutions based on the niching theory to ensure the diversity of the nondominated solutions. To avoid missing the extreme solutions of each objective during the multiobjective optimization process, extra particle swarms used to search the independent optimal solution of each objective are supplemented in this algorithm. In order to determine the best compromise solution, a method to select the compromise solution based on entropy weight ideal point theory is also proposed in this paper. Using the algorithm to optimize the characteristics of a typical direct-acting contactor, the results show that the proposed algorithm can obtain the best compromise solution in MOPs. [ABSTRACT FROM AUTHOR]

Order picking, which is collecting a set of products from different locations in a warehouse, has repeatedly been described as one of the most laborious and time-consuming internal logistic processes. Each order is issued to pick some products located at given locations in the warehouse. In this paper, we consider an order picking problem, in which a number of orders with different delivery due dates are going to be retrieved by a limited number of order pickers in multiperiods such that the total tardiness is minimized. The aim is to determine a retrieval plan in terms of order batching and order picker multitrip routing as decision variables. Besides, products are arrived and replenished at the predetermined locations at different periods. Therefore, products sitting in those locations should be delivered soon to provide empty rooms for replenishment. A mixed integer linear programming formulation is proposed for this new problem. The model is optimally solved for small-size problems. For larger instances, grouping metaheuristic algorithms are proposed based on particle swarm optimization and the league championship algorithm that use group-based operators to generate reasonable batches of orders. Improvement heuristics are designed as well. The performance of the MILP formulation and metaheuristic algorithms is analyzed for different problem instances whose designs are based on real data gathered from an auto parts warehouse. Results indicate that our algorithms can stably solve large instances of the problem in a reasonable time. [ABSTRACT FROM AUTHOR]

Accurate identification and classification of atmospheric particulates can provide the basis for their source apportionment. Most current research studies mainly focus on the classification of atmospheric particles based on the energy spectrum of particles, which has the problems of low accuracy and being time-consuming. It is necessary to study the classification method of atmospheric particles with higher accuracy. In this paper, a convolutional neural network (CNN) model with attention mechanism is proposed to identify and classify the scanning electron microscopy (SEM) images of atmospheric particles. First, this work established a database, Qingdao 2016–2018, for atmospheric particles classification research. This database consists of 3469 SEM images of single particulates. Secondly, by analyzing the morphological characteristics of single particle SEM images, it can be divided into four categories: fibrous particles, flocculent particles, spherical particles, and mineral particles. Thirdly, by introducing attention mechanism into convolutional neural network, an Attention-CNN model for the identification and classification of the four types of atmospheric particles based on the SEM images is established. Finally, the Attention-CNN model is trained and tested based on the SEM images database, and the results of identification and classification for four types of particles are obtained. Under the same SEM images database, the classification results from Attention-CNN are compared with those of CNN and SVM. It is found that Attention-CNN has higher classification accuracy and reduces significantly the misclassification number of particles, which shows the focusing effect of attention mechanism. [ABSTRACT FROM AUTHOR]

During the past few years, batch service systems have attracted considerable attention due to their wide area of applications. In this present paper, we study a special batch service polling system (the so-called Israeli queue) with priorities. Different from the previous papers which focus on the performance analysis, we aim to investigate the strategic behavior of customers and optimal design for the underlying queueing model. By considering two levels of information (observable and unobservable) provided upon customers' arrival, we, respectively, derive the equilibrium strategies of high-priority and low-priority customers, regarding the joining or balking dilemma. We also present some numerical examples to reveal the impacts of several parameters on the equilibrium strategies, together with some intuitive explanations. Finally, we formulate the revenue function of the service provider and present the Particle Swarm Optimization algorithm to seek the optimal service prices for the high-priority and low-priority customers to maximize the service provider's revenue under the two levels of information. [ABSTRACT FROM AUTHOR]

Comprehensive learning particle swarm optimization (CLPSO) is a powerful metaheuristic for global optimization. This paper studies parallelizing CLPSO by open computing language (OpenCL) on the integrated Intel HD Graphics 520 (IHDG520) graphical processing unit (GPU) with a low clock rate. We implement a coarse-grained all-GPU model that maps each particle to a separate work item. Two enhancement strategies, namely, generating and transferring random numbers from the central processor to the GPU as well as reducing the number of instructions in the kernel, are proposed to shorten the model's execution time. This paper further investigates parallelizing deterministic optimization for implicit stochastic optimization of China's Xiaowan Reservoir. The deterministic optimization is performed on an ensemble of 62 years' historical inflow records with monthly time steps, is solved by CLPSO, and is parallelized by a coarse-grained multipopulation model extended from the all-GPU model. The multipopulation model involves a large number of work items. Because of the capacity limit for a buffer transferring data from the central processor to the GPU and the size of the global memory region, the random number generation strategy is modified by generating a small number of random numbers that can be flexibly exploited by the large number of work items. Experiments conducted on various benchmark functions and the case study demonstrate that our proposed all-GPU and multipopulation parallelization models are appropriate; and the multipopulation model achieves the consumption of significantly less execution time than the corresponding sequential model. [ABSTRACT FROM AUTHOR]

Voltage source converter-high-voltage direct current (VSC-HVDC) is the mainstream technology of the offshore wind power transmission, which has been rapidly developed in recent years. The small-signal stability problem is closely related to offshore wind power grid-connected safety, but the present study is relatively small. This paper established a mathematical model of the doubly fed induction generator (DFIG) integrated into the IEEE9 system via VSC-HVDC in detail, and small-signal stability analysis of offshore wind farm (OWF) grid connection is specially studied under different positions and capacities. By selecting two load nodes and two generator nodes in the system for experiments, the optimal location and capacity of offshore wind power connection are obtained by comparing the four schemes. In order to improve the weak damping of the power system, this paper presents a method to determine the parameters of the power system stabilizer (PSS) based on the particle swarm optimization (PSO) algorithm combined with different inertia weight functions. The optimal position of the controller connected to the grid is obtained from the analysis of modal control theory. The results show that, after joining the PSS control, the system damping ratio significantly increases. Finally, the proposed measures are verified by MATLAB/Simulink simulation. The results show that the system oscillation can be significantly reduced by adding PSS, and the small-signal stability of offshore wind power grid connection can be improved. [ABSTRACT FROM AUTHOR]

In the mining industry, smart surveying and exploration operations for the minerals are essential during mining missions. Usually, these missions are performed in remote areas that do not have a wireless communications infrastructure. This paper proposes to use the unmanned aerial vehicle (UAV) as a relay communication node between the exploration team and the ground control station (GCs). UAV can act as a relay node to provide mobile, flexible, and reliable communication links in remote environments and complex topologies. In this work, the pathloss models in millimeter-wave technology are considered because they provide massive data rates for line of sight scenarios. The optimization problem of identifying a 3D location and trajectory of the UAV relay node is formulated to maximize the total team members' data rate. Because the problem is non-convex, the particle swarm optimization algorithm is used to solve it and determine an efficient location and trajectory of the UAV. [ABSTRACT FROM AUTHOR]

The losses in the radial distribution system are inevitable which needs to be minimized for the proper transmission of power to the end customers. This problem can be solved by the allocation of capacitor banks at proper locations with appropriate sizing. These allocations need an efficient approach for the performance enhancement of RDS. In this paper, several metaheuristic techniques such as particle swarm optimization (PSO), Harmony search, Bat, Cuckoo, and Grey-wolf (GW) algorithms are employed to find the size of capacitor banks. Loss sensitivity analysis is considered for the indication of candidate buses where a capacitor has to be installed to reduce the total system losses and ultimately increase efficiency. Cost-effectiveness, power loss minimization, and voltage enhancement can be determined and compared for these 5 techniques and are implemented on the IEEE-34 bus system to illustrate the efficacy of each of them. The results show the advantages and drawbacks of the techniques separately. The simulations are carried out in MATLAB. [ABSTRACT FROM AUTHOR]

To achieve fast and accurate adjustment of robotic fish, this paper proposes state prediction model based on the extreme learning machine optimized by particle swarm algorithm. The proposed model can select desirable actions for robotic fish according to precisely predicted states, "adjusting position" or "pushing ball" defined herein. Specifically, the extreme learning machine (ELM) is leveraged to predict the state of robotic fish, from the observations of current surrounding environment. As the outputs in ELM are varying with the randomly initialized parameters, particle swarm optimization (PSO) algorithm further improves the accuracy and robustness of the ELM by optimizing initial parameters. The empirical results on URWPGSim2D simulation platform indicate that the robotic fish tends to carry out appropriate actions using the state prediction model so that we can complete the game efficiently. It proves that the proposed model can make best use of the real-time information of robotic fish and water polo and derive fulfilling action strategy in various scenarios, which meet the requirements of motion control for robotic fish. [ABSTRACT FROM AUTHOR]

Shape memory alloy- (SMA-) based actuators are widely applied in the compliant actuating systems. However, the measured data of the SMA-based compliant actuating system reveal the input-output hysteresis behavior, and the actuating precision of the compliant actuating system could be degraded by such hysteresis nonlinearities. To characterize such nonlinearities in the SMA-based compliant actuator precisely, a Jiles-Atherton model is adopted in this paper, and a modified particle swarm optimization (MPSO) algorithm is proposed to identify the parameters in the Jiles-Atherton model, which is a combination of several differential nonlinear equations. Compared with the basic PSO identification algorithm, the designed MPSO algorithm can reduce the local optimum problem so that the Jiles-Atherton model with the identified parameters can show good agreements with the measured experimental data. The good capture ability of the proposed identification algorithm is also examined through the comparisons with Jiles-Atherton model using the basic PSO identification algorithm. [ABSTRACT FROM AUTHOR]

The grey system model with time power, which is often called the GM(1,1, t α ), appeals considerable interest of research due to its effectiveness in time series forecasting. Aimed to improve further the GM(1,1, t α ) model, this paper introduces a new whitening equation with variable coefficient into the original whitening equation which extends applicable scope; as a result, an improved grey model with time power, namely, OGM(1,1, t α ), is proposed. Firstly, the time response function of the novel model and the restored values of original series are deduced through grey modelling techniques. Secondly, the variable coefficient in the whitening equation and the time power are determined by particle swarm optimization algorithm. Two empirical examples are then used to verify the validity of the novel model. Finally, the novel model is applied to predict the oil consumption of China from 2004 to 2018. Results show the novel model outperforms other commonly-used competitive models, which can well serve a benchmark model for scholars and decision-makers. [ABSTRACT FROM AUTHOR]

As the Internet of Things (IoT) smart mobile devices explode in complex opportunistic social networks, the amount of data in complex networks is increasing. Large amounts of data cause high latency, high energy consumption, and low-reliability issues when dealing with computationally intensive and latency-sensitive emerging mobile applications. Therefore, we propose a task-sharing strategy that comprehensively considers delay, energy consumption, and terminal reputation value (DERV) for this context. The model consists of a task-sharing decision model that integrates latency and energy consumption, and a reputation value-based model for the allocation of the computational resource game. The two submodels apply an improved particle swarm algorithm and a Lagrange multiplier, respectively. Mobile nodes in the complex social network are given the opportunity to make decisions so that they can choose to share computationally intensive, latency-sensitive computing tasks to base stations with greater computing power in the same network. At the same time, to prevent malicious competition from end nodes, the base station decides the allocation of computing resources based on a database of reputation values provided by a trusted authority. The simulation results show that the proposed strategy can meet the service requirements of low delay, low power consumption, and high reliability for emerging intelligent applications. It effectively realizes the overall optimized allocation of computation sharing resources and promotes the stable transmission of massive data in complex networks. [ABSTRACT FROM AUTHOR]

In this paper, a new method of reactive power compensation is proposed for reducing power loss of distribution power networks. The new method is the combination of local compensation at each load and distribution line compensation. In the method, local capacitors at each load are determined to increase power factor of load to an expected value first and then a number of capacitors are placed in distribution lines with two factors, location and capacity by using the three applied methods. Particle swarm optimization (PSO), parasitism predation algorithm (PPA), and tunicate swarm algorithm (TSA) are applied for the proposed method on four distribution systems with 15, 33, 69, and 85 buses. The comparisons of results with previous methods indicate that the three applied methods can reach higher loss reduction for all study cases. TSA can reach loss reduction more effectively than others by 19.4%, 0.5%, 7.9%, and 10.76% for the four distribution systems, respectively. The most important emphasis is that PSO, which was considered to be of low effectiveness in previous studies, can reach much better loss than approximately all previous methods thank to the proposed compensation method. PSO also reached better loss reduction than others by 18.97%, 0.4%, 7.73%, and 10.21%, respectively. Consequently, it is recommended that the proposed compensation method is useful for distribution systems in minimizing total power loss and TSA can be selected a new and powerful method for the problem. [ABSTRACT FROM AUTHOR]

With the development of Big Data, Industry 4.0, and other technologies, the concept of smart city has become a new goal, new concept, and new practice of many urban developments. It provides a method to solve the problem that public management cannot optimize resources in China's urban development and puts forward a supporting scheme more in line with the optimization of public management resources. Effective use of relevant supporting schemes can improve urban public management capacity, optimize resources, and promote the city to embark on the road of scientific development. This paper starts with the multiobjective optimization algorithm to optimize the matching of public resources and realize the effective utilization of public management resources. Using particle swarm optimization algorithm, the optimal allocation management of 8 kinds of resources in this paper is carried out, and the optimization analysis is carried out from the performance indexes, such as resource allocation time and configuration complexity. Finally, the weights of the eight resources in importance, complexity, and resource demand are 0.4, 0.4, and 0.2, respectively. The proposed method realizes the classification of resources and the optimal matching of resources. [ABSTRACT FROM AUTHOR]

Team selection optimization is the foundation of enterprise strategy realization; it is of great significance for maximizing the effectiveness of organizational decision-making. Thus, the study of team selection/team foundation has been a hot topic for a long time. With the rapid development of information technology, big data has become one of the significant technical means and played a key role in many researches. It is a frontier of team selection study by the means of combining big data with team selection, which has the great practical significance. Taking strategic equilibrium matching and dynamic gain as association constraints and maximizing revenue as the optimization goal, the Hadoop enterprise information management platform is constructed to discover the external environment, organizational culture, and strategic objectives of the enterprise and to discover the potential of the customer. And in order to promote the renewal of production and cooperation mode, a team selection optimization model based on DPSO is built. The simulation experiment method is used to qualitatively analyze the main parameters of the particle swarm optimization in this paper. By comparing the iterative results of genetic algorithm, ordinary particle swarm algorithm, and discrete particle swarm algorithm, it is found that the DPSO algorithm is effective and preferred in the study of team selection with the background of big data. [ABSTRACT FROM AUTHOR]

Constrained optimization plays an important role in many decision-making problems and various real-world applications. In the last two decades, various evolutionary algorithms (EAs) were developed and still are developing under the umbrella of evolutionary computation. In general, EAs are mainly categorized into nature-inspired and swarm-intelligence- (SI-) based paradigms. All these developed algorithms have some merits and also demerits. Particle swarm optimization (PSO), firefly algorithm, ant colony optimization (ACO), and bat algorithm (BA) 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 (MSIA) 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 (IEEE-CEC′13). The suggested algorithm has approximated promising solutions with good convergence and diversity maintenance for most of the used bound constrained single optimization problems. [ABSTRACT FROM AUTHOR]

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. [ABSTRACT FROM AUTHOR]

With the increasing number of electric vehicles (EVs), the charging demand of EVs has brought many new research hotspots, i.e., charging path planning and charging pricing strategy of the charging stations. In this paper, an integrated framework is proposed for multiobjective EV path planning with varied charging pricing strategies, considering the driving distance, total time consumption, energy consumption, charging fee such factors, while the charging pricing strategy is designed based on the objectives of maximizing the total revenues of the charging stations and balancing the profits of the charging stations. First, the energy consumption model of EVs, the M/M/S queuing model of charging stations, and the charging model of charging piles are established. A novel charging path planning algorithm is proposed based on bidirectional Martins' algorithm, which can assist EV users to select charging stations and plan charging paths. Then, a particle swarm optimization (PSO) algorithm is applied to solve the optimal solution of charging station pricing designation. Finally, the method proposed in the paper is simulated on the street map of Shenzhen to verify the efficacy of the multiobjective charging path planning for EVs and the feasibility of the charging pricing strategy. [ABSTRACT FROM AUTHOR]

The optimization of high-dimensional functions is an important problem in both science and engineering. Wolf pack algorithm is a technique often used for computing the global optimum of a multivariable function. In this paper, we develop a new wolf pack algorithm that can accurately compute the optimal value of a high-dimensional function. First, chaotic opposite initialization is designed to improve the quality of initial solution. Second, the disturbance factor is added in the scouting process to enhance the searching ability of wolves, and an adaptive step length is designed to enhance the global searching ability to prevent wolves from falling into the local optimum effectively. A set of standard test functions are selected to test the performance of the proposed algorithm, and the test results are compared with other algorithms. The high-dimensional and ultrahigh-dimensional functions (500 and 1000) are tested. The experimental results show that the proposed algorithm features in good global convergence, high accuracy calculation, strong robustness, and excellent performance in high-dimensional functions. [ABSTRACT FROM AUTHOR]

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 (LMD) 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 (KLG-QPSO). 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. [ABSTRACT FROM AUTHOR]

Whale optimization algorithm (WOA), known as a novel nature-inspired swarm optimization algorithm, demonstrates superiority in handling global continuous optimization problems. However, its performance deteriorates when applied to large-scale complex problems due to rapidly increasing execution time required for huge computational tasks. Based on interactions within the population, WOA is naturally amenable to parallelism, prompting an effective approach to mitigate the drawbacks of sequential WOA. In this paper, field programmable gate array (FPGA) is used as an accelerator, of which the high-level synthesis utilizes open computing language (OpenCL) as a general programming paradigm for heterogeneous System-on-Chip. With above platform, a novel parallel framework of WOA named PWOA is presented. The proposed framework comprises two feasible parallel models called partial parallel and all-FPGA parallel, respectively. Experiments are conducted by performing WOA on CPU and PWOA on OpenCL-based FPGA heterogeneous platform, to solve ten well-known benchmark functions. Meanwhile, other two classic algorithms including particle swarm optimization (PSO) and competitive swarm optimizer (CSO) are adopted for comparison. Numerical results show that the proposed approach achieves a promising computational performance coupled with efficient optimization on relatively large-scale complex problems. [ABSTRACT FROM AUTHOR]

As the medium of human-computer interaction, it is crucial to correctly and quickly interpret the motion information of surface electromyography (sEMG). Deep learning can recognize a variety of sEMG actions by end-to-end training. However, most of the existing deep learning approaches have complex structures and numerous parameters, which make the network optimization problem difficult to realize. In this paper, a novel PSO-based optimized lightweight convolution neural network (PLCNN) is designed to improve the accuracy and optimize the model with applications in sEMG signal movement recognition. With the purpose of reducing the structural complexity of the deep neural network, the designed convolution neural network model is mainly composed of three convolution layers and two full connection layers. Meanwhile, the particle swarm optimization (PSO) is used to optimize hyperparameters and improve the autoadaptive ability of the designed sEMG pattern recognition model. To further indicate the potential application, three experiments are designed according to the progressive process of body movements with respect to the Ninapro standard data set. Experiment results demonstrate that the proposed PLCNN recognition method is superior to the four other popular classification methods. [ABSTRACT FROM AUTHOR]

Lithium-ion batteries have been widely used as energy storage systems and in electric vehicles due to their desirable balance of both energy and power densities as well as continual falling price. Accurate estimation of the state-of-charge (SOC) of a battery pack is important in managing the health and safety of battery packs. This paper proposes a compact radial basis function (RBF) neural model to estimate the state-of-charge (SOC) of lithium battery packs. Firstly, a suitable input set strongly correlated with the package SOC is identified from directly measured voltage, current, and temperature signals by a fast recursive algorithm (FRA). Secondly, a RBF neural model for battery pack SOC estimation is constructed using the FRA strategy to prune redundant hidden layer neurons. Then, the particle swarm optimization (PSO) algorithm is used to optimize the kernel parameters. Finally, a conventional RBF neural network model, an improved RBF neural model using the two stage method, and a least squares support vector machine (LSSVM) model are also used to estimate the battery SOC as a comparative study. Simulation results show that generalization error of SOC estimation using the novel RBF neural network model is less than half of that using other methods. Furthermore, the model training time is much less than the LSSVM method and the improved RBF neural model using the two-stage method. [ABSTRACT FROM AUTHOR]

Particle Swarm Optimization (PSO) is an excellent population-based optimization algorithm. Meanwhile, because of its inspiration source and the velocity update feature, it is also widely used in the collaborative searching tasks for swarm robotics. One of the PSO-based models for robotic swarm searching tasks is Robotic PSO (RPSO). It adds additional items for obstacle avoidance into standard PSO and has been applied to many single-target search tasks. However, due to PSO's global optimization characteristics, it is easy to converge to a specific position in the search space and lose the ability to explore further. When faced with the problem of multitarget searching, it may become inefficient or even invalid. This paper proposes an Exploration Enhanced Robotic PSO (E2RPSO) method for multitarget searching problems for robotic swarms. The proposed method modifies the third item in the RPSO as an additional attraction term. This item not only enables the robot to avoid collisions but also guides the swarm to search unexplored regions as much as possible. This operation increases the swarm's task-specific (top-down) diversity, making the system cover a broader search area and avoid falling into local optimums. Besides, the aggregation degree and evolution speed factors are also included in determining the inertia weight of the proposed method, which adjusts the swarm's internal (bottom-up) diversity dynamically. The comparison results show that this method can balance the relationship between exploration and exploitation well, which has the potential to be applied to multitarget searching scenarios. [ABSTRACT FROM AUTHOR]

Sine cosine algorithm (SCA) is a new meta-heuristic approach suggested in recent years, which repeats some random steps by choosing the sine or cosine functions to find the global optimum. SCA has shown strong patterns of randomness in its searching styles. At the later stage of the algorithm, the drop of diversity of the population leads to locally oriented optimization and lazy convergence when dealing with complex problems. Therefore, this paper proposes an enriched SCA (ASCA) based on the adaptive parameters and chaotic exploitative strategy to alleviate these shortcomings. Two mechanisms are introduced into the original SCA. First, an adaptive transformation parameter is proposed to make transformation more flexible between global search and local exploitation. Then, the chaotic local search is added to augment the local searching patterns of the algorithm. The effectiveness of the ASCA is validated on a set of benchmark functions, including unimodal, multimodal, and composition functions by comparing it with several well-known and advanced meta-heuristics. Simulation results have demonstrated the significant superiority of the ASCA over other peers. Moreover, three engineering design cases are employed to study the advantage of ASCA when solving constrained optimization tasks. The experimental results have shown that the improvement of ASCA is beneficial and performs better than other methods in solving these types of problems. [ABSTRACT FROM AUTHOR]

Dam behavior is difficult to predict due to its complexity. At the same time, dam deformation behavior is vital to dam systems. Developing a precise prediction model of dam deformation from prototype data is still challenging but determinant in the structural safety assessment. In this paper, an artificial neural network (ANN), trained by the improved artificial fish swarm algorithm (IAFSA) and backpropagation algorithm (BP), is proposed for predicting the dam deformation. Initially, crossover operator is embedded into AFSA, which aims to enhance the performance. In light of the influence mechanism of many factors on dam deformation behavior, the hybrid (IAFSA and BP) model uses statistical input to obtain the optimal connection weights and threshold values of the neural network. The hybrid model integrates IAFSA's strong global searching ability and BP's strong local search ability. To avoid overfitting the training set data, a validation set is adopted to check the generalization capability. Subsequently, the obtained optimal parameters are applied to predict the dam deformation behavior. The hybrid model's preciseness is verified against the radial displacements of a pendulum in a concrete arch dam and simulations of four models: statistical model, BP-ANN optimized by genetic algorithm (GA), particle swarm optimization (PSO), and AFSA. Results demonstrate that the proposed model outperforms other models and may provide alarms for safety control. [ABSTRACT FROM AUTHOR]

In recent years, swarm-based stochastic optimizers have achieved remarkable results in tackling real-life problems in engineering and data science. When it comes to the particle swarm optimization (PSO), the comprehensive learning PSO (CLPSO) is a well-established evolutionary algorithm that introduces a comprehensive learning strategy (CLS), which effectively boosts the efficacy of the PSO. However, when the single modal function is processed, the convergence speed of the algorithm is too slow to converge quickly to the optimum during optimization. In this paper, the elite-based dominance scheme of another well-established method, grey wolf optimizer (GWO), is introduced into the CLPSO, and the grey wolf local enhanced comprehensive learning PSO algorithm (GCLPSO) is proposed. Thanks to the exploitative trends of the GWO, the algorithm improves the local search capacity of the CLPSO. The new variant is compared with 15 representative and advanced algorithms on IEEE CEC2017 benchmarks. Experimental outcomes have shown that the improved algorithm outperforms other comparison competitors when coping with four different kinds of functions. Moreover, the algorithm is favorably utilized in feature selection and three constrained engineering construction problems. Simulations have shown that the GCLPSO is capable of effectively dealing with constrained problems and solves the problems encountered in actual production. [ABSTRACT FROM AUTHOR]

In this paper, we present a new approach which is based on using numerical solutions and swarm algorithms (SAs) to solve the interval quadratic programming problem (IQPP). We use numerical solutions for SA to improve its performance. Our approach replaced all intervals in IQPP by additional variables. This new form is called the modified quadratic programming problem (MQPP). The Karush–Kuhn–Tucker (KKT) conditions for MQPP are obtained and solved by the numerical method to get solutions. These solutions are functions in the additional variables. Also, they provide the boundaries of the basic variables which are used as a start point for SAs. Chaotic particle swarm optimization (CPSO) and chaotic firefly algorithm (CFA) are presented. In addition, we use the solution of dual MQPP to improve the behavior and as a stopping criterion for SAs. Finally, the comparison and relations between numerical solutions and SAs are shown in some well-known examples. [ABSTRACT FROM AUTHOR]

The bike-sharing system (BSS), as a sustainable way to deal with the "last mile" problem of mass transit systems, is increasingly popular in recent years. Despite its success, the BSS tends to suffer from the mismatch of bike supply and user demand. BSS operators have to transfer bikes from surplus stations to deficit stations to redistribute them among stations by means of trucks. In this paper, we deal with the bike-sharing rebalancing problem with balance intervals (BRP-BIs), which is a variant of the static bike-sharing rebalancing problem. In this problem, the equilibrium of station is characterized by a balance interval instead of a balance point in the literature. We formulate the BRP-BI as a biobjective mixed-integer programming model with the aim of determining both the minimum cost route for a single capacitated vehicle and the maximum average rebalance utility, an index for the balanced degree of station. Then, a multistart multiobjective particle swarm optimization (MS-MOPSO) algorithm is proposed to solve the model such that the Pareto optimal solutions can be derived. The proposed algorithm is extended with crossover operator and variable neighbourhood search to enhance its exploratory capability. Compared with Hybrid NSGA-II and MOPSO, the computational experimental results demonstrate that our MS-MOPSO can obtain Pareto optimal solutions with higher quality. [ABSTRACT FROM AUTHOR]

Conventional optimization methods are not efficient enough to solve many of the naturally complicated optimization problems. Thus, inspired by nature, metaheuristic algorithms can be utilized as a new kind of problem solvers in solution to these types of optimization problems. In this paper, an optimization algorithm is proposed which is capable of finding the expected quality of different locations and also tuning its exploration-exploitation dilemma to the location of an individual. A novel particle swarm optimization algorithm is presented which implements the conditioning learning behavior so that the particles are led to perform a natural conditioning behavior on an unconditioned motive. In the problem space, particles are classified into several categories so that if a particle lies within a low diversity category, it would have a tendency to move towards its best personal experience. But, if the particle's category is with high diversity, it would have the tendency to move towards the global optimum of that category. The idea of the birds' sensitivity to its flying space is also utilized to increase the particles' speed in undesired spaces in order to leave those spaces as soon as possible. However, in desirable spaces, the particles' velocity is reduced to provide a situation in which the particles have more time to explore their environment. In the proposed algorithm, the birds' instinctive behavior is implemented to construct an initial population randomly or chaotically. Experiments provided to compare the proposed algorithm with the state-of-the-art methods show that our optimization algorithm is one of the most efficient and appropriate ones to solve the static optimization problems. [ABSTRACT FROM AUTHOR]

A centralized airflow control scheme for a complex ocean energy network (OEN) is proposed in this paper to reduce the output power variation (OPV). The OEN is an integrated network of multiple oscillating water columns (OWCs) that are located at different geographical sites connected to a common electrical grid. The complexity of the OWC-OEN increases manifolds due to the integration of several OWCs and design of controllers become very challenging task. So, the centralized airflow control scheme is designed in two stages. In control stage-1, a proportional-integral- (PI-) type controller is designed to provide a common reference command to control stage-2. In control stage-2, the antiwindup PID controllers are implemented for the airflow control of all the OWCs simultaneously. In order to tune the large number of control parameters of this complex system, a fitness function based on integral squared error (ISE) is minimized using the widely adopted particle swarm optimization (PSO) technique. Next, the simulation results were obtained with random wave profiles created using the Joint North Sea Wave Project (JONSWAP) irregular wave model. The OPV of the proposed OWC-OEN was reduced significantly as compared to the individual OWC. It was further observed that the OPV of the proposed scheme was lower than that achieved with uncontrolled and MPPT controlled OWC-OEN. The effect of communication delay on the OPV of the proposed OWC-OEN scheme was also investigated with the proposed controller, which was found to be robust for a delay up to 100 ms. [ABSTRACT FROM AUTHOR]

Trajectory planning is the foundation of locomotion control for quadruped robots. This paper proposes a bionic foot-end trajectory which can adapt to many kinds of terrains and gaits based on the idea of trajectory planning combining Cartesian space with joint space. Trajectory points are picked for inverse kinematics solution, and then quintic polynomials are used to plan joint space trajectories. In order to ensure that the foot-end trajectory generated by the joint trajectory planning is closer to the original Cartesian trajectory, the distributions of the interpolation point are analyzed from the spatial domain to temporal domain. An evaluation function was established to assess the closeness degree between the actual trajectory and the original curve. Subsequently, the particle swarm optimization (PSO) algorithm and genetic algorithm (GA) for the points selection are used to obtain a more precise trajectory. Simulation and physical prototype experiments were included to support the correctness and effectiveness of the algorithms and the conclusions. [ABSTRACT FROM AUTHOR]

In this paper, a multi-unmanned underwater vehicle (UUV) cooperative dynamic maneuver decision-making algorithm is proposed based on the combination of game theory and intuitionistic fuzzy sets. Underwater environments with weak connectivity, underwater noise, and dynamic uncertainties are fully considered through intuitionistic fuzzy sets, which solves one of the main problems in making decisions underwater. Subsequently, the intuitionistic fuzzy multiattribute evaluation of a UUV maneuver strategy is conducted, and the intuitionistic fuzzy payment matrix of the cooperative dynamic maneuver game is obtained. Thereafter, the Nash equilibrium condition is proposed to satisfy the intuitionistic fuzzy total order, and the Nash equilibrium maneuver decision-making model under a dynamic underwater environment is established. Meanwhile, the modified particle swarm optimization method is presented to solve the established problem and find the optimal strategy. Finally, an example is used to verify the superiority of the proposed cooperative dynamic maneuver decision-making algorithm. [ABSTRACT FROM AUTHOR]

This paper proposes an improved coyote optimization algorithm (ICOA) for optimizing the location and sizing of solar photovoltaic distribution generation units (PVDGUs) in radial distribution systems. In the considered problem, four single objectives consisting of total power losses, capacity of all PVDGUs, voltage profile index, and harmonic distortions are minimized independently while satisfying branch current limits, voltage limits, and harmonic distortion limits exactly and simultaneously. The performance of the proposed ICOA method has been improved significantly since two improvements were carried out on the two new solution generations of the conventional coyote optimization algorithm (COA). By finding four single objectives from two IEEE distribution power systems with 33 buses and 69 buses, the impact of each proposed improvement and two proposed improvements on the real performance of ICOA has been investigated. ICOA was superior to COA in terms of capability of finding higher quality solutions, more stable search ability, and faster convergence speed. Furthermore, we have also applied five other metaheuristic algorithms consisting of biogeography-based optimization (BBO), genetic algorithm (GA), particle swarm optimization algorithm (PSO), sunflower optimization (SFO), and salp swarm algorithm (SSA) for dealing with the same problem and evaluating further performance of ICOA. The result comparisons have also indicated the outstanding performance of ICOA because it could find much better results than these methods, especially SFO, SSA, and GA. Consequently, the proposed ICOA is a very effective method for finding the optimal location and capacity of PVDGUs in radial distribution power systems. [ABSTRACT FROM AUTHOR]

Based on the ideas of the new information priority principle and the fractional-accumulation generating operator, in this paper we propose a novel weighted fractional GM(1,1) (WFGM(1,1)) prediction model. In the new model, the original sequence is first transformed by using the weighted fractional-accumulation generating operator, which involves two parameters. With special choices of these parameters, the proposed WFGM(1,1) model reduces to the classical GM(1,1) model and the fractional GM(1,1) (FGM(1,1)) model, as well as the new information priority GM(1,1) (NIPGM(1,1)) model studied recently. Stability property of the WFGM(1,1) model is studied in detail. In practice, the quantum particle swarm optimization algorithm is adopted to choose the quasi-optimal parameters for the new model so as to get the best fitting accuracy. Finally, four numerical examples from different practical applications are present. Numerical results show that the new proposed prediction model is very efficient and has both the best fitting accuracy and the best prediction accuracy compared with the GM(1,1) and the FGM(1,1) as well as the NIPGM(1,1) prediction models. [ABSTRACT FROM AUTHOR]

It is urgent to combine knowledge resources with manufacturing business processes to form a knowledge service in the cloud mode, so as to provide intelligent support for business activities in product development process. The main challenge of knowledge resource service, however, is how to rapidly construct the complex resource service system and respond promptly to the changeable service requirements in the business process, which is similar to the software system modeling using a component in software engineering. This paper is concerned with an optimal composition framework (OCF) of knowledge resource service, including service decomposition, component encapsulation, and optimal composition. Firstly, the typical business processes are decomposed into the dynamic knowledge element (DKE), and all kinds of knowledge resources and service behaviors are encapsulated into the reusable resource service components (RSC). Then, a multicomponent optimal composition mathematical model is presented, which transforms the problem of component composition into a multiobjective optimization problem. On this basis, a heuristic algorithm with the adaptive mutation probability is introduced to composite the multigranularity service component dynamically and robustly. Finally, the case of component composition for maintenance resource service is studied and the simulation results are provided to verify the efficacy of the proposed model and algorithms. [ABSTRACT FROM AUTHOR]

This paper seeks to improve the photovoltaic (PV) system efficiency using metaheuristic, optimized fractional order incremental conductance (FO-INC) control. The proposed FO-INC controls the output voltage of the PV arrays to obtain maximum power point tracking (MPPT). Due to its simplicity and efficiency, the incremental conductance MPPT (INC-MPPT) is one of the most popular algorithms used in the PV scheme. However, owing to the nonlinearity and fractional order (FO) nature of both PV and DC-DC converters, the conventional INC algorithm provides a trade-off between monitoring velocity and tracking precision. Fractional calculus is used to provide an enhanced dynamical model of the PV system to describe nonlinear characteristics. Moreover, three metaheuristic optimization techniques are applied; Particle Swarm Optimization (PSO), Ant Colony Optimization (ACO), and AntLion Optimizer (ALO) are used for tuning the FO parameters of the proposed INC-MPPT. A MATLAB-Simulink-based model of the PV and optimization have been developed and simulated for different INC-MPPT techniques. Different techniques aim to control the boost DC-DC converter towards the MPP. The proposed optimization algorithms are, also, developed and implemented in MATLAB to tune the target parameters. Four performance indices are also introduced in this research to show the reliability of the comparative analysis of the proposed FO-INC with metaheuristic optimization and the conventional INC-MPPT algorithms when applied to a dynamical PV system under rapidly changing weather conditions. The simulation results show the effective performance of the proposed metaheuristic optimized FO-INC as a MPPT control for different climatic conditions with disturbance rejection and robustness analysis. [ABSTRACT FROM AUTHOR]

There is a huge amount of data in the opportunity of “turning waste into treasure” with the arrival of the big data age. Urban layout is very important for the development of urban transportation and building system. Once the layout of the city is finalized, it will be difficult to start again. Therefore, the urban architectural layout planning and design have a very important impact. This paper uses the urban architecture layout big data for building layout optimization using advanced computation techniques. Firstly, a big data collection and storage system based on the Hadoop platform is established. Then, the evaluation model of urban building planning based on improved logit and PSO algorithm is established. The PSO algorithm is used to find the suitable area for this kind of building layout, and then through five impact indicators: land prices, rail transit, historical protection, road traffic capacity, and commercial potential have been established by using the following logit linear regression model. Then, the bridge between logit and PSO algorithm is established by the fitness value of particle. The particle in the particle swarm is assigned to the index parameter of logit model, and then the logit model in the evaluation system is run. The performance index corresponding to the set of parameters is obtained. The performance index is passed to the PSO as the fitness value of the particle to search for the best adaptive position. The reasonable degree of regional architectural planning is obtained, and the rationality of urban architectural planning layout is determined. [ABSTRACT FROM AUTHOR]