A new model predictive control (MPC) algorithm is used to select optimal air conditioning setpoints for a commercial office building, considering variable electricity prices, weather, occupancy and lighting. This algorithm, Cost-Comfort Particle Swarm Optimization (CCPSO), is the first to combine a realistic, smooth representation of occupants’ willingness to pay for thermal comfort with a bottom-up, non-linear model of the building and air conditioning system under control. We find that using a quadratic preference function for temperature can yield solutions that are both more comfortable and lower-cost than previous work that used a ``brick wall'' preference function with no preference for further cooling within an allowed temperature band and infinite aversion to going outside the allowed band. Using historical pricing data for a summer month in Chicago, CCPSO provided a 3\% reduction in costs vs. a ``brick-wall'' MPC approach with similar comfort and 13\% reduction in costs vs. a standard night setback strategy. CCPSO also reduced peak-hours demand by 3\% vs. the ``brick-wall'' strategy and 15\% vs. standard night-setback. At the same time, the CCPSO strategy increased off-peak energy consumption by 15\% vs. the ``brick-wall'' strategy. This may be valuable for power systems integrating large amounts of renewable power, which can otherwise become uneconomic due to saturation of demand during off-peak hours.

Particle Swarm Optimization (PSO) is a metaheuristic global optimization paradigm that has gained prominence in the last two decades due to its ease of application in unsupervised, complex multidimensional problems which cannot be solved using traditional deterministic algorithms. The canonical particle swarm optimizer is based on the flocking behavior and social co-operation of birds and fish schools and draws heavily from the evolutionary behavior of these organisms. This paper serves to provide a thorough survey of the PSO algorithm with special emphasis on the development, deployment and improvements of its most basic as well as some of the very recent state–of-the-art implementations. Concepts and directions on choosing the inertia weight, constriction factor, cognition and social weights and perspectives on convergence, parallelization, elitism, niching and discrete optimization as well as neighborhood topologies are outlined. Hybridization attempts with other evolutionary and swarm paradigms in selected applications are covered and an up-to-date review is put forward for the interested reader.

This work addresses the energy-based source localization problem in wireless sensors networks. Instead of circumventing the maximum likelihood (ML) problem by applying convex relaxations and approximations (like all existing approaches do), we here tackle it directly by the use of metaheuristics. To the best of our knowledge, this is the first time that metaheuristics is applied to this type of problems. More specifically an elephant herding optimization (EHO) algorithm is applied. Through extensive simulations, the key parameters of the EHO algorithm are optimized such that they match the energy decay model between two sensor nodes. A detailed analysis of the computational complexity is presented, as well as performance comparison between the proposed algorithm and existing non-metaheuristic ones. Simulation results show that the new approach significantly outperforms the existing solutions in noisy environments, encouraging further improvement and testing of metaheuristic methods.

In this study, the resource blocks (RB) are allocated to user equipment (UE) according to the evolutional algorithms for long term evolution (LTE) systems. Particle Swarm Optimization (PSO) algorithm is one of the evolutionary algorithms, based on the imitation of a flock of birds foraging behavior through learning and grouping the best experience. In previous work, the Simple Particle Swarm Optimization (SPSO) algorithm was proposed for RB allocation to enhance the throughput of Device-to-Device (D2D) communications and improve the system capacity performance. In simulation results, with less population size of M = 10, the SPSO can perform quickly convergence to sub-optimal solution in the 100^th generation and obtained sub-optimum performance with more 2 UEs than the Rand method. Genetic algorithm (GA) is one of the evolutionary algorithms, based on Darwinian models of natural selection and evolution. Therefore, we further proposed a Refined PSO (RPSO) and a novel GA to enhance the throughput of UEs and to improve the system capacity performance. Simulation results show that the proposed GA with 100 populations, in 200 generations can converge to suboptimal solutions. Therefore, with comparing with the SPSO algorithm the proposed GA and RPSO can improve system capacity performance with 1.8 and 0.4 UEs, respectively.

Quantitative structure-activity relationship (QSAR) model is adopted to study the relationship between the chemical and physical properties of various substances and the structure. Through QSAR studies, the internal relationship between the invisible structure and the activity can be obtained. In this paper, a novel chaos-enhanced accelerate particle swarm algorithm (CAPSO) is proposed, which is used to molecular descriptors screening and optimization of the weights of back propagation artificial neural network (BP ANN). Then, the QSAR model based on CAPSO and BP ANN is put forward, hereinafter referred to as CAPSO BP ANN model. The prediction experiment showed that the CAPSO algorithm is a reliable method for screening molecular descriptors and the five molecular descriptors obtained by CAPSO algorithm could well characterize the molecular structure of each compound in pKa prediction. The experimental results also showed the CAPSO BP ANN model has a good performance in predicting the pKa values of various compounds, the absolute mean relative error, root mean square error, and square correlation coefficient are respectively 0.5364, 0.0632, and 0.9438, indicating the higher prediction accuracy and correlation. The proposed hybrid intelligent model can be applied in all kinds of engineering design, prediction of physical and chemical properties and intelligent calculation.

This paper presents a multi-swarm PSO algorithm for the Quadratic Assignment Problem (QAP) implemented on the OpenCL platform. Our work was motivated by results of time efficiency tests performed for single-swarm algorithm implementation that showed clearly that the benefits of a parallel execution platform can be fully exploited provided the processed population is large. The described algorithm can be executed in two modes: with independent swarms or with migration. We discuss the algorithm construction as well as we report results of tests performed on several problem instances from the QAPLIB library. During the experiments the algorithm was configured to process large populations. This allowed us to collect statistical data related to values of goal function reached by individual particles. We use them to demonstrate on two test cases that although single particles seem to behave chaotically during the optimization process, when the whole population is analyzed, the probability that a particle will select a near-optimal solution grows.

In this paper, an in-wheel vibration absorber for In-wheel-motor electric vehicle (IWM EV) is designed, and a comprehensive control strategy of in-wheel absorber and vehicle suspension is proposed to improve vehicle ride comfort. The proposed in-wheel vibration absorber, designed for suppressing the motor vibration, is composed of a spring and a controllable damper. The values of in-wheel spring stiffness and damper initial coefficient are determined by using the improved particle swarm optimization (IPSO) algorithm, which is carried on the typical driving condition. To deal with the negative interaction effects between vehicle suspension and in-wheel absorber, the linear quadratic regulator (LQR) algorithm is utilized to control suspension damper, and the fuzzy PID method is utilized to control in-wheel damper. Based on the four evaluation indexes including vehicle body vertical acceleration, suspension dynamic deflection, wheel dynamic load and motor wallop, the simulation results show that, the proposed LQR control of suspension effectively improves vehicle ride comfort, and the fuzzy PID control of in-wheel damper exhibits superior performance of motor vibration suppressing in comparison to conventional electric wheel.

Most of existing fuzzy forecasting models partition historical training time series into fuzzy time series and build fuzzy-trend logical relationship groups to generate forecasting rules. The determination process of intervals is complex and uncertainty. In this paper, we present a novel fuzzy forecasting model based on high-order fuzzy-fluctuation trends and the fuzzy-fluctuation logical relationships of the training time series. Firstly, we compare each data with the data of its previous day in historical training time series to generate a new fluctuation trend time series(FTTS). Then, fuzzify the FTTS into fuzzy-fluctuation time series(FFTS) according to the up, equal or down range and orientation of the fluctuations. Since the relationship between historical FFTS and the fluctuation trend of future is nonlinear, Particle Swarm Optimization (PSO) algorithm is employed to estimate the required parameters. Finally, use the acquired parameters to forecast the future fluctuations. In order to compare the performance of the proposed model with that of the other models, we apply the proposed method to forecast the Taiwan Stock Exchange Capitalization Weighted Stock Index (TAIEX) time series datasets. The experimental results and the comparison results show that the proposed method can be successfully applied in stock market forecasting or such kinds of time series. We also apply the proposed method to forecast Shanghai Stock Exchange Composite Index (SHSECI) to verify its effectiveness and universality.

The greenhouse gases and air pollution generated by extensive energy use have exacerbated climate change. An electric-bus (e-bus) transportation system favors reducing pollution and carbon emissions. This study analyzed the minimization of construction costs for an all battery-swapping public e-bus transportation system. A simulation was conducted according to existing timetables and routes. Daytime charging was incorporated during the hours of operation; the two parameters of the daytime charging scheme were the residual battery capacity and battery-charging energy during various intervals of daytime peak electricity hours. The parameters were optimized using three algorithms: particle swarm optimization (PSO), a genetic algorithm (GA), and a PSO–GA. This study observed the effects of optimization on cost changes (e.g., number of e-buses, on-board battery capacity, number of extra batteries, charging facilities, and energy consumption) and compared the plug-in and battery-swapping e-bus systems. The results revealed that daytime charging can reduce the construction costs of both systems. In contrast to the other two algorithms, the PSO–GA yielded the most favorable optimization results for the charging scheme. Finally, according to the cases investigated and the parameters of this study, the construction cost of the plug-in e-bus system was lower than that of the battery-swapping e-bus system.

Underwater Sensor Networks (UWSNs) can enable a broad range of applications such as resource monitoring, disaster prevention, and navigation-assisted. It is especially relevant for sensor nodes location in UWSNs. Global Positioning System (GPS) is not suitable for using in UWSNs because of the underwater propagation problems. Hence some localization algorithms based on the precise time synchronization between sensor nodes have been proposed which are not feasible for UWSNs. In this paper, we propose a localization algorithm called Two-Phase Time Synchronization-Free Localization Algorithm (TP-TSFLA). TP-TSFLA contains two phases, namely, range-based estimation phase and range-free evaluation phase. In the first phase, we address a time synchronization-free localization scheme base on the Particle Swarm Optimization (PSO) algorithm to decrease the localization error. In the second phase, we propose a Circle-based Range-Free Localization Algorithm (CRFLA) to locate the unlocalized sensor nodes which cannot obtain the location information through the first phase. In the second phase, sensor nodes which are localized in the first phase act as the new anchor nodes to help realize localization. Hence in this algorithm, we use a small number of mobile beacons to help achieve location without any other anchor nodes. Besides, to improve the precision of the range-free method, an extension of CRFLA by designing a coordinate adjustment scheme is updated. The simulation results show that TP-TSFLA can achieve a relative high localization ratio without time synchronization.

Proteomics research has become one of the most important topics in the fields of life science and natural science. At present, research on protein–protein interaction networks (PPINs) mainly focuses on detecting protein complexes or function modules. However, existing approaches are either ineffective or incomplete. In this paper, we investigate function module detection mechanisms in PPIN, including open databases, existing detection algorithms and recent solutions. After that, we describe the proposed solution based on simplified swarm optimization (SSO) algorithm and gene ontology knowledge. The proposed solution implements SSO algorithm for clustering proteins with similar function, and imports biological gene ontology knowledge for further identifying function complexes and improving detection accuracy. Furthermore, we use four different categories of species dataset for experiment: Fruitfly, Mouse, Scere, and Human. The testing and analysis result show that the proposed solution is feasible, efficient and could achieve a higher accuracy of prediction than existing approaches.

As with many of the non-deterministic search algorithms, particularly those are analogous to complex biological systems, there are a number of inherent difficulties, and the Bees Algorithm (BA) is no exception. Basic versions and variations of the BA have their own drawbacks. Some of these drawbacks are a large number of parameters to be set, lack of methodology for parameter setting and computational complexity. This paper describes a Grouped version of the Bees Algorithm (GBA) addressing these issues. Unlike its conventional version, in this algorithm bees are grouped to search different sites with different neighbourhood sizes rather than just discovering two types of sites, namely elite and selected. Following a description of the GBA, the results gained for 12 benchmark functions are presented and compared with those of the basic BA, enhanced BA, standard BA and modified BA to demonstrate the efficacy of the proposed algorithm. Compared to the conventional implementations of the BA, the proposed version requires setting of fewer parameters, while producing the optimum solutions much faster.

Recycling waste products is an environmental-friendly activity that can bring benefits to accompany, saving manufacturing costs and improving economic efficiency. For the beer industry, recycling bottles can reduce manufacturing costs and reduce the industry's carbon footprint. This paper presents a model for a multi-objective collection-distribution center location and allocation problem in a closed loop supply chain for the beer industry, in which the objective is to minimize total costs and transportation pollution. Uncertainties in the form of randomness and fuzziness are jointly handled in this paper to ensure a more practical problem solution, for which returned bottle sand unusable bottles are considered fuzzy random variables. A heuristic algorithm based on priority-based global-local-neighbor particle swarm optimization (pb-glnPSO) is applied to ensure reliable solutions for this NP-hard problem. A case study on a beer operation company is conducted to illustrate the application of the proposed model and demonstrate the priority-based global-local-neighbor particle swarm optimization.

A reinforcement learning algorithm is proposed to improve the accuracy of short-term load forecasting (STLF) in this article. The proposed model integrates radial basis function neural network (RBFNN), support vector regression (SVR), and adaptive annealing learning algorithm (AALA). In the proposed methodology, firstly, the initial structure of RBFNN is determined by using SVR. Then, an AALA with time-varying learning rates is used to optimize the initial parameters of SVR-RBFNN (AALA-SVR-RBFNN). In order to overcome the stagnation for searching optimal RBFNN, a particle swarm optimization (PSO) is applied to simultaneously find promising learning rates in AALA. Finally, the short-term load demands are predicted by using the optimal RBFNN. The performance of the proposed methodology is verified on the actual load dataset from Taiwan Power Company (TPC). Simulation results reveal that the proposed AALA-SVR-RBFNN can achieve a better load forecasting precision as compared to various RBFNNs.