Satellite Network, Design, Optimization, and Management
| dc.contributor.advisor | Raghavan, Subramanian | en_US |
| dc.contributor.author | Gamvros, Ioannis | en_US |
| dc.contributor.department | Decision and Information Technologies | en_US |
| dc.contributor.publisher | Digital Repository at the University of Maryland | en_US |
| dc.contributor.publisher | University of Maryland (College Park, Md.) | en_US |
| dc.date.accessioned | 2006-09-12T06:02:34Z | |
| dc.date.available | 2006-09-12T06:02:34Z | |
| dc.date.issued | 2006-08-07 | en_US |
| dc.description.abstract | We introduce several network design and planning problems that arise in the context of commercial satellite networks. At the heart of most of these problems we deal with a traffic routing problem over an extended planning horizon. In satellite networks route changes are associated with significant monetary penalties that are usually in the form of discounts (up to 40%) offered by the satellite provider to the customer that is affected. The notion of these rerouting penalties requires the network planners to consider management problems over multiple time periods and introduces novel challenges that have not been considered previously in the literature. Specifically, we introduce a multiperiod traffic routing problem and a multiperiod network design problem that incorporate rerouting penalties. For both of these problems we present novel path-based reformulations and develop branch-and-price-and-cut approaches to solve them. The pricing problems in both cases present new challenges and we develop special purpose approaches that can deal with them. We also show how these results can be extended to deal with traffic routing and network design decisions in other settings with much more general rerouting penalties. Our computational work demonstrates the benefits of using the branch-and-price-and-cut procedure developed that can deal with the multiperiod nature of the problem as opposed to straightforward, myopic period-by-period optimization approaches. In order to deal with cases in which future demand is not known with certainty we present the stochastic version of the multiperiod traffic routing problem and formulate it as a stochastic multistage recourse problem with integer variables at all stages. We demonstrate how an appropriate path-based reformulation and an associated branch-and-price-and-cut approach can solve this problem and other more general multistage stochastic integer multicommodity flow problems. Finally, we motivate the notion of reload costs that refer to variable (i.e., per unit of flow) costs for the usage of pairs of edges, as opposed to single edges. We highlight the practical and theoretical significance of these cost structures and present two extended graphs that allow us to easily capture these costs and generate strong formulations. | en_US |
| dc.format.extent | 1870363 bytes | |
| dc.format.mimetype | application/pdf | |
| dc.identifier.uri | http://hdl.handle.net/1903/3904 | |
| dc.language.iso | en_US | |
| dc.subject.pqcontrolled | Operations Research | en_US |
| dc.subject.pquncontrolled | branch-and-price-and-cut | en_US |
| dc.subject.pquncontrolled | satellite networks | en_US |
| dc.subject.pquncontrolled | multiperiod traffic routing | en_US |
| dc.subject.pquncontrolled | integer stochastic programming | en_US |
| dc.subject.pquncontrolled | reload costs; | en_US |
| dc.title | Satellite Network, Design, Optimization, and Management | en_US |
| dc.type | Dissertation | en_US |
Files
Original bundle
1 - 1 of 1