0
Research Papers: Design Automation

A Novel Sequential Multi-Objective Optimization Using Anchor Points in the Design Space of Global Variables

[+] Author and Article Information
Jianhua Zhou, Min Xu

National Engineering Laboratory for the
Automotive Electronic Control Technology,
Shanghai Jiao Tong University,
Shanghai 200240, China

Mian Li

National Engineering Laboratory for the
Automotive Electronic Control Technology,
Shanghai Jiao Tong University,
Shanghai 200240, China;
University of Michigan-Shanghai Jiao Tong
University Joint Institute,
Shanghai Jiao Tong University,
Shanghai 200240, China
e-mail: mianli@sjtu.edu.cn

1Corresponding author.

Contributed by the Design Automation Committee of ASME for publication in the JOURNAL OF MECHANICAL DESIGN. Manuscript received February 1, 2016; final manuscript received August 24, 2016; published online October 3, 2016. Assoc. Editor: Harrison M. Kim.

J. Mech. Des 138(12), 121406 (Oct 03, 2016) (11 pages) Paper No: MD-16-1092; doi: 10.1115/1.4034671 History: Received February 01, 2016; Revised August 24, 2016

Multi-objective problems are encountered in many engineering applications and multi-objective optimization (MOO) approaches have been proposed to search for Pareto solutions. Due to the nature of searching for multiple optimal solutions, the computational efforts of MOO can be a serious concern. To improve the computational efficiency, a novel efficient sequential MOO (S-MOO) approach is proposed in this work, in which anchor points in the design space for global variables are fully utilized and a data set for global solutions is generated to guide the search for Pareto solutions. Global variables refer to those shared by more than one objective or constraint, while local variables appear only in one objective and corresponding constraints. As a matter of fact, it is the existence of global variables that leads to couplings among the multiple objectives. The proposed S-MOO breaks the couplings among multiple objectives (and constraints) by distinguishing the global variables, and thus all objectives are optimized in a sequential manner within each iteration while all iterations can be processed in parallel. The computational cost per produced Pareto point is reduced and a well-spread Pareto front is obtained. Six numerical and engineering examples including two three-objective problems are tested to demonstrate the applicability and efficiency of the proposed approach.

FIGURES IN THIS ARTICLE
<>
Copyright © 2016 by ASME
Your Session has timed out. Please sign back in to continue.

References

Papalambros, P. Y. , and Wilde, D. J. , 2000, Principles of Optimal Design: Modeling and Computation, 2nd ed., Cambridge University Press, New York.
Arora, J. S. , 2004, Introduction to Optimum Design, 2nd ed., Elsevier, New York.
Belegundu, A. D. , and Chandrupatla, T. R. , 1999, Optimization Concepts and Applications in Engineering, Prentice Hall, Englewood Cliffs, NJ.
Koski, J. , 1988, “ Multicriteria Truss Optimization,” Multicriteria Optimization in Engineering and in the Sciences, W. Stadler , ed., Plenum Press, New York, pp. 263–307.
Jahn, J. , Klose, J. , and Merkel, A. , 1991, “ On the Application of a Method of Reference Point Approximation to Bicriterial Optimization Problems in Chemical Engineering,” Advances in Optimization, W. Oettli and D. Pallaschke , eds., Springer, Berlin, pp. 478–491.
Das, I. , and Dennis, J. E. , 1997, “ A Closer Look at Drawbacks of Minimizing Weighted Sums of Objectives for Pareto Set Generation in Multicriteria Optimization Problems,” Struct. Optim., 14(1), pp. 63–69. [CrossRef]
Haimes, Y. Y. , Lasdon, L. S. , and Wismer, D. A. , 1971, “ On a Bicriterion Formulation of the Problems of Integrated System Identification and System Optimization,” IEEE Trans. Syst. Man Cybern., 1(3), pp. 296–297. [CrossRef]
Das, I. , and Dennis, J. E. , 1998, “ Normal-Boundary Intersection: A New Method for Generating the Pareto Surface in Nonlinear Multicriteria Optimization Problems,” SIAM J. Optim., 8(3), pp. 631–657. [CrossRef]
Messac, A. , Ismail, Y. A. , and Mattson, C. A. , 2003, “ The Normalized Normal Constraint Method for Generating the Pareto Frontier,” Struct. Multidiscip. Optim., 25(2), pp. 86–98. [CrossRef]
Messac, A. , and Mattson, C. A. , 2004, “ Normal Constraint Method With Guarantee of Even Representation of Complete Pareto Frontier,” AIAA J., 42(10), pp. 2101–2111. [CrossRef]
Holland, J. , 1975, Adaptation in Natural and Artificial Systems, The University of Michigan Press, Ann Arbor, MI.
Goldberg, D. E. , 1989, Genetic Algorithms in Search, Optimization, and Machine Learning, Addison-Wesley, Reading, MA.
Dudy, L. , Yaochu, J. , Yew-Soon, O. , and Sendhoff, B. , 2010, “ Generalizing Surrogate-Assisted Evolutionary Computation,” IEEE Trans. Evol. Comput., 134(3), pp. 329–355.
Deb, K. , Gupta, S. , Daum, D. , and Branke, J. , 2009, “ Reliability-Based Optimization Using Evolutionary Algorithm,” IEEE Trans. Evol. Comput., 13(5), pp. 1054–1074. [CrossRef]
Storn, R. , and Price, K. , 1997, “ Differential Evolution—A Simple and Efficient Heuristic for Global Optimization Over Continuous Spaces,” J. Global Optim., 11(4), pp. 341–359. [CrossRef]
Deb, K. , Agrawal, S. , Pratap, A. , and Meyarivan, T. , 2002, “ A Fast and Elitist Multi-Objective Genetic Algorithm: NSGA-II,” IEEE Trans. Evol. Comput., 6(2), pp. 182–197. [CrossRef]
Deb, K. , 2001, Multiobjective Optimization Using Evolutionary Algorithms, Wiley, New York.
Coello, C. A. , Van Veldhuizen, D. A. , and Lamont, G. B. , 2002, Evolutionary Algorithms for Solving Multi-Objective Problems, Kluwer Academic Publishers, Boston, MA.
Narayanan, S. , and Azarm, S. , 1999, “ On Improving Multiobjective Genetic Algorithms for Design Optimization,” Struct. Multidiscip. Optim., 18(2), pp. 146–155. [CrossRef]
Kurapati, A. , Azarm, S. , and Wu, J. , 2002, “ Constraint Handling Improvements for Multi-Objective Genetic Algorithms,” Struct. Multidiscip. Optim., 23(3), pp. 204–213. [CrossRef]
Li, M. , Azarm, S. , and Boyars, A. , 2006, “ A New Deterministic Approach Using Sensitivity Region Measures for Multi-Objective Robust and Feasibility Robust Design Optimization,” ASME J. Mech. Des., 128(4), pp. 874–883. [CrossRef]
Hu, W. , Li, M. , Azarm, S. , and Almansoori, A. , 2011, “ Multi-Objective Robust Optimization Under Interval Uncertainty Using Online Approximation and Constraint Cuts,” ASME J. Mech. Des., 133(6), p. 061002. [CrossRef]
Saha, A. , Ray, T. , and Smith, W. , 2011, “ Towards Practical Evolutionary Robust Multi-Objective Optimization,” 2011 IEEE Congress on Evolutionary Computation, June 5–8, pp. 2123–2130.
Deb, K. , 2014, “ Multi-Objective Optimization,” Search Methodologies, 2nd ed., E. K. Burke and G. Kendall , eds., Springer, New York.
Kukkonen, S. , and Lampinen, J. , 2004, “ An Extension of Generalized Differential Evolution for Multi-Objective Optimization,” Parallel Problem Solving From Nature—PPSN VIII, Springer, Berlin, Heidelberg, pp. 752–761.
Sarker, R. , and Abbass, H. A. , 2004, “ Differential Evolution for Solving Multi-Objective Optimization Problems,” Asia-Pac. J. Oper. Res., 21(2), pp. 225–240. [CrossRef]
Mansoornejad, B. , Mostoufi, N. , and Jalali-Farahani, F. , 2008, “ A Hybrid GA–SQP Optimization Technique for Determination of Kinetic Parameters of Hydrogenation Reactions,” Comput. Chem. Eng., 32(7), pp. 1447–1455. [CrossRef]
Ishibuchi, H. , Yoshida, T. , and Murata, T. , 2003, “ Balance Between Genetic Search and Local Search in Memetic Algorithms for Multiobjective Permutation Flowshop Scheduling,” IEEE Trans. Evol. Comput., 7(2), Sept. 25–28, pp. 204–223. [CrossRef]
Kumar, A. , Sharma, D. , and Deb, K. , 2007, “ A Hybrid Multi-Objective Optimization Procedure Using PCX Based NSGA-II and Sequential Quadratic Programming,” 2007 IEEE Congress on Evolutionary Computation, Sept. 25–28, pp. 3011–3018.
Gao, X. , Chen, B. , He, X. , Qiu, T. , Li, J. , Wang, C. , and Zhang, L. , 2008, “ Multi-Objective Optimization for the Periodic Operation of the Naphtha Pyrolysis Process Using a New Parallel Hybrid Algorithm Combining NSGA-II With SQP,” Comput. Chem. Eng., 32(11), pp. 2801–2811. [CrossRef]
Hu, X. , and Wang, Z. , 2003, “ Hybridization of the Multi-Objective Evolutionary Algorithms and the Gradient-Based Algorithms,” The 2003 Congress on Evolutionary Computation, Dec. 8–12, pp. 870–877.
Guarneri, P. , Dandurand, B. , Fadel, G. , and Wiecek, M. M. , 2013, “ Bilevel Multiobjective Optimization of Vehicle Layout,” 10th World Congress on Structural and Multidisciplinary Optimization, Orlando, FL, May 19–24, pp. 19–24.
Kang, N. , Kokkolaras, M. , and Papalambros, P. Y. , 2014, “ Solving Multiobjective Optimization Problems Using Quasi-Separable MDO Formulations and Analytical Target Cascading,” Struct. Multidiscip. Optim., 50(5), pp. 849–859. [CrossRef]
Cheng, S. , Zhou, J. H. , and Li, M. , 2015, “ A New Hybrid Algorithm for Multi-Objective Robust Optimization With Interval Uncertainty,” ASME J. Mech. Des., 137(2), p. 021401. [CrossRef]
Gunawan, S. , 2004, “ Parameter Sensitivity Measures for Single Objective, Multi-Objective, and Feasibility Robust Design Optimization,” Ph.D. dissertation, Department of Mechanical Engineering, UMD, College Park, MD.
Deb, K. , Thiele, L. , Laumanns, M. , and Zitzler, E. , 2001, “ Scalable Test Problems for Evolutionary Multi-Objective Optimization,” TIK-Technical Report No. 112.

Figures

Grahic Jump Location
Fig. 1

Multi-objective solutions

Grahic Jump Location
Fig. 2

Hyperarea and overall spread

Grahic Jump Location
Fig. 3

Monotonicity of objective and domination relationship

Grahic Jump Location
Fig. 4

Set Z for a five-objective problem with two global variables

Grahic Jump Location
Fig. 5

Observations with one global and local variable(s)

Grahic Jump Location
Fig. 6

Observation with two global variables

Grahic Jump Location
Fig. 8

Pareto fronts of example 1 (a) results of WS, (b) results of NNC, and (c) results of S-MOO

Grahic Jump Location
Fig. 9

Pareto fronts of example 2 (a) results of WS, (b) results of NNC, and (c) results of S-MOO

Grahic Jump Location
Fig. 10

Pareto fronts of example 3 (a) results of WS, (b) results of NNC, and (c) results of S-MOO

Grahic Jump Location
Fig. 11

Pareto fronts of speed reducer (a) results of WS, (b) results of NNC, (c) results of S-MOO before inserting more points, and (d) results of S-MOO after inserting more points

Grahic Jump Location
Fig. 12

Pareto fronts for three-objective example (a) results of NNC and (b) results of S-MOO

Grahic Jump Location
Fig. 13

Illustration of the four-bar truss problem

Grahic Jump Location
Fig. 14

Pareto fronts for four-bar truss (a) results of WS, (b) results of NNC, and (c) results of S-MOO

Tables

Errata

Discussions

Some tools below are only available to our subscribers or users with an online account.

Related Content

Customize your page view by dragging and repositioning the boxes below.

Related Journal Articles
Related eBook Content
Topic Collections

Sorry! You do not have access to this content. For assistance or to subscribe, please contact us:

  • TELEPHONE: 1-800-843-2763 (Toll-free in the USA)
  • EMAIL: asmedigitalcollection@asme.org
Sign In