IDEAS home Printed from https://ideas.repec.org/a/hin/jnlmpe/961412.html
   My bibliography  Save this article

Multiobjective RFID Network Optimization Using Multiobjective Evolutionary and Swarm Intelligence Approaches

Author

Listed:
  • Hanning Chen
  • Yunlong Zhu
  • Lianbo Ma
  • Ben Niu

Abstract

The development of radio frequency identification (RFID) technology generates the most challenging RFID network planning (RNP) problem, which needs to be solved in order to operate the large-scale RFID network in an optimal fashion. RNP involves many objectives and constraints and has been proven to be a NP-hard multi-objective problem. The application of evolutionary algorithm (EA) and swarm intelligence (SI) for solving multiobjective RNP (MORNP) has gained significant attention in the literature, but these algorithms always transform multiple objectives into a single objective by weighted coefficient approach. In this paper, we use multiobjective EA and SI algorithms to find all the Pareto optimal solutions and to achieve the optimal planning solutions by simultaneously optimizing four conflicting objectives in MORNP, instead of transforming multiobjective functions into a single objective function. The experiment presents an exhaustive comparison of three successful multiobjective EA and SI, namely, the recently developed multiobjective artificial bee colony algorithm (MOABC), the nondominated sorting genetic algorithm II (NSGA-II), and the multiobjective particle swarm optimization (MOPSO), on MORNP instances of different nature, namely, the two-objective and three-objective MORNP. Simulation results show that MOABC proves to be more superior for planning RFID networks than NSGA-II and MOPSO in terms of optimization accuracy and computation robustness.

Suggested Citation

  • Hanning Chen & Yunlong Zhu & Lianbo Ma & Ben Niu, 2014. "Multiobjective RFID Network Optimization Using Multiobjective Evolutionary and Swarm Intelligence Approaches," Mathematical Problems in Engineering, Hindawi, vol. 2014, pages 1-13, April.
  • Handle: RePEc:hin:jnlmpe:961412
    DOI: 10.1155/2014/961412
    as

    Download full text from publisher

    File URL: http://downloads.hindawi.com/journals/MPE/2014/961412.pdf
    Download Restriction: no

    File URL: http://downloads.hindawi.com/journals/MPE/2014/961412.xml
    Download Restriction: no

    File URL: https://libkey.io/10.1155/2014/961412?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    More about this item

    Statistics

    Access and download statistics

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:hin:jnlmpe:961412. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    We have no bibliographic references for this item. You can help adding them by using this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Mohamed Abdelhakeem (email available below). General contact details of provider: https://www.hindawi.com .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.