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/ .

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

科研通是完全免费的文献互助平台,具备全网最快的应助速度,最高的求助完成率。 对每一个文献求助,科研通都将尽心尽力,给求助人一个满意的交代。
实时播报
刚刚
搜集达人应助科研通管家采纳,获得10
刚刚
刚刚
科研通AI6应助科研通管家采纳,获得10
刚刚
科研通AI2S应助科研通管家采纳,获得10
刚刚
大个应助科研通管家采纳,获得10
刚刚
1秒前
1秒前
1秒前
Frank应助放假啊可能采纳,获得10
1秒前
1秒前
慕青应助科研通管家采纳,获得10
1秒前
田様应助SCO采纳,获得10
1秒前
浮游应助科研通管家采纳,获得10
1秒前
科研通AI6应助科研通管家采纳,获得10
1秒前
chcmuer发布了新的文献求助10
1秒前
量子星尘发布了新的文献求助10
1秒前
科研通AI6应助科研通管家采纳,获得10
1秒前
可爱的函函应助叶子采纳,获得10
1秒前
1秒前
1秒前
1秒前
1秒前
1秒前
1秒前
1秒前
2秒前
搜集达人应助青鸟飞鱼采纳,获得10
2秒前
2秒前
逆蝶完成签到,获得积分10
2秒前
酷波er应助8y24dp采纳,获得10
2秒前
哑巴和喇叭完成签到 ,获得积分10
2秒前
小鱼干发布了新的文献求助10
3秒前
SciGPT应助内向士萧采纳,获得10
3秒前
3秒前
咖啡苦咔咔完成签到,获得积分10
3秒前
浮游应助yf990703采纳,获得10
3秒前
zz完成签到,获得积分10
4秒前
yznfly应助孙朱珠采纳,获得50
4秒前
ljlj发布了新的文献求助10
4秒前
高分求助中
(应助此贴封号)【重要!!请各用户(尤其是新用户)详细阅读】【科研通的精品贴汇总】 10000
Predation in the Hymenoptera: An Evolutionary Perspective 1800
List of 1,091 Public Pension Profiles by Region 1561
Binary Alloy Phase Diagrams, 2nd Edition 1400
Specialist Periodical Reports - Organometallic Chemistry Organometallic Chemistry: Volume 46 1000
Holistic Discourse Analysis 600
Beyond the sentence: discourse and sentential form / edited by Jessica R. Wirth 600
热门求助领域 (近24小时)
化学 材料科学 医学 生物 工程类 有机化学 生物化学 物理 纳米技术 计算机科学 内科学 化学工程 复合材料 物理化学 基因 遗传学 催化作用 冶金 量子力学 光电子学
热门帖子
关注 科研通微信公众号,转发送积分 5512592
求助须知:如何正确求助?哪些是违规求助? 4607038
关于积分的说明 14502582
捐赠科研通 4542444
什么是DOI,文献DOI怎么找? 2489039
邀请新用户注册赠送积分活动 1471072
关于科研通互助平台的介绍 1443218