Home            Contact us            FAQs
    
      Journal Home      |      Aim & Scope     |     Author(s) Information      |      Editorial Board      |      MSP Download Statistics

     Research Journal of Applied Sciences, Engineering and Technology

    Abstract
2013(Vol.5, Issue:01)
Article Information:

A Comparative Study of Several Hybrid Particle Swarm Algorithms for Function Optimization

Yanhua Zhong and Changqing Yuan
Corresponding Author:  Zhixiang Hou 
Submitted: 2011 Month, 00
Accepted: July 18, 2012
Published: January 01, 2013
Abstract:
Currently, the researchers have made a lot of hybrid particle swarm algorithm in order to solve the shortcomings that the Particle Swarm Algorithms is easy to converge to local extremum, these algorithms declare that there has been better than the standard particle swarm. This study selects three kinds of representative hybrid particle swarm optimizations (differential evolution particle swarm optimization, GA particle swarm optimization, quantum particle swarm optimization) and the standard particle swarm optimization to test with three objective functions. We compare evolutionary algorithm performance by a fixed number of iterations of the convergence speed and accuracy and the number of iterations under the fixed convergence precision, analyzing these types of hybrid particle swarm optimization results and practical performance. Test results show hybrid particle algorithm performance has improved significantly.

Key words:  Differential evolutionary particle swarm optimization algorithm, function optimization, particle swarm, Quantum Particle Swarm Optimization (QPSO), function optimization , ,
Abstract PDF HTML
Cite this Reference:
Yanhua Zhong and Changqing Yuan, . A Comparative Study of Several Hybrid Particle Swarm Algorithms for Function Optimization. Research Journal of Applied Sciences, Engineering and Technology, (01): 23-29.
Article Information:

RFID Anti-Collision Algorithm Based on Occurrence Position

Mingsheng Hu, Zhijuan Jia, Xiaoyu Ji and Liu Hong
Corresponding Author:  Mingsheng Hu 
Submitted: July 26, 2012
Accepted: May 18, 2013
Published: January 01, 2013
Abstract:
Aiming at the data redundancy problem in process of anti-collision in RFID, an OP(occurrence position) algorithm is proposed in this study, OP algorithm is based on the theory of direct georeference and BS (binary search) algorithm, improve traditional binary search mechanism by changing data transformed by anti-collision commands, data transformed by anti-collision commands in OP algorithm contains the same information as those data in BS algorithm, but contains less data bits than that in BS algorithm. Analysis is made for binary search algorithm used in process of anti-collision and shortcomings are given, analysis for ALOHA algorithm is also given, then principles of OP algorithm which is proposed to improve those shortcomings existing in BS algorithm and ALOHA algorithm are elaborated, analysis is also made for OP algorithm. Finally a module for OP algorithm is established on transmission delay and data redundancy, results of simulations show that OP algorithm has even higher capability than other Binary Search algorithm and has better suitability on occasion of much more tags.

Key words:  Anti-collision, binary search, occurrence position, RFID, , ,
Abstract PDF HTML
Cite this Reference:
Mingsheng Hu, Zhijuan Jia, Xiaoyu Ji and Liu Hong, . RFID Anti-Collision Algorithm Based on Occurrence Position. Research Journal of Applied Sciences, Engineering and Technology, (01): 23-29.
ISSN (Online):  2040-7467
ISSN (Print):   2040-7459
Submit Manuscript
   Information
   Sales & Services
Home   |  Contact us   |  About us   |  Privacy Policy
Copyright © 2024. MAXWELL Scientific Publication Corp., All rights reserved