東華大學圖書館 |

Optimal Design and Operation of WHO-EPI Vaccine Distribution Chains.

紀錄類型:	書目-電子資源 : Monograph/item
正題名/作者:	Optimal Design and Operation of WHO-EPI Vaccine Distribution Chains./
作者:	Yang, Yuwen.
面頁冊數:	1 online resource (171 pages)
附註:	Source: Dissertations Abstracts International, Volume: 82-09, Section: B.
Contained By:	Dissertations Abstracts International82-09B.
標題:	International conferences. -
電子資源:	http://pqdd.sinica.edu.tw/twdaoapp/servlet/advanced?query=28370996click for full text (PQDT)
ISBN:	9798582554226

Optimal Design and Operation of WHO-EPI Vaccine Distribution Chains.
Yang, Yuwen.

Optimal Design and Operation of WHO-EPI Vaccine Distribution Chains. - 1 online resource (171 pages)

Source: Dissertations Abstracts International, Volume: 82-09, Section: B.

Thesis (Ph.D.)--University of Pittsburgh, 2020.

Includes bibliographical references

Vaccination has been proven to be the most effective method to prevent infectious diseases and in 1974 the World Health Organization (WHO) established the Expanded Programme on Immunization (EPI) to provide universal access to all important vaccines for all children, with a special focus on underserved low- and middle-income countries. However, there are still roughly 20 million infants worldwide who lack access to routine immunization services and remain at risk, and millions of additional deaths could be avoided if global vaccination coverage could improve. The broad goal of this research is to optimize the design and operation of the WHO-EPI vaccine distribution chain in these underserved low- and middle-income countries. We first present a network design problem for a general WHO-EPI vaccine distribution network by developing a mathematical model that formulates the network design problem as a mixed integer program (MIP). We then present three algorithms for typical problems that are too large to be solved using commercial MIP software. We test the algorithms using data derived from four different countries in sub-Saharan Africa and show that with our final algorithm, high-quality solutions are obtained for even the largest problems within a few minutes. We then discuss the problem of outreach to remote population centers when resources are limited and direct clinic service is unavailable. A set of these remote population centers is chosen, and over an appropriate planning period, teams of clinicians and support personnel are sent from a depot to set up mobile clinics at these locations to vaccinate people there and in the immediate surrounding area. We formulate the problem of designing outreach efforts as an MIP that is a combination of a set covering problem and a vehicle routing problem. We then incorporate uncertainty to study the robustness of the worst-case solutions and the related issue of the value of information. Finally, we study a variation of the outreach problem that combines Set Covering and the Traveling Salesmen Problem and provides an MIP formulation to solve the problem. Motivated by applications where the optimal policy needs to be updated on a regular basis and where repetitively solving this via MIP can be computationally expensive, we propose a machine learning approach to effectively deal with this problem by providing an opportunity to learn from historical optimal solutions that are derived from the MIP formulation. We also present a case study on outreach operations and provide numerical results. Our results show that while the novel machine learning based mechanism generates high quality solution repeatedly for problems that resemble instances in the training set, it does not generalize as well on a different set of optimization problems. These mixed results indicate that there are promising research opportunities to use machine learning to achieve tractability and scalability.

Electronic reproduction.
Ann Arbor, Mich. :
ProQuest,
2023

Mode of access: World Wide Web

ISBN: 9798582554226Subjects--Topical Terms:

3558960
International conferences.
Subjects--Index Terms:

Neural networksIndex Terms--Genre/Form:

542853
Electronic books.

Optimal Design and Operation of WHO-EPI Vaccine Distribution Chains.
LDR:04241nmm a2200337K 4500 001 2353327
005 20230306113802.5
006 m o d
007 cr mn ---uuuuu
008 241011s2020 xx obm 000 0 eng d
020 $a 9798582554226
035 $a (MiAaPQ)AAI28370996
035 $a (MiAaPQ)Pittsburgh39390
035 $a AAI28370996
040 $a MiAaPQ $b eng $c MiAaPQ $d NTU
100 1 $a Yang, Yuwen. $3 3693669
245 1 0 $a Optimal Design and Operation of WHO-EPI Vaccine Distribution Chains.
264 0 $c 2020
300 $a 1 online resource (171 pages)
336 $a text $b txt $2 rdacontent
337 $a computer $b c $2 rdamedia
338 $a online resource $b cr $2 rdacarrier
500 $a Source: Dissertations Abstracts International, Volume: 82-09, Section: B.
500 $a Advisor: Jennifer, Shang; Bo, Zeng; Hoda, Bidkhori; Rajgopal, Jayant.
502 $a Thesis (Ph.D.)--University of Pittsburgh, 2020.
504 $a Includes bibliographical references
520 $a Vaccination has been proven to be the most effective method to prevent infectious diseases and in 1974 the World Health Organization (WHO) established the Expanded Programme on Immunization (EPI) to provide universal access to all important vaccines for all children, with a special focus on underserved low- and middle-income countries. However, there are still roughly 20 million infants worldwide who lack access to routine immunization services and remain at risk, and millions of additional deaths could be avoided if global vaccination coverage could improve. The broad goal of this research is to optimize the design and operation of the WHO-EPI vaccine distribution chain in these underserved low- and middle-income countries. We first present a network design problem for a general WHO-EPI vaccine distribution network by developing a mathematical model that formulates the network design problem as a mixed integer program (MIP). We then present three algorithms for typical problems that are too large to be solved using commercial MIP software. We test the algorithms using data derived from four different countries in sub-Saharan Africa and show that with our final algorithm, high-quality solutions are obtained for even the largest problems within a few minutes. We then discuss the problem of outreach to remote population centers when resources are limited and direct clinic service is unavailable. A set of these remote population centers is chosen, and over an appropriate planning period, teams of clinicians and support personnel are sent from a depot to set up mobile clinics at these locations to vaccinate people there and in the immediate surrounding area. We formulate the problem of designing outreach efforts as an MIP that is a combination of a set covering problem and a vehicle routing problem. We then incorporate uncertainty to study the robustness of the worst-case solutions and the related issue of the value of information. Finally, we study a variation of the outreach problem that combines Set Covering and the Traveling Salesmen Problem and provides an MIP formulation to solve the problem. Motivated by applications where the optimal policy needs to be updated on a regular basis and where repetitively solving this via MIP can be computationally expensive, we propose a machine learning approach to effectively deal with this problem by providing an opportunity to learn from historical optimal solutions that are derived from the MIP formulation. We also present a case study on outreach operations and provide numerical results. Our results show that while the novel machine learning based mechanism generates high quality solution repeatedly for problems that resemble instances in the training set, it does not generalize as well on a different set of optimization problems. These mixed results indicate that there are promising research opportunities to use machine learning to achieve tractability and scalability.
533 $a Electronic reproduction. $b Ann Arbor, Mich. : $c ProQuest, $d 2023
538 $a Mode of access: World Wide Web
650 4 $a International conferences. $3 3558960
650 4 $a Industrial engineering. $3 526216
650 4 $a Vaccines. $3 684854
650 4 $a Integer programming. $3 648270
650 4 $a Clinics. $3 1962048
650 4 $a Artificial intelligence. $3 516317
650 4 $a Genetic algorithms. $3 533907
650 4 $a Neural networks. $3 677449
650 4 $a Influenza. $3 924085
650 4 $a Operations research. $3 547123
650 4 $a Information processing. $3 3561808
650 4 $a Traveling salesman problem. $3 3448648
650 4 $a Immunization. $3 772489
653 $a Neural networks
655 7 $a Electronic books. $2 lcsh $3 542853
690 $a 0546
710 2 $a ProQuest Information and Learning Co. $3 783688
710 2 $a University of Pittsburgh. $3 958527
773 0 $t Dissertations Abstracts International $g 82-09B.
856 4 0 $u http://pqdd.sinica.edu.tw/twdaoapp/servlet/advanced?query=28370996 $z click for full text (PQDT)