加权
一致性(知识库)
匹配(统计)
计算机科学
等级制度
选择(遗传算法)
算法
数学优化
有限元法
迭代法
可靠性工程
数学
工程类
统计
机器学习
人工智能
结构工程
医学
放射科
经济
市场经济
作者
Jeremy J. Michalek,Panos Y. Papalambros
标识
DOI:10.1115/detc2004-57134
摘要
Weighting coefficients are used in Analytical Target Cascading (ATC) at each element of the hierarchy to express the relative importance of matching targets passed from the parent element and maintaining consistency of linking variables and consistency with designs achieved by subsystem child elements. Proper selection of weight values is crucial when the top level targets are unattainable, for example when “stretch” targets are used. In this case, strict design consistency cannot be achieved with finite weights; however, it is possible to achieve arbitrarily small inconsistencies. This article presents an iterative method for finding weighting coefficients that achieve solutions within user-specified inconsistency tolerances and demonstrates its effectiveness with several examples. The method also led to reduced computational time in the demonstration examples.
科研通智能强力驱动
Strongly Powered by AbleSci AI