You are here

STOCHASTIC OPTIMIZATION AND APPLICATIONS WITH ENDOGENOUS UNCERTAINTIES VIA DISCRETE CHOICE MODELSl

Download pdf | Full Screen View

Date Issued:
2019
Abstract/Description:
Stochastic optimization is an optimization method that solves stochastic problems for minimizing or maximizing an objective function when there is randomness in the optimization process. In this dissertation, various stochastic optimization problems from the areas of Manufacturing, Health care, and Information Cascade are investigated in networks systems. These stochastic optimization problems aim to make plan for using existing resources to improve production efficiency, customer satisfaction, and information influence within limitation. Since the strategies are made for future planning, there are environmental uncertainties in the network systems. Sometimes, the environment may be changed due to the action of the decision maker. To handle this decision-dependent situation, the discrete choice model is applied to estimate the dynamic environment in the stochastic programming model. In the manufacturing project, production planning of lot allocation is performed to maximize the expected output within a limited time horizon. In the health care project, physician is allocated to different local clinics to maximize the patient utilization. In the information cascade project, seed selection of the source user helps the information holder to diffuse the message to target users using the independent cascade model to reach influence maximization. \parThe computation complexities of the three projects mentioned above grow exponentially by the network size. To solve the stochastic optimization problems of large-scale networks within a reasonable time, several problem-specific algorithms are designed for each project. In the manufacturing project, the sampling average approximation method is applied to reduce the scenario size. In the health care project, both the guided local search with gradient ascent and large neighborhood search with Tabu search are developed to approach the optimal solution. In the information cascade project, the myopic policy is used to separate stochastic programming by discrete time, and the Markov decision process is implemented in policy evaluation and updating.
Title: STOCHASTIC OPTIMIZATION AND APPLICATIONS WITH ENDOGENOUS UNCERTAINTIES VIA DISCRETE CHOICE MODELSl.
0 views
0 downloads
Name(s): Chen, Mengnan, Author
Zheng, Qipeng, Committee Chair
Boginski, Vladimir, Committee CoChair
Vela, Adan, Committee Member
Yayla Kullu, Muge, Committee Member
University of Central Florida, Degree Grantor
Type of Resource: text
Date Issued: 2019
Publisher: University of Central Florida
Language(s): English
Abstract/Description: Stochastic optimization is an optimization method that solves stochastic problems for minimizing or maximizing an objective function when there is randomness in the optimization process. In this dissertation, various stochastic optimization problems from the areas of Manufacturing, Health care, and Information Cascade are investigated in networks systems. These stochastic optimization problems aim to make plan for using existing resources to improve production efficiency, customer satisfaction, and information influence within limitation. Since the strategies are made for future planning, there are environmental uncertainties in the network systems. Sometimes, the environment may be changed due to the action of the decision maker. To handle this decision-dependent situation, the discrete choice model is applied to estimate the dynamic environment in the stochastic programming model. In the manufacturing project, production planning of lot allocation is performed to maximize the expected output within a limited time horizon. In the health care project, physician is allocated to different local clinics to maximize the patient utilization. In the information cascade project, seed selection of the source user helps the information holder to diffuse the message to target users using the independent cascade model to reach influence maximization. \parThe computation complexities of the three projects mentioned above grow exponentially by the network size. To solve the stochastic optimization problems of large-scale networks within a reasonable time, several problem-specific algorithms are designed for each project. In the manufacturing project, the sampling average approximation method is applied to reduce the scenario size. In the health care project, both the guided local search with gradient ascent and large neighborhood search with Tabu search are developed to approach the optimal solution. In the information cascade project, the myopic policy is used to separate stochastic programming by discrete time, and the Markov decision process is implemented in policy evaluation and updating.
Identifier: CFE0007792 (IID), ucf:52347 (fedora)
Note(s): 2019-12-01
Ph.D.
Engineering and Computer Science, Industrial Engineering and Management Systems
Doctoral
This record was generated from author submitted information.
Subject(s): Discrete Choice Model -- Stochastic Optimization -- Stochastic Programming -- Dynamic Programming -- Markov Decision Process
Persistent Link to This Record: http://purl.flvc.org/ucf/fd/CFE0007792
Restrictions on Access: public 2019-12-15
Host Institution: UCF

In Collections