An intelligent moving object optimization algorithm for design problems with mixed variables, mixed constraints and multiple objectives

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.

[1]  John A. Nelder,et al.  A Simplex Method for Function Minimization , 1965, Comput. J..

[2]  J. F. Price,et al.  On descent from local minima , 1971 .

[3]  David Mautner Himmelblau,et al.  Applied Nonlinear Programming , 1972 .

[4]  Robert E. Beck,et al.  Elementary Linear Programming with Applications , 1979 .

[5]  Klaus Schittkowski,et al.  More test examples for nonlinear programming codes , 1981 .

[6]  F. Mistree,et al.  AN OPTIMIZATION METHOD FOR THE DESIGN OF LARGE, HIGHLY CONSTRAINED COMPLEX SYSTEMS , 1981 .

[7]  John S. Gero,et al.  A COMPARISON OF THREE METHODS FOR GENERATING THE PARETO OPTIMAL SET , 1984 .

[8]  E. Sandgren,et al.  Nonlinear Integer and Discrete Programming in Mechanical Design Optimization , 1990 .

[9]  R. G. Fenton,et al.  A MIXED INTEGER-DISCRETE-CONTINUOUS PROGRAMMING METHOD AND ITS APPLICATION TO ENGINEERING DESIGN OPTIMIZATION , 1991 .

[10]  Jahau Lewis Chen,et al.  Optimal design of machine elements using genetic algorithms , 1993 .

[11]  Francisco J. Prieto,et al.  A Sequential Quadratic Programming Algorithm Using an Incomplete Solution of the Subproblem , 1995, SIAM J. Optim..

[12]  S. Wu,et al.  GENETIC ALGORITHMS FOR NONLINEAR MIXED DISCRETE-INTEGER OPTIMIZATION PROBLEMS VIA META-GENETIC PARAMETER OPTIMIZATION , 1995 .

[13]  John N. Tsitsiklis,et al.  Introduction to linear optimization , 1997, Athena scientific optimization and computation series.

[14]  Jeffrey C. Lagarias,et al.  Convergence Properties of the Nelder-Mead Simplex Method in Low Dimensions , 1998, SIAM J. Optim..

[15]  K. I. M. McKinnon,et al.  Convergence of the Nelder-Mead Simplex Method to a Nonstationary Point , 1998, SIAM J. Optim..

[16]  Peter Spellucci,et al.  An SQP method for general nonlinear programs using only equality constrained subproblems , 1998, Math. Program..

[17]  J. Ndiritu,et al.  AN IMPROVED GENETIC ALGORITHM FOR CONTINUOUS AND MIXED DISCRETE-CONTINUOUS OPTIMIZATION , 1999 .

[18]  Alan D. Christiansen,et al.  MOSES: A MULTIOBJECTIVE OPTIMIZATION TOOL FOR ENGINEERING DESIGN , 1999 .

[19]  S. K. Mazumder,et al.  CONSTRAINED NON-LINEAR PROGRAMMING: A MINIMUM CROSS-ENTROPY ALGORITHM , 1999 .

[20]  Tamara G. Kolda,et al.  Optimization by Direct Search: New Perspectives on Some Classical and Modern Methods , 2003, SIAM Rev..

[21]  Zhixi Chen,et al.  An Integrated Model for the Design and Evaluation of Multiwell Hydraulic Fracture Treatments for Gas-Condensate Reservoirs , 2003 .

[22]  M. M. Rahman,et al.  Multicriteria Hydraulic Fracturing Optimization for Reservoir Stimulation , 2003 .

[23]  M. A. Luersen,et al.  A constrained, globalized, and bounded Nelder–Mead method for engineering optimization , 2004 .

[24]  Tapabrata Ray,et al.  Leader identification and leader selection: its effect on a swarm’s performance for multi-objective design optimization problems , 2004 .

[25]  S. N. Ghani.  An improved 'complex' method of function minimization , 2006 .