张芸芝, 张文超, 王晓迪, 陈雪平. 先验约束条件下的最优次序添加设计[J]. 应用概率统计. DOI: 10.12460/j.issn.1001-4268.aps.2024.2022134
引用本文: 张芸芝, 张文超, 王晓迪, 陈雪平. 先验约束条件下的最优次序添加设计[J]. 应用概率统计. DOI: 10.12460/j.issn.1001-4268.aps.2024.2022134
ZHANG Yunzhi, ZHANG Wenchao, WANG Xiaodi, CHEN Xueping. Optimal Order-of-Addition Experiments under a Prior Constraint[J]. Chinese Journal of Applied Probability and Statistics. DOI: 10.12460/j.issn.1001-4268.aps.2024.2022134
Citation: ZHANG Yunzhi, ZHANG Wenchao, WANG Xiaodi, CHEN Xueping. Optimal Order-of-Addition Experiments under a Prior Constraint[J]. Chinese Journal of Applied Probability and Statistics. DOI: 10.12460/j.issn.1001-4268.aps.2024.2022134

先验约束条件下的最优次序添加设计

Optimal Order-of-Addition Experiments under a Prior Constraint

  • 摘要: 添加次序试验广泛存在于许多领域, 包括食品和工业生产等. 当成分个数较大时,所有的排列试验非常大, 实际也无法完成. 特别在实际试验中, 往往需要考虑某些先验信息, 比如已知成分 i 必须安排在成分 j 之前. 本文探讨了在相关约束条件下如何构造最优次序添加设计问题. 首先给出了一个带有约束条件的 PWO 模型, 然后通过改进的阈值接受算法, 构造了具有最小点次序添加试验的 D-最优设计. 最后通过带有先验约束的作业调度教学案例, 验证了该方法的有效性.

     

    Abstract: The order-of-addition experiments exist widely in many fields, including food and industrial production, but the relative research under prior constraints is limited. The purpose of this paper aims to select an optimal sequence under the restriction that component i is added before j, while it is unachievable to compare all sequences when the number of components m is large. To achieve this, a constrained PWO model is first provided, and then the D-optimal designs for order-of addition experiments with minimal-points via the modified threshold accepting algorithm is established. The effectiveness of the proposed method is demonstrated by a job scheduling problem with a prior constraint for also teaching cases.

     

/

返回文章
返回