Back to search

Clemson University

Network Target Coordination for Design Optimization of Decomposed Systems

Abstract

dc:description.abstract

A complex engineered system is often decomposed into a number of different subsystems that interact on one another and together produce results not obtainable by the subsystems alone. Effective coordination of the interdependencies shared among these subsystems is critical to fulfill the stakeholder expectations and technical requirements of the original system. The past research has shown that various coordination methods obtain different solution accuracies and exhibit different computational efficiencies when solving a decomposed system. Addressing these coordination decisions may lead to improved complex system design. This dissertation studies coordination methods through two types of decomposition structures, hierarchical, and nonhierarchical. For coordinating hierarchically decomposed systems, linear and proximal cutting plane methods are applied based on augmented Lagrangian relaxation and analytical target cascading (ATC). Three nonconvex, nonlinear design problems are used to verify the numerical performance of the proposed coordination method and the obtained results are compared to traditional update schemes of subgradient-based algorithm. The results suggest that the cutting plane methods can significantly improve the solution accuracy and computational efficiency of the hierarchically decomposed systems. In addition, a biobjective optimization method is also used to capture optimality and feasibility. The numerical performance of the biobjective algorithm is verified by solving an analytical mass allocation problem. For coordinating nonhierarchically decomposed complex systems, network target coordination (NTC) is developed by modeling the distributed subsystems as different agents in a network. To realize parallel computing of the subsystems, NTC via a consensus alternating direction method of multipliers is applied to eliminate the use of the master problem, which is required by most distributed coordination methods. In NTC, the consensus is computed using a locally update scheme, providing the potential to realize an asynchronous solution process. The numerical performance of NTC is verified using a geometrical programming problem and two engineering problems.

Degree

thesis:*
Name thesis:degree_name
Doctor of Philosophy (PhD)
Level thesis:degree_level
Dissertation
Discipline thesis:degree_discipline
Mechanical Engineering

Author and committee

dc:creator, dc:contributor.*
Author dc:creator
  • Wang, Wenshan
Contributors dc:contributor
  • Fadel, Georges M
  • Li , Gang
  • Thompson , Lonny L
  • Wiecek , Margaret M

Subjects

dc:subject × 7

Identifiers

dc:identifier.*
Repository record dc:identifier
https://open.clemson.edu/all_dissertations/1071

Chain of custody

source
Harvested from
Clemson University
Base URL
open.clemson.edu/do/oai/
Last updated
2026-11-19
Source record
OAI-PMH GetRecord
citation

Wang, Wenshan. Network Target Coordination for Design Optimization of Decomposed Systems. Dissertation thesis, https://open.clemson.edu/all_dissertations/1071