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)

科研通是完全免费的文献互助平台,具备全网最快的应助速度,最高的求助完成率。 对每一个文献求助,科研通都将尽心尽力,给求助人一个满意的交代。
实时播报
刚刚
科研通AI5应助神勇长颈鹿采纳,获得10
刚刚
研友_nVWP2Z完成签到 ,获得积分0
1秒前
2秒前
科研狗完成签到 ,获得积分20
2秒前
3秒前
3秒前
科研通AI6应助Zxc采纳,获得10
3秒前
4秒前
田様应助孔凡悦采纳,获得10
4秒前
5秒前
5秒前
5秒前
cometx完成签到 ,获得积分10
6秒前
135发布了新的文献求助10
6秒前
6秒前
椰椰鲨发布了新的文献求助30
7秒前
张凤发布了新的文献求助10
8秒前
8秒前
ZYZ完成签到,获得积分10
8秒前
yxf完成签到,获得积分10
8秒前
9秒前
谦让R发布了新的文献求助10
9秒前
万能图书馆应助z69823采纳,获得30
11秒前
Time发布了新的文献求助10
11秒前
善学以致用应助李春丽采纳,获得10
11秒前
量子星尘发布了新的文献求助10
12秒前
13秒前
浮游应助傲娇的觅翠采纳,获得10
14秒前
ymr发布了新的文献求助10
15秒前
孔凡悦发布了新的文献求助10
17秒前
17秒前
谦让R完成签到,获得积分10
18秒前
大模型应助Lven采纳,获得10
18秒前
19秒前
思源应助科研通管家采纳,获得10
20秒前
烟花应助科研通管家采纳,获得10
20秒前
上官若男应助科研通管家采纳,获得10
20秒前
领导范儿应助科研通管家采纳,获得10
20秒前
Hello应助科研通管家采纳,获得10
20秒前
高分求助中
(应助此贴封号)【重要!!请各用户(尤其是新用户)详细阅读】【科研通的精品贴汇总】 10000
Einführung in die Rechtsphilosophie und Rechtstheorie der Gegenwart 1500
Binary Alloy Phase Diagrams, 2nd Edition 1000
青少年心理适应性量表(APAS)使用手册 700
Air Transportation A Global Management Perspective 9th Edition 700
DESIGN GUIDE FOR SHIPBOARD AIRBORNE NOISE CONTROL 600
NMR in Plants and Soils: New Developments in Time-domain NMR and Imaging 600
热门求助领域 (近24小时)
化学 医学 生物 材料科学 工程类 有机化学 内科学 生物化学 物理 计算机科学 纳米技术 遗传学 基因 复合材料 化学工程 物理化学 病理 催化作用 免疫学 量子力学
热门帖子
关注 科研通微信公众号,转发送积分 4979618
求助须知:如何正确求助?哪些是违规求助? 4232294
关于积分的说明 13182934
捐赠科研通 4023273
什么是DOI,文献DOI怎么找? 2201279
邀请新用户注册赠送积分活动 1213717
关于科研通互助平台的介绍 1129916