AN OPTIMIZATION FRAMEWORK FOR GLOBAL PLANETARY SURFACE EXPLORATION CAMPAIGNS

Abstract

As the scale of space exploration increases, 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. This paper introduces the Generalized Location Routing Problem with Profits (GLR-PP), which is a framework to deal with this campaign optimization problem. A mathematical formulation for the GLRPP is developed and Solution methods to solve the GLRPP are presented. A case study for a global Mars surface exploration campaign optimization has been carried Out. Problem instances with 100 potential bases and 1000 potential exploration sites are solved with consideration of realistic future technologies and constraints.