Run orders in factorial designs using the assignment–expansion method

IF 6.7 1区 工程技术 Q1 COMPUTER SCIENCE, INTERDISCIPLINARY APPLICATIONS
Romario A. Conto López , Alexander A. Correa Espinal , Olga C. Úsuga Manco , Pablo A. Maya Duque
{"title":"Run orders in factorial designs using the assignment–expansion method","authors":"Romario A. Conto López ,&nbsp;Alexander A. Correa Espinal ,&nbsp;Olga C. Úsuga Manco ,&nbsp;Pablo A. Maya Duque","doi":"10.1016/j.cie.2024.110844","DOIUrl":null,"url":null,"abstract":"<div><div>In the practical application of experimental design, the run order significantly impacts the efficiency of the estimations and the associated costs. Recently proposed ordering methods for factorial designs have mainly focused on minimizing the number of level changes while maintaining low bias, as it has not been possible to minimize both properties simultaneously. This paper introduces the assignment–expansion method, which implements optimization techniques to adapt the assignment problem and obtain sequential orders with a limited number of runs, thereby reducing the bias and the number of level changes. Subsequently, the expansion method is employed to generalize the desirable properties to designs with a greater number of factors and levels. This method proved able to obtain orders for more general factorial designs that turned out to have the desired properties and simultaneously minimized the bias and the number of level changes. Furthermore, some of these orders achieved minimum values for both criteria.</div></div>","PeriodicalId":55220,"journal":{"name":"Computers & Industrial Engineering","volume":"200 ","pages":"Article 110844"},"PeriodicalIF":6.7000,"publicationDate":"2025-02-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Computers & Industrial Engineering","FirstCategoryId":"5","ListUrlMain":"https://www.sciencedirect.com/science/article/pii/S0360835224009665","RegionNum":1,"RegionCategory":"工程技术","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q1","JCRName":"COMPUTER SCIENCE, INTERDISCIPLINARY APPLICATIONS","Score":null,"Total":0}
引用次数: 0

Abstract

In the practical application of experimental design, the run order significantly impacts the efficiency of the estimations and the associated costs. Recently proposed ordering methods for factorial designs have mainly focused on minimizing the number of level changes while maintaining low bias, as it has not been possible to minimize both properties simultaneously. This paper introduces the assignment–expansion method, which implements optimization techniques to adapt the assignment problem and obtain sequential orders with a limited number of runs, thereby reducing the bias and the number of level changes. Subsequently, the expansion method is employed to generalize the desirable properties to designs with a greater number of factors and levels. This method proved able to obtain orders for more general factorial designs that turned out to have the desired properties and simultaneously minimized the bias and the number of level changes. Furthermore, some of these orders achieved minimum values for both criteria.
求助全文
约1分钟内获得全文 求助全文
来源期刊
Computers & Industrial Engineering
Computers & Industrial Engineering 工程技术-工程:工业
CiteScore
12.70
自引率
12.70%
发文量
794
审稿时长
10.6 months
期刊介绍: Computers & Industrial Engineering (CAIE) is dedicated to researchers, educators, and practitioners in industrial engineering and related fields. Pioneering the integration of computers in research, education, and practice, industrial engineering has evolved to make computers and electronic communication integral to its domain. CAIE publishes original contributions focusing on the development of novel computerized methodologies to address industrial engineering problems. It also highlights the applications of these methodologies to issues within the broader industrial engineering and associated communities. The journal actively encourages submissions that push the boundaries of fundamental theories and concepts in industrial engineering techniques.
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术官方微信