换肾计划高效紧凑的配方

IF 6.7 1区 工程技术 Q1 COMPUTER SCIENCE, INTERDISCIPLINARY APPLICATIONS
{"title":"换肾计划高效紧凑的配方","authors":"","doi":"10.1016/j.cie.2024.110533","DOIUrl":null,"url":null,"abstract":"<div><p>This study develops a new compact mathematical formulation to improve transplant planning in a kidney exchange program with a long cycle size. Our proposed integer programming model uses a new index, called timeslot, to significantly improve the model’s solution time for problems with large cycle sizes. To enhance the performance of obtaining an optimal solution, we apply two procedures. First, we define an appropriate upper bound for the defined index that reduces the number of variables and constraints as the cycle size increases. Furthermore, we develop a variable reduction procedure to eliminate the redundant variables and strengthen its performance. Finally, we assess the model performance in a systematic computational comparison and demonstrate its advantages compared to the existing formulations in the literature.</p></div>","PeriodicalId":55220,"journal":{"name":"Computers & Industrial Engineering","volume":null,"pages":null},"PeriodicalIF":6.7000,"publicationDate":"2024-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Kidney exchange program: An efficient compact formulation\",\"authors\":\"\",\"doi\":\"10.1016/j.cie.2024.110533\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"<div><p>This study develops a new compact mathematical formulation to improve transplant planning in a kidney exchange program with a long cycle size. Our proposed integer programming model uses a new index, called timeslot, to significantly improve the model’s solution time for problems with large cycle sizes. To enhance the performance of obtaining an optimal solution, we apply two procedures. First, we define an appropriate upper bound for the defined index that reduces the number of variables and constraints as the cycle size increases. Furthermore, we develop a variable reduction procedure to eliminate the redundant variables and strengthen its performance. Finally, we assess the model performance in a systematic computational comparison and demonstrate its advantages compared to the existing formulations in the literature.</p></div>\",\"PeriodicalId\":55220,\"journal\":{\"name\":\"Computers & Industrial Engineering\",\"volume\":null,\"pages\":null},\"PeriodicalIF\":6.7000,\"publicationDate\":\"2024-09-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/S0360835224006545\",\"RegionNum\":1,\"RegionCategory\":\"工程技术\",\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"Q1\",\"JCRName\":\"COMPUTER SCIENCE, INTERDISCIPLINARY APPLICATIONS\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Computers & Industrial Engineering","FirstCategoryId":"5","ListUrlMain":"https://www.sciencedirect.com/science/article/pii/S0360835224006545","RegionNum":1,"RegionCategory":"工程技术","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q1","JCRName":"COMPUTER SCIENCE, INTERDISCIPLINARY APPLICATIONS","Score":null,"Total":0}
引用次数: 0

摘要

本研究开发了一种新的紧凑型数学公式,以改善周期较长的换肾计划中的移植规划。我们提出的整数编程模型使用了一个新的指标,称为 "timeslot",从而显著改善了该模型对大周期问题的求解时间。为了提高获得最优解的性能,我们采用了两种方法。首先,我们为定义的指数定义了一个适当的上限,随着周期大小的增加,该上限会减少变量和约束条件的数量。此外,我们还开发了一个变量缩减程序,以消除冗余变量并增强其性能。最后,我们通过系统的计算比较对模型性能进行了评估,并展示了其与文献中现有公式相比的优势。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
Kidney exchange program: An efficient compact formulation

This study develops a new compact mathematical formulation to improve transplant planning in a kidney exchange program with a long cycle size. Our proposed integer programming model uses a new index, called timeslot, to significantly improve the model’s solution time for problems with large cycle sizes. To enhance the performance of obtaining an optimal solution, we apply two procedures. First, we define an appropriate upper bound for the defined index that reduces the number of variables and constraints as the cycle size increases. Furthermore, we develop a variable reduction procedure to eliminate the redundant variables and strengthen its performance. Finally, we assess the model performance in a systematic computational comparison and demonstrate its advantages compared to the existing formulations in the literature.

求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
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学术官方微信