scholarly journals Matching Sensor Ontologies with Simulated Annealing Particle Swarm Optimization

2021 ◽  
Vol 2021 ◽  
pp. 1-11
Author(s):  
Hai Zhu ◽  
Xingsi Xue ◽  
Aifeng Geng ◽  
He Ren
Keyword(s):  
Particle Swarm Optimization ◽  
Simulated Annealing ◽  
Particle Swarm ◽  
Location Based Services ◽  
Sensor Data ◽  
Ontology Matching ◽  
Ontology Alignment ◽  
Matching Problem ◽  
Swarm Optimization

In recent years, innovative positioning and mobile communication techniques have been developing to achieve Location-Based Services (LBSs). With the help of sensors, LBS is able to detect and sense the information from the outside world to provide location-related services. To implement the intelligent LBS, it is necessary to develop the Semantic Sensor Web (SSW), which makes use of the sensor ontologies to implement the sensor data interoperability, information sharing, and knowledge fusion among intelligence systems. Due to the subjectivity of sensor ontology engineers, the heterogeneity problem is introduced, which hampers the communications among these sensor ontologies. To address this problem, sensor ontology matching is introduced to establish the corresponding relationship between different sensor terms. Among all ontology matching technologies, Particle Swarm Optimization (PSO) can represent a contributing method to deal with the low-quality ontology alignment problem. For the purpose of further enhancing the quality of matching results, in our work, sensor ontology matching is modeled as the meta-matching problem firstly, and then based on this model, aiming at various similarity measures, a Simulated Annealing PSO (SAPSO) is proposed to optimize their aggregation weights and the threshold. In particular, the approximate evaluation metrics for evaluating quality of alignment without reference are proposed, and a Simulated Annealing (SA) strategy is applied to PSO’s evolving process, which is able to help the algorithm avoid the local optima and enhance the quality of solution. The well-known Ontology Alignment Evaluation Initiative’s benchmark (OAEI’s benchmark) and three real sensor ontologies are used to verify the effectiveness of SAPSO. The experimental results show that SAPSO is able to effectively match the sensor ontologies.

scholarly journals Optimizing Biomedical Ontology Alignment through a Compact Multiobjective Particle Swarm Optimization Algorithm Driven by Knee Solution

2020 ◽  
Vol 2020 ◽  
pp. 1-10
Author(s):  
Xingsi Xue ◽  
Xiaojing Wu ◽  
Junfeng Chen
Keyword(s):  
Particle Swarm Optimization ◽  
Optimization Algorithm ◽  
Particle Swarm Optimization Algorithm ◽  
Particle Swarm ◽  
Biomedical Ontology ◽  
Ontology Matching ◽  
Ontology Alignment ◽  
Matching Problem ◽  
Swarm Optimization ◽  
Multiobjective Particle Swarm Optimization

Nowadays, most real-world decision problems consist of two or more incommensurable or conflicting objectives to be optimized simultaneously, so-called multiobjective optimization problems (MOPs). Usually, a decision maker (DM) prefers only a single optimum solution in the Pareto front (PF), and the PF’s knee solution is logically the one if there are no user-specific or problem-specific preferences. In this context, the biomedical ontology matching problem in the Semantic Web (SW) domain is investigated, which can be of help to integrate the biomedical knowledge and facilitate the translational discoveries. Since biomedical ontologies often own large-scale concepts with rich semantic meanings, it is difficult to find a perfect alignment that could meet all DM’s requirements, and usually, the matching process needs to trade-off two conflict objectives, i.e., the alignment’s recall and precision. To this end, in this work, the biomedical ontology matching problem is first defined as a MOP, and then a compact multiobjective particle swarm optimization algorithm driven by knee solution (CMPSO-K) is proposed to address it. In particular, a compact evolutionary mechanism is proposed to efficiently optimize the alignment’s quality, and a max-min approach is used to determine the PF’s knee solution. In the experiment, three biomedical tracks provided by Ontology Alignment Evaluation Initiative (OAEI) are used to test CMPSO-K’s performance. The comparisons with OAEI’s participants and PSO-based matching technique show that CMPSO-K is both effective and efficient.

A Modified Particle Swarm Optimization Algorithm with Cases Studies

2011 ◽  
Vol 268-270 ◽  
pp. 823-828
Author(s):  
Cheng Chien Kuo ◽  
Hung Cheng Chen ◽  
Teng Fa Taso ◽  
Chin Ming Chiang
Keyword(s):  
Particle Swarm Optimization ◽  
Simulated Annealing ◽  
Particle Swarm ◽  
Pso Algorithm ◽  
Solution Quality ◽  
Swarm Optimization ◽  
Fast Calculation ◽  
Modified Particle Swarm Optimization ◽  
Stochastic Optimization Algorithms

s paper presents a hybrid algorithm, the “particle swarm optimization with simulated annealing behavior (SA-PSO)” algorithm, which combines the advantages of good solution quality in simulated annealing and fast calculation in particle swarm optimization. As stochastic optimization algorithms are sensitive to its parameters, this paper introduces criteria in selecting parameters to improve solution quality. To prove the usability and effectiveness of the proposed algorithm, simulations are performed using 20 different mathematical optimized functions of different dimensions. The results made from different algorithms are then compared between the quality of the solution, the efficiency of searching for the solution and the convergence characteristics. According to the simulation results, SA-PSO obtained higher efficiency, better quality and faster convergence speed than other compared algorithms.

A Particle Swarm Optimization Algorithm Based on Simulated Annealing

2014 ◽  
Vol 989-994 ◽  
pp. 2301-2305 ◽  
Author(s):  
Zi Chao Yan ◽  
Yang Shen Luo
Keyword(s):  
Particle Swarm Optimization ◽  
Simulated Annealing ◽  
Particle Swarm Optimization Algorithm ◽  
Particle Swarm ◽  
Global Optimum ◽  
Population Diversity ◽  
Swarm Optimization ◽  
Simulated Analysis ◽  
Metropolis Criterion

The passage aims at solving the problems resulted from the optimized process of Particle Swarm Optimization (PSO), which might reduce the population diversity, cause the algorithm to convergence too early, etc. A whole new mutable simulated annealing particle swarm optimization is proposed based on the combine of the simulated annealing mechanism and mutation. This new algorithm substitutes the Metropolis criterion in the simulated annealing mechanism for mutagenic factors in the process of mutation, which both ensures the diversity of the particle swarm, and ameliorates the quality of the swarm, so that this algorithm would convergence to the global optimum. According to the result of simulated analysis, this hybrid algorithm maintains the simplicity of the particle swarm optimization, improves its capability of global optimization, and finally accelerates the convergence and enhances the precision of this algorithm.

A New Methodology for the Reliability Based Particle Swarm Optimization with Simulated Annealing

2011 ◽  
Vol 274 ◽  
pp. 101-111 ◽  
Author(s):  
Norelislam Elhami ◽  
Rachid Ellaia ◽  
Mhamed Itmi
Keyword(s):  
Particle Swarm Optimization ◽  
Simulated Annealing ◽  
Numerical Models ◽  
Limit State ◽  
Particle Swarm ◽  
Geometrical Parameters ◽  
Rectangular Plates ◽  
Swarm Optimization ◽  
Reliability Methods ◽  
State Functions

This paper presents a new methodology for the Reliability Based Particle Swarm Optimization with Simulated Annealing. The reliability analysis procedure couple traditional and modified first and second order reliability methods, in rectangular plates modelled by an Assumed Modes approach. Both reliability methods are applicable to the implicit limit state functions through numerical models, like those based on the Assumed Mode Method. For traditional reliability approaches, the algorithms FORM and SORM use a Newton-Raphson procedure for estimate design point. In modified approaches, the algorithms are based on heuristic optimization methods such as Particle Swarm Optimization and Simulated Annealing Optimization. Numerical applications in static, dynamic and stability problems are used to illustrate the applicability and effectiveness of proposed methodology. These examples consist in a rectangular plates subjected to in-plane external loads, material and geometrical parameters which are considered as random variables. The results show that the predicted reliability levels are accurate to evaluate simultaneously various implicit limit state functions with respect to static, dynamic and stability criterions.

scholarly journals Service Composition in IoT using Genetic algorithm and Particle swarm optimization

2020 ◽  
Vol 10 (1) ◽  
pp. 56-64 ◽  
Author(s):  
Neeti Kashyap ◽  
A. Charan Kumari ◽  
Rita Chhikara
Keyword(s):  
Genetic Algorithm ◽  
Quality Of Service ◽  
Particle Swarm Optimization ◽  
Service Composition ◽  
Particle Swarm ◽  
Optimal Solution ◽  
Pso Algorithm ◽  
Critical Issue ◽  
Swarm Optimization

AbstractWeb service compositions are commendable in structuring innovative applications for different Internet-based business solutions. The existing services can be reused by the other applications via the web. Due to the availability of services that can serve similar functionality, suitable Service Composition (SC) is required. There is a set of candidates for each service in SC from which a suitable candidate service is picked based on certain criteria. Quality of service (QoS) is one of the criteria to select the appropriate service. A standout amongst the most important functionality presented by services in the Internet of Things (IoT) based system is the dynamic composability. In this paper, two of the metaheuristic algorithms namely Genetic Algorithm (GA) and Particle Swarm Optimization (PSO) are utilized to tackle QoS based service composition issues. QoS has turned into a critical issue in the management of web services because of the immense number of services that furnish similar functionality yet with various characteristics. Quality of service in service composition comprises of different non-functional factors, for example, service cost, execution time, availability, throughput, and reliability. Choosing appropriate SC for IoT based applications in order to optimize the QoS parameters with the fulfillment of user’s necessities has turned into a critical issue that is addressed in this paper. To obtain results via simulation, the PSO algorithm is used to solve the SC problem in IoT. This is further assessed and contrasted with GA. Experimental results demonstrate that GA can enhance the proficiency of solutions for SC problem in IoT. It can also help in identifying the optimal solution and also shows preferable outcomes over PSO.

Pigeon-inspired optimization and lateral inhibition for image matching of autonomous aerial refueling

2017 ◽  
Vol 232 (8) ◽  
pp. 1571-1583 ◽  
Author(s):  
Yongbin Sun ◽  
Haibin Duan
Keyword(s):  
Particle Swarm Optimization ◽  
Lateral Inhibition ◽  
Image Matching ◽  
Hybrid Algorithm ◽  
Particle Swarm ◽  
Matching Problem ◽  
Aerial Refueling ◽  
Swarm Optimization ◽  
Swarm Intelligence Algorithm ◽  
Computation Speed

Autonomous aerial refueling (AAR) is an essential application of unmanned aerial vehicles for both military and civilian domains. In this paper, a hybrid algorithm of the pigeon-inspired optimization (PIO) and lateral inhibition (LI), called LI-PIO, is proposed for image matching problem of AAR. LI is adopted for image pre-processing to enhance the edges and contrast of images. PIO, inspired from the homing characteristics of pigeons, is a novel bio-inspired swarm intelligence algorithm. To demonstrate the effectiveness and feasibility of our proposed algorithm, we make extensive comparative experiments with particle swarm optimization (PSO), particle swarm optimization based on lateral inhibition (LI-PSO), and PIO. It can be concluded from the experimental results that our proposed LI-PIO has excellent performances for image matching problem of AAR, especially in convergent rate and computation speed.

Sign in / Sign up

Export Citation Format

Share Document