scholarly journals Multiobjective Reliable Cloud Storage with Its Particle Swarm Optimization Algorithm

2016 ◽  
Vol 2016 ◽  
pp. 1-14 ◽  
Author(s):  
Xiyang Liu ◽  
Lei Fan ◽  
Liming Wang ◽  
Sha Meng
Keyword(s):  
Particle Swarm Optimization ◽  
Data Storage ◽  
Volume Growth ◽  
Real Life ◽  
Particle Swarm ◽  
Experimental Results ◽  
Digital Data ◽  
Swarm Optimization ◽  
Proposed Model ◽  
Multiobjective Particle Swarm Optimization

Information abounds in all fields of the real life, which is often recorded as digital data in computer systems and treated as a kind of increasingly important resource. Its increasing volume growth causes great difficulties in both storage and analysis. The massive data storage in cloud environments has significant impacts on the quality of service (QoS) of the systems, which is becoming an increasingly challenging problem. In this paper, we propose a multiobjective optimization model for the reliable data storage in clouds through considering both cost and reliability of the storage service simultaneously. In the proposed model, the total cost is analyzed to be composed of storage space occupation cost, data migration cost, and communication cost. According to the analysis of the storage process, the transmission reliability, equipment stability, and software reliability are taken into account in the storage reliability evaluation. To solve the proposed multiobjective model, a Constrained Multiobjective Particle Swarm Optimization (CMPSO) algorithm is designed. At last, experiments are designed to validate the proposed model and its solution PSO algorithm. In the experiments, the proposed model is tested in cooperation with 3 storage strategies. Experimental results show that the proposed model is positive and effective. The experimental results also demonstrate that the proposed model can perform much better in alliance with proper file splitting methods.

MULTIOBJECTIVE PARTICLE SWARM OPTIMIZATION BASED ON DIMENSIONAL UPDATE

2013 ◽  
Vol 22 (03) ◽  
pp. 1350015 ◽  
Author(s):  
HEMING XU ◽  
YINGLIN WANG ◽  
XIN XU
Keyword(s):  
Particle Swarm Optimization ◽  
Pareto Front ◽  
Particle Swarm ◽  
Experimental Results ◽  
Entire Region ◽  
Swarm Optimization ◽  
Nondominated Solutions ◽  
Limited Size ◽  
Multiobjective Particle Swarm Optimization ◽  
The Impact

For multiobjective particle swarm optimization (MOPSO), two particles may be incomparable, i. e., not dominated by each other. The personal best and the global best for the particle become less optimal, thus the convergence becomes slow. Even worse, an archive of a limited size can not cover the entire region dominated by the Pareto front, the uncovered region can contain unidentifiable nondominated solutions that are not optimal, and thus the precision the algorithm achieves encounters a plateau. Therefore we propose dimensional update, i. e., evaluating the particle's fitness after updating each variable of its position. Separate consideration of the impact of each variable decreases the occurrence of incomparable relations, thus improves the performance. Experimental results validate the efficiency of our algorithm.

scholarly journals Knowledge-guided multiobjective particle swarm optimization with fusion learning strategies

2021 ◽  
Author(s):  
Wei Li ◽  
Xiang Meng ◽  
Ying Huang ◽  
Soroosh Mahmoodi
Keyword(s):  
Particle Swarm Optimization ◽  
Learning Strategies ◽  
Learning Strategy ◽  
Particle Swarm ◽  
Population Diversity ◽  
Selection Strategy ◽  
Rapid Loss ◽  
Solution Quality ◽  
Swarm Optimization ◽  
Multiobjective Particle Swarm Optimization

AbstractMultiobjective particle swarm optimization (MOPSO) algorithm faces the difficulty of prematurity and insufficient diversity due to the selection of inappropriate leaders and inefficient evolution strategies. Therefore, to circumvent the rapid loss of population diversity and premature convergence in MOPSO, this paper proposes a knowledge-guided multiobjective particle swarm optimization using fusion learning strategies (KGMOPSO), in which an improved leadership selection strategy based on knowledge utilization is presented to select the appropriate global leader for improving the convergence ability of the algorithm. Furthermore, the similarity between different individuals is dynamically measured to detect the diversity of the current population, and a diversity-enhanced learning strategy is proposed to prevent the rapid loss of population diversity. Additionally, a maximum and minimum crowding distance strategy is employed to obtain excellent nondominated solutions. The proposed KGMOPSO algorithm is evaluated by comparisons with the existing state-of-the-art multiobjective optimization algorithms on the ZDT and DTLZ test instances. Experimental results illustrate that KGMOPSO is superior to other multiobjective algorithms with regard to solution quality and diversity maintenance.

scholarly journals Neural Network Approach for Global Solar Irradiance Prediction at Extremely Short-Time-Intervals Using Particle Swarm Optimization Algorithm

Energies ◽  
2021 ◽  
Vol 14 (4) ◽  
pp. 1213
Author(s):  
Ahmed Aljanad ◽  
Nadia M. L. Tan ◽  
Vassilios G. Agelidis ◽  
Hussain Shareef
Keyword(s):  
Neural Networks ◽  
Particle Swarm Optimization ◽  
Solar Irradiance ◽  
Particle Swarm ◽  
Time Interval ◽  
Time Intervals ◽  
Swarm Optimization ◽  
Backpropagation Neural Networks ◽  
Proposed Model ◽  
Short Time

Hourly global solar irradiance (GSR) data are required for sizing, planning, and modeling of solar photovoltaic farms. However, operating and controlling such farms exposed to varying environmental conditions, such as fast passing clouds, necessitates GSR data to be available for very short time intervals. Classical backpropagation neural networks do not perform satisfactorily when predicting parameters within short intervals. This paper proposes a hybrid backpropagation neural networks based on particle swarm optimization. The particle swarm algorithm is used as an optimization algorithm within the backpropagation neural networks to optimize the number of hidden layers and neurons used and its learning rate. The proposed model can be used as a reliable model in predicting changes in the solar irradiance during short time interval in tropical regions such as Malaysia and other regions. Actual global solar irradiance data of 5-s and 1-min intervals, recorded by weather stations, are applied to train and test the proposed algorithm. Moreover, to ensure the adaptability and robustness of the proposed technique, two different cases are evaluated using 1-day and 3-days profiles, for two different time intervals of 1-min and 5-s each. A set of statistical error indices have been introduced to evaluate the performance of the proposed algorithm. From the results obtained, the 3-days profile’s performance evaluation of the BPNN-PSO are 1.7078 of RMSE, 0.7537 of MAE, 0.0292 of MSE, and 31.4348 of MAPE (%), at 5-s time interval, where the obtained results of 1-min interval are 0.6566 of RMSE, 0.2754 of MAE, 0.0043 of MSE, and 1.4732 of MAPE (%). The results revealed that proposed model outperformed the standalone backpropagation neural networks method in predicting global solar irradiance values for extremely short-time intervals. In addition to that, the proposed model exhibited high level of predictability compared to other existing models.

scholarly journals Asteroid Rendezvous Mission Design Using Multiobjective Particle Swarm Optimization

2014 ◽  
Vol 2014 ◽  
pp. 1-13 ◽  
Author(s):  
Ya-zhong Luo ◽  
Li-ni Zhou
Keyword(s):  
Particle Swarm Optimization ◽  
Particle Swarm ◽  
Optimization Techniques ◽  
Mission Design ◽  
Trajectory Design ◽  
Time Transfer ◽  
Pareto Solution ◽  
Swarm Optimization ◽  
Multiobjective Particle Swarm Optimization ◽  
Asteroid Mission

A new preliminary trajectory design method for asteroid rendezvous mission using multiobjective optimization techniques is proposed. This method can overcome the disadvantages of the widely employed Pork-Chop method. The multiobjective integrated launch window and multi-impulse transfer trajectory design model is formulated, which employes minimum-fuel cost and minimum-time transfer as two objective functions. The multiobjective particle swarm optimization (MOPSO) is employed to locate the Pareto solution. The optimization results of two different asteroid mission designs show that the proposed approach can effectively and efficiently demonstrate the relations among the mission characteristic parameters such as launch time, transfer time, propellant cost, and number of maneuvers, which will provide very useful reference for practical asteroid mission design. Compared with the PCP method, the proposed approach is demonstrated to be able to provide much more easily used results, obtain better propellant-optimal solutions, and have much better efficiency. The MOPSO shows a very competitive performance with respect to the NSGA-II and the SPEA-II; besides a proposed boundary constraint optimization strategy is testified to be able to improve its performance.

Adaptive particle swarm optimization algorithm based long short-term memory networks for sentiment analysis

2021 ◽  
pp. 1-17
Author(s):  
J. Shobana ◽  
M. Murali
Keyword(s):  
Particle Swarm Optimization ◽  
Sentiment Analysis ◽  
Language Processing ◽  
Short Term Memory ◽  
Contextual Information ◽  
Particle Swarm ◽  
Pso Algorithm ◽  
Swarm Optimization ◽  
Adaptive Particle Swarm Optimization ◽  
Proposed Model

Text Sentiment analysis is the process of predicting whether a segment of text has opinionated or objective content and analyzing the polarity of the text’s sentiment. Understanding the needs and behavior of the target customer plays a vital role in the success of the business so the sentiment analysis process would help the marketer to improve the quality of the product as well as a shopper to buy the correct product. Due to its automatic learning capability, deep learning is the current research interest in Natural language processing. Skip-gram architecture is used in the proposed model for better extraction of the semantic relationships as well as contextual information of words. However, the main contribution of this work is Adaptive Particle Swarm Optimization (APSO) algorithm based LSTM for sentiment analysis. LSTM is used in the proposed model for understanding complex patterns in textual data. To improve the performance of the LSTM, weight parameters are enhanced by presenting the Adaptive PSO algorithm. Opposition based learning (OBL) method combined with PSO algorithm becomes the Adaptive Particle Swarm Optimization (APSO) classifier which assists LSTM in selecting optimal weight for the environment in less number of iterations. So APSO - LSTM ‘s ability in adjusting the attributes such as optimal weights and learning rates combined with the good hyper parameter choices leads to improved accuracy and reduces losses. Extensive experiments were conducted on four datasets proved that our proposed APSO-LSTM model secured higher accuracy over the classical methods such as traditional LSTM, ANN, and SVM. According to simulation results, the proposed model is outperforming other existing models.

Sign in / Sign up

Export Citation Format

Share Document