Back to search

Georgia Institute of Technology

Space Logistics and Mission Planning Optimization via Nonconvex Mixed-Integer Nonlinear Programming

Abstract

dc:description.abstract

As we strive to establish a long-term or permanent presence in space, it is imperative to develop optimization frameworks that enable space logistics and mission planning with high fidelity while maintaining tractable computational costs. Realistic space logistics problems often involve (i) integer variables to represent discrete mission decisions and (ii) nonlinear and nonconvex relationships to capture the complexity of space systems design or spacecraft dynamics. However, most existing methods and frameworks rely on mixed-integer linear programming (MILP), which cannot fully represent these nonlinear and nonconvex characteristics. To address both aspects simultaneously, this thesis formulates and develops solution approaches for space logistics and mission planning problems as nonconvex mixed-integer nonlinear programs (MINLPs). The first application considers integrated space logistics, which concurrently optimizes transportation scheduling and spacecraft sizing, where the sizing component involves nonconvex and implicit functions. Since this problem can be challenging to solve with standard MINLP solvers, a decomposition framework is developed to efficiently compute high-quality feasible solutions. In the second application, the framework is then extended to enable global optimization of MINLPs involving concave functions, a common structure in space systems. This capability is demonstrated through a case study on simultaneous optimization of mission operations and systems design for crewed Mars missions. Another application considers integrated space logistics with spacecraft staging optimization. To accommodate the increased problem complexity, the decomposition method is modified to handle multiple classes of nonconvexity, improving modeling fidelity at the cost of higher computational effort. Overall, this thesis introduces nonconvex MINLP formulations and corresponding solution approaches to space logistics and mission planning, establishing a new direction for addressing problems with greater complexity and fidelity.

Degree

thesis:*
Level thesis:degree_level
Doctoral
Department dc:contributor.department
Aerospace Engineering
Grantor dc:publisher
Georgia Institute of Technology
Year dc:date.issued
2025

Author and committee

dc:creator, dc:contributor.*
Author dc:creator
  • Isaji, Masafumi
Advisor dc:contributor.advisor
  • Ho, Koki
Committee members dc:contributor.committeemember
  • Gunter, Brian
  • Lightsey, Edgar G.
  • Sahinidis, Nick
  • Edwards, Stephen

Subjects

dc:subject × 3

Rights

Language dc:language.iso
en_US

Identifiers

dc:identifier.*
Handle dc:identifier.uri
https://hdl.handle.net/1853/78738

Chain of custody

source
Harvested from
Georgia Tech
Base URL
repository.gatech.edu/server/oai/request
Last updated
2026-11-19
Source record
OAI-PMH GetRecord
citation

Isaji, Masafumi. Space Logistics and Mission Planning Optimization via Nonconvex Mixed-Integer Nonlinear Programming. Doctoral thesis, Georgia Institute of Technology, 2025. https://hdl.handle.net/1853/78738