Unconventional optimization for achieving well-informed design solutions for the automobile industry

ABSTRACT In practice, engineering optimization problems come in various complexities that are different from the usual problem formulations used in a single academic study. To solve such unconventional description of problems, optimization experts must use different tools and tricks first to reformulate the problems as structured optimization problems and then to use an appropriate adaptation of existing optimization algorithms to solve them. In this article, a design optimization case study from the automobile industry is narrated, stating three different problem solving scenarios arising sequentially after each problem is solved. The article shows how each problem description can be formulated as a suitable optimization problem and how a suitable and existing optimization algorithm can be modified to find the respective solutions of interest to the engineer. The sequential reformulation of problems and their solutions not only allow engineers eventually to discover the final solutions of interest, the whole process is extremely rewarding to them in terms of knowledge gathered about alternative potential solutions of the problem. Although applied to a single automotive design problem in this article, the philosophy and methods described here are generic and should motivate both engineering optimization researchers and the industry to pursue more such studies.

[1]  Thomas Bäck,et al.  Optimizing highly constrained truck loadings using a self-adaptive genetic algorithm , 2015, 2015 IEEE Congress on Evolutionary Computation (CEC).

[2]  R. K. Ursem Multi-objective Optimization using Evolutionary Algorithms , 2009 .

[3]  J. Dennis,et al.  Mixed Variable Optimization of the Number and Composition of Heat Intercepts in a Thermal Insulation System , 2001 .

[4]  Anne Auger,et al.  Markov Chain Analysis of Cumulative Step-Size Adaptation on a Linear Constrained Problem , 2015, Evolutionary Computation.

[5]  Yi Zhang,et al.  An "ageing" operator and its use in the highly constrained topological optimization of HVAC system design , 2005, GECCO '05.

[6]  Marco Dorigo,et al.  Genetic Algorithms and Highly Constrained Problems: The Time-Table Case , 1990, PPSN.

[7]  Kalyanmoy Deb,et al.  An Evolutionary Many-Objective Optimization Algorithm Using Reference-Point-Based Nondominated Sorting Approach, Part I: Solving Problems With Box Constraints , 2014, IEEE Transactions on Evolutionary Computation.

[8]  Qingfu Zhang,et al.  MOEA/D: A Multiobjective Evolutionary Algorithm Based on Decomposition , 2007, IEEE Transactions on Evolutionary Computation.

[9]  Kaisa Miettinen,et al.  Nonlinear multiobjective optimization , 1998, International series in operations research and management science.

[10]  Kalyanmoy Deb,et al.  A Taxonomy for Metamodeling Frameworks for Evolutionary Multiobjective Optimization , 2019, IEEE Transactions on Evolutionary Computation.

[11]  Marzouk Benali,et al.  Multi-objective self-adaptive algorithm for highly constrained problems: Novel method and applications , 2010 .

[12]  Roberto Piola Evolutionary solutions to a highly constrained combinatorial problem , 1994, Proceedings of the First IEEE Conference on Evolutionary Computation. IEEE World Congress on Computational Intelligence.

[13]  Kalyanmoy Deb,et al.  A population-based fast algorithm for a billion-dimensional resource allocation problem with integer variables , 2017, Eur. J. Oper. Res..

[14]  Xin Yao,et al.  Stochastic ranking for constrained evolutionary optimization , 2000, IEEE Trans. Evol. Comput..

[15]  Antonio J. Nebro,et al.  jMetal: A Java framework for multi-objective optimization , 2011, Adv. Eng. Softw..

[16]  Alexander I. J. Forrester,et al.  Engineering design applications of surrogate-assisted optimization techniques , 2014 .

[17]  David E. Goldberg,et al.  Genetic Algorithms in Search Optimization and Machine Learning , 1988 .

[18]  Kalyanmoy Deb,et al.  A fast and elitist multiobjective genetic algorithm: NSGA-II , 2002, IEEE Trans. Evol. Comput..

[19]  Martin J. Oates,et al.  The Pareto Envelope-Based Selection Algorithm for Multi-objective Optimisation , 2000, PPSN.

[20]  Kalyanmoy Deb,et al.  An Evolutionary Many-Objective Optimization Algorithm Using Reference-Point Based Nondominated Sorting Approach, Part II: Handling Constraints and Extending to an Adaptive Approach , 2014, IEEE Transactions on Evolutionary Computation.

[21]  Hanif D. Sherali,et al.  Methods of Feasible Directions , 2005 .

[22]  Kalyanmoy Deb,et al.  Simulated Binary Crossover for Continuous Search Space , 1995, Complex Syst..

[23]  Marco Laumanns,et al.  SPEA2: Improving the Strength Pareto Evolutionary Algorithm For Multiobjective Optimization , 2002 .