國立虎尾科技大學 |

Using Dominance in Solving Complex, Combinatorial Optimization Problems : = Applications from Healthcare Provider Scheduling and Vehicle Routing.

Record Type:	Language materials, manuscript : Monograph/item
Title/Author:	Using Dominance in Solving Complex, Combinatorial Optimization Problems :/
Reminder of title:	Applications from Healthcare Provider Scheduling and Vehicle Routing.
Author:	Hong, Young-Chae.
Description:	1 online resource (130 pages)
Notes:	Source: Dissertation Abstracts International, Volume: 79-04(E), Section: B.
Contained By:	Dissertation Abstracts International79-04B(E).
Subject:	Industrial engineering. -
Online resource:	click for full text (PQDT)
ISBN:	9780355365580

Using Dominance in Solving Complex, Combinatorial Optimization Problems : = Applications from Healthcare Provider Scheduling and Vehicle Routing.
Hong, Young-Chae.

Using Dominance in Solving Complex, Combinatorial Optimization Problems :Applications from Healthcare Provider Scheduling and Vehicle Routing. - 1 online resource (130 pages)

Source: Dissertation Abstracts International, Volume: 79-04(E), Section: B.

Thesis (Ph.D.)

Includes bibliographical references

The focus of this dissertation is to develop mathematical methods for the multi-criteria optimization problem and the vehicle routing problem. We approach these problems through the concept of Pareto dominance. Our goal is to develop general algorithms that utilize Pareto dominance and solve the problems in reasonable time.

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

Mode of access: World Wide Web

ISBN: 9780355365580Subjects--Topical Terms:

679492
Industrial engineering.
Index Terms--Genre/Form:

554714
Electronic books.

Using Dominance in Solving Complex, Combinatorial Optimization Problems : = Applications from Healthcare Provider Scheduling and Vehicle Routing.
LDR:04884ntm a2200385Ki 4500 001 910603
005 20180517123958.5
006 m o u
007 cr mn||||a|a||
008 190606s2017 xx obm 000 0 eng d
020 $a 9780355365580
035 $a (MiAaPQ)AAI10670304
035 $a (MiAaPQ)umichrackham:000909
035 $a AAI10670304
040 $a MiAaPQ $b eng $c MiAaPQ
099 $a TUL $f hyy $c available through World Wide Web
100 1 $a Hong, Young-Chae. $3 1181975
245 1 0 $a Using Dominance in Solving Complex, Combinatorial Optimization Problems : $b Applications from Healthcare Provider Scheduling and Vehicle Routing.
264 0 $c 2017
300 $a 1 online resource (130 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: Dissertation Abstracts International, Volume: 79-04(E), Section: B.
500 $a Adviser: Amy Ellen Mainville Cohn.
502 $a Thesis (Ph.D.) $c University of Michigan $d 2017.
504 $a Includes bibliographical references
520 $a The focus of this dissertation is to develop mathematical methods for the multi-criteria optimization problem and the vehicle routing problem. We approach these problems through the concept of Pareto dominance. Our goal is to develop general algorithms that utilize Pareto dominance and solve the problems in reasonable time.
520 $a We first consider the problem of assigning medical residents to shifts within a pediatric emergency department. This problem is challenging to solve for a number of reasons. First, like many other healthcare personnel scheduling problems, it has a non-homogeneous work force, with each resident having different characteristics, requirements, and capabilities. Second, residency scheduling problems must not only ensure adequate resources for patient care but must also meet educational training needs, adding further complexity and constraints. Finally, since many factors should be taken into account when selecting the "best" schedule, there is no one clear, well-defined single objective function under which to optimize. Thus, it is difficult, if not impossible, to pre-assign weights that allow these factors and the preferences of the scheduler (typically, a Chief Resident) to be captured in a mathematical objective function.
520 $a We propose an integer programming formulation and an iterative, interactive approach in which we use this integer program for ill-defined multiple objective criteria which are often in conflict with each other. After we identify quantifiable metrics through the interactive approach, we develop an integer programming-based approach embedded within a recursive algorithm to provide the Chief with a set of Pareto-dominant schedules from which to select. We then present our collaborative work with the University of Michigan C.S. Mott Children's Hospital in building monthly schedules, focusing on both the tractability of our methods and a case study to study how a Chief Resident would evaluate the Pareto set.
520 $a When building schedules, an alternative is to use a column generation approach in which each variable represents complete sequences of tasks for a single agent to perform. In Chapter 4, we show how the concept of Pareto dominance can be used to generate columns efficiently. We evaluate dynamic programming-based column generation approaches for the vehicle routing problem since the models and algorithms proposed for the vehicle routing problems can be used effectively not only for the solution of transportation problems concerning the delivery or collection of goods but also for the solution of scheduling problems arising in healthcare as well.
520 $a In particular, we consider a new variant of the Time-Constrained Heterogeneous Vehicle Routing Problem (TCHVRP). In this problem, the cost and travel time of any given arc vary by vehicle type within a heterogeneous fleet. We make no assumptions about Pareto dominance across vehicles; nor do we assume that cost and time are correlated. Our research is motivated by situations in which existing fleets are evolving to incorporate hybrid vehicles in addition to their existing vehicle types; for many vehicles, the cost per mile depends heavily on the type of driving (such as highway versus city). We formulate TCHVRP as a path-based model, which we solve using column generation. We introduce several different methods to solve the pricing problem. We conclude by conducting empirical analyses to assess the performance of the proposed approach.
533 $a Electronic reproduction. $b Ann Arbor, Mich. : $c ProQuest, $d 2018
538 $a Mode of access: World Wide Web
650 4 $a Industrial engineering. $3 679492
655 7 $a Electronic books. $2 local $3 554714
690 $a 0546
710 2 $a ProQuest Information and Learning Co. $3 1178819
710 2 $a University of Michigan. $b Industrial & Operations Engineering. $3 1181972
773 0 $t Dissertation Abstracts International $g 79-04B(E).
856 4 0 $u http://pqdd.sinica.edu.tw/twdaoapp/servlet/advanced?query=10670304 $z click for full text (PQDT)