Meta-Heuristics: An Overview

  • Osman I
  • Kelly J
N/ACitations
Citations of this article
92Readers
Mendeley users who have this article in their library.
Get full text

Abstract

Meta-heuristics are the most recent development in approximate search methods for solving complex optimization problems, that arise in business , commerce, engineering, industry, and many other areas. A meta-heuristic guides a subordinate heuristic using concepts derived from artificial intelligence, biological, mathematical, natural and physical sciences to improve their performance. We shall present brief overviews for the most successful meta-heuristics. The paper concludes with future directions in this growing area of research.

Cite

CITATION STYLE

APA

Osman, I. H., & Kelly, J. P. (1996). Meta-Heuristics: An Overview. In Meta-Heuristics (pp. 1–21). Springer US. https://doi.org/10.1007/978-1-4613-1361-8_1

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free