0

Full Content is available to subscribers

Subscribe/Learn More  >

A New Multi-Objective Mixed-Discrete Particle Swarm Optimization Algorithm

[+] Author Affiliations
Weiyang Tong

Syracuse University, Syracuse, NY

Souma Chowdhury

Mississippi State University, Starkville, MS

Achille Messac

Mississippi State University, Mississippi State, MS

Paper No. DETC2014-35572, pp. V02AT03A017; 10 pages
doi:10.1115/DETC2014-35572
From:
  • ASME 2014 International Design Engineering Technical Conferences and Computers and Information in Engineering Conference
  • Volume 2A: 40th Design Automation Conference
  • Buffalo, New York, USA, August 17–20, 2014
  • Conference Sponsors: Design Engineering Division, Computers and Information in Engineering Division
  • ISBN: 978-0-7918-4631-5
  • Copyright © 2014 by ASME

abstract

Complex system design problems tend to be high dimensional and nonlinear, and also often involve multiple objectives and mixed-integer variables. Heuristic optimization algorithms have the potential to address the typical (if not most) characteristics of such complex problems. Among them, the Particle Swarm Optimization (PSO) algorithm has gained significant popularity due to its maturity and fast convergence abilities. This paper seeks to translate the unique benefits of PSO from solving typical continuous single-objective optimization problems to solving multi-objective mixed-discrete problems, which is a relatively new ground for PSO application. The previously developed Mixed-Discrete Particle Swarm Optimization (MDPSO) algorithm, which includes an exclusive diversity preservation technique to prevent premature particle clustering, has been shown to be a powerful single-objective solver for highly constrained MINLP problems. In this paper, we make fundamental advancements to the MDPSO algorithm, enabling it to solve challenging multi-objective problems with mixed-discrete design variables. In the velocity update equation, the explorative term is modified to point towards the non-dominated solution that is the closest to the corresponding particle (at any iteration). The fractional domain in the diversity preservation technique, which was previously defined in terms of a single global leader, is now applied to multiple global leaders in the intermediate Pareto front. The multi-objective MDPSO (MO-MDPSO) algorithm is tested using a suite of diverse benchmark problems and a disc-brake design problem. To illustrate the advantages of the new MO-MDPSO algorithm, the results are compared with those given by the popular Elitist Non-dominated Sorting Genetic Algorithm-II (NSGA-II).

Copyright © 2014 by ASME

Figures

Tables

Interactive Graphics

Video

Country-Specific Mortality and Growth Failure in Infancy and Yound Children and Association With Material Stature

Use interactive graphics and maps to view and sort country-specific infant and early dhildhood mortality and growth failure data and their association with maternal

NOTE:
Citing articles are presented as examples only. In non-demo SCM6 implementation, integration with CrossRef’s "Cited By" API will populate this tab (http://www.crossref.org/citedby.html).

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 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