Advanced Search
DSpace@MIT

Generalized multi-commodity network flows : case studies in space logistics and complex infrastructure systems

Research and Teaching Output of the MIT Community

Show simple item record

dc.contributor.advisor Olivier L. de Weck. en_US
dc.contributor.author Ishimatsu, Takuto en_US
dc.contributor.other Massachusetts Institute of Technology. Department of Aeronautics and Astronautics. en_US
dc.date.accessioned 2013-11-18T20:39:33Z
dc.date.available 2013-11-18T20:39:33Z
dc.date.copyright 2013 en_US
dc.date.issued 2013 en_US
dc.identifier.uri http://hdl.handle.net/1721.1/82470
dc.description Thesis (Ph. D.)--Massachusetts Institute of Technology, Dept. of Aeronautics and Astronautics, 2013. en_US
dc.description This electronic version was submitted and approved by the author's academic department as part of an electronic thesis pilot project. The certified thesis is available in the Institute Archives and Special Collections. en_US
dc.description Cataloged from department-submitted PDF version of thesis. en_US
dc.description Includes bibliographical references (p. 153-157). en_US
dc.description.abstract In transition to a new era of human space exploration, the question is what the next-generation space logistics paradigm should be. The past studies on space logistics have been mainly focused on a "vehicle" perspective such as propulsive feasibility, cargo capacity constraints, and manifesting strategies, with the arbitrarily predetermined logistics network. But how do we select an optimal logistics network? Especially if we can utilize in-situ resources on the Moon and Mars, it will add complexity to network selection problem. The objective of this thesis is to develop a comprehensive graph-theoretic modeling framework to quantitatively evaluate and optimize space exploration logistics from a "network" perspective. In an attempt to create such a modeling framework, we develop a novel network flow model referred to as the generalized multi-commodity network flow (GMCNF) model. On top of the classical network flow problems, the GMCNF model proposed in this thesis introduces three types of matrix multiplications (requirement, transformation, and concurrency), and also allows loop edges associated with nodes (graph loops) and multiple edges between the same end nodes (multigraph). With this modification, the model can handle multiple commodities that interact with each other in the form of requirement at nodes, transformation on edges, and concurrency within edges. A linear programming (LP) formulation and a mixed integer linear programming (MILP) formulation of the GMCNF model are described in preparation for the two case studies. For the MILP formulation, in addition to the flow, we introduce two more variables, capacity expansion and decision binary, and additional constraints including the big-M method. The first case study applies the GMCNF LP model to human exploration of Mars. First we solve the baseline problem with a demand that is equivalent to that of the NASA's Mars Design Reference Architecture (DRA) 5.0 scenario. It is found that the solution saves 67.5% from the Mars DRA 5.0 reference scenario in terms of the initial mass in low-Earth orbit (IMLEO) primarily because chemical (LOX/LH2) propulsion is used along with oxygen-rich ISRU. We also present one possible scenario with two "gateway" resource depots at GTO and DTO with orbital transfer vehicles (OTVs) running in the cislunar and Martian systems. Then we solve variant problems that have different settings to see the effect of each factor. Findings include: taking advantage of oxygen-rich ISRU, LOX/LH2 is preferred to nuclear thermal rocket (NTR), the aerobraking option as well as ISRU availability on the Moon make great contributions in reducing the total mass to be launched from Earth, and as the ISRU production rate decreases, ISRU in each location becomes worthless at a certain threshold and the network topology changes toward direct paths using NTR. The other case study applies the GMCNF MILP model to the complex infrastructure systems in Saudi Arabia, focusing on the couplings between water and energy. Considering the capacity of the online infrastructures as of 2010 as a basis, we solve the problems with the 2030 demand and the 2050 demand. The objective function is a weighted sum of the total cost and the total CO2 emission. The key findings include: the network tends to be less connected, more isolated when putting more emphasis on minimizing the CO2 emissions, and some of the resulting networks suggest the possibility of the long-distance pipeline network connecting the west coast and the east coast via the central region (trans-peninsula pipeline). en_US
dc.description.statementofresponsibility by Takuto Ishimatsu en_US
dc.format.extent 157 p. en_US
dc.language.iso eng en_US
dc.publisher Massachusetts Institute of Technology en_US
dc.rights M.I.T. theses are protected by copyright. They may be viewed from this source for any purpose, but reproduction or distribution in any format is prohibited without written permission. See provided URL for inquiries about permission. en_US
dc.rights.uri http://dspace.mit.edu/handle/1721.1/7582 en_US
dc.subject Aeronautics and Astronautics. en_US
dc.title Generalized multi-commodity network flows : case studies in space logistics and complex infrastructure systems en_US
dc.type Thesis en_US
dc.description.degree Ph.D. en_US
dc.contributor.department Massachusetts Institute of Technology. Department of Aeronautics and Astronautics. en_US
dc.identifier.oclc 862119066 en_US


Files in this item

Name Size Format Description
862119066-MIT.pdf 6.828Mb PDF Full printable version

This item appears in the following Collection(s)

Show simple item record

MIT-Mirage