{
  "id": "1408.5348",
  "version": "v1",
  "published": "2014-08-22T16:18:09.000Z",
  "updated": "2014-08-22T16:18:09.000Z",
  "title": "Bat Algorithm is Better Than Intermittent Search Strategy",
  "authors": [
    "Xin-She Yang",
    "Suash Deb",
    "Simon Fong"
  ],
  "comment": "11 pages 1 figure. Available as X. S. Yang, S. Deb, S. Fong, Bat Algorithm is Better Than Intermittent Search Strategy, Multiple-Valued Logic and Soft Computing, 22 (3), 223-237 (2014). arXiv admin note: substantial text overlap with arXiv:1308.3898",
  "categories": [
    "math.OC",
    "cs.NE"
  ],
  "abstract": "The efficiency of any metaheuristic algorithm largely depends on the way of balancing local intensive exploitation and global diverse exploration. Studies show that bat algorithm can provide a good balance between these two key components with superior efficiency. In this paper, we first review some commonly used metaheuristic algorithms, and then compare the performance of bat algorithm with the so-called intermittent search strategy. From simulations, we found that bat algorithm is better than the optimal intermittent search strategy. We also analyse the comparison results and their implications for higher dimensional optimization problems. In addition, we also apply bat algorithm in solving business optimization and engineering design problems.",
  "revisions": [
    {
      "version": "v1",
      "updated": "2014-08-22T16:18:09.000Z"
    }
  ],
  "analyses": {
    "keywords": [
      "higher dimensional optimization problems",
      "optimal intermittent search strategy",
      "metaheuristic algorithm largely depends",
      "global diverse exploration",
      "apply bat algorithm"
    ],
    "note": {
      "typesetting": "TeX",
      "pages": 11,
      "language": "en",
      "license": "arXiv",
      "status": "editable",
      "adsabs": "2014arXiv1408.5348Y"
    }
  }
}