A NEW PERSPECTIVE OF METAHEURISTIC ALGORITHMS
Keywords:Optimization, Metaheuristics, Local search, Evolutionary Algorithms, Generating New Solutions
Optimization is the art of modeling in order to produce the optimal outcome under the given conditions. The objective of optimization is to maximize or decrease the consequences that best satisfy technological and management procedures. In view of the findings, this paper provides a brief survey of methods for examining the optimization problem space, illustrates the mechanics of metaheuristic and developmental calculations, and defines their connection to constructing optimization problems. In addition to covering the encoding of metaheuristic and developmental calculations and the management of constraints, this paper also delves into the periods of introductory or provisional arrangements, the iterative determination of arrangements, and the assessment of the execution of metaheuristic and developmental calculations. All meta-heuristic and developmental calculations are shown to share a single calculation with their respective phases highlighted.
Saka, M. P., Hasan.ebi, O., and Geem, Z. W. (2016). “Metaheuristics in structural optimization and discussions on harmony search algorithm.” Swarm and Evolutionary Computation, 28, 88–97.
S.rensen, K. (2013). “Metaheuristics: The metaphor exposed.” International Transaction in Operational Research, 22(1), 3–18.
Dokeroglu, T.; Sevinc, E.; Kucukyilmaz, T.; Cosar, A. A survey on new generation metaheuristic algorithms. Comput. Ind. Eng. 2019, 137, 106040.
Kondamadugula, S.; Naidu, S.R. Accelerated evolutionary algorithms with parameter importance based population initialization for variation-aware analog yield optimization. In Proceedings of the 2016 IEEE 59th International Midwest Symposium on Circuits and Systems (MWSCAS), Abu Dhabi, United Arab Emirates, 16–19 October 2016.
Battiti R, Brunato M, Mascia F (2008) Reactive search and intelligent optimization. Springer, Berlin
Eiben A, van der Hauw J (1997) Solving 3-sat with adaptive genetic algorithms. In: Proceedings of the fourth IEEE conference on evolutionary computation. IEEE Press, pp 81–86
Eiben AE, Smith JE (2003) Introduction to evolutionary computing. Springer, Berlin
Gent IP, Walsh T (1993) Towards an understanding of hill-climbing procedures for SAT. Proceedings of AAAI- 93:28–33
Glover F, Laguna M (1993) Tabu search. In: Reeves C (ed) Modern heuristics techniques for combinatorial problems. Blackwell Scientific Publishing, Oxford, pp 70–141
Larranaga P, Lozano JA (2001) Estimation of distribution algorithms. A new tool for evolutionary computation. Kluwer Academic Publishers, Boston
Marchiori E, Rossi C (1999) A flipping genetic algorithm for hard 3-sat problems. Proceedings of the Genetic and Evolutionary Computation Conference 1:393–400
How to Cite
Copyright (c) 2023 Academic Journal of Nawroz University
This work is licensed under a Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 International License.
Authors retain copyright
The use of a Creative Commons License enables authors/editors to retain copyright to their work. Publications can be reused and redistributed as long as the original author is correctly attributed.
- The researcher(s), whether a single or joint research paper, must sell and transfer to the publisher (the Academic Journal of Nawroz University) through all the duration of the publication which starts from the date of entering this Agreement into force, the exclusive rights of the research paper/article. These rights include the translation, reuse of papers/articles, transmit or distribute, or use the material or parts(s) contained therein to be published in scientific, academic, technical, professional journals or any other periodicals including any other works derived from them, all over the world, in English and Arabic, whether in print or in electronic edition of such journals and periodicals in all types of media or formats now or that may exist in the future. Rights also include giving license (or granting permission) to a third party to use the materials and any other works derived from them and publish them in such journals and periodicals all over the world. Transfer right under this Agreement includes the right to modify such materials to be used with computer systems and software, or to reproduce or publish it in e-formats and also to incorporate them into retrieval systems.
- Reproduction, reference, transmission, distribution or any other use of the content, or any parts of the subjects included in that content in any manner permitted by this Agreement, must be accompanied by mentioning the source which is (the Academic Journal of Nawroz University) and the publisher in addition to the title of the article, the name of the author (or co-authors), journal’s name, volume or issue, publisher's copyright, and publication year.
- The Academic Journal of Nawroz University reserves all rights to publish research papers/articles issued under a “Creative Commons License (CC BY-NC-ND 4.0) which permits unrestricted use, distribution, and reproduction of the paper/article by any means, provided that the original work is correctly cited.
- Reservation of Rights
The researcher(s) preserves all intellectual property rights (except for the one transferred to the publisher under this Agreement).
- Researcher’s guarantee
The researcher(s) hereby guarantees that the content of the paper/article is original. It has been submitted only to the Academic Journal of Nawroz University and has not been previously published by any other party.
In the event that the paper/article is written jointly with other researchers, the researcher guarantees that he/she has informed the other co-authors about the terms of this agreement, as well as obtaining their signature or written permission to sign on their behalf.
The author further guarantees:
- The research paper/article does not contain any defamatory statements or illegal comments.
- The research paper/article does not violate other's rights (including but not limited to copyright, patent, and trademark rights).
This research paper/article does not contain any facts or instructions that could cause damages or harm to others, and publishing it does not lead to disclosure of any confidential information.