Leveraging Design Heuristics for Multi-Objective Metamaterial Design Optimization

2021 ◽  
Author(s):  
Roshan Suresh Kumar ◽  
Srikar Srivatsa ◽  
Meredith Silberstein ◽  
Daniel Selva

Abstract Design optimization of metamaterials and other complex systems often relies on the use of computationally expensive models. This makes it challenging to use global multi-objective optimization approaches that require many function evaluations. Engineers often have heuristics or rules of thumb with potential to drastically reduce the number of function evaluations needed to achieve good convergence. Recent research has demonstrated that these design heuristics can be used explicitly in design optimization, indeed leading to accelerated convergence. However, these approaches have only been demonstrated on specific problems, the performance of different methods was diverse, and despite all heuristics being “correct”, some heuristics were found to perform much better than others for various problems. In this paper, we describe a case study in design heuristics for a simple class of 2D constrained multiobjective optimization problems involving lattice-based metamaterial design. Design heuristics are strategically incorporated into the design search and the heuristics-enabled optimization framework is compared with the standard optimization framework not using the heuristics. Results indicate that leveraging design heuristics for design optimization can help in reaching the optimal designs faster. We also identify some guidelines to help designers choose design heuristics and methods to incorporate them for a given problem at hand.

2022 ◽  
Vol 0 (0) ◽  
Author(s):  
Fouzia Amir ◽  
Ali Farajzadeh ◽  
Jehad Alzabut

Abstract Multiobjective optimization is the optimization with several conflicting objective functions. However, it is generally tough to find an optimal solution that satisfies all objectives from a mathematical frame of reference. The main objective of this article is to present an improved proximal method involving quasi-distance for constrained multiobjective optimization problems under the locally Lipschitz condition of the cost function. An instigation to study the proximal method with quasi distances is due to its widespread applications of the quasi distances in computer theory. To study the convergence result, Fritz John’s necessary optimality condition for weak Pareto solution is used. The suitable conditions to guarantee that the cluster points of the generated sequences are Pareto–Clarke critical points are provided.


2014 ◽  
Vol 984-985 ◽  
pp. 419-424
Author(s):  
P. Sabarinath ◽  
M.R. Thansekhar ◽  
R. Saravanan

Arriving optimal solutions is one of the important tasks in engineering design. Many real-world design optimization problems involve multiple conflicting objectives. The design variables are of continuous or discrete in nature. In general, for solving Multi Objective Optimization methods weight method is preferred. In this method, all the objective functions are converted into a single objective function by assigning suitable weights to each objective functions. The main drawback lies in the selection of proper weights. Recently, evolutionary algorithms are used to find the nondominated optimal solutions called as Pareto optimal front in a single run. In recent years, Non-dominated Sorting Genetic Algorithm II (NSGA-II) finds increasing applications in solving multi objective problems comprising of conflicting objectives because of low computational requirements, elitism and parameter-less sharing approach. In this work, we propose a methodology which integrates NSGA-II and Technique for Order Preference by Similarity to Ideal Solution (TOPSIS) for solving a two bar truss problem. NSGA-II searches for the Pareto set where two bar truss is evaluated in terms of minimizing the weight of the truss and minimizing the total displacement of the joint under the given load. Subsequently, TOPSIS selects the best compromise solution.


Author(s):  
Mohammad Reza Farmani ◽  
Jafar Roshanian ◽  
Meisam Babaie ◽  
Parviz M Zadeh

This article focuses on the efficient multi-objective particle swarm optimization algorithm to solve multidisciplinary design optimization problems. The objective is to extend the formulation of collaborative optimization which has been widely used to solve single-objective optimization problems. To examine the proposed structure, racecar design problem is taken as an example of application for three objective functions. In addition, a fuzzy decision maker is applied to select the best solution along the pareto front based on the defined criteria. The results are compared to the traditional optimization, and collaborative optimization formulations that do not use multi-objective particle swarm optimization. It is shown that the integration of multi-objective particle swarm optimization into collaborative optimization provides an efficient framework for design and analysis of hierarchical multidisciplinary design optimization problems.


2015 ◽  
pp. 1246-1276
Author(s):  
Wen Fung Leong ◽  
Yali Wu ◽  
Gary G. Yen

Generally, constraint-handling techniques are designed for evolutionary algorithms to solve Constrained Multiobjective Optimization Problems (CMOPs). Most Multiojective Particle Swarm Optimization (MOPSO) designs adopt these existing constraint-handling techniques to deal with CMOPs. In this chapter, the authors present a constrained MOPSO in which the information related to particles' infeasibility and feasibility status is utilized effectively to guide the particles to search for feasible solutions and to improve the quality of the optimal solution found. The updating of personal best archive is based on the particles' Pareto ranks and their constraint violations. The infeasible global best archive is adopted to store infeasible nondominated solutions. The acceleration constants are adjusted depending on the personal bests' and selected global bests' infeasibility and feasibility statuses. The personal bests' feasibility statuses are integrated to estimate the mutation rate in the mutation procedure. The simulation results indicate that the proposed constrained MOPSO is highly competitive in solving selected benchmark problems.


Sign in / Sign up

Export Citation Format

Share Document