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)

科研通是完全免费的文献互助平台,具备全网最快的应助速度,最高的求助完成率。 对每一个文献求助,科研通都将尽心尽力,给求助人一个满意的交代。
实时播报
1秒前
2秒前
LZ的脑子发布了新的文献求助20
2秒前
方仔完成签到,获得积分10
2秒前
2秒前
make217完成签到 ,获得积分10
3秒前
CanLiu完成签到,获得积分10
3秒前
3秒前
yukky完成签到,获得积分10
4秒前
4秒前
科研通AI5应助yu采纳,获得30
4秒前
Lucas应助霞霞采纳,获得10
5秒前
方仔发布了新的文献求助10
5秒前
5秒前
5秒前
水晶完成签到,获得积分10
6秒前
科研通AI5应助jyyg采纳,获得10
6秒前
mailure发布了新的文献求助20
7秒前
沉默沛岚发布了新的文献求助10
7秒前
7秒前
师霸完成签到,获得积分10
7秒前
momucy完成签到,获得积分10
7秒前
小浣熊发布了新的文献求助10
7秒前
7秒前
鲸鱼发布了新的文献求助10
8秒前
8秒前
8秒前
Sunshine发布了新的文献求助10
8秒前
tyliu完成签到,获得积分10
8秒前
9秒前
momucy发布了新的文献求助10
10秒前
量子星尘发布了新的文献求助10
11秒前
11秒前
11秒前
adasdad完成签到,获得积分10
11秒前
李不开你发布了新的文献求助10
11秒前
12秒前
阿刚发布了新的文献求助10
13秒前
JazzWon完成签到,获得积分10
13秒前
ZYao65发布了新的文献求助10
15秒前
高分求助中
(应助此贴封号)【重要!!请各用户(尤其是新用户)详细阅读】【科研通的精品贴汇总】 10000
计划经济时代的工厂管理与工人状况(1949-1966)——以郑州市国营工厂为例 500
INQUIRY-BASED PEDAGOGY TO SUPPORT STEM LEARNING AND 21ST CENTURY SKILLS: PREPARING NEW TEACHERS TO IMPLEMENT PROJECT AND PROBLEM-BASED LEARNING 500
The Pedagogical Leadership in the Early Years (PLEY) Quality Rating Scale 410
Modern Britain, 1750 to the Present (第2版) 300
Writing to the Rhythm of Labor Cultural Politics of the Chinese Revolution, 1942–1976 300
Lightning Wires: The Telegraph and China's Technological Modernization, 1860-1890 250
热门求助领域 (近24小时)
化学 材料科学 医学 生物 工程类 有机化学 生物化学 物理 纳米技术 计算机科学 内科学 化学工程 复合材料 物理化学 基因 催化作用 遗传学 冶金 电极 光电子学
热门帖子
关注 科研通微信公众号,转发送积分 4600474
求助须知:如何正确求助?哪些是违规求助? 4010608
关于积分的说明 12416866
捐赠科研通 3690360
什么是DOI,文献DOI怎么找? 2034326
邀请新用户注册赠送积分活动 1067728
科研通“疑难数据库(出版商)”最低求助积分说明 952513