Journal of Heuristics最新文献

筛选
英文 中文
Heuristic-based allocation of supply constrained blood platelets in emerging economies. 新兴经济体中供应受限血小板的启发式分配
IF 1.1 4区 计算机科学
Journal of Heuristics Pub Date : 2021-01-01 Epub Date: 2021-04-28 DOI: 10.1007/s10732-021-09474-0
Fredrik Ødegaard, Sudipendra Nath Roy
{"title":"Heuristic-based allocation of supply constrained blood platelets in emerging economies.","authors":"Fredrik Ødegaard, Sudipendra Nath Roy","doi":"10.1007/s10732-021-09474-0","DOIUrl":"10.1007/s10732-021-09474-0","url":null,"abstract":"<p><p>Platelets are valuable, but highly perishable, blood components used in the treatment of, among others, viral dengue fever, blood-related illness, and post-chemotherapy following cancer. Given the short shelf-life of 3-5 days and a highly volatile supply and demand pattern, platelet inventory allocation is a challenging task. This is especially prevalent in emerging economies where demand variability is more pronounced due to neglected tropical diseases, and a perpetual shortage of supply. The consequences of which have given rise to an illegal 'red market'. Motivated by experience at a regional hospital in India, we investigate the problem of platelet allocation among three priority-differentiated demand streams. Specifically we consider a central hospital which, in addition to internal emergency and non-emergency requests, faces external demand from local clinics. We analyze the platelet allocation decision from a social planner's perspective and propose an allocation heuristic based on revenue management (RM) principles. The objective is to maximize total social benefit in a highly supply-constrained environment. Using data from the aforementioned Indian hospital as a case study, we conduct a numerical simulation and sensitivity analysis to evaluate the allocation heuristic. The performance of the RM-based policy is evaluated against the current sequential first come, first serve policy and two fixed proportion-based rationing policies. It is shown that the RM-based policy overall dominates, serves patients with the highest medical urgency better, and can curtail patients' need to procure platelets from commercial sources.</p>","PeriodicalId":54810,"journal":{"name":"Journal of Heuristics","volume":"27 1","pages":"719-745"},"PeriodicalIF":1.1,"publicationDate":"2021-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://www.ncbi.nlm.nih.gov/pmc/articles/PMC8079886/pdf/","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"43445389","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"OA","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
CMSA algorithm for solving the prioritized pairwise test data generation problem in software product lines 求解软件产品线中优先成对测试数据生成问题的CMSA算法
IF 2.7 4区 计算机科学
Journal of Heuristics Pub Date : 2020-11-10 DOI: 10.1007/s10732-020-09462-w
Javier Ferrer, F. Chicano, José Antonio Ortega-Toro
{"title":"CMSA algorithm for solving the prioritized pairwise test data generation problem in software product lines","authors":"Javier Ferrer, F. Chicano, José Antonio Ortega-Toro","doi":"10.1007/s10732-020-09462-w","DOIUrl":"https://doi.org/10.1007/s10732-020-09462-w","url":null,"abstract":"","PeriodicalId":54810,"journal":{"name":"Journal of Heuristics","volume":"27 1","pages":"229 - 249"},"PeriodicalIF":2.7,"publicationDate":"2020-11-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://sci-hub-pdf.com/10.1007/s10732-020-09462-w","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"52226565","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 5
Iterated local search for single machine total weighted tardiness batch scheduling 单机总加权延迟批量调度的迭代局部搜索
IF 2.7 4区 计算机科学
Journal of Heuristics Pub Date : 2020-11-09 DOI: 10.1007/s10732-020-09461-x
Eduardo Queiroga, Rian G. S. Pinheiro, Quentin Christ, A. Subramanian, A. Pessoa
{"title":"Iterated local search for single machine total weighted tardiness batch scheduling","authors":"Eduardo Queiroga, Rian G. S. Pinheiro, Quentin Christ, A. Subramanian, A. Pessoa","doi":"10.1007/s10732-020-09461-x","DOIUrl":"https://doi.org/10.1007/s10732-020-09461-x","url":null,"abstract":"","PeriodicalId":54810,"journal":{"name":"Journal of Heuristics","volume":"27 1","pages":"353 - 438"},"PeriodicalIF":2.7,"publicationDate":"2020-11-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://sci-hub-pdf.com/10.1007/s10732-020-09461-x","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"41386945","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 14
A reduced cost-based restriction and refinement matheuristic for stochastic network design problem 随机网络设计问题的一种基于降低成本的约束和改进数学方法
IF 2.7 4区 计算机科学
Journal of Heuristics Pub Date : 2020-10-24 DOI: 10.1007/s10732-020-09460-y
Fatemeh Sarayloo, T. Crainic, W. Rei
{"title":"A reduced cost-based restriction and refinement matheuristic for stochastic network design problem","authors":"Fatemeh Sarayloo, T. Crainic, W. Rei","doi":"10.1007/s10732-020-09460-y","DOIUrl":"https://doi.org/10.1007/s10732-020-09460-y","url":null,"abstract":"","PeriodicalId":54810,"journal":{"name":"Journal of Heuristics","volume":"27 1","pages":"325 - 351"},"PeriodicalIF":2.7,"publicationDate":"2020-10-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://sci-hub-pdf.com/10.1007/s10732-020-09460-y","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"44195320","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 4
Local search for the maximum k-plex problem 最大k-丛问题的局部搜索
IF 2.7 4区 计算机科学
Journal of Heuristics Pub Date : 2020-10-08 DOI: 10.1007/s10732-020-09459-5
W. Pullan
{"title":"Local search for the maximum k-plex problem","authors":"W. Pullan","doi":"10.1007/s10732-020-09459-5","DOIUrl":"https://doi.org/10.1007/s10732-020-09459-5","url":null,"abstract":"","PeriodicalId":54810,"journal":{"name":"Journal of Heuristics","volume":"27 1","pages":"303 - 324"},"PeriodicalIF":2.7,"publicationDate":"2020-10-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://sci-hub-pdf.com/10.1007/s10732-020-09459-5","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"46927453","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 3
Multi-level evolution strategies for high-resolution black-box control 高分辨率黑箱控制的多级进化策略
IF 2.7 4区 计算机科学
Journal of Heuristics Pub Date : 2020-10-04 DOI: 10.1007/s10732-021-09483-z
O. M. Shir, Xi Xing, H. Rabitz
{"title":"Multi-level evolution strategies for high-resolution black-box control","authors":"O. M. Shir, Xi Xing, H. Rabitz","doi":"10.1007/s10732-021-09483-z","DOIUrl":"https://doi.org/10.1007/s10732-021-09483-z","url":null,"abstract":"","PeriodicalId":54810,"journal":{"name":"Journal of Heuristics","volume":"27 1","pages":"1021 - 1055"},"PeriodicalIF":2.7,"publicationDate":"2020-10-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://sci-hub-pdf.com/10.1007/s10732-021-09483-z","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"46309130","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
Reactive VNS algorithm for the maximum k-subset intersection problem 最大k-子集交集问题的反应VNS算法
IF 2.7 4区 计算机科学
Journal of Heuristics Pub Date : 2020-09-04 DOI: 10.1007/s10732-020-09452-y
F. C. S. Dias, W. A. Tavares, José Robertty de Freitas Costa
{"title":"Reactive VNS algorithm for the maximum k-subset intersection problem","authors":"F. C. S. Dias, W. A. Tavares, José Robertty de Freitas Costa","doi":"10.1007/s10732-020-09452-y","DOIUrl":"https://doi.org/10.1007/s10732-020-09452-y","url":null,"abstract":"","PeriodicalId":54810,"journal":{"name":"Journal of Heuristics","volume":"26 1","pages":"913 - 941"},"PeriodicalIF":2.7,"publicationDate":"2020-09-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://sci-hub-pdf.com/10.1007/s10732-020-09452-y","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"47679269","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 2
Matheuristics to optimize refueling and maintenance planning of nuclear power plants 优化核电站换料和维修计划的数学
IF 2.7 4区 计算机科学
Journal of Heuristics Pub Date : 2020-09-02 DOI: 10.1007/s10732-020-09450-0
N. Dupin, E. Talbi
{"title":"Matheuristics to optimize refueling and maintenance planning of nuclear power plants","authors":"N. Dupin, E. Talbi","doi":"10.1007/s10732-020-09450-0","DOIUrl":"https://doi.org/10.1007/s10732-020-09450-0","url":null,"abstract":"","PeriodicalId":54810,"journal":{"name":"Journal of Heuristics","volume":"27 1","pages":"63 - 105"},"PeriodicalIF":2.7,"publicationDate":"2020-09-02","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://sci-hub-pdf.com/10.1007/s10732-020-09450-0","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"52226541","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 11
An adaptive large neighborhood search heuristic for the planar storage location assignment problem: application to stowage planning for Roll-on Roll-off ships 平面存储位置分配问题的自适应大邻域搜索启发式算法:在滚装船舶配载规划中的应用
IF 2.7 4区 计算机科学
Journal of Heuristics Pub Date : 2020-08-14 DOI: 10.1007/s10732-020-09451-z
Jone R. Hansen, K. Fagerholt, M. Stålhane, J. G. Rakke
{"title":"An adaptive large neighborhood search heuristic for the planar storage location assignment problem: application to stowage planning for Roll-on Roll-off ships","authors":"Jone R. Hansen, K. Fagerholt, M. Stålhane, J. G. Rakke","doi":"10.1007/s10732-020-09451-z","DOIUrl":"https://doi.org/10.1007/s10732-020-09451-z","url":null,"abstract":"","PeriodicalId":54810,"journal":{"name":"Journal of Heuristics","volume":"26 1","pages":"885 - 912"},"PeriodicalIF":2.7,"publicationDate":"2020-08-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://sci-hub-pdf.com/10.1007/s10732-020-09451-z","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"45495908","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 8
Correction to: A genetic algorithm for finding realistic sea routes considering the weather 修正:一种遗传算法,用于寻找考虑天气的实际海上航线
IF 2.7 4区 计算机科学
Journal of Heuristics Pub Date : 2020-07-23 DOI: 10.1007/s10732-020-09455-9
Stefan Kuhlemann, Kevin Tierney
{"title":"Correction to: A genetic algorithm for finding realistic sea routes considering the weather","authors":"Stefan Kuhlemann, Kevin Tierney","doi":"10.1007/s10732-020-09455-9","DOIUrl":"https://doi.org/10.1007/s10732-020-09455-9","url":null,"abstract":"","PeriodicalId":54810,"journal":{"name":"Journal of Heuristics","volume":"26 1","pages":"827 - 827"},"PeriodicalIF":2.7,"publicationDate":"2020-07-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://sci-hub-pdf.com/10.1007/s10732-020-09455-9","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"49050693","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 11
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
相关产品
×
本文献相关产品
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:604180095
Book学术官方微信
小红书