Path Optimization and Object Localization Using Hybrid Particle Swarm and Ant Colony Optimization for Mobile RFID Reader

Mohd Zaki Zakaria, Md Yusoff Jamaluddin

Abstract


This paper proposes a hybrid approach of Particle Swarm Optimization (PSO) and Ant Colony Optimization (ACO) for the mobile Radio Frequency Identification System (RFID) reader to get the shortest path for object localization. In this approach, we have adopted the ACO global pheromone updating information of ants to guide the update velocities and position for PSO based on nearest neighbor constraints. The pheromone information is used efficiently to guide the selection of each particle in a search space of its visits. The best path will be used for mobile RFID reader for objects localization in search space. Simulation results show that the method is effective, minimizing the number of visited nodes for a mobile RFID reader.

Keywords


RFID, Path Optimization, PSO, ACO

Full Text:

PDF

References


A.E Eiben and C.A. Schipper,’ On evolutionary exploration and exploitation.” Fundamental Informaticate, vol. 35, no. 1-4,pp.35-50, 1998.

C. Grosan and A. Abraham: Hybrid Evolutionary Algorithms: Methodologies, Architectures, and Reviews, Studies in Computational Intelligence (SCI) 75, 1–17 (2007)

Li F, Morgan R, and Williams D (1997) Hybrid genetic approaches to ramping rate constrained dynamic economic dispatch, Electric Power Systems Research, 43(11), pp. 97–103

Somasundaram P, Lakshmiramanan R, and Kuppusamy K (2005) Hybrid algorithm based on EP and LP for security constrained economic dispatch problem, Electric Power Systems Research, 76(1–3), pp. 77–85

Lo CC and Chang WH (2000) A multiobjective hybrid genetic algorithm for the capacitated multipoint network design problem, IEEE Transactions on Systems, Man and Cybernetics - Part B, 30(3), pp. 461–470

Tseng LY and Liang SC (2005) A hybrid metaheuristic for the assignment problem, Computational Optimization and Applications, 34(1), pp. 85–113

Finkenzeller, K. : RFID Handbook, 2003. Fundamental and applications in contactless smart cards and identificationChichester : John Wiley.

http://en.wikipedia.org/wiki/Packing_problem#Circles_in_ square

SakmongkonChumkamon, PeranittiTuvaphanthaphiphat, PhongsakKeeratiwintakorn, Proceedings of ECTI-CON 2008

Chou L.D., Wu C.H., Ho S.P., Lee C.C. and Chen J.M. (2004) Requirement Analysis and Implementation of Palm-based Multimedia Museum Guide Systems. IEEE 18th International

F.B. Zahn, C.E. Noon, Shortest path algorithms: An evaluation using real road networks, Transport. Sci. 32 (1998) 65–73.

G. Desaulniers, F. Soumis, An efficient algorithm to find a shortest path for a car-like robot, IEEE Trans. Robot. Automat. 11 (6) (1995) 819–828.

Moy, J., 1994. Open Shortest Path First Version 2. RFQ 1583, Internet Engineering Task Force. http://www.ietf.org.

S. Anusha& Sridhar Iyer, 2005. A Coverage Planning Tool for RFID Networks With Mobile Readers: EUC workshops, LNCS 3823

AmmarW.Mohemmed et al. Solving shortest path problem using particle swarm optimization. Applied Soft Computing 8(2008) 1643-1653

J. Kennedy, R.C. Eberhart, Particle swarm optimization, in: Proceedings of the IEEE International Conference on Neural Networks, 1995, pp.1942–1948.

Goldberg, D.E., 1989. Genetic Algorithms in Search, Optimization and Machine Learning. Addison-Wesley, Reading, MA.

Starkweather, T., Whitley, D., Whitley, C., Mathial, K., 1991. A comparison of genetic sequencing operators. In: Proceedings of the Fourth International Conference on Genetic Algorithms, Los Altos, CA, pp. 69–76.

Oliver, I., Smith, D., Holland, J., 1987. A study of permutation crossover operators on the traveling salesman problem. In: Proceedings of the Second International Conference on Genetic Algorithms, London, pp. 224–230.

Knosala, R., Wal, T., 2001. A production scheduling problem using genetic algorithm. Journal of Materials Processing Technology 109 (1–2), 90–95.

P.Bahl& V.N. Padmanabhan, 2000. RADAR: an in-building RF-based user location and tracking systems, in IEEE INFOCOM, pg775-784.


Refbacks

  • There are currently no refbacks.


Copyright (c) 2016

Creative Commons License
This work is licensed under a Creative Commons Attribution-NonCommercial 4.0 International License.

 

Copyright © 2014 Journal of Information Sciences and Computing Technologies. All rights reserved.

ISSN: 2394-9066

For any help/support contact us at jiscteditor@scitecresearch.com.