Skip to main content
Log in

Penalty functions and two-step selection procedure based DIRECT-type algorithm for constrained global optimization

  • Research Paper
  • Published:
Structural and Multidisciplinary Optimization Aims and scope Submit manuscript

Abstract

Applied optimization problems often include constraints. Although the well-known derivative-free global-search DIRECT algorithm performs well solving box-constrained global optimization problems, it does not naturally address constraints. In this article, we develop a new algorithm DIRECT-GLce for general constrained global optimization problems incorporating two-step selection procedure and penalty function approach in our recent DIRECT-GL algorithm. The proposed algorithm effectively explores hyper-rectangles with infeasible centers which are close to boundaries of feasibility and may cover feasible regions. An extensive experimental investigation revealed the potential of the proposed approach compared with other existing DIRECT-type algorithms for constrained global optimization problems, including important engineering problems.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Fig. 1
Fig. 2
Fig. 3
Fig. 4
Fig. 5
Fig. 6

Similar content being viewed by others

References

Download references

Acknowledgements

The authors would like to thank all anonymous referees for their valuable comments and suggestions to improve the paper.

Funding

The research work of R. Paulavičius and L. Stripinis was funded by a Grant (No. P-MIP-17-60) from the Research Council of Lithuania.

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Remigijus Paulavičius.

Additional information

Responsible Editor: Shapour Azarm

Publisher’s note

Springer Nature remains neutral with regard to jurisdictional claims in published maps and institutional affiliations.

Data access statement

Data underlying this article can be accessed on Zenodo at https://dx.doi.org/10.5281/zenodo.1218981, and used under the Creative Commons Attribution license.

Appendices

Appendix A: The mathematical formulations of engineering problems

NASA speed reducer design problem (Liu et al. 2017; Ray and Liew 2003).

The overall weight subject to constraints on bending stress of the gear teeth, surface stress, and transverse deflections of the shafts and stresses in the shafts is minimized. This problem has 7 design variables and 11 constraints. The optimization problem is formulated as following:

$$ \begin{array}{ll} \min & f(\mathbf{x}) = 0.7854x_{1}{x_{2}^{2}}(3.3333{x_{3}^{2}} + 14.9334x_{3} - 43.0934) \\ & -1.508x_{1}({x_{6}^{2}}+{x_{7}^{2}})+ 7.4777({x_{6}^{3}}+{x_{7}^{3}}) \\ & + 0.7854(x_{4}{x_{6}^{2}}+x_{5}{x_{7}^{2}}) \\ \mathrm{ s.t.} & g_{1}(\mathbf{x}) = \frac{27}{x_{1}{x_{2}^{2}}x_{3}}-1 \leq \mathbf{0},~ g_{2}(\mathbf{x})=\frac{397.5}{x_{1}{x_{2}^{2}}{x_{3}^{2}}} - 1 \leq \mathbf{0}, \\ & g_{3}(\mathbf{x})=\frac{1.93{x_{4}^{3}}}{x_{2}x_{3}{x_{6}^{4}}} - 1 \leq \mathbf{0},~ g_{4}(\mathbf{x})=\frac{1.93{x_{5}^{3}}}{x_{2}x_{3}{x_{7}^{4}}} - 1 \leq \mathbf{0},\\ & g_{5}(\mathbf{x})= \frac{((\frac{745x_{4}}{x_{2}x_{3}})^{2}+ 16.9 \times 10^{6})^{0.5}}{110{x_{6}^{3}}} - 1 \leq \mathbf{0}, \\ & g_{6}(\mathbf{x})=\frac{((\frac{745x_{5}}{x_{2}x_{3}})^{2}+ 157.5 \times 10^{6})^{0.5}}{85{x_{7}^{3}}} - 1 \leq \mathbf{0}, \\ & g_{7}(\mathbf{x})=\frac{x_{2}x_{3}}{40} - 1 \leq \mathbf{0},~ g_{8}(\mathbf{x})= \frac{5x_{2}}{x_{1}} - 1 \leq \mathbf{0}, \\ & g_{9}(\mathbf{x})=\frac{x_{1}}{12x_{2}} - 1 \leq \mathbf{0},~ g_{10}(\mathbf{x})=\frac{1.5x_{6}+ 1.9}{x_{4}} - 1 \leq \mathbf{0}, \\ & g_{11}(\mathbf{x})=\frac{1.1x_{7}+ 1.9}{x_{5}} - 1 \leq \mathbf{0} \end{array} $$

where 2.6 ≤ x1 ≤ 3.6, 0.7 ≤ x2 ≤ 0.8, 17 ≤ x3 ≤ 28, 7.3 ≤ x4 ≤ 8.3, 7.8 ≤ x5 ≤ 8.3, 2.9 ≤ x6 ≤ 3.9, 5 ≤ x7 ≤ 5.5.

Table 10 Key characteristics of the optimization test problems with equality constraints

Pressure vessel design problem (Kazemi et al. 2011; Liu et al. 2017).

The total cost of material, forming, and welding of a cylindrical vessel is minimized. This problem has four design variables and six constraints The optimization problem formulated as following:

$$ \begin{array}{ll} \min & f(\mathbf{x})= 0.6224x_{1}x_{3}x_{4}+ 1.7781x_{2}{x_{3}^{2}}+ 3.1661{x_{1}^{2}}x_{4} \\ & + 19.84{x_{1}^{2}}x_{3}\\ \mathrm{ s.t.} & g_{1}(\mathbf{x})= -x_{1}+ 0.0193x_{3} \leq \mathbf{0}, \\ & g_{2}(\mathbf{x})= -x_{2}+ 0.00954x_{3} \leq \mathbf{0}, \\ & g_{3}(\mathbf{x})=- \pi {x_{3}^{2}}x_{4}- \frac{4}{3} \pi {x_{3}^{3}}+ 1296000 \leq \mathbf{0}, \\ & g_{4}(\mathbf{x})= x_{4}-240 \leq \mathbf{0},~ g_{5}(\mathbf{x})= 1.1-x_{1} \leq \mathbf{0}, \\ & g_{6}(\mathbf{x})= 0.6-x_{2} \leq \mathbf{0} \end{array} $$

where 1 ≤ x1 ≤ 1.375, 0.625 ≤ x2 ≤ 1, 25 ≤ x3 ≤ 150, 25 ≤ x4 ≤ 240.

Tension/compression spring design problem (Kazemi et al. 2011; Liu et al. 2017).

The weight subject to constraints on minimum deflection, shear stress, surge frequency, and limits on outside diameter is minimized. This problem has three design variables and four constraints. The optimization problem formulated as following:

$$ \begin{array}{ll} \min & f(\mathbf{x})={x_{1}^{2}}x_{2}(x_{3}+ 2)\\ \mathrm{ s.t.} & g_{1}(\mathbf{x})= 1- \frac{{x_{2}^{3}}x_{3}}{71875{x_{1}^{4}}} \leq \mathbf{0}, \\ & g_{2}(\mathbf{x})= \frac{x_{2}(4x_{2}-x_{1})}{12566{x_{1}^{3}}(x_{2}-x_{1})}+ \frac{2.46}{12566{x_{1}^{2}}}-1 \leq \mathbf{0}, \\ & g_{3}(\mathbf{x})= 1- \frac{140.54x_{1}}{x_{3}{x_{2}^{2}}} \leq \mathbf{0},~ g_{4}(\mathbf{x})= \frac{x_{1}+x_{2}}{1.5}-1 \leq \mathbf{0} \end{array} $$

where 0.05 ≤ x1 ≤ 0.2, 0.25 ≤ x2 ≤ 1.3, 2 ≤ x3 ≤ 15.

Three-bar truss design problem (Liu et al. 2017; Ray and Liew 2003).

The volume subject to stress constraints is minimized. This problem has two design variables and three constraints. The optimization problem formulated as following:

$$ \begin{array}{ll} \min & f(\mathbf{x})= 100(2 \sqrt{2} x_{1}+x_{2})\\ \mathrm{ s.t.} & g_{1}(\mathbf{x})= \frac{\sqrt{2} x_{1}+x_{2}}{\sqrt{2} {x_{1}^{2}}+ 2x_{1}x_{2}}2-2 \leq \mathbf{0}, \\ & g_{2}(\mathbf{x})= \frac{x_{2}}{\sqrt{2} {x_{1}^{2}}+ 2x_{1}x_{2}}2-2 \leq \mathbf{0}, \\ & g_{3}(\mathbf{x})= \frac{1}{x_{1}+\sqrt{2} x_{2}}2-2 \leq \mathbf{0} \end{array} $$

where 0 ≤ x1 ≤ 1, 0 ≤ x2 ≤ 1.

Appendix B: Test problems with linear and nonlinear constraints

Table 11 Key characteristics of the constrained global optimization test problems

Rights and permissions

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Stripinis, L., Paulavičius, R. & Žilinskas, J. Penalty functions and two-step selection procedure based DIRECT-type algorithm for constrained global optimization. Struct Multidisc Optim 59, 2155–2175 (2019). https://doi.org/10.1007/s00158-018-2181-2

Download citation

  • Received:

  • Revised:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s00158-018-2181-2

Keywords

Navigation