A metaheuristic penalty approach for the starting point in nonlinear programming (original) (raw)
Related papers
Metaheuristic Algorithms: Guidelines for Implementation
Journal of Soft Computing and Decision Support Systems , 2017
This paper presents a quick review of the basic concepts and essential steps for implementing of metaheuristic algorithms. It can be therefore used as a roadmap to shed light on solving an optimization problem using a metaheuristic algorithm. We provide a brief review of the topics, including general concepts for metaheuristics, the need to design metaheuristics, the need for further improvement of metaheuristics, parameters tuning and performance assessment of metaheuristic algorithms. Finally, the paper ends with a guideline framework which aims to assist new researchers for solving optimization problems via metaheuristics.
Metaheuristic Optimization Backgrounds: A Literature Review
Solving optimization problems becomes a central theme not only on operational research but also on several research areas like robotic, medicine, economic etc. The number of support decision problems that can be formalized as an optimization problem is growing rapidly. This study represents a literature revue of Metaheuristics optimization. Metaheuristics are applied to all kinds of combinatorial problems, and they can also be adapted to continuous problems. These approaches which include the simulated annealing method, genetic algorithms, taboo search method, the Ant Colony Algorithms, particle swarm optimization (PSO) etc. are for both mono-objective problems and multi-objective problems. The first area analyzes the inherent difficulties of each objective function, while the second treats the case of the simultaneous presence of several objectives. We will see that the tow aspects are often related in practice. Before focusing on the multi-objective optimization, it is necessary to explain the context of the mono-objective optimization. A special attention is given to the method of particle swarm optimization (PSO).
Metaheuristic research: A comprehensive survey
Artificial Intelligence Review, 2018
Because of successful implementations and high intensity, metaheuristic research has been extensively reported in literature, which covers algorithms, applications, comparisons, and analysis. Though, little has been evidenced on insightful analysis of metaheuristic performance issues, and it is still a "black box" that why certain metaheuristics perform better on specific optimization problems and not as good on others. The performance related analyses performed on algorithms are mostly quantitative via performance validation metrics like mean error, standard deviation, and co-relations have been used. Moreover, the performance tests are often performed on specific benchmark functions - few studies are those which involve real data from scientific or engineering optimization problems. In order to draw a comprehensive picture of metaheuristic research, this paper performs a survey of metaheuristic research in literature which consists of 1222 publications from year 1983 to 2016 (thirty three years). Based on the collected evidence, this paper addresses four dimensions of metaheuristic research: introduction of new algorithms, modifications and hybrids, comparisons and analysis, and research gaps and future directions. The objective is to highlight potential open questions and critical issues raised in literature. The work provides guidance for future research to be conducted more meaningfully that can serve for the good of this area of research.
A survey on optimization metaheuristics
Information Sciences, 2013
Metaheuristics are widely recognized as efficient approache s for many hard optimization problems. This paper provides a survey of some of the main metaheuristics. It outlines the components and concepts that are used in various metaheuristics in order to analyze their similarities and differences. The classification adopted in this paper differentiates between single solution based metaheuristics and population based metaheuristics . The literature survey is accompanied by the presentation of references for further details, including applications. Recent trends are also briefly discussed. (P. Siarry).
A Walk into Metaheuristics for Engineering Optimization: Principles, Methods and Recent Trends
International Journal of Computational Intelligence Systems, 2015
Metaheuristics has attained increasing interest for solving complex real-world problems. This paper studies the principles and the state-of-the-art of metaheuristic methods for engineering optimization. Both the classic and emerging approaches to optimization using metaheuristics are reviewed and analyzed. All the methods are discussed in three basic types: trajectory-based, in which in each step a new solution is created from the previous one; multitrajectory-based, in which a multi-start mechanism is used; and population-based, where multiple new solutions are created considering a population of approximate solutions. We further discuss algorithms and strategies to handle multi-modal and multi-objective optimization tasks as well as methods for parallel implementation of metaheuristic algorithms. Then, different software frameworks for metaheuristics are introduced. Finally, several interesting directions are pointed out as future research trends.
Engineering applications of metaheuristics: an introduction
Journal of Physics: Conference Series, 2017
Metaheuristic algorithms are important tools that in recent years have been used extensively in several fields. In engineering, there is a big amount of problems that can be solved from an optimization point of view. This paper is an introduction of how metaheuristics can be used to solve complex problems of engineering. Their use produces accurate results in problems that are computationally expensive. Experimental results support the performance obtained by the selected algorithms in such specific problems as digital filter design, image processing and solar cells design.
Engineering Optimization: An Introduction with Metaheuristic Applications
An accessible introduction to metaheuristics and optimization, featuring powerful and modern algorithms for application across engineering and the sciences From engineering and computer science to economics and management science, optimization is a core component for problem solving. Highlighting the latest developments that have evolved in recent years, Engineering Optimization: An Introduction with Metaheuristic Applications outlines popular metaheuristic algorithms and equips readers with the skills needed to apply these techniques to their own optimization problems. With insightful examples from various fields of study, the author highlights key concepts and techniques for the successful application of commonly-used metaheuristc algorithms, including simulated annealing, particle swarm optimization, harmony search, and genetic algorithms.
Metaheuristics for Hard Optimization
Metaheuristics for Hard Optimization, 2006
The use of general descriptive names, registered names, trademarks, etc. in this publication does not imply, even in the absence of a specific statement, that such names are exempt from the relevant protective laws and regulations and therefore free for general use.
Applied Mathematical Sciences, 2017
Metaheuristic techniques are usually used to solve optimization problems, that is, they are used in problems that seek the minimum or maximum points that satisfy a function [1]. The solution found is approximate and is located around the exact point of the solution. On the other hand, we have the optimization techniques with restrictions, which are based on the Lagrange multipliers and convert the restricted optimization problem with n variables to an unrestricted problem with n+k variables, where k is equal to the number of restrictions, and whose equations can be resolved more easily.