Design Optimization Average-Based Algorithm
DOI:
https://doi.org/10.31449/inf.v44i1.1890Abstract
This article introduces a metaheuristic algorithm to solve engineering design optimization problems. The algorithm is based on the concept of diversity and independence that is aggregated in the average design of a population of designs containing information dispersed through a variety of points, and on the concept of intensification represented by the best design. The algorithm is population-based, where the population individual designs are randomly generated. The population can be normally or uniformly generated. The algorithm may start either with points randomly generated or with a designer preferred trial guess. The algorithm is validated using standard classical unconstrained and constrained engineering optimum design test problems reported in the literature. The results presented indicate that the proposed algorithm is a very simple alternative to solve this kind of problems. They compare well with the analytical solutions and/or the best results achieved so far. Two constrained problem analytical solutions not found in the literature are presented in annex.References
Andrei, N. (2013) Nonlinear Optimization Applications Using the GAMS Technology. Springer Science & Business Media.
Arora, J. S. (1989) Introduction to Optimum Design. McGraw-Hill, New York.
Blum, C., Roli, A. (2003) Metaheuristics in Combinatorial Optimization: overview and conceptual comparison. ACM Computing Surveys. 35, 268-308.
Cagnina, L.C., Esquivel, S.C., Coello, C.A.C. (2008) Solving Engineering Optimization Problems with the Simple Constrained Particle Swarm Optimizer, Informatica. 32, 319-326.
Dixon, L.C.W., Szego, G.P. (1975) Towards Global Optimization. North Holland.
Geem, Z.W., Kim, G.H., Loganathan, G.V. (2001) A New Heuristic Optimization Algorithm: Harmonic Search. Simulation. 76, 60-68.
Glover, F., Laguna, M. (1997) Tabu Search. Kluwer Academic Publishers
Holland, J.H. (1975) Adaptation in Natural and Artificial Systems. The University of Michigan Press: Ann Arbor.
Kannan, B.K., Kramer, S.N. (1994) An Augmented Lagrange Multiplier Based Method for Mixed Integer Discrete Continuous Optimization and its Applications to Mechanical Design. Journal of Mechanical Design. 116, 318-320.
Kayham, A.H., Ceylan, H., Ayvaz, M.T., Gurarslan, G.: PSOLVER (2010) A New Hybrid Particle Swarm Optimization Algorithm for Solving Continuous Optimization Problems. Expert Systems with Applications. 37, 6798-6808.
Kirkpatrick, S., Gelatt, C.D., Vecchi, M.P. (1983) Optimization by Simulated Annealing. Science. 220, 671-680.
Lee, K.S., Geem, Z.W. (2005) A New Meta-Heuristic Algorithm for Continuous Engineering Optimization: Harmony Search Theory and Practice. Computer Methods in Applied Mechanical Engineering. 194, 3902–3933.
Luenberger, D.G. (1984) Introduction to Linear and Nonlinear Programming. Addison-Wesley, Massachusetts.
Moré, J.J., Garbow, B.S., Hillstrom, K.E. (1981) Testing Unconstrained Optimization Software. ACM Transactions on Mathematical Software. 7, (1), 17- 41.
Papalambros, P.Y., Wilde, D.J. (1988) Principles of Optimal Design: modeling and computation. Cambridge University Press, New York.
Ragsdell, K. M., Phillips, D.T. (1975) Optimal Design of a Class of Welded Structures Using Geometric Programming. ASME J. Eng. Ind. Ser. B. 98 (3), 1021–1025.
Rao, S.S.: Engineering Optimization (1996) Theory and Practice. John Wiley & Sons.
Rosenbrock, H.H. (1960) An Automatic Method for Finding the Greatest or Least Value of a Function. Computer Journal. 3, 175-184.
Sandgren, E. (1990) Nonlinear Integer and Discrete Programming in Mechanical Design Optimization. Journal of Mechanical Design. 112 (2), 223–229.
Spall, J.C. (2003) Introduction to Stochastic Search and Optimization: estimation, simulation and control. John Wiley&Sons.
Surowiecki, J. (2005) The Wisdom of Crowds: Why the Many Are Smarter Than the Few and How Collective Wisdom Shapes Business, Economies, Societies and Nations. Anchor Books.
Williams, S. (2006) The Wisdom of Crowds: why the many are smarter than the few and how collective wisdom shapes business, economies, societies, and nations. Business Book Review™. 21 (43).
Wolpert, D.H., Macready, W.G. (1997) No Free Lunch Theorems for Optimization. IEEE Transactions on Evolutionary Computation. 1, 67-82.
Yang, X.S. (2008) Nature-inspired Metaheuristic Algorithms. Luniver Press.
Downloads
Published
How to Cite
Issue
Section
License
I assign to Informatica, An International Journal of Computing and Informatics ("Journal") the copyright in the manuscript identified above and any additional material (figures, tables, illustrations, software or other information intended for publication) submitted as part of or as a supplement to the manuscript ("Paper") in all forms and media throughout the world, in all languages, for the full term of copyright, effective when and if the article is accepted for publication. This transfer includes the right to reproduce and/or to distribute the Paper to other journals or digital libraries in electronic and online forms and systems.
I understand that I retain the rights to use the pre-prints, off-prints, accepted manuscript and published journal Paper for personal use, scholarly purposes and internal institutional use.
In certain cases, I can ask for retaining the publishing rights of the Paper. The Journal can permit or deny the request for publishing rights, to which I fully agree.
I declare that the submitted Paper is original, has been written by the stated authors and has not been published elsewhere nor is currently being considered for publication by any other journal and will not be submitted for such review while under review by this Journal. The Paper contains no material that violates proprietary rights of any other person or entity. I have obtained written permission from copyright owners for any excerpts from copyrighted works that are included and have credited the sources in my article. I have informed the co-author(s) of the terms of this publishing agreement.
Copyright © Slovenian Society Informatika
