An Iterative Exact Algorithm over a Time-Expanded Network for the Transportation of Biomedical Samples

算法 流量网络 计算机科学 数学优化 数学
作者
Daniel Mauricio Ocampo-Giraldo,Ana María Anaya-Arenas,Claudio Contardo
出处
期刊:Informs Journal on Computing
标识
DOI:10.1287/ijoc.2023.0061
摘要

In this article we propose an iterative algorithm to address the optimization problem of distributing a set of multiple highly perishable commodities in a healthcare network. In the biomedical sample transportation problem, numerous commodities with short lifespans presume multiple transportation requests at the same facility in a day and restrict the maximum time to reach their destination. These two characteristics create an interdependency between the routing and the pickup decisions in time that is highly complex. To address these timing issues, we model this problem as a service network design problem over a time-expanded network. Our solution method aggregates the network at two levels. First, the commodities are aggregated and artificially consolidated, reducing the symmetry arising when multiple transportation requests are solicited within a short period of time. Second, the space-time nodes in the network are constructed dynamically, thus reducing the size of the mathematical model to be solved at each iteration. Moreover, the method creates auxiliary networks to calculate good-quality primal bounds to the problem. Our algorithm proves to be efficient to solve a set of real-life instances from the Quebec laboratory network under the management of the Ministère de la Santé et des Services sociaux (Ministry of Health and Social Services) with a detailed network of up to 2,377 periods and 277 transportation requests. History: Accepted by Andrea Lodi, Area Editor for Design & Analysis of Algorithms—Discrete. Funding: This work was supported by the Natural Sciences and Engineering Research Council of Canada [Grants 2018-04609, 2020-06311]. Supplemental Material: The software that supports the findings of this study is available within the paper and its Supplemental Information ( https://pubsonline.informs.org/doi/suppl/10.1287/ijoc.2023.0061 ) as well as from the IJOC GitHub software repository ( https://github.com/INFORMSJoC/2023.0061 ). The complete IJOC Software and Data Repository is available at https://informsjoc.github.io/ .
最长约 10秒,即可获得该文献文件

科研通智能强力驱动
Strongly Powered by AbleSci AI
更新
PDF的下载单位、IP信息已删除 (2025-6-4)

科研通是完全免费的文献互助平台,具备全网最快的应助速度,最高的求助完成率。 对每一个文献求助,科研通都将尽心尽力,给求助人一个满意的交代。
实时播报
chen发布了新的文献求助10
1秒前
gyd发布了新的文献求助10
1秒前
1秒前
2秒前
Orange应助早睡不掉头发采纳,获得10
2秒前
NikiJu完成签到,获得积分10
2秒前
msn00完成签到,获得积分10
2秒前
Dr_Zhang完成签到 ,获得积分10
2秒前
ding应助伶俐的夜香采纳,获得10
3秒前
fangchenxi完成签到,获得积分10
3秒前
ltc0728完成签到,获得积分10
3秒前
3秒前
言希发布了新的文献求助10
4秒前
4秒前
Master发布了新的文献求助10
5秒前
5秒前
坦率的匪应助优雅翎采纳,获得10
5秒前
香蕉觅云应助林屿溪采纳,获得10
5秒前
方方方方方完成签到,获得积分10
8秒前
Lqiang发布了新的文献求助10
9秒前
FrozNineTivus完成签到,获得积分10
10秒前
11秒前
11秒前
philospipi应助rio采纳,获得10
13秒前
冷香咖啡完成签到,获得积分10
13秒前
李健的小迷弟应助fixing采纳,获得10
14秒前
小七发布了新的文献求助10
15秒前
15秒前
17秒前
充电宝应助Aurora采纳,获得10
17秒前
哭泣的麦当劳完成签到 ,获得积分10
17秒前
搜集达人应助evelsing采纳,获得10
18秒前
敛矜完成签到,获得积分10
18秒前
李健的小迷弟应助夜枫采纳,获得10
19秒前
WD发布了新的文献求助10
19秒前
嘿小黑应助李健采纳,获得150
20秒前
彩色的芝麻完成签到 ,获得积分10
20秒前
21秒前
22秒前
乾贝完成签到,获得积分10
24秒前
高分求助中
Picture Books with Same-sex Parented Families: Unintentional Censorship 1000
A new approach to the extrapolation of accelerated life test data 1000
ACSM’s Guidelines for Exercise Testing and Prescription, 12th edition 500
Nucleophilic substitution in azasydnone-modified dinitroanisoles 500
Indomethacinのヒトにおける経皮吸収 400
Phylogenetic study of the order Polydesmida (Myriapoda: Diplopoda) 370
基于可调谐半导体激光吸收光谱技术泄漏气体检测系统的研究 310
热门求助领域 (近24小时)
化学 材料科学 医学 生物 工程类 有机化学 生物化学 物理 内科学 纳米技术 计算机科学 化学工程 复合材料 遗传学 基因 物理化学 催化作用 冶金 细胞生物学 免疫学
热门帖子
关注 科研通微信公众号,转发送积分 3979719
求助须知:如何正确求助?哪些是违规求助? 3523760
关于积分的说明 11218505
捐赠科研通 3261224
什么是DOI,文献DOI怎么找? 1800507
邀请新用户注册赠送积分活动 879117
科研通“疑难数据库(出版商)”最低求助积分说明 807182