IDEAS home Printed from https://ideas.repec.org/a/igg/jamc00/v7y2016i1p38-64.html
   My bibliography  Save this article

Nephron Algorithm Optimization: Inspired of the Biologic Nephron Performance

Author

Listed:
  • Reza Behmanesh

    (Department of Industrial Engineering, Science and Research Branch, Islamic Azad University, Tehran, Iran)

Abstract

A new Meta heuristic algorithm inspired of the biologic nephron performance for optimization of objective functions in Np-hard problems is introduced. The complexity of the problems increases with their size, and hence their solution space increases exponentially. Despite of designing the several search techniques with balanced exploration and exploitation in order to solve such as these problems, there are some drawbacks to make suitable adjustment between exploring and exploiting in performance of the Meta heuristic algorithms. The proposed algorithm in this paper can adjust between intensification and diversification strategies intrinsically, to make efficient optimization technique. For testing Nephron algorithm optimization (NAO), the traveling salesman problem (TSP) is provided as a solution in various sizes. Results indicate that NAO provides robust optimal solutions.

Suggested Citation

  • Reza Behmanesh, 2016. "Nephron Algorithm Optimization: Inspired of the Biologic Nephron Performance," International Journal of Applied Metaheuristic Computing (IJAMC), IGI Global, vol. 7(1), pages 38-64, January.
    • Handle: RePEc:igg:jamc00:v:7:y:2016:i:1:p:38-64
    as

    Download full text from publisher

    File URL: http://services.igi-global.com/resolvedoi/resolve.aspx?doi=10.4018/IJAMC.2016010103
    Download Restriction: no
    ---><---

    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:igg:jamc00:v:7:y:2016:i:1:p:38-64. 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: Journal Editor (email available below). General contact details of provider: https://www.igi-global.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.