Abstract
This paper presents an optimization algorithm for engineering design problems having a mix of continuous, discrete and integer variables; a mix of linear, non-linear, differentiable, non-differential, equality, inequality and even discontinuous design constraints; and conflicting multiple design objectives. The intelligent movement of objects (vertices and compounds) is simulated in the algorithm based on a Nelder–Mead simplex with added features to handle variable types, bound and design constraints, local optima, search initiation from an infeasible region and numerical instability, which are the common requirements for large-scale, complex optimization problems in various engineering and business disciplines. The algorithm is called an INTElligent Moving Object algorithm and tested for a wide range of benchmark problems. Validation results for several examples, which are manageable within the scope of this paper, are presented herein. Satisfactory results have been obtained for all the test problems, hence, highlighting the benefits of the proposed method.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
Balachandran M, Gero JS (1984) A comparison of three methods for generating the Pareto optimal set. Eng Optim 7(4):319–336
Bertsimas D, Tsitsiklis JN (1997) Introduction to linear optimization. Athena, Belmont
Chen JL, Tsao YC (1993) Optimal design of machine elements using genetic algorithms. J Chin Soc Mech Eng 14(2):193–199
Coello CAC, Christiansen AD (1999) Moses: a multiobjective optimization tool for engineering design. Eng Optim 31:337–368
Das NC, Mazumder SK, Kajal DE (1999) Constrained non-linear programming: a minimum cross-entropy algorithm. Eng Optim 31:479–487
Fu J, Fenton RG, Cleghorn W (1991) A mixed integer-discrete-continuous programming method and its application to engineering design optimization. Eng Optim 17:263–280
Ghani SN (1972) An improved complex method of function minimization. CAD 71–78
Ghani SN (1989) A versatile procedure for optimization of a nonlinear nondifferentiable constrained objective function, AERE R13714. UK Atomic Energy Authority, Nuclear Physics and Instrumentation Division, Harwell Laboratory, Oxfordshire
Goldstein AA, Price JF (1971) On descent from local minima. Math Comput 25(115):569–574
Gurwitz C, Overton M (1989) Sequential quadratic programming methods based on approximating a projected Hessian matrix. SIAM J Sci Comput 10:631–653
Himmelblau D (1972) Applied nonlinear programming. McGraw-Hill, New York
Hock W, Schittkowski K (1981) Test examples for nonlinear programming codes. Springer, Berlin Heidelberg New York
Kolda TG, Lewis RM, Torczon V (2003) Optimization by direct search: new perspectives on some classical and modern methods. SIAM Rev 45(3):385–482
Kolman B, Beck RE (1980) Elementary linear programming with applications. Academic, New York
Lagarias JC, Reeds JA, Wright MH, Wright PE (1998) Convergence properties of the Nelder–Mead simplex method in low dimensions. SIAM J Optim 9(1):112–147
Liew KM, Tan PK, Ray T (2004) Leader identification and leader selection: its effect on a swarm's performance for multi-objective design optimization problems. Struct Multidiscipl Optim 28(2–3):156–169
Luersen MA, Le Riche R, Guyon F (2004) A constrained, globalized, and bounded Nelder–Mead method for engineering optimization. Struct Multidiscipl Optim 27:43–54
McKinnon KIM (1998) Convergence of the Nelder–Mead simplex method to a nonstationary point. SIAM J Optim 9(1):148–158
Mistree F, Hughes OF, Phouc HB (1981) An optimization method for the design of large, highly constrained complex systems. Eng Optim 5:179–197
Murray W, Prieto JP (1995) A sequential quadratic programming algorithm using an incomplete solution of the subproblem. SIAM J Optim 5:590–640
Ndiritu JG, Daniell TM (1999) An improved genetic algorithm for continuous and mixed discrete-continuous optimization. Eng Optim 31:589–614
Nelder JA, Mead R (1965) A simplex method for function minimization. Comput J 7(4):308–313
Rahman MM, Rahman MK, Rahman SS (2003) Multicriteria hydraulic fracturing optimization for reservoir stimulation. Pet Sci & Technol 21(11–12):1721–1758
Rao SS (1996) Engineering optimization, 3rd edn. Wiley, New York
Sandgren E (1990) Nonlinear integer and discrete programming in mechanical design optimization. Trans ASME J Mech Des 112(2):223–229
Spellucci P (1998) An SQP method for general nonlinear programs using only equality constrained subprograms. Math Program 82:413–448
Valencia KL, Chen Z, Rahman MK, Rahman SS (2003) An integrated model for the design and evaluation of multiwell hydraulic fracture treatments for gas-condensate reservoirs. Paper SPE 84660, SPE International Improved Oil Recovery Conference in Asia Pacific, Kuala Lumpur, 20–21 Oct 2003
Wu S, Chow P (1995) Genetic algorithms for nonlinear mixed discrete-integer optimization problems via meta-genetic parameter optimization. Eng Optim 24:137–159
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
About this article
Cite this article
Rahman, M.K. An intelligent moving object optimization algorithm for design problems with mixed variables, mixed constraints and multiple objectives. Struct Multidisc Optim 32, 40–58 (2006). https://doi.org/10.1007/s00158-005-0552-y
Published:
Issue Date:
DOI: https://doi.org/10.1007/s00158-005-0552-y