Skip to main content
Log in

Abstract

During preliminary phases in product design, on the basis of strong physical hypotheses (e.g. isotherm, steady state), physical and functional requirements can be expressed as coarse-grained constraint-based models on a few degrees of freedom, possibly including several design criteria to optimize. Such models are usually handled by multi-objective optimization solvers in order to find design solutions giving the best trade-offs between design criteria. Another approach developed in this paper is to partially explore all the areas of the design space using an anytime interval branch-and-prune algorithm called IDFS such that the design criteria are converted into so-called \(\varepsilon \)-constraints. The expected result is a sample of solutions diversified in both the objective space and the design space. Several quality indicators are introduced in order to measure this diversity and compare IDFS with two state-of-the-art multi-objective optimization solvers NSGA-II and NSGA-III on three real-world case studies. The results show that IDFS is able to identify new close-to-optimal designs and permits a better understanding of the design space. This framework provides a promising alternative tool for decision making, in particular for integrating interaction in the preliminary design process.

Graphical Abstract

Partial exploration aims to compute a diversified subset of feasible solutions; We built an anytime branch and prune algorithm for partial design space exploration. We built a protocol to analyze diversity in both the design and the objective space. We compare partial exploration and optimization approaches on three design problems. Partial Exploration is a tool for decision makers to identify quasi-optimal designs.

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
Fig. 7
Fig. 8
Fig. 9
Fig. 10
Fig. 11
Fig. 12
Fig. 13
Fig. 14
Fig. 15
Fig. 16
Fig. 17
Fig. 18
Fig. 19

Similar content being viewed by others

Notes

  1. https://pymoo.org/.

  2. http://www.ibex-lib.org/.

  3. https://pymoo.org/.

References

  1. Tchertchian, N., Yvars, P., Millet, D.: Benefits and limits of a constraint satisfaction problem/life cycle assessment approach for the ecodesign of complex systems: a case applied to a hybrid passenger ferry. J. Clean. Prod. 42, 1–18 (2013)

    Article  Google Scholar 

  2. Kang, E., Jackson, E., Schulte, W.: An approach for effective design space exploration. In: Calinescu, R., Jackson, E. (eds.) Foundations of Computer Software. Modeling, Development, and Verification of Adaptive Systems. Lecture Notes in Computer Science, pp. 33–54. Springer, Berlin (2011)

    Chapter  Google Scholar 

  3. Gelle, E., Faltings, B., Clément, D.E., Smith, I.: Constraint satisfaction methods for applications in engineering. Eng. Comput. (2000). https://doi.org/10.1007/PL00007190

    Article  MATH  Google Scholar 

  4. Yvars, P.A.: Using constraint satisfaction for designing mechanical systems. Int. J. Interact. Des. Manuf. IJIDeM 2, 161–167 (2008). https://doi.org/10.1007/s12008-008-0047-3

    Article  Google Scholar 

  5. Larroude, V., Yvars, PA., Millet, D.: Global optimization of environmental impact by a constraint satisfaction approach—application to ship-ecodesign. Des. Soc. p. 11 (2011)

  6. Cicconi, P., Manieri, S., Nardelli, M., Bergantino, N., Raffaeli, R., Germani, M.: A constraint-based approach for optimizing the design of overhead lines. Int. J. Interact. Des. Manuf. 14(3), 1121–1139 (2020). https://doi.org/10.1007/s12008-020-00680-x

    Article  Google Scholar 

  7. Messine, F., Nogarede, B., Lagouanelle, J.L.: Optimal design of electromechanical actuators: a new method based on global optimization. IEEE Trans. Magn. 34(1), 299–308 (1998). https://doi.org/10.1109/20.650361

    Article  Google Scholar 

  8. Yvars, P.A., Lafon, P., Zimmer, L.: Optimization of Mechanical System: contribution of Constraint Satisfaction Method. In: 2009 Int. Conf. Comput. Ind. Eng. Troyes, France: IEEE. p. 1379–1384 (2009)

  9. Brownlee, A.E.I., Wright, J.A.: Constrained, mixed-integer and multi-objective optimisation of building designs by NSGA-II with fitness approximation. Appl. Soft Comput. 33, 114–126 (2015). https://doi.org/10.1016/j.asoc.2015.04.010

    Article  Google Scholar 

  10. Demarco, F., Bertacchini, F., Scuro, C., Bilotta, E., Pantano, P.: The development and application of an optimization tool in industrial design. Int. J. Interact. Des. Manuf. 14(3), 955–970 (2020). https://doi.org/10.1007/s12008-020-00679-4

    Article  Google Scholar 

  11. Fortunet, C., Durieux, S., Chanal, H., Duc, E.: Multicriteria decision optimization for the design and manufacture of structural aircraft parts. Int. J. Interact. Des. Manuf. 14(3), 1015–1030 (2020). https://doi.org/10.1007/s12008-020-00685-6

    Article  Google Scholar 

  12. Stewart, R.H., Palmer, T.S., DuPont, B.: A survey of multi-objective optimization methods and their applications for nuclear scientists and engineers. Prog. Nucl. Energy 138, 103830 (2021). https://doi.org/10.1016/j.pnucene.2021.103830

    Article  Google Scholar 

  13. Zavala, G.R., Nebro, A.J., Luna, F., Coello Coello, C.A.: A survey of multi-objective metaheuristics applied to structural optimization. Struct. Multidisc. Optim. 49(4), 537–558 (2014). https://doi.org/10.1007/s00158-013-0996-4

    Article  MathSciNet  Google Scholar 

  14. Papalambros, P., Wilde, D.: Principles of Optimal Design: Modeling and Computation. 3rd ed. Modelling and computation (2017)

  15. Deb, K., Agrawal, S., Pratap, A., Meyarivan, T.A.: Fast Elitist Non-dominated Sorting Genetic Algorithm for Multi-objective Optimization: NSGA-II. In: Parallel Problem Solving from Nature PPSN VI. vol. 1917. Berlin, Heidelberg: Springer Berlin Heidelberg. p. 849–858 (2000)

  16. Mandal, W.A.: A two-bar truss structural model under uncertainty: a uncertain chance constrained geometric programming (UCCGP) approach. Int. J. Interact. Des. Manuf. 13(2), 471–485 (2019). https://doi.org/10.1007/s12008-018-0477-5

    Article  Google Scholar 

  17. Institute for Environment and Sustainability (Joint Research Centre). Life Cycle Indicators Framework: Development of Life Cycle Based Macro Level Monitoring Indicators for Resources, Products and Waste for the EU 27. LU: Publications Office of the European Union; (2012)

  18. Deb, K., Jain, S.: Running Performance Metrics for Evolutionary Multi-Objective Optimizations; (2002)

  19. Schwind, N., Okimoto, T., Clement, M., Inoue, K.: Representative Solutions for Multi-Objective Constraint Optimization Problems. In: The 15th International Conference on Principles of Knowledge Representation and Reasoning (KR’16). KR; (2016)

  20. Ingmar, L., de la Banda, M.G., Stuckey, P.J., Tack, G.: Modelling diversity of solutions. Proc. AAAI Conf. Artif. Intell. 34(02), 1528–1535 (2020). https://doi.org/10.1609/aaai.v34i02.5512

    Article  Google Scholar 

  21. Vassilvitskii, S., Yannakakis, M.: Efficiently computing succinct trade-off curves. Theor. Comput. Sci. 348, 334–356 (2005)

    Article  MathSciNet  MATH  Google Scholar 

  22. Yuan, Y., Ong, Y.S., Gupta, A., Xu, H.: Objective reduction in many-objective optimization: evolutionary multiobjective approaches and comprehensive analysis. IEEE Trans. Evol. Comput. 22(2), 189–210 (2018). https://doi.org/10.1109/TEVC.2017.2672668

    Article  Google Scholar 

  23. Van Hentenryck, P., Mcallester, D., Kapur, D.: Solving polynomial systems using a branch and prune approach. SIAM J. Numer. https://doi.org/10.1137/S0036142995281504. (1997)

  24. Chenouard, R., Goldsztejn, A., Jermann, C.: Search strategies for an anytime usage of the branch and prune algorithm. International Joint Conference on Artificial Intelligence, 2009, United States, pp. 468–473 (2009)

  25. Benhamou, F., Goualard, F., Granvilliers, L., Puget, J.F.: Revising hull and box consistency. Int. Conf. Log. Program (1999). https://doi.org/10.7551/mitpress/4304.003.0024

    Article  Google Scholar 

  26. Araya, I., Trombettoni, G., Neveu, B.: A contractor based on convex interval Taylor. In: Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization. Problems Lecture Notes in Computer Science, pp. 1–16. Springer, Berlin (2012)

    Google Scholar 

  27. Chabert, G., Jaulin, L.: Contractor programming. Artif. Intell. 173(11), 1079–1100 (2009). https://doi.org/10.1016/j.artint.2009.03.002

    Article  MathSciNet  MATH  Google Scholar 

  28. Ryoo, H.S., Sahinidis, N.V.: A branch-and-reduce approach to global optimization. J. Glob. Optim. 8(2), 107–138 (1996). https://doi.org/10.1007/BF00138689

    Article  MathSciNet  MATH  Google Scholar 

  29. Misener, R., Floudas, C.A.: ANTIGONE: Algorithms for continuous/integer global optimization of nonlinear equations. J. Glob. Optim. 59(2), 503–526 (2014). https://doi.org/10.1007/s10898-014-0166-2

    Article  MathSciNet  MATH  Google Scholar 

  30. Ehrgott, M., Ruzika, S.: Improved \(\epsilon \)-constraint method for multiobjective programming. J. Optim. Theory Appl. 138(3), 375–396 (2008). https://doi.org/10.1007/s10957-008-9394-2

    Article  MathSciNet  MATH  Google Scholar 

  31. Audet, C., Bigeon, J., Cartier, D., Le Digabel, S., Salomon, L.: Performance indicators in multiobjective optimization. Eur. J. Oper. Res. (2020). https://doi.org/10.1016/j.ejor.2020.11.016

    Article  MATH  Google Scholar 

  32. Zitzler, E., Thiele, L., Laumanns, M., Fonseca, C.M., Fonseca, V.: Performance assessment of multiobjective optimizers: an analysis and review. IEEE Trans. Evol. Comput. 7, 117–132 (2003). https://doi.org/10.1109/TEVC.2003.810758

  33. Palesi, M., Givargis, T.: Multi-objective design space exploration using genetic algorithms. In: Hardware/Software Codesign—Proceedings of the International Workshop pp 67–72 (2002)

  34. Cagan, J., Campbell, M., Finger, S., Tomiyama, T.: A framework for computational design synthesis: model and applications. J. Comput. Inf. Sci. Eng. 10(1115/1), 2013289 (2005)

    Google Scholar 

  35. Chenouard, R., Granvilliers, L., Sebastian, P.: Search heuristics for constraint-aided embodiment design. AIEDAM 23(2), 175–195 (2009). https://doi.org/10.1017/S0890060409000055

    Article  Google Scholar 

  36. Sayın, S.: Measuring the quality of discrete representations of efficient sets in multiple objective mathematical programming. Math. Program. 87(3), 543–560 (2000). https://doi.org/10.1007/s101070050011

    Article  MathSciNet  MATH  Google Scholar 

  37. Dechter, R., Pearl, J.: Generalized best-first search strategies and the optimality of A*. J. ACM 32(3), 505–536 (1985). https://doi.org/10.1145/3828.3830

    Article  MathSciNet  MATH  Google Scholar 

  38. Morrison, D.R., Jacobson, S.H., Sauppe, J.J., Sewell, E.C.: Branch-and-bound algorithms: a survey of recent advances in searching, branching, and pruning. Discrete Optim. 19, 79–102 (2016). https://doi.org/10.1016/j.disopt.2016.01.005

    Article  MathSciNet  MATH  Google Scholar 

  39. Meseguer, P.: Interleaved depth-first search. Proc. Fifteenth Int. J. Conf. Artif. Intell. 2, 1382–1387 (1997). https://doi.org/10.5555/1622270.1622355

    Article  Google Scholar 

  40. Jain, H., Deb, K.: An Evolutionary many-objective optimization algorithm using reference-point based nondominated sorting approach, Part II: Handling constraints and extending to an adaptive approach. IEEE Trans. Evol. Comput. 18(4), 602–622 (2014). https://doi.org/10.1109/TEVC.2013.2281534

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Thomas Richard de Latour.

Ethics declarations

Conflict of interest

The authors have no competing interest to declare.

Additional information

Publisher's Note

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

Appendix A Models

Appendix A Models

1.1 A1 Engine

$$\begin{aligned} CSP :\ {{\textbf {x}}} =&\, (b, c_r, d_I, d_E, w) \\ \left[b\right] =&\, [0,100] \\ \left[c_r\right] =&\, [0,100] \\ \left[d_I\right] =&\, [0,0.05] \\ \left[d_E\right] =&\, [0,1] \\ \left[w\right] =&\, [0,6.5] \\ subject \ to \\ c_1:&\ b-83.33 \le 0\\ c_2:&\ 76.9-b \le 0\\ c_3:&\ d_I+d_E-0.82b\le 0\\ c_4:&\ 0.83d_I-d_E\le 0\\ c_5:&\ d_E-0.89d_I \le 0\\ c_6:&\ 215.46-d_I^2 \le 0\\ c_7:&\ c_r-13.2+0.0045b \le 0\\ c_{8}:&\ 2b^3/1.18348e^6-1.3<0\\ c_{9}:&\ 2b^3/1.18348e^6-0.7>0\\ MOP :\\&\ min(ISFC,-BKW/V) \\ ISFC=&\,81.8964/(0.8595(1-c_r^{-0.33})\\&\quad +(0.83((8+4c_r)+1.5(c_r\\&\quad -1)(4\pi /1.859e^6)b^3)/(2+c_r)b))\\ BKW/V=&\,w[FMEP-3688\eta _t\eta _v]/120\\ where\\ FMEP=&\, 4.826(c_r-9.2)+(7.97+2.99e^5wb^{-2}\\&\quad +1.36e7bw^2)\\ \eta _t =&\, 0.8595(1-c_r^{-0.33})-S_v\sqrt{1.5/w}\\ \eta _v =&\, \eta _{vb}(1+5.96e^{-3}w^2)/((1+55.789/0.44)\\&\quad \times (w/(d_I)^2))^2\\ \eta _{vb} =&\,{\left\{ \begin{array}{ll} 0.067-0.038e^{w-5.25}, \ w \ge 5.25,\\ 0.637+0.13w-0.014w^2\\ +0.00066w^3, w < 5.25 \end{array}\right. }\\ S_v=&\,0.83(8+4c_r+1.0134e^{-5}(c_r-1)b^3)/((2+c_r)b)\\ Exploration: \\&BWK \ge 13400 \\&ISFC \le 223.2 \end{aligned}$$

1.2 A2 Actuator

$$\begin{aligned} CSP : \\ {{\textbf {x}}} =&\, (e,J_{cu},la,\beta ,P)\\ \left[e\right] =&\, [0.00001,0.005] \\ \left[J_{cu}\right] =&\, [1e5,1e7] \\ \left[la\right] =&\, [0.001,0.05] \\ \left[\beta \right] =&\, [0.8,1] \\ \left[P\right] =&\,[1,10] \\ subject \ to.\\ c_1:&\ D-2*(la+e) \ge 0 \\ c_2:&\ 0.001 \le E \le 0.05 \\ c_3:&\ 0.001 \le D \le 0.05 \\ c_4:&\ 0.001 \le \lambda \le 0.05 \\ c_5:&\ 0.001 \le K_f \le 0.05 \\ where \\ E =&\, 10^{11}/(0.7*(J_{cu}^2))\\ D =&\,0.1P/\pi \\ \lambda =&\, 0.015\pi D^2(D+E)B_e\sqrt{7^{11}\beta E}\\ Kf =&\, 1.5P\beta (e+E)/D\\ B_e =&\,(1.8la/(D\log {(D+2E)/(D-2(la+e))})\\ C =&\, D\pi \beta B_e/(6P)\\ MOP:\\&min(Vu,Va,Pj)\\ Vu =&\, \pi (D/\lambda )(D+E-e-la)(2C+E+e+la)\\ Va =&\,\pi \beta la(D/\lambda )(D-2e-la)\\ Pj =&\, 0.018e^{-6}\pi (D/\lambda )(D+E)10^{11}\\ Exploration \\ Vu \le&6.5e^{-4}\\ Va \le&1.5e^{-4}\\ Pj \le&45 \end{aligned}$$

1.3 A3 Water

$$\begin{aligned} CSP: \\&{{\textbf {x}}} = (x_1, x_2, x_3) \\ \left[x_1\right] =&\,[0.01,0.45]\\ \left[x_2\right] =&\,[0.01,0.10]\\ \left[x_3\right] =&\,[0.01,0.10]\\ subject \ to. \\ c_1:&\ 0.00139/(x_1x_2)+4.94x_3 - 0.08 \le 1 \\ c_2:&\ 0.000306/(x_1x_2)+1.082x_3 - 0.0986 \le 1 \\ c_3:&\ 12.307/(x_1x_2) + 49408.24x_3 \\&\ \ + 4051.02 \le 50000 \\ c_4:&\ 2.098/(x_1x_2) + 8046.33x_3 - 696.71 \le 16000 \\ c_5:&\ 2.138/(x_1x_2) + 7883.39x_3 - 705.04 \le 10000 \\ c_6:&\ 0.417/(x_1x_2) + 1721.26x_3 - 136.54 \le 2000 \\ c_7:&\ 0.164/(x_1x_2) + 631.13x_3 - 54.48 \le 550 \\ MOP:\\&min(f_1,f_2,f_3,f_4,f_5)\\ f_1 =&\, 106780.37(x_2 + x_3) + 61704.67 \\ f_2 =&\, 3000x_1 \\ f_3 =&\, 30570 0.02289x_2/(0.06 2289.0)0.65 \\ f_4 =&\, 250.0 2289.0exp(-39.75x_2 +9.9x_3 +2.74) \\ f_5 =&\, 25.0((1.39/(x_1x_2)) + 4940.0x_3 - 80.0) \\ Exploration \\&f_1 \le 8e4\\&f_2 \le 1.35e3\\&f_3 \le 1\\&f_4 \le 8.1e6\\&f_5 \le 3e4 \end{aligned}$$

Rights and permissions

Springer Nature or its licensor (e.g. a society or other partner) holds exclusive rights to this article under a publishing agreement with the author(s) or other rightsholder(s); author self-archiving of the accepted manuscript version of this article is solely governed by the terms of such publishing agreement and applicable law.

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Richard de Latour, T., Chenouard, R. & Granvilliers, L. Partial design space exploration strategies applied in preliminary design. Int J Interact Des Manuf (2023). https://doi.org/10.1007/s12008-023-01377-7

Download citation

  • Received:

  • Accepted:

  • Published:

  • DOI: https://doi.org/10.1007/s12008-023-01377-7

Keywords

Navigation