Please use this identifier to cite or link to this item:
http://hdl.handle.net/11375/20483
Title: | A Location-Inventory Problem for Customers with Time Constraints |
Authors: | E, Fan |
Advisor: | Huang, Kai |
Department: | Computational Engineering and Science |
Keywords: | stochastic facility location problem;;sample average approximation;dual heuristic;location-inventory problem |
Publication Date: | 2016 |
Abstract: | In this paper, a two-stage stochastic facility location problem integrated with inven- tory and recourse decisions is studied and solved. This problem is inspired by an industrial supply chain design problem of a large retail chain with slow-moving prod- ucts. Uncertainty is expressed by a discrete and finite set of scenarios. Recourse actions can be taken after the realization of random demands. Location, inventory, transportation, and recourse decisions are integrated into a mixed-integer program with an objective minimizing the expected total cost. A dual heuristic procedure is studied and embedded into the sample average approximation (SAA) method. The computation experiments demonstrate that our combined SAA with dual heuristic algorithm has a similar performance on solution quality and a much shorter compu- tational time. |
URI: | http://hdl.handle.net/11375/20483 |
Appears in Collections: | Open Access Dissertations and Theses |
Files in This Item:
File | Description | Size | Format | |
---|---|---|---|---|
E_Fan_201608_Master's.pdf | 364.77 kB | Adobe PDF | View/Open |
Items in MacSphere are protected by copyright, with all rights reserved, unless otherwise indicated.