2026-09-19T15:43:13Zhttps://dspace.mit.edu/server/oai/request

oai:dspace.mit.edu:1721.1/430772022-01-13T07:54:11Zcom_1721.1_7582com_1721.1_7581col_1721.1_131022

Olivier L. de Weck. Ahn, Jaemyung Massachusetts Institute of Technology. Dept. of Aeronautics and Astronautics. Massachusetts Institute of Technology. Department of Aeronautics and Astronautics 2008-11-07T18:59:32Z 2008-11-07T18:59:32Z 2008 2008 http://hdl.handle.net/1721.1/43077 244302425 Thesis (Ph. D.)--Massachusetts Institute of Technology, Dept. of Aeronautics and Astronautics, 2008. Includes bibliographical references (p. 143-149). As the scale of space exploration gets larger, planning of planetary surface exploration becomes more complex and campaign-level optimization becomes necessary. This is a challenging profit maximization problem whose decisions encompass selection of bases, technological options, routes, and excursion methods under constraints on a route, a mission, and a whole campaign. The Generalized Location Routing Problem with Profits (GLRPP) is developed in this thesis as a framework to solve this campaign optimization problem. A mathematical formulation for the GLRPP is developed and two solution methods to solve the GLRPP - a single phase method and a three-phase method - are presented. Numerical experiments for these two solution methods are carried out and their performance in terms of efficiency and effectiveness are analyzed. Two case studies are carried out. The first case study is a global Mars surface exploration campaign optimization. Problem instances for 100 potential bases and 1000 potential exploration sites are successfully solved using a three-phase solution method. A methodology to express the incremental value of a technology using exploration profits is demonstrated to evaluate an orbiting depot and in-situ resource utilization (ISRU). The second case study is a college football recruiting problem. A GLRPP instance is created out of the NCAA football division I-A schools and airports from which the schools can be reached. The problem is successfully solved using the three-phase solution method within a very small optimality gap. by Jaemyung Ahn. Ph.D. 149 p. eng Massachusetts Institute of Technology 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. http://dspace.mit.edu/handle/1721.1/7582 Aeronautics and Astronautics. The Generalized Location Routing Problem with Profits for planetary surface exploration and terrestrial applications GLRPP for planetary surface exploration and terrestrial applications Thesis application/pdf false Publication unknown unknown <Publication xmlns="https://www.openaire.eu/cerif-profile/1.1/" id="5d8bf575-94b2-4e64-8a01-15b6c0c05eb1"> <Type xmlns="https://www.openaire.eu/cerif-profile/vocab/COAR_Publication_Types">http://purl.org/coar/resource_type/c_1843</Type> <Language>eng</Language> <Title>The Generalized Location Routing Problem with Profits for planetary surface exploration and terrestrial applications</Title> <Subtitle>GLRPP for planetary surface exploration and terrestrial applications</Subtitle> <PublishedIn> <Publication> </Publication> </PublishedIn> <PublicationDate>2008</PublicationDate> <Authors> <Author> <DisplayName>Ahn, Jaemyung</DisplayName> <Affiliation> <OrgUnit> </OrgUnit> </Affiliation> </Author> </Authors> <Editors> </Editors> <Publishers> <Publisher> <DisplayName>Massachusetts Institute of Technology</DisplayName> <OrgUnit /> </Publisher> </Publishers> <License>http://dspace.mit.edu/handle/1721.1/7582</License> <Keyword>Aeronautics and Astronautics.</Keyword> <Abstract>As the scale of space exploration gets larger, planning of planetary surface exploration becomes more complex and campaign-level optimization becomes necessary. This is a challenging profit maximization problem whose decisions encompass selection of bases, technological options, routes, and excursion methods under constraints on a route, a mission, and a whole campaign. The Generalized Location Routing Problem with Profits (GLRPP) is developed in this thesis as a framework to solve this campaign optimization problem. A mathematical formulation for the GLRPP is developed and two solution methods to solve the GLRPP - a single phase method and a three-phase method - are presented. Numerical experiments for these two solution methods are carried out and their performance in terms of efficiency and effectiveness are analyzed. Two case studies are carried out. The first case study is a global Mars surface exploration campaign optimization. Problem instances for 100 potential bases and 1000 potential exploration sites are successfully solved using a three-phase solution method. A methodology to express the incremental value of a technology using exploration profits is demonstrated to evaluate an orbiting depot and in-situ resource utilization (ISRU). The second case study is a college football recruiting problem. A GLRPP instance is created out of the NCAA football division I-A schools and airports from which the schools can be reached. The problem is successfully solved using the three-phase solution method within a very small optimality gap.</Abstract> <Access xmlns="http://purl.org/coar/access_right" > </Access> </Publication>