A robust possibilistic programming framework for designing an organ transplant supply chain under uncertainty
Organ transplantation is a crucial task in the healthcare supply chain, which organizes the supply and demand for various vital organs. In this regard, dealing with uncertainty is one of the main challengings in designing an organ transplant supply chain. To address this gap, in the present research...
Gespeichert in:
Veröffentlicht in: | Annals of operations research 2023-09, Vol.328 (1), p.493-530 |
---|---|
Hauptverfasser: | , , |
Format: | Artikel |
Sprache: | eng |
Schlagworte: | |
Online-Zugang: | Volltext |
Tags: |
Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
|
container_end_page | 530 |
---|---|
container_issue | 1 |
container_start_page | 493 |
container_title | Annals of operations research |
container_volume | 328 |
creator | Goli, Alireza Ala, Ali Mirjalili, Seyedali |
description | Organ transplantation is a crucial task in the healthcare supply chain, which organizes the supply and demand for various vital organs. In this regard, dealing with uncertainty is one of the main challengings in designing an organ transplant supply chain. To address this gap, in the present research, a mathematical formulation and solution method is proposed to optimize the organ transplants supply chain under shipment time uncertainty. A possibilistic programming model and simulation-based solution method are developed for organ transplant center location, allocation, and distribution. The proposed mathematical model optimizes the overall cost by considering the fuzzy uncertainty of organ demands and transportation time. Moreover, a novel simulation-based optimization is applied using the credibility theory to deal with the uncertainty in the optimization of this mathematical model. In addition, the proposed model and solution method are evaluated by implementing different test problems. The numerical results demonstrate that the optimal credibility level is between 0.2 and 0.6 in all tested cases. Moreover, the patient’s satisfaction rate is higher than the viability rate in the designed organ supply chain. |
doi_str_mv | 10.1007/s10479-022-04829-7 |
format | Article |
fullrecord | <record><control><sourceid>proquest_cross</sourceid><recordid>TN_cdi_proquest_journals_2850915506</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><sourcerecordid>2850915506</sourcerecordid><originalsourceid>FETCH-LOGICAL-c319t-6d6b7cf41aba1bb543a0e681a327e054566bae5d7a5453069f96e483f97075a13</originalsourceid><addsrcrecordid>eNp9UE1LxDAQDaLguvoHPAU8VydJkzTHZfELFrzoOaRtWrO2aU1aZP-9WSt48zLzZnhvhvcQuiZwSwDkXSSQS5UBpRnkBVWZPEErwiXNFGPFKVoB5XnGGYNzdBHjHgAIKfgK9RschnKOEx6HGF3pOhcnV-ExDG0wfe98i5sE7NcQPnAzBFzb6Fp_3BuPh9CmOgXj49gZP-E4j2N3wNW7cR7PvrYh1cqGKc3T4RKdNaaL9uq3r9Hbw_3r9inbvTw-bze7rGJETZmoRSmrJiemNKQsec4MWFEQw6i0wHMuRGksr6VJmIFQjRI2L1ijJEhuCFujm-VusvE52zjp_TAHn15qWnBQhHMQiUUXVhWS92AbPQbXm3DQBPQxVr3EqlOs-idWLZOILaKYyL614e_0P6pvibR84g</addsrcrecordid><sourcetype>Aggregation Database</sourcetype><iscdi>true</iscdi><recordtype>article</recordtype><pqid>2850915506</pqid></control><display><type>article</type><title>A robust possibilistic programming framework for designing an organ transplant supply chain under uncertainty</title><source>SpringerNature Journals</source><source>EBSCOhost Business Source Complete</source><creator>Goli, Alireza ; Ala, Ali ; Mirjalili, Seyedali</creator><creatorcontrib>Goli, Alireza ; Ala, Ali ; Mirjalili, Seyedali</creatorcontrib><description>Organ transplantation is a crucial task in the healthcare supply chain, which organizes the supply and demand for various vital organs. In this regard, dealing with uncertainty is one of the main challengings in designing an organ transplant supply chain. To address this gap, in the present research, a mathematical formulation and solution method is proposed to optimize the organ transplants supply chain under shipment time uncertainty. A possibilistic programming model and simulation-based solution method are developed for organ transplant center location, allocation, and distribution. The proposed mathematical model optimizes the overall cost by considering the fuzzy uncertainty of organ demands and transportation time. Moreover, a novel simulation-based optimization is applied using the credibility theory to deal with the uncertainty in the optimization of this mathematical model. In addition, the proposed model and solution method are evaluated by implementing different test problems. The numerical results demonstrate that the optimal credibility level is between 0.2 and 0.6 in all tested cases. Moreover, the patient’s satisfaction rate is higher than the viability rate in the designed organ supply chain.</description><identifier>ISSN: 0254-5330</identifier><identifier>EISSN: 1572-9338</identifier><identifier>DOI: 10.1007/s10479-022-04829-7</identifier><language>eng</language><publisher>New York: Springer US</publisher><subject>Business and Management ; Combinatorics ; Mathematical analysis ; Mathematical models ; Operations research ; Operations Research/Decision Theory ; Optimization ; Original Research ; Robustness (mathematics) ; Supply chains ; Theory of Computation ; Transplantation ; Transplants ; Transplants & implants ; Uncertainty</subject><ispartof>Annals of operations research, 2023-09, Vol.328 (1), p.493-530</ispartof><rights>The Author(s), under exclusive licence to Springer Science+Business Media, LLC, part of Springer Nature 2022</rights><rights>The Author(s), under exclusive licence to Springer Science+Business Media, LLC, part of Springer Nature 2022.</rights><lds50>peer_reviewed</lds50><woscitedreferencessubscribed>false</woscitedreferencessubscribed><citedby>FETCH-LOGICAL-c319t-6d6b7cf41aba1bb543a0e681a327e054566bae5d7a5453069f96e483f97075a13</citedby><cites>FETCH-LOGICAL-c319t-6d6b7cf41aba1bb543a0e681a327e054566bae5d7a5453069f96e483f97075a13</cites><orcidid>0000-0001-9535-9902</orcidid></display><links><openurl>$$Topenurl_article</openurl><openurlfulltext>$$Topenurlfull_article</openurlfulltext><thumbnail>$$Tsyndetics_thumb_exl</thumbnail><linktopdf>$$Uhttps://link.springer.com/content/pdf/10.1007/s10479-022-04829-7$$EPDF$$P50$$Gspringer$$H</linktopdf><linktohtml>$$Uhttps://link.springer.com/10.1007/s10479-022-04829-7$$EHTML$$P50$$Gspringer$$H</linktohtml><link.rule.ids>315,781,785,27928,27929,41492,42561,51323</link.rule.ids></links><search><creatorcontrib>Goli, Alireza</creatorcontrib><creatorcontrib>Ala, Ali</creatorcontrib><creatorcontrib>Mirjalili, Seyedali</creatorcontrib><title>A robust possibilistic programming framework for designing an organ transplant supply chain under uncertainty</title><title>Annals of operations research</title><addtitle>Ann Oper Res</addtitle><description>Organ transplantation is a crucial task in the healthcare supply chain, which organizes the supply and demand for various vital organs. In this regard, dealing with uncertainty is one of the main challengings in designing an organ transplant supply chain. To address this gap, in the present research, a mathematical formulation and solution method is proposed to optimize the organ transplants supply chain under shipment time uncertainty. A possibilistic programming model and simulation-based solution method are developed for organ transplant center location, allocation, and distribution. The proposed mathematical model optimizes the overall cost by considering the fuzzy uncertainty of organ demands and transportation time. Moreover, a novel simulation-based optimization is applied using the credibility theory to deal with the uncertainty in the optimization of this mathematical model. In addition, the proposed model and solution method are evaluated by implementing different test problems. The numerical results demonstrate that the optimal credibility level is between 0.2 and 0.6 in all tested cases. Moreover, the patient’s satisfaction rate is higher than the viability rate in the designed organ supply chain.</description><subject>Business and Management</subject><subject>Combinatorics</subject><subject>Mathematical analysis</subject><subject>Mathematical models</subject><subject>Operations research</subject><subject>Operations Research/Decision Theory</subject><subject>Optimization</subject><subject>Original Research</subject><subject>Robustness (mathematics)</subject><subject>Supply chains</subject><subject>Theory of Computation</subject><subject>Transplantation</subject><subject>Transplants</subject><subject>Transplants & implants</subject><subject>Uncertainty</subject><issn>0254-5330</issn><issn>1572-9338</issn><fulltext>true</fulltext><rsrctype>article</rsrctype><creationdate>2023</creationdate><recordtype>article</recordtype><sourceid>ABUWG</sourceid><sourceid>AFKRA</sourceid><sourceid>AZQEC</sourceid><sourceid>BENPR</sourceid><sourceid>CCPQU</sourceid><sourceid>DWQXO</sourceid><sourceid>GNUQQ</sourceid><recordid>eNp9UE1LxDAQDaLguvoHPAU8VydJkzTHZfELFrzoOaRtWrO2aU1aZP-9WSt48zLzZnhvhvcQuiZwSwDkXSSQS5UBpRnkBVWZPEErwiXNFGPFKVoB5XnGGYNzdBHjHgAIKfgK9RschnKOEx6HGF3pOhcnV-ExDG0wfe98i5sE7NcQPnAzBFzb6Fp_3BuPh9CmOgXj49gZP-E4j2N3wNW7cR7PvrYh1cqGKc3T4RKdNaaL9uq3r9Hbw_3r9inbvTw-bze7rGJETZmoRSmrJiemNKQsec4MWFEQw6i0wHMuRGksr6VJmIFQjRI2L1ijJEhuCFujm-VusvE52zjp_TAHn15qWnBQhHMQiUUXVhWS92AbPQbXm3DQBPQxVr3EqlOs-idWLZOILaKYyL614e_0P6pvibR84g</recordid><startdate>20230901</startdate><enddate>20230901</enddate><creator>Goli, Alireza</creator><creator>Ala, Ali</creator><creator>Mirjalili, Seyedali</creator><general>Springer US</general><general>Springer Nature B.V</general><scope>AAYXX</scope><scope>CITATION</scope><scope>3V.</scope><scope>7TA</scope><scope>7TB</scope><scope>7WY</scope><scope>7WZ</scope><scope>7XB</scope><scope>87Z</scope><scope>88I</scope><scope>8AL</scope><scope>8AO</scope><scope>8FD</scope><scope>8FE</scope><scope>8FG</scope><scope>8FK</scope><scope>8FL</scope><scope>ABJCF</scope><scope>ABUWG</scope><scope>AFKRA</scope><scope>ARAPS</scope><scope>AZQEC</scope><scope>BENPR</scope><scope>BEZIV</scope><scope>BGLVJ</scope><scope>CCPQU</scope><scope>DWQXO</scope><scope>FR3</scope><scope>FRNLG</scope><scope>F~G</scope><scope>GNUQQ</scope><scope>HCIFZ</scope><scope>JG9</scope><scope>JQ2</scope><scope>K60</scope><scope>K6~</scope><scope>K7-</scope><scope>KR7</scope><scope>L.-</scope><scope>L6V</scope><scope>M0C</scope><scope>M0N</scope><scope>M2P</scope><scope>M7S</scope><scope>P5Z</scope><scope>P62</scope><scope>PQBIZ</scope><scope>PQBZA</scope><scope>PQEST</scope><scope>PQQKQ</scope><scope>PQUKI</scope><scope>PTHSS</scope><scope>Q9U</scope><orcidid>https://orcid.org/0000-0001-9535-9902</orcidid></search><sort><creationdate>20230901</creationdate><title>A robust possibilistic programming framework for designing an organ transplant supply chain under uncertainty</title><author>Goli, Alireza ; Ala, Ali ; Mirjalili, Seyedali</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-LOGICAL-c319t-6d6b7cf41aba1bb543a0e681a327e054566bae5d7a5453069f96e483f97075a13</frbrgroupid><rsrctype>articles</rsrctype><prefilter>articles</prefilter><language>eng</language><creationdate>2023</creationdate><topic>Business and Management</topic><topic>Combinatorics</topic><topic>Mathematical analysis</topic><topic>Mathematical models</topic><topic>Operations research</topic><topic>Operations Research/Decision Theory</topic><topic>Optimization</topic><topic>Original Research</topic><topic>Robustness (mathematics)</topic><topic>Supply chains</topic><topic>Theory of Computation</topic><topic>Transplantation</topic><topic>Transplants</topic><topic>Transplants & implants</topic><topic>Uncertainty</topic><toplevel>peer_reviewed</toplevel><toplevel>online_resources</toplevel><creatorcontrib>Goli, Alireza</creatorcontrib><creatorcontrib>Ala, Ali</creatorcontrib><creatorcontrib>Mirjalili, Seyedali</creatorcontrib><collection>CrossRef</collection><collection>ProQuest Central (Corporate)</collection><collection>Materials Business File</collection><collection>Mechanical & Transportation Engineering Abstracts</collection><collection>Access via ABI/INFORM (ProQuest)</collection><collection>ABI/INFORM Global (PDF only)</collection><collection>ProQuest Central (purchase pre-March 2016)</collection><collection>ABI/INFORM Global (Alumni Edition)</collection><collection>Science Database (Alumni Edition)</collection><collection>Computing Database (Alumni Edition)</collection><collection>ProQuest Pharma Collection</collection><collection>Technology Research Database</collection><collection>ProQuest SciTech Collection</collection><collection>ProQuest Technology Collection</collection><collection>ProQuest Central (Alumni) (purchase pre-March 2016)</collection><collection>ABI/INFORM Collection (Alumni Edition)</collection><collection>Materials Science & Engineering Collection</collection><collection>ProQuest Central (Alumni Edition)</collection><collection>ProQuest Central UK/Ireland</collection><collection>Advanced Technologies & Aerospace Collection</collection><collection>ProQuest Central Essentials</collection><collection>ProQuest Central</collection><collection>Business Premium Collection</collection><collection>Technology Collection</collection><collection>ProQuest One Community College</collection><collection>ProQuest Central Korea</collection><collection>Engineering Research Database</collection><collection>Business Premium Collection (Alumni)</collection><collection>ABI/INFORM Global (Corporate)</collection><collection>ProQuest Central Student</collection><collection>SciTech Premium Collection</collection><collection>Materials Research Database</collection><collection>ProQuest Computer Science Collection</collection><collection>ProQuest Business Collection (Alumni Edition)</collection><collection>ProQuest Business Collection</collection><collection>Computer Science Database</collection><collection>Civil Engineering Abstracts</collection><collection>ABI/INFORM Professional Advanced</collection><collection>ProQuest Engineering Collection</collection><collection>ABI/INFORM Global</collection><collection>Computing Database</collection><collection>Science Database</collection><collection>Engineering Database</collection><collection>Advanced Technologies & Aerospace Database</collection><collection>ProQuest Advanced Technologies & Aerospace Collection</collection><collection>ProQuest One Business</collection><collection>ProQuest One Business (Alumni)</collection><collection>ProQuest One Academic Eastern Edition (DO NOT USE)</collection><collection>ProQuest One Academic</collection><collection>ProQuest One Academic UKI Edition</collection><collection>Engineering Collection</collection><collection>ProQuest Central Basic</collection><jtitle>Annals of operations research</jtitle></facets><delivery><delcategory>Remote Search Resource</delcategory><fulltext>fulltext</fulltext></delivery><addata><au>Goli, Alireza</au><au>Ala, Ali</au><au>Mirjalili, Seyedali</au><format>journal</format><genre>article</genre><ristype>JOUR</ristype><atitle>A robust possibilistic programming framework for designing an organ transplant supply chain under uncertainty</atitle><jtitle>Annals of operations research</jtitle><stitle>Ann Oper Res</stitle><date>2023-09-01</date><risdate>2023</risdate><volume>328</volume><issue>1</issue><spage>493</spage><epage>530</epage><pages>493-530</pages><issn>0254-5330</issn><eissn>1572-9338</eissn><abstract>Organ transplantation is a crucial task in the healthcare supply chain, which organizes the supply and demand for various vital organs. In this regard, dealing with uncertainty is one of the main challengings in designing an organ transplant supply chain. To address this gap, in the present research, a mathematical formulation and solution method is proposed to optimize the organ transplants supply chain under shipment time uncertainty. A possibilistic programming model and simulation-based solution method are developed for organ transplant center location, allocation, and distribution. The proposed mathematical model optimizes the overall cost by considering the fuzzy uncertainty of organ demands and transportation time. Moreover, a novel simulation-based optimization is applied using the credibility theory to deal with the uncertainty in the optimization of this mathematical model. In addition, the proposed model and solution method are evaluated by implementing different test problems. The numerical results demonstrate that the optimal credibility level is between 0.2 and 0.6 in all tested cases. Moreover, the patient’s satisfaction rate is higher than the viability rate in the designed organ supply chain.</abstract><cop>New York</cop><pub>Springer US</pub><doi>10.1007/s10479-022-04829-7</doi><tpages>38</tpages><orcidid>https://orcid.org/0000-0001-9535-9902</orcidid></addata></record> |
fulltext | fulltext |
identifier | ISSN: 0254-5330 |
ispartof | Annals of operations research, 2023-09, Vol.328 (1), p.493-530 |
issn | 0254-5330 1572-9338 |
language | eng |
recordid | cdi_proquest_journals_2850915506 |
source | SpringerNature Journals; EBSCOhost Business Source Complete |
subjects | Business and Management Combinatorics Mathematical analysis Mathematical models Operations research Operations Research/Decision Theory Optimization Original Research Robustness (mathematics) Supply chains Theory of Computation Transplantation Transplants Transplants & implants Uncertainty |
title | A robust possibilistic programming framework for designing an organ transplant supply chain under uncertainty |
url | https://sfx.bib-bvb.de/sfx_tum?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2024-12-16T21%3A11%3A32IST&url_ver=Z39.88-2004&url_ctx_fmt=infofi/fmt:kev:mtx:ctx&rfr_id=info:sid/primo.exlibrisgroup.com:primo3-Article-proquest_cross&rft_val_fmt=info:ofi/fmt:kev:mtx:journal&rft.genre=article&rft.atitle=A%20robust%20possibilistic%20programming%20framework%20for%20designing%20an%20organ%20transplant%20supply%20chain%20under%20uncertainty&rft.jtitle=Annals%20of%20operations%20research&rft.au=Goli,%20Alireza&rft.date=2023-09-01&rft.volume=328&rft.issue=1&rft.spage=493&rft.epage=530&rft.pages=493-530&rft.issn=0254-5330&rft.eissn=1572-9338&rft_id=info:doi/10.1007/s10479-022-04829-7&rft_dat=%3Cproquest_cross%3E2850915506%3C/proquest_cross%3E%3Curl%3E%3C/url%3E&disable_directlink=true&sfx.directlink=off&sfx.report_link=0&rft_id=info:oai/&rft_pqid=2850915506&rft_id=info:pmid/&rfr_iscdi=true |