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

Empirical Evaluation of Hill Climbing Algorithm

Author

Listed:
  • Manju Khari

    (Department of Computer Science and Engineering, Guru Gobind Singh Indraprastha University, Delhi, India)

  • Prabhat Kumar

    (Department of Computer Science and Engineering, National Institute of Technology Patna, Patna, India)

Abstract

The software is growing in size and complexity every day due to which strong need is felt by the research community to search for the techniques which can optimize test cases effectively. The current study is inspired by the collective behavior of finding paths from the colony of food and uses different versions of Hill Climbing Algorithm (HCA) such as Stochastic, and Steepest Ascent HCA for the purpose of finding a good optimal solution. The performance of the proposed algorithm is verified on the basis of three parameters comprising of optimized test cases, time is taken during the optimization process, and the percentage of optimization achieved. The results suggest that proposed Stochastic HCA is significantly average percentage better than Steepest Ascent HCA in reducing the number of test cases in order to accomplish the optimization target.

Suggested Citation

  • Manju Khari & Prabhat Kumar, 2017. "Empirical Evaluation of Hill Climbing Algorithm," International Journal of Applied Metaheuristic Computing (IJAMC), IGI Global, vol. 8(4), pages 27-40, October.
    • Handle: RePEc:igg:jamc00:v:8:y:2017:i:4:p:27-40
    as

    Download full text from publisher

    File URL: http://services.igi-global.com/resolvedoi/resolve.aspx?doi=10.4018/IJAMC.2017100102
    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:8:y:2017:i:4:p:27-40. 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.